杨辉三角

 1 #include <stdio.h>   //本来不会做的，但是编着编着就出来了，么么哒 
 2 
 3 int main(){
 4     int n;
 5     int triangle[31][31];
 6     int i;
 7     int j;
 8     
 9     while((scanf("%d",&n))!=EOF){
10         for(i=0;i<31;i++)
11             for(j=0;j<31;j++)
12                 triangle[i][j]=0;
13         
14         triangle[0][0]=1;
15         triangle[1][0]=1;
16         triangle[1][1]=1;
17                 
18         for(i=2;i<n;i++){
19             triangle[i][0]=1;
20             triangle[i][i]=1;
21             for(j=1;j<=i;j++){
22                 triangle[i][j]=triangle[i-1][j]+triangle[i-1][j-1];
23             }
24         }
25         
26         for(i=0;i<n;i++){
27             for(j=0;j<n;j++){
28                 if(triangle[i][j]!=0){
29                     if(j==0)
30                         printf("%d",triangle[i][j]);
31                         
32                     else
33                         printf(" %d",triangle[i][j]);
34                 }
35             }
36                 
37             printf("\n");
38         }
39         
40         printf("\n");
41         
42     } 
43     return 0;
44 }