hdu 1391
来源:互联网 发布:pdf拼接软件 编辑:程序博客网 时间:2024/06/05 09:49
Number Steps
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2681 Accepted Submission(s): 1650
Problem Description
Starting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.
You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0...5000.
You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0...5000.
Input
The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.
Output
For each point in the input, write the number written at that point or write No Number if there is none.
Sample Input
34 26 63 4
Sample Output
612No Number
Source
Asia 2000, Tehran (Iran)
Recommend
Ignatius.L
#include <stdio.h>int main(){int n, x, y;scanf("%d", &n);while (n--){scanf("%d%d", &x, &y);if(x == y || x-2 == y){if (x%2)//odd numberprintf("%d\n", x+y-1);elseprintf("%d\n", x+y);}elseprintf("No Number\n");}return 0;}
- hdu 1391
- hdu 1391
- HDU 1391
- hdu 1391Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391:Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- AISO教程UDP组播的例程
- Android屏蔽EditText的软键盘
- hdu 1390
- 探讨大数据量处理
- [Leetcode] Decode Ways *
- hdu 1391
- 三一显露了私企的尴尬处境
- javascript单引号和双引号区别
- linux install 命令
- Java开发技术大全(由简入深500个源码讲解)
- Myeclipse 8.5 配置SVN
- 写给自己
- hdu 1393
- Android SDK如何配置安装?