杨辉三角形 递归与非递归

 1 //非递归
 2 #include<iostream>
 3 
 4 using namespace std;
 5 
 6 int main(){
 7     int n;
 8     cin>>n;
 9     for(int i = 1;i <= n;i++){
10         for(int k = 0;k < n - i;k++)
11           cout<<‘ ‘;
12         cout<<1<<‘ ‘;
13         long long c = 1;
14         for(int j = 1;j < i;j++){
15             c = c * (i - j) / j;
16             cout<<c<<‘ ‘;
17         }
18         cout<<endl;
19     } 
20     return 0;
21 }

 1 #include<stdio.h>                   
 2  int triangle(int m,int n)           
 3  {
 4      if( m==n || m==0)
 5          return 1;
 6      else
 7          return ( triangle( m-1,n-1 ) + triangle(m,n-1) );
 8  }
 9 
10 
11  int main()
12  {
13      int i,j,n;
14      scanf("%d",&n);
15      for(j=0;j<n;j++)
16      {
17          for( i=0;i<=j;i++)
18          {
19              printf("%d ",triangle(i,j));
20          }
21          printf("\n");
22      }
23      return 0;
24  }