CodeForces-334A-Candy Bags

Gerald has n younger brothers and their number happens to be even. One day he bought n2 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 n2 he has exactly one bag with k candies.
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 n2. You can print the numbers in the lines in any order.
It is guaranteed that the solution exists at the given limits.
Examples
Input
2
Output
1 4
2 3
Note
The sample shows Gerald’s actions if he has two brothers. In this case, his bags contain 1, 2, 3 and 4 candies. He can give the bags with 1 and 4 candies to one brother and the bags with 2 and 3 to the other brother.
题意：
主人公给n个兄弟们买了n^ 2 袋糖，编号为1，2，3……n^2，袋子内糖的数目等于编号数。
下面问你怎样分这n方 袋糖，让每个兄弟拿到的袋数和糖数都相同
同学的方法是不断取头取尾各取一半的袋数（比如四个兄弟的时候从前面取两袋 后面取两袋 下一个兄弟也是这样），保持一致，但是当n为奇数的时候就没法均分了。
所以问题只能用二维数组的方式来解决
怎么解决呢 把1~n方袋的糖变成一个矩阵
每个兄弟从各行的不同列！各取一袋（比如说第一行取了第一列的，第二行只能取第一列之外的 第三行以此类推）这样可以保证每个兄弟取的糖数相等！ 代码不太好解释 简单说就是第一个先取主对角线的，第二个向右平移一格取（有人发现少一个，所以再加上左下角的一个）第三个再向右平移一格取（这样正好加上左下角平行于对角线的两个）。
以此类推 取完所有

#include<stdio.h>
int main()
{
	int n,i,j,a[102][102],count;
	scanf("%d",&n);
	for(i=1;i<n+1;i++)
	for(j=1;j<n+1;j++)
	a[i][j]=(i-1)*n+j;
	
	for(count=1,i=1,j=1;count<n*n+1;count++)
	{
		if(i<n&&j<n)
			printf("%d",a[i++][j++]);
		else if(j==n)
			{
				if(i==n) {printf("%d",a[i][j]);i=1;j=2;}
				else {printf("%d",a[i][j]);i++;j=1;}
			}
		else if(i==n)
			{printf("%d",a[i][j]);j+=2;i=1;}
		if(count%n==0) printf("\n");
		else printf(" ");
	}
	return 0;
}