费马大定理

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_37891604/article/details/82078184

http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1004&cid=812

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

 

Statistic | Submit | Clarifications | Back

费马大定理：又称费马最后的定理，当n>2时，关于x,y,z的方程 没有正整数解。

n<2是就是勾股数--https://mp.csdn.net/postedit/82078554