uva 10025 The ? 1 ? 2 ? ... ? n = k problem(算式规律)
来源:互联网 发布:java前沿技术 2017 编辑:程序博客网 时间:2024/06/05 02:55
The ? 1 ? 2 ? ... ? n = k problem
The problem
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
The Input
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题目大意:给出一个数, 判断它需要从1~m(可用+、-)填充的算式求得。求m
解题思路:首先, 1~m的和一定要 > n(如果全+都无法表示的话, 更别说有-)其次,找到一个m,使得1~m的和>n之后,因为sum >= n, 所以要减掉一个数, 比如在数字k前面加个-号, 相当于sum - 2 * k,也就是说每次减掉只能是偶数, 那么就要求sum % 2 == n % 2.(负数同理)
#include<stdio.h>int main(){int t, n, sum, i;scanf("%d", &t);while (t--){scanf("%d", &n);if (n < 0)n = -n;for (sum = 0, i = 1; ; i++){sum += i;if (sum >= n && (sum - n) % 2 == 0){printf("%d\n", i);break;}}if (t)printf("\n");}return 0;}
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem(算式规律)
- UVa 10025 - The ? 1 ? 2 ? ... ? n = k problem
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem
- Uva 10025 - The ? 1 ? 2 ? ... ? n = k problem
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem
- uva 10025 - The ? 1 ? 2 ? ... ? n = k problem
- UVa 10025 - The ? 1 ? 2 ? ... ? n = k problem
- UVA - 10025 :The ? 1 ? 2 ? ... ? n = k problem
- Uva 10025 - The ? 1 ? 2 ? ... ? n = k problem
- uva 10025The ? 1 ? 2 ? ... ? n = k problem
- UVa 10025 - The ? 1 ? 2 ? ... ? n = k problem
- UVA 10025 The ? 1 ? 2 ? ... ? n = k problem
- UVa 10025: The ? 1 ? 2 ? ... ? n = k problem
- UVA 10025 The ? 1 ? 2 ? ... ? n = k problem
- uva 10025 - The 1 2 ... n = k problem
- UVA 10025 The ? 1 ? 2 ? ... ? n = k problem
- UVA 10025 - The ? 1 ? 2 ? ... ? n = k problem
- uva 10025 - The ? 1 ? 2 ? ... ? n = k problem
- C# 服务创建线程
- S3C2416 Linux2.6.21 驱动移植--添加UART3 及波特率设置bug消除
- 胆识也是一种能力[转 一个女程序员的创业人生]
- 浅谈Java 同步机制
- UVa 10651 Pebble Solitaire 记忆化搜索+位运算
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem(算式规律)
- 已知树的前序和中序求后序 hdu 题目1710 Binary Tree Traversals
- join & union & group by
- wince 关于Bin文件的解析
- Maya 2013 下载以及破解教程
- Objective-C之Foundation框架NSNumber、NSNull、NSValue、NSDate用法介绍
- Hibernate之session
- Eboot中nand flash控制器参数TACLS、TWRPH0和TWRPH1的确定(基于K9F2G08U0B)
- UVA 10591 Happy Number