POJ 2590:Steps
来源:互联网 发布:淘宝怎么秒杀 编辑:程序博客网 时间:2024/06/05 10:47
Steps
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7872 Accepted: 3612
Description
One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous step.
What is the minimum number of steps in order to get from x to y? The length of the first and the last step must be 1.
What is the minimum number of steps in order to get from x to y? The length of the first and the last step must be 1.
Input
Input consists of a line containing n, the number of test cases.
Output
For each test case, a line follows with two integers: 0 <= x <= y < 2^31. For each test case, print a line giving the minimum number of steps to get from x to y.
Sample Input
345 4845 4945 50
Sample Output
334
Source
Waterloo local 2000.01.29
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include<iostream>using namespace std;int main(){ long a,b,d; int n,c,step; cin>>n; while(n--) { cin>>a>>b; d=b-a,c=1,step=0; while(1) { if(d<2*c)break; else { d=d-2*c; step+=2; c++; } } if(d>c)step+=2; else if(d<=0)step+=0; else step+=1; cout<<step<<endl; } return 0;}
1 0
- POJ 2590 Steps
- POJ 2590 Steps
- POJ 2590:Steps
- Steps POJ - 2590
- POJ 2590 Steps(简单数列递推)
- POJ 2590 Steps (ZOJ 1871)
- Steps POJ - 2590(数学推导???规律吧!!!)
- poj 1663 Number Steps
- POJ 1663 Number Steps
- POJ 1663Number Steps
- POJ 1663 Number Steps
- POJ 1663:Number Steps
- POJ 1663:Number Steps
- zoj 1871 || poj 2590 Steps(数学题 = =)
- Poj.2590 Steps【“英语题”,水】 2015/09/22
- POJ 1663 Number Steps 笔记
- POJ-2590-Steps题目详解,思路分析及代码,规律题,重要的是找到规律~~
- Steps
- 别拦我,让我悲伤一会
- Android 5.1 ActivityManagerService启动
- iOS UI自动化——Instruments常用语法
- hdoj 1527取石子游戏
- JavaScript菜鸟教程 grammar
- POJ 2590:Steps
- Java抢红包小程序
- Javascript的四种(函数)调用模式
- Ubuntu安装Vim
- poj1386Play on Words(欧拉通路)
- 单链表实现行编辑
- 深入了解windows句柄
- HDU 3001 Travelling(状压DP)
- mycat读写分离与主从切换