Power of Cryptography

Background

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.

The Problem

Given an integer  and an integer  you
are to write a program that determines  , the positive  root
of p. In this problem, given such integers n and p, p will always be of the form  for an integer k (this
integer is what your program must find).

The 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  , and
there exists an integer k,  such that  .

The Output

For each integer pair n and p the value  should be printed, i.e., the number k such that  .

Sample Input

2
16
3
27
7
4357186184021382204544

Sample Output

4
3
1234

想的太复杂了，刚开始还想用字符串来着，但是在网上找相关解法知道用double可解决问题，double大小可达到2的1024次方。

但是强制类型转换时要注意精度问题，通常方法是+0.5之后再转换类型。

代码如下：

#include <stdio.h>
#include <math.h>
int main(void)
{
    double n,p;
    while(scanf("%lf%lf",&n,&p)!=EOF)
     printf("%.0f\n",pow(p,1.0/n));
    return 0;
}