SDAU 1012

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 m，現在n^p=m; 求p

思路：

如果是掃描查找的話，需要自己寫出大數相乘的規則，顯然是比較麻煩的。所以用數學知識轉化一下的話，就比較簡單了， p=m ^ 1/n  

感想：

一開始感覺挺難得，後來小豆子給我提醒了一下，恍然大悟~

AC代碼：

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
int main()
{
    //freopen("r.txt", "r", stdin);
    double n,p;
    int t;
    while(cin>>n)
    {
        cin>>p;
        t=pow(p,1/n)+0.5;
        cout<<t<<endl;
    }
}