HDU 1391 Number Steps
来源:互联网 发布:淘宝上比较好的女鞋店 编辑:程序博客网 时间:2024/06/04 17:44
Number Steps
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
题意:如图规律,查询每个点的值,没有值的点输出No Number。
找下规律就行了,输入的两个数是坐标,只有同为奇数或同为偶数才有值,而且横坐标等于纵坐标或者比纵坐标大二。偶数相加为两个之和,奇数相加则为和减一。
#include<stdio.h>int main(){ int t,n,m; scanf("%d",&t); while(t--) { int j,i; scanf("%d%d",&n,&m); j=n%2+m%2; i=n-m; if(i>=0&&i<=2&&j!=1) { if(j==0) printf("%d\n",n+m); if(j==2) printf("%d\n",n+m-1); } else printf("No Number\n"); } return 0;}
2 0
- hdu 1391Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391:Number Steps
- HDU 1391 Number Steps
- hdu 1391 Number Steps
- 水题 hdu 1391 Number steps
- hdu-oj 1391 Number Steps
- hdu 1391 Number Steps
- HDU 1391 Number Steps【找规律】
- 杭电 HDU ACM 1391 Number Steps
- HDU 1391 Number Steps(数学题+找规律)
- HDU 1391 Number Steps
- Number Steps 1391
- HDOJ 1391 Number Steps
- HDOJ 1391 Number Steps
- HDU 1391 Number Steps(思维题目,找规律)
- hdoj.1391 Number Steps 20140821
- Java
- JS实现动态生成表格并提交表格数据向后端
- 读书笔记(C++)——【泛型算法】
- C语言宏详解
- 判断一棵树是否为平衡二叉树
- HDU 1391 Number Steps
- Android官方开发文档Training系列课程中文版:后台服务之IntentService的创建
- Light OJ:1058Parallelogram Counting(几何数学+技巧排序)
- Linux常用命令 ---- grep命令
- Android官方开发文档Training系列课程中文版:后台服务之IntentService的使用
- 递归逆序打印字符串
- webx 容器初始化
- Android Studio 多环境打包(测试,开发,生产)
- 2016.8.14