SWUST OJ(599)

拉丁方阵

 1 #include <iostream>
 2 #include <cstdlib>
 3 
 4 using namespace std;
 5 
 6 int main()
 7 {
 8     int n;
 9     cin>>n;
10     int f = 0, j;
11     for(int i=0;i<n;i++)
12     {
13         for(j=i;j<n;j++)
14         {
15             if(j == i)
16             {
17                 cout<<j+1;
18                 continue;
19             }
20             cout<<" "<<j+1;
21         }
22         f++;
23         if(f>0)
24         {
25             for(int k = 0; k<f-1;k++)
26             {
27                 cout<<" "<<k+1;
28             }
29         }
30         cout<<endl;
31     }
32     return 0;
33 }

 

转载于:https://www.cnblogs.com/Ghost4C-QH/p/10693263.html