POJ2590:Steps
来源:互联网 发布:淘宝下架立刻就上架吗 编辑:程序博客网 时间:2024/05/23 01:57
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
//纯规律水题
#include <iostream>#include <cmath>using namespace std;int main(){ int x,y,n; cin >> n; while(n--) { cin >> x >> y; cout << (int)(sqrt(y-x)*2-1e-9) << endl; } return 0;}
- POJ2590:Steps
- POJ2590 Steps
- poj2590-steps
- ZOJ1871 POJ2590 Steps
- poj2590
- 北大ACM poj2590
- Steps
- Steps
- Steps
- Steps
- Steps
- Steps
- Steps
- steps
- Steps
- steps
- Number Steps
- Number Steps
- LIBSVM在matlab中使用小结
- hdu2851
- java循环障碍CyclicBarrier
- CocosX学习实录02——第5章 CCLayer子类的一般写法,obj-C改C++,
- REST 与 SOAP巅峰对话
- POJ2590:Steps
- iOS5分辨率适配
- CWebBrowser2加载打印心得
- 中国经济 警惕黑天鹅
- 深入浅出 - Android系统移植与平台开发(七)- 初识HAL
- 关于UIView重复动画效果的问题
- 【程序1】1~4组成无重复数字的三位数
- Cooike记住用户名
- 代码自动生成工具MyGeneration之一(程序员必备工具)