uva 846 Steps(数学规律)
来源:互联网 发布:淘宝客建站 编辑:程序博客网 时间:2024/06/02 13:44
Steps
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: 0xy < 231. 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题目大意:给出两个数字, 要求从a走到b, 第一步和最后一步只能走1, 每步的值可以是前面一步值-1, 不变和+1.求a到b最少走几步。
解题思路:1...k k ...1所需步为2 * k,
<1>2 * sum(1~k) ->2 * k
<2>2 * sum(1~k) ~2 * sum(1~k) + 1 + k -> 2 *k + 1
<3>2 * sum(1~k) + k + 1 ~2 * sum(1~k+1) -> 2 *(k + 1)
#include<stdio.h>int main(){long long a, b, t, n, sum, k;scanf("%lld", &t);while (t--){scanf("%lld%lld", &a, &b);n = b - a;sum = 0;if (n == 0){printf("%lld\n", n);continue;}for (long long i = 0; ; i++){sum += 2 * i;k = sum - n;if (k >= 0 && k < i){printf("%lld\n", 2 * i);break;}else if(k >= i){printf("%lld\n", 2 * i - 1);break;}}}return 0;}
- uva 846 Steps(数学规律)
- UVA 864-Steps 数学规律
- UVA 846 - Steps(数学)
- uva 846 Steps(找规律)
- UVa 846 Steps (数学)
- UVA 846 (暑假-数学 -G - Steps)
- Steps POJ - 2590(数学推导???规律吧!!!)
- uva 10706 Number Sequence(数学规律)
- UVa Problem 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
- 线程的setUncaughtExceptionHandler方法
- 利用 Apache 服务器搭建 Python 网站 (二)
- 简单同步下载
- POJ 1442 Black Box
- TS 详解
- uva 846 Steps(数学规律)
- android 读写xml文件
- linux内存管理---虚拟地址、逻辑地址、线性地址、物理地址的区别(一)
- 学习中的英文单词及其他知识
- ubuntu 安装 jdk 的三种方法
- 编译Linux内核
- Halcon基本数据结构
- Uva - 1339 - Ancient Cipher
- 查看备份信息【list backup】