HDU2032 杨辉三角

 1 #include<cstdio>
 2 int main()
 3 {
 4     int n;
 5     long long A[35][35];
 6     for(int i = 1; i <= 35; i++)
 7     {
 8         for(int j = 1; j <= i; j++)
 9         {
10             if(i == j || j == 1) A[i][j] = 1;
11             else
12             {
13                 A[i][j] = A[i-1][j-1] + A[i-1][j];
14             }
15         }
16     }
17     while(~scanf("%d", &n))
18     {
19         for(int i = 1; i <= n; i++)
20         {
21             for(int j = 1; j < i; j++)
22             {
23                 printf("%I64d ", A[i][j]);
24             }
25             printf("%I64d\n", A[i][i]);
26         }
27         printf("\n");
28     }
29     return 0;
30 }