Poj.2590 Steps【“英语题”,水】 2015/09/22
来源:互联网 发布:马丁靴品牌知乎 编辑:程序博客网 时间:2024/05/16 01:29
Steps
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7825 Accepted: 3600
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
同ZOJ1871
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){ int from,to,t; cin>>t; while( t-- ){ scanf("%d%d",&from,&to); int dis = to - from; if( !dis ){ printf("0\n"); continue; } int x = 0,i,step; for( i = 1 ; ; ++i ){ if( x + i * 2 >= dis ) break; x += i*2; } step = i*2-2; if( x+i*2 == dis ) printf("%d\n",step+2); else if( x+i >= dis ) printf("%d\n",step+1); else printf("%d\n",step+2); } return 0;}
0 0
- Poj.2590 Steps【“英语题”,水】 2015/09/22
- ZOJ.1871 Steps【水,”英语题“】 2015/09/22
- POJ 2590 Steps
- POJ 2590 Steps
- POJ 2590:Steps
- Steps POJ - 2590
- Steps 数论水题
- POJ 2590 Steps(简单数列递推)
- POJ 2590 Steps (ZOJ 1871)
- Steps POJ - 2590(数学推导???规律吧!!!)
- POJ-2590-Steps题目详解,思路分析及代码,规律题,重要的是找到规律~~
- 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(数学题 = =)
- 第四十五天 百度地图定位SDK
- 开博说明
- 平静
- JAVAEE分页jar包及其用法
- iOS8下的开发变化
- Poj.2590 Steps【“英语题”,水】 2015/09/22
- 【转】菜鸟,大牛和教主,三者的区别
- sqlmap使用参数详解
- mac 下设置path
- UVA 12086 - Potentiometers(树状数组)
- swift --函数
- java设计模式第14弹--备忘录模式
- nyoj--79--导弹拦截(动态规划)
- ZOJ 2587--Unique Attack【判断最小割是否唯一】