HDU 6441 Find Integer（费马大定理）

people in USSS love math very much, and there is a famous math problem .

give you two integers n,a,you are required to find 2 integers b,c such that an+bn=cn.
Input
one line contains one integer T;(1≤T≤1000000)

next T lines contains two integers n,a;(0≤n≤1000,000,000,3≤a≤40000)
Output
print two integers b,c if b,c exits;(1≤b,c≤1000,000,000);

else print two integers -1 -1 instead.
Sample Input
1
2 3
Sample Output
4 5
题解：此题考察费马大定理，当n>=3时，a的n次方+b的n次方=c的n次方，将没有整数解，所以这个题只需判断，n=1和n=2的情况就好了，我们接下来，还要提一下，当n=2时，你需要点开
https://wenku.baidu.com/view/8282f1b669eae009591bec85.html
这个神奇的链接看一下。

AC代码：

#include<stdio.h>
int main()
{
	long long T,n,a;
	scanf("%lld",&T);
	while(T--)
	{
		scanf("%lld%lld",&n,&a);
		if(n>=3||n==0)
		{
			printf("-1 -1\n");
		}
		else if(n==1)
		{
			printf("%lld %lld\n",a+1,2*a+1);
		}
		else if(n==2)
		{
			if(a%2!=0)
			{
				printf("%lld %lld\n",a*(a/2)+a/2,a*(a/2)+a/2+1);
			}
			else
			{
				printf("%lld %lld\n",(a*(a/2))/2-1,(a*(a/2))/2+1);
			}
		}
	}
	return 0;
}