Codeforces-334A

最新推荐文章于 2019-07-22 22:08:06 发布

煦--晨

最新推荐文章于 2019-07-22 22:08:06 发布

阅读量937

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/u011519618/article/details/9737107

版权

水题专栏收录该内容

30 篇文章 0 订阅

订阅专栏

哎，被这道水题虐住了。。

A. Candy Bags

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 524288/262144K (Java/Other)

Total Submission(s) : 13 Accepted Submission(s) : 3

Problem Description

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 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 n². You can print the numbers in the lines in any order.

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

Sample Input

Sample Output

#include"stdio.h"
#include"string.h"
int main()
{
int m,n,i,j,k,h;
while(scanf("%d",&m)!=EOF)
{
  k=1;
  h=1+m*m;
  for(i=1;i<=m;i++)
  {
   for(j=1;j<=m/2;j++)
   {
    printf("%d %d ",k,h-k);
    k++;
   }
   printf("\n");
  }
}
return 0;
}