HDU 1391
来源:互联网 发布:手机淘宝怎样改好评 编辑:程序博客网 时间:2024/06/06 17:35
分类讨论推倒公式而已
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main() {int n;scanf("%d", &n);while(n--) {int a, b;int k;scanf("%d%d", &a, &b);if(0 == a && 0 == b) {printf("0\n");continue;}if(a == b+2) {if(0 == a%2) {k = a-1;}else {k = a-2;}}else if(a == b) {if(0 == a%2) {k = a-1;}else {k = a;}}int t = (k+1)/2;int c = 4*t-3;int ans = -1;if(a == b) {if(0 == a%2) {ans = c+3;}else {ans = c;}}else if(a == b+2) {if(0 == a%2) {ans = c+1;}else {ans = c+2;}}if(-1 != ans) {printf("%d\n", ans);}else {printf("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
- QT blog
- SQLite数据库查询优化
- sfl4j+logback取代log4j 、jcl
- ZOJ 2972 (DP)
- HDU 1878 无向图的欧拉回路的判断
- HDU 1391
- JSP运行原理(一)
- 开发者必备的6款源码搜索引擎
- 大小写互换
- 关于丁克的问题
- 开通博客
- why total memory is less than atual memory in /proc/meminfo,
- android 签名对比
- Maximum Depth of Binary Tree