334A.md (1376B)
1 Source: https://codeforces.com/problemset/problem/334/A 2 3 A. Candy Bags 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Gerald has *n* younger brothers and their number happens to be even. One day he bought *n*2 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*2 he has exactly one bag with *k* candies. 22 23 Help him give *n* bags of candies to each brother so that all brothers got the same number of candies. 24 25 Input 26 27 The single line contains a single integer *n* (*n* is even, 2 ≤ *n* ≤ 100) — the number of Gerald's brothers. 28 29 Output 30 31 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*2. You can print the numbers in the lines in any order. 32 33 It is guaranteed that the solution exists at the given limits. 34 35 Examples 36 37 Input 38 39 ``` 40 2 41 ``` 42 43 Output 44 45 ``` 46 1 4 47 2 3 48 ``` 49 50 Note 51 52 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.