UVA 10025 (13.08.06)
来源:互联网 发布:js怎么判断undefined 编辑:程序博客网 时间:2024/05/18 02:28
The ? 1 ? 2 ? ... ? n = k problem
Theproblem
Given the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k
? 1 ? 2 ? ... ? n = k
For example: to obtain k = 12 , the expression to be used will be:
- 1 + 2 + 3 + 4 + 5 + 6 - 7 = 12
with n = 7
TheInput
The first line is the number of test cases, followed by a blank line.
Each test case of the input contains integer k (0<=|k|<=1000000000).
Each test case will be separated by a single line.
The Output
For each test case, your program should print the minimal possible n (1<=n) to obtain k with the above formula.
Print a blank line between the outputs for two consecutive test cases.
Sample Input
212-3646397
Sample Output
72701
题意不累赘~
做法:
假设sum1 = a1 + a2 + a3 + ... + an + x >= k
而sum2 = a1 + a2 + a3 + ... + an - x = k
那么sum1 - sum2 = 2x
也就是说, 无论k的正负, 全把k当正数处理, 一直累加正数得到sum1 与 不按全当正数处理得到的sum2 相差的值是一个偶数(2x, 即负数的绝对值的两倍~)
故, 全部从1累加到n吧, 直到 (sum >= k && (sum - k) % 2 == 0)
AC代码:
#include<stdio.h>int T;int main() { scanf("%d", &T); while(T--) { int k; int sum = 0; scanf("%d", &k); if(k < 0) k = (-1 * k); for(int i = 1; ;i++) { sum += i; if(sum >= k && (sum-k) % 2 == 0) { printf("%d\n", i); break; } } if(T) printf("\n"); } return 0;}
- UVA 10025 (13.08.06)
- UVA 10790 (13.08.06)
- UVA 253 (13.08.06)
- UVA 621 (13.08.06)
- UVA 591 (13.08.06)
- UVA 573 (13.08.06)
- UVA 846 (13.08.06)
- UVA 10499 (13.08.06)
- UVA 10025
- UVA-10025
- UVA 10025
- UVA 784 (13.08.09)
- UVA 401 (13.08.01)
- UVA 10361 (13.08.01)
- UVA 537 (13.08.01)
- UVA 409 (13.08.01)
- UVA 465 (13.08.02)
- UVA 10494 (13.08.02)
- CF 52C Circular RMQ(区间更新,区间询问)
- Subversion的两种工作模式
- 关于android 图像格式问题
- hdu 4649——Professor Tian
- 面试题:赛马问题
- UVA 10025 (13.08.06)
- hdu 2048 神、上帝以及老天爷
- 称球问题
- HDUOJ 4649 2013多校第五场第7题
- 给IT新人的15点建议:苦逼程序员的辛酸反省与总结
- HDU 1799 循环多少次?(排列组合,dp)
- 线性规划、梯度下降、正规方程组——斯坦福ML公开课笔记1-2
- 数据库设计技巧
- GBK和UTF8什么区别