CodeForces - 1594A Consecutive Sum Riddle【数学计算】

A. Consecutive Sum Riddle
time limit per test 2 seconds
memory limit per test 256 megabytes

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 −10¹⁸≤l18 and l+(l+1)+…+(r−1)+r=n.

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

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

Output
For each test case, print the two integers l and r such that −10¹⁸≤l18 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
input
7
1
2
3
6
100
25
3000000000000
output
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.

问题链接：CodeForces - 1594A Consecutive Sum Riddle
问题简述：（略）
问题分析：（略）

AC的C语言程序如下：

#include 

int main()
{
    int t;
    scanf("%d", &t);
    while (t--) {
        long long n;
        scanf("%lld", &n);
        printf("%lld %lldn", -n + 1, n);
    }
    
    return 0;
}