BETA

Difficulty Level: Easy

Submissions: 2681 Accuracy:

21.63%

Find Nth root of M
     

You are given 2 numbers (N , M) the task is to find N√M (Nth root of M).

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains two space separated integers N and M.

Output:
For each test case in a new line print an integer denoting Nth root of M if the root is an integer else print -1.

Constraints:
1<=T<=200
2<=N<=20
1<=M<=10^9+5

Example:
Input:

2
2 9
3 9
Output:
3
-1

 

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Devoshree Mukherji

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.