SGU 109 Magic of David Copperfield II

109. Magic of David Copperfield II

time limit per test: 0.5 sec. memory limit per test: 4096 KB

 

The well-known magician David Copperfield loves lo show the following trick: a square with N rows and N columns of different pictures appears on a TV screen, Let us number all the pictures in the following order:

1	2	...	N
...	...	...	...
N*(N-1)+1	N*(N-1)+2	...	N*N

Each member of the audience is asked to put a finger on the upper left picture (i.e., picture number one) and The Magic begins: the magician tells the audience to move the finger K₁ times through the pictures (each move is a shift of the finger to the adjacent picture up, down, left or right provided that there is a picture to move to), then with a slight movement of his hand he removes some of the pictures with an exclamation "You are not there!", and ... it is true - your finger is not pointing to any of the pictures removed. Then again, he tells the audience to make K₂ moves, and so on. At the end he removes all the pictures but one and smiling triumphantly declares, "I've caught you" (applause).
Just now, David is trying to repeat this trick. Unfortunately, he had-a hard day before, and you know how hard to conjure with a headache. You have to write a program that will help David to make his trick.

 

 

Input

The input file contains a single integer number N (1<N<101).

 

Output

Your program should write the following lines with numbers to the output file: K₁ X_1,1 X_1,2 ... X_1,m1 K₂ X_2,1 X_2,2 ... X_2,m2 ... K_e X_e,1 X_e,2 ... X_e,me where K_i is a number of moves the audience should make on the i-th turn (N<=K_i<300). All Ki, should be different (i.e. K_i<>K_j when i<>j). X_i,1 X_i,2 ... X_i,mi are the numbers of the pictures David should remove after the audience will make K_i moves (the number of the pictures removed is arbitrary, but each picture should be listed only once, and at least one picture should be removed on each turn). A description of the every next turn should begin with a new line. All numbers on each line should be separated by one or more spaces. After e iterations, all pictures except one should be removed.

 

Sample Input

 

3

 

 

 

Sample Output

 

3 1 3 7 9
5 2 4 6 8

 

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <queue>
#include <vector>
#include <string>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 5005
#define ll long long
#define INF 0x7fffffff
#define eps 1e-8
int n,m;
int main(){
    while (~scanf("%d",&n)){
        if (n == 2) { printf("3 4\n5 2 3\n"); continue; }
        for (int k = 0; k < n+1; k++){
            m = n;
            if (k == 0)printf("%d", n);
            else{
                if (n % 2 == 0)m--;
                printf("%d", m + 2 * k);
            }
            for (int i = 1; i <= n;i++)
            for (int j = 1; j <= n;j++)
            if (i + j == n+3-k||(k==0&&i+j>n+3-k))printf("% d", (i-1)*n + j);
            puts("");
        }
    }
    return 0;
}