递推方式:
/*TC2.0调试通过*/
#include <stdio.h>
#define N 10
main()
{
long a[N+2],b[N+2],*p=a,*q=b,*t,i,j;
for (i=0;i<=N+1;i++) a[i]=b[i]=0;
printf ("%d\n",a[1]=1);
for (i=2;i<=N+1;i++,printf("\n"),t=p,p=q,q=t)
for (j=1;j<=i;j++)
printf ("%ld ",q[j]=p[j-1]+p[j]);
}
这个该简单了:
/*TC2.0调试通过*/
#include <stdio.h>
#define N 10
long c(int m,int n){
int i;
long t=1;
for (i=m-n+1;i<=m;i++) t*=i;
for (i=1;i<=n;i++) t/=i;
return t;
}
main(){
int i,j;
for (i=0;i<=N;i++,printf("\n"))
for (j=0;j<=i;j++)
printf("%ld ",c(i,j));
}