hdu6441 Find Integer

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

 

 

Source

2018中国大学生程序设计竞赛 - 网络选拔赛

 

 

Recommend

chendu

首先，费马大定理得出n>2的时候没有整数解，输出-1 -1

这样只分析n=0,1,2的时候

n=0无解

n=1的时候，b=a,c=2*a

n=2的时候，利用勾股数，判断下奇偶就好

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll t,n,a,i,j,tmp,b,c;
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld%lld",&n,&a);
        if(n>2||n==0)
        {//cout<<"^^"<<endl;
            printf("-1 -1\n");
        }
        else
        {
            if(n==1)
            {
                b=a;
                c=2*a;
                printf("%lld %lld\n",b,c);
            }
            else
            {
                if(a%2)
                {
                    tmp=(a-1)/2;
                    b=2*tmp*tmp+2*tmp;
                    c=2*tmp*tmp+2*tmp+1;
                    printf("%lld %lld\n",b,c);
                }
                else
                {
                    tmp=a/2;
                    b=tmp*tmp-1;
                    c=tmp*tmp+1;
                    printf("%lld %lld\n",b,c);
                }
            }
        }
    }
}