2019-04-13 20:39发布 生成海报
int C(int n,int k) { if(k>n) return 0; return num[n][k]; } void Cal(int n) { for(int i=0;i<=n;++i){ num[i][0]=1; for(int j=1;j
{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.xiaopingtou.cn//data/attach/topic/topicKPo7gB.jpg', '推荐 guiwukejiBGG 的文章《组合数求模模板》','https://www.xiaopingtou.net/article-53980.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}