Codeforces Round #747 (Div. 2), problem: (A) Consecutive Sum Riddle,

最新推荐文章于 2022-11-22 23:15:14 发布

aisliveF

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量380

点赞数 1

分类专栏：竞赛文章标签： c++ 算法

本文链接：https://blog.csdn.net/weixin_46006714/article/details/120663628

版权

竞赛专栏收录该内容

45 篇文章 2 订阅

订阅专栏

本文介绍了一道编程题目，要求找到两个整数l和r，使得l到r的连续整数之和等于给定的目标值n。通过分析发现，答案总是存在且可以通过取n的负数对称值作为l来构造。给出的C++代码实现了这一解决方案，输出了满足条件的l和r。

摘要由CSDN通过智能技术生成

A - Consecutive Sum Riddle
A. Consecutive Sum Riddle
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Theofanis has a riddle for you and if you manage to solve it, he will give you a Cypriot snack halloumi for free (Cypriot cheese).

You are given an integer n. You need to find two integers l and r such that −1018≤l<r≤1018 and l+(l+1)+…+(r−1)+r=n.

Input
The first line contains a single integer t (1≤t≤104) — the number of test cases.

The first and only line of each test case contains a single integer n (1≤n≤1018).

Output
For each test case, print the two integers l and r such that −1018≤l<r≤1018 and l+(l+1)+…+(r−1)+r=n.

It can be proven that an answer always exists. If there are multiple answers, print any.

Example
inputCopy
7
1
2
3
6
100
25
3000000000000
outputCopy
0 1
-1 2
1 2
1 3
18 22
-2 7
999999999999 1000000000001
Note
In the first test case, 0+1=1.

In the second test case, (−1)+0+1+2=2.

In the fourth test case, 1+2+3=6.

In the fifth test case, 18+19+20+21+22=100.

In the sixth test case, (−2)+(−1)+0+1+2+3+4+5+6+7=25.
题意：找到一组区间累加和，使得区间和等于给定的数字n，输出此时的左右区间的端点值。
题解：我们发现该题的左右区间范围可以正负的最大值均可以取到，我们要求原来的n值，那么只要对于n的左边的一个值的负数取到，一直累加到n，根据正负抵消，那么此时的左右区间的累加和一定是n本身，正负数的值关于原点对称。

代码部分：

#include<bits/stdc++.h>
using namespace std;
int main(){
	int t;
	long long n;
	cin>>t;
	while(t--){
		cin>>n;
		cout<<-n+1<<' '<<n<<endl;
	}
	return 0;
}