Find Integer

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

题解：由费马大定理知n>=3时必然无解，因此只需讨论n==2的情况

奇偶数列：

程序中的式子是经过奇偶数列结论得来的。

#include<cstdio>
using namespace std;
typedef long long ll;
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll n,a;
        scanf("%lld %lld",&n,&a);
        if(n>=3 || n==0)
        {
            printf("-1 -1\n");
        }
        else if(n == 1)
        {
            printf("1 %lld\n",a+1);
        }
        else
        {
            ll temp = a*a;
            if(a%2)
            {
                temp /= 2;
                printf("%lld %lld\n",temp,temp+1);
            }
            else
            {
                temp /= 4;
                printf("%lld %lld\n",temp-1,temp+1);
            }
        }
    }
    return 0;
}