cf194 div2 A. Candy Bags
来源:互联网 发布:怎么添加网络磁盘 编辑:程序博客网 时间:2024/06/05 06:16
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 kcandies.
Help him give n bags of candies to each brother so that all brothers got the same number of candies.
The single line contains a single integer n (n is even, 2 ≤ n ≤ 100) — the number of Gerald's brothers.
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.
2
1 42 3
#include <cstdio>#include <algorithm>using namespace std;int N, n;int main() { scanf ("%d", &N); n = N*N; for (int i = 0; i < N; i++) { for (int p = 1; p <= N/2; p++) { printf ("%d %d ", i*(N/2)+p, n-(i*(N/2)+p)+1); } printf ("\n"); } return 0;}
- cf194 div2 A. Candy Bags
- A. Candy Bags
- 344A. Candy Bags
- codeforces 334A. Candy Bags
- CodeForces 334A Candy Bags
- CodeForces #194 Div.2 A. Candy Bags
- Codeforces Round #194 (Div. 2) A. Candy Bags
- Codeforces Round #194 (Div. 2) A. Candy Bags
- Codeforces Round #194 (Div. 2) / 334A Candy Bags(模拟)
- CF422 div2 C. Hacker, pack your bags!
- A. Two Bags of Potatoes
- A. Feed with Candy
- Codeforces-239A-Two Bags of Potatoes
- codeforces 105 div2 A
- codeforces 145 div2 A
- cf192 div2 A. Cakeminator
- cf div2 191 A
- cf 185div2 A
- FlashBuilder 好用的小插件
- 暑假集训#1 B题
- 编程珠玑第一章课后习题
- Android 一键锁屏 问题与解决
- Linux下代码补全的真正神器v
- cf194 div2 A. Candy Bags
- Objective-C 方法类型限定
- 从Qt4.x升级至Qt5工程代码需做的改变
- 用js实现的非浏览器的全屏弹窗
- [unity基础教程] unity Mathf 数学运算(C#)
- web开发者要学的知识
- 【念7.27】我是一个“无赖”
- 浅析Spring框架设计
- CSS3 圆角(border-radius)