Problem L

Problem Description

Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among 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 only of theoretical interest.
This problem involves the efficient computation of integer roots of numbers.
Given an integer n>=1 and an integer p>= 1 you have to write a program that determines the n th positive root of p. In this problem, given such integers n and p, p will always be of the form k to the n ^th. power, 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<10¹⁰¹ and there exists an integer k, 1<=k<=10⁹ such that kⁿ = p.

 

Output

For each integer pair n and p the value k 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

简单题意：

  密码学和数论是一个令人感兴趣的研究。现在要求编写一个程序，给出n和p，然后求出p的n次方根。

解题思路形成过程：

  在 我的C++函数库中，并没有开n次方根的函数。但是有一个求n次方的函数，那就是pow().所以我想，开n次方根也就是求p的1/n次方。所以程序就了然于胸。

感想:

  在考虑任何问题是，都要用已有知识求探求未知，有时候，反其道而行也是一种不错的方式。

AC代码：

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
    double n,p,k;
    while(cin>>n>>p)
    {
       
        k=pow(p,1.0/n);
        cout<<k<<endl;
    }
    return 0;
}