4 solutions

  • 2
    @ 2025-11-1 20:13:30
    #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
      @ 2025-7-15 11:11:41
      #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;
      }
      • -2
        @ 2025-12-13 14:18:32

        #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int x=n,y=n; n=2x-1; int m=2y-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
          @ 2025-7-11 11:57:13
          #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
          51
          Accepted
          20
          Uploaded By