Find Integer

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 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=1且勾股数是答案。

（题解里面最重要的是勾股数规律）

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