费马大定理
Find Integer
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 414 Accepted Submission(s): 78
Special Judge
Problem Description
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 a^n+b^n=c^n.
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
Source
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main()
{
long long int n,a;
int t;
scanf("%d",&t);
while(t--)
{
scanf("%lld%lld",&n,&a);
if(n==0||n>2)
printf("-1 -1\n");
else if(n==1)
printf("1 %lld",a+1);
else
{
if(a%2==0)
{
long long int b,c;
b=((a*a)/2-2)/2;
c=((a*a)/2+2)/2;
printf("%lld %lld\n",b,c);
}
else
{
long long int b,c;
b=((a*a)-1)/2;
c=((a*a)+1)/2;
printf("%lld %lld\n",b,c);
}
}
}
return 0;
}