Codeforces Round #194 (Div. 2) / 334A Candy Bags(模拟)

A. Candy Bags

http://codeforces.com/problemset/problem/334/A

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Gerald has n younger brothers and their number happens to be even. One day he bought n² candy bags. One bag has one candy, one bag has two candies, one bag has three candies and so on. In fact, for each integer k from 1 to n² he has exactly one bag with kcandies.

Help him give n bags of candies to each brother so that all brothers got the same number of candies.

Input

The single line contains a single integer n (n is even, 2 ≤ n ≤ 100) — the number of Gerald's brothers.

Output

Let's assume that Gerald indexes his brothers with numbers from 1 to n. You need to print n lines, on the i-th line print n integers — the numbers of candies in the bags for the i-th brother. Naturally, all these numbers should be distinct and be within limits from 1 to n². You can print the numbers in the lines in any order.

It is guaranteed that the solution exists at the given limits.

Sample test(s)

input

2

output

1 4
2 3

注意n是偶数。

此题有个用j来进行全局控制的小技巧。

完整代码：

/*30ms,0KB*/

#include<cstdio>

int main()
{
	int n, j = 1;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		int tot = 0;
		while (tot++ < (n >> 1))
		{
			printf("%d %d ", j, n * n - j + 1);
			j++;///用这个来控制每个哥哥的分配糖果数
		}
		printf("\n");
	}
	return 0;
}