SWUST OJ(599)

拉丁方阵

#include <iostream>
#include <cstdlib>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int f = 0, j;
    for(int i=0;i<n;i++)
    {
        for(j=i;j<n;j++)
        {
            if(j == i)
            {
                cout<<j+1;
                continue;
            }
            cout<<" "<<j+1;
        }
        f++;
        if(f>0)
        {
            for(int k = 0; k<f-1;k++)
            {
                cout<<" "<<k+1;
            }
        }
        cout<<endl;
    }
    return 0;
}