# UVA113 solution by Mubasshir Ahmed

Current work in cryptography involves (among other things) large prime numbers and computing
powers of numbers modulo functions of these primes. Work in this area has resulted in the practical
use of results from number theory and other branches of mathematics once considered to be of only
theoretical interest.
This problem involves the efficient computation of integer roots of numbers.
Given an integer n ≥ 1 and an integer p ≥ 1 you are to write a program that determines √n p, the
positive n-th root of p. In this problem, given such integers n and p, p will always be of the form k
n for an integer k (this integer is what your program must find).
Input
The input consists of a sequence of integer pairs n and p with each integer on a line by itself. For all
such pairs 1 ≤ n ≤ 200, 1 ≤ p < 10101 and there exists an integer k, 1 ≤ k ≤ 109
such that k
n = p.
Output
For each integer pair n and p the value √n p should be printed, i.e., the number k such that k
n = p.
Sample Input
2 16
3 27
7 4357186184021382204544
Sample Output
4 3
1234

### Snippet options

Copy snippet: For this you need a free my code stock.com account.
Embed code : You will find the embed code for this snippet at the end of the page, if you want to embed it into a website or a blog!

```#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std ;
int main()
{
double  k , n  ;
double p ;

while (scanf("%lf%lf",&k,&n)==2)

{
p = pow(n,1.0/k);
printf("%.0lf\n",p);
}
return 0 ;
}```

### Create a free my code stock.com account now.

my code stok.com is a free service, which allows you to save and manage code snippes of any kind and programming language. We provide many advantages for your daily work with code-snippets, also for your teamwork. Give it a try!

You can customize the height of iFrame-Codes as needed! You can find more infos in our API Reference for iframe Embeds.