F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Find Integer

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 6859    Accepted Submission(s): 2163
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 \le T\le1000000)$

next $T$ lines contains two integers $n$,$a$;$(0 \le n \le1000$,$000$,$000,3 \le a \le 40000)$
 

Output
print two integers $b$,$c$ if $b$,$c$ exits;$(1 \le b,c \le 1000$,$000$,$000)$;

else print two integers -1 -1 instead.
 

Sample Input
1 2 3
 

Sample Output
4 5
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-12-11 21:06:16, Gzip enabled