CF1594A.Consecutive Sum Riddle
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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 .
输入格式
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 ).
输出格式
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.
输入输出样例
输入#1
7 1 2 3 6 100 25 3000000000000
输出#1
0 1 -1 2 1 2 1 3 18 22 -2 7 999999999999 1000000000001
说明/提示
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 .