ZYCode ICPC Round Premier League

· · 个人记录

先这样排:

1 2
3 4
5 6
......
n-1 n

然后 1 的位置不动,每次顺时针循环其它数。

/*
When a shadow falls across your world,
And your enemy wants nothing but your annihilation.
Where will you find your allies,
In a desperate struggle for survival?
*/
#include <bits/stdc++.h>
using namespace std;
int a[1005][2],n; 
int main(){
    cin>>n;
    n/=2;
    for(int i=1;i<=n;i++)a[i][0]=i,a[i][1]=i+n;
    for(int i=1;i<n*2;i++){
        for(int i=1;i<=n;i++)cout<<a[i][0]<<" "<<a[i][1]<<endl;
        cout<<endl;
        int t=a[n][1];
        for(int i=n;i>1;i--)a[i][1]=a[i-1][1];
        a[1][1]=a[2][0];
        for(int i=2;i<n;i++)a[i][0]=a[i+1][0];
        a[n][0]=t;
    }
    return 0;
}