1 solutions

  • 0
    @ 2025-8-12 19:37:26
    #include<bits/stdc++.h>
    using namespace std;
    const int N=20;
    int g[N][N];
    int main()
    {
      	int n;
      	cin>>n;
      	int d=1;
      	for(int k=1;k<=n;k++)
      	{
      		int y=n-k+1;
    		int x=1;
    		for(int i=1;i<=k;i++)
    		{
    			g[x][y]=d;
    			d++;
    			x++,y++;	
    		}	
    	}
    	for(int k=2;k<=n;k++)
    	{
    		int x=k,y=1;
    		for(int i=1;i<=n-k+1;i++)
    		{
    			g[x][y]=d;
    			d++;
    			x++,y++;
    		}
    	}
    	for(int i=1;i<=n;i++)
    	{
    		for(int j=1;j<=n;j++)
    		{
    			cout<<setw(4)<<g[i][j];
    		}
    		cout<<endl;
    	}
        return 0;
    }
    
    • 1

    Information

    ID
    2873
    Time
    1000ms
    Memory
    64MiB
    Difficulty
    10
    Tags
    # Submissions
    5
    Accepted
    2
    Uploaded By