3 solutions
-
2
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int x=n,y=n; n=2*x-1; int m=2*y-1; for(int i=1;i<=n;i++) { int cnt=0; for(int j=1;j<=m;j++) { if(abs(i-x)+abs(j-y)<=x-1) { cnt++; cout<<cnt; } else { cout<<" "; } } cout<<endl; } return 0; } -
2
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { for(int j=1;j<=n-i;j++) { cout<<" "; } for(int j=1;j<=2*i-1;j++) { cout<<j; } cout<<endl; } for(int i=2;i<=n;i++) { for(int j=1;j<i;j++) { cout<<" "; } for(int j=1;j<=2*n+1-2*i;j++) { cout<<j; } cout<<endl; } return 0; } -
0
#include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n-i;j++){ cout<<" "; } for(int j=1;j<=2*i-1;j++){ cout<<j; } cout<<endl; } for(int i=1;i<=n;i++){ for(int j=1;j<=i;j++){ cout<<" "; } for(int j=1;j<=2*n-1-2*i;j++){ cout<<j; } cout<<endl; } return 0; }
- 1
Information
- ID
- 2848
- Time
- 1000ms
- Memory
- 64MiB
- Difficulty
- 1
- Tags
- # Submissions
- 39
- Accepted
- 14
- Uploaded By