菜鸟起航的专栏

用母函数打表求出所有分组的组合数#include#includeint a[155],b[40],c1[155],c2[155];int main(){ int i,j,t,n,m,k; a[1]=1;a[2]=0; for(i=2;i<=150;i++) { if(a[i]==0) { f

#includeint c1[101][260],c2[101][260];int main(){ int n,i,j,k,a[5]={1,5,10,25,50},p; n=250; c1[0][0]=1; for(i=0;i<=4;i++) { for(j=0;j<=n;j++) f

#include#include#includeint main(){ int a[10005],b[10005],c[10005],i,j,k,n,max,mm; while(scanf("%d",&n)!=EOF) { max=0; for(i=0;i<n;i++) { scanf("%d",&c[i]);

#include#includeint main(){ int a[200],b[200],i,j,k,n,m,s[101],e[101]; while(scanf("%d%d",&n,&m)!=EOF) { for(i=0;i<n;i++) scanf("%d%d",&s[i],&e[i]); memset(a

#includeint c1[32769],c2[32769];int main(){ int i,n,j,k,a[3]={1,2,3}; for(i=0;i<32769;i++) c1[i]=1; for(j=0;j<32769;j++) for(k=0;k+j<32769;k+=2) c2[j+k]+=c1[j]; for(j=0;j<32769;j++) {

母函数水题  #includeint c1[301],c2[301];int main(){ int t,n,m,i,j,s,k; while(scanf("%d",&n),n) { for(j=0;j<=n;j++) {c1[j]=1;c2[j]=0;} for(i=2;i<=n;i++)

母函数水过#include#include#define lmax 10000int c1[lmax+1],c2[lmax+1];int main(){ int n,i,j,k,t,a[25],sum,b; scanf("%d",&t); while(t--) { sum=0; scanf("%

整数拆分母函数模板题   #includeint c1[121],c2[121];int main(){ int t,n,m,i,j,s,k; while(scanf("%d",&n)!=EOF) { for(j=0;j<=n;j++) {c1[j]=1;c2[j]=0;}

指数型母函数指数阶一般求解的问题：已知有n种颜色的球，第1种X1个，第2种X2个，第3种X3个。。。求从中取m个的方案数(组合数)。公式中的ak/k!就是所求的组合数，ak为排列数。只要把求系数的时候每个都相应的 除以i的阶乘即可   #include#includeint main(){ int i,j,k,m,n,a[20],c[11]; c[0]=1;

#include#includeint main(){ int i,j,n,k,m,c[4]={0,1,2,5},b[4]; int c1[8010],c2[8010]; while(scanf("%d%d%d",&b[1],&b[2],&b[3]),b[1]||b[2]||b[3]) { memset(c1,0,s