2 solutions
-
0
Guest MOD
-
2
代码:
#include<bits/stdc++.h> using namespace std; const int N=1010; int a[N][N]; int n; int main() { cin>>n; a[1][1]=1; for(int i=2;i<=n;i++){ for(int j=1;j<=i;j++){ a[i][j]=a[i-1][j-1]+a[i-1][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++){ cout<<a[i][j]<<' '; } cout<<'\n'; } return 0; } -
1
#include<bits/stdc++.h> using namespace std; long long a[5000][5000],n,s; int main() { cin>>n; for(int i=0;i<n;i++){ a[i][0]=1; a[i][i]=1; } for(int i=0;i<n;i++){ for(int j=1;j<=i;j++){ a[i][j]=a[i-1][j]+a[i-1][j-1]; } } for(int i=0;i<n;i++){ for(int j=0;j<=i;j++){ cout<<a[i][j]<<" "; } cout<<"\n"; } return 0; }#include<bits/stdc++.h> using namespace std; long long a[5000][5000],n,s; int main() { cin>>n;//输入 for(int i=0;i<n;i++){ a[i][0]=1; a[i][i]=1; } for(int i=0;i<n;i++){ for(int j=1;j<=i;j++){ a[i][j]=a[i-1][j]+a[i-1][j-1]; } } for(int i=0;i<n;i++){ for(int j=0;j<=i;j++){ cout<<a[i][j]<<" "; } cout<<"\n"; } return 0; }
- 1
Information
- ID
- 405
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 108
- Accepted
- 55
- Uploaded By