Find Integer

Find Integer

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 6597    Accepted Submission(s): 1852
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 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

 定理：

费马大定理

a^n+b^n = c^n 若n大于2则无正整数解

只需要特判下0，1 然后找下2的解就可以

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    int t,n,a;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&a);
        if(n==0)
        {
            printf("-1 -1
");
        }
        if(n==1)
        {
            printf("1 %d
",a+1);
        }
        if(n==2)
        {
            if(a%2==0)
            {
                printf("%d %d
",(a*a/2-2)/2,(a*a/2+2)/2);
            }
            else
            {
                printf("%d %d
",(a*a-1)/2,(a*a+1)/2);
            }
        }
        if(n>=3)
        {
            printf("-1 -1
");
        }
    }
    return 0;
}