Cube 其实作为小白的我不是很明白这道题存在的意思是什么。

As a student of the applied mathematics school of UESTC, WCM likes mathematics. Some day he found an interesting theorem that every positive integer’s cube can be expressed as the sum of some continuous odd positive integers.
For example,

111111 = 1331 = 111+113+115+117+119+121+123+125+127+129+131

Facing such a perfect theorem, WCM felt very agitated. But he didn’t know how to prove it. He asked his good friend Tom Riddle for help. Tom Riddle is a student of the computer science school of UESTC and is skillful at programming. He used the computer to prove the theorem’s validity easily. Can you also do it?

Given a positive integer N, you should determine how to express this number as the sum of N continuous odd positive integers. You only need to output the smallest and the largest number among the N integers.
Output
For each test case, output two integers on a line, the smallest and the largest number among the N continuous odd positive integers whose sum is N * N * N.
Sample Input
Raw
2
11
3
Sample Output
Raw
111 131
7 11

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
    	long long  b;
    	int num=1;
    	scanf("%lld",&b);
    	printf("%d %d\n",b*(b-1)+1,b*(b+1)-1);
	}
	return 0;        
}