楊輝三角
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36071 Accepted Submission(s): 15099
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
#include <stdio.h> #include <stdlib.h> int main() { int n,a[100][100],i,j; while (scanf("%d",&n)!=EOF) { for (i=0;i<n;i++) { a[i][0]=1; a[i][i]=1; } if (n>=3) { for (i=2;i<=n;i++) for (j=1;j<i;j++) a[i][j]=a[i-1][j-1]+a[i-1][j]; } for (i=0;i<n;i++) { printf("%d",a[i][0]); for (j=1;j<=i;j++) { printf(" %d",a[i][j]); } printf("\n"); } printf("\n"); } return 0; }