UVA - 846-Steps
来源:互联网 发布:慢镜头回放软件 编辑:程序博客网 时间:2024/05/18 23:52
题目描述:
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.
Input and Output
Input consists of a line containing n, the number of test cases. For each test case, a line follows with two integers: 0
Sample Input
3
45 48
45 49
45 50
Sample Output
3
3
4
类型:数学题?。。考察思路的
思路: 因为步距由1到某值然后又降到1,要求最小步数,所以步距序列一定是由1升到n再降到1,中间插上平等步距。所以我的思路是求得一个数列:123…n…321前n项和刚好大于要求距离,然后降低n到n-1分析仍差距离(存在一个域)补上步数即可
#include<stdio.h>#include<stdlib.h>int main(){ int Case; scanf("%d", &Case); while(Case--) { int head, tail; scanf("%d %d", &head, &tail); int num = tail - head; int n = 1; while(((1+n)*n - n) < num) n++; n--; if((num -((1+n)*n - n))>n) n= 2*n - 1 + 2; else n= 2*n - 1 + 1; printf("%d\n", n); }}
- uva 846 Steps
- uva-846 steps
- uva 846 Steps
- UVA 846 - Steps
- uva 846 - Steps
- UVa 846 - Steps
- UVa 846 - Steps
- UVa 846-Steps
- UVa 846 - Steps
- UVA 846 Steps
- uva 846 - Steps
- UVa 846 Steps (数学)
- uva 846 Steps
- UVa 846 Steps
- uva - 846 - Steps
- UVa 846 - Steps
- UVa - 846 - Steps
- UVa 846 - Steps
- Leetcode:Reverse Integer
- 关于jackson的DeserializationFeature.FAIL_ON_UNKNOWN_PROPERTIES
- 动态链接库,静态链接库和可执行文件的区别是什么?
- 大话PHP之性能
- JAVA --- 面向对象基础知识框架整理
- UVA - 846-Steps
- 最全的常用正则表达式分享
- Hummer云端demo介绍
- 关于数据块出现的游离坏块的实验:
- Android两种不同的方法去实现图像的放大与缩小
- Leetcode:Remove Duplicates from Sorted Array
- truss 命令
- memcached和redis的区别
- 01-复杂度2. Maximum Subsequence Sum (25)