本文共 1667 字，大约阅读时间需要 5 分钟。

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

21632774357186184021382204544

Sample Output

431234

1 /************************************************************************* 2     > File Name: 1234.cpp 3     > Author: acmicpcstar 4     > Mail: acmicpcstar@gmail.com 5     > Created Time: 2014年04月23日 星期三 19时36分47秒 6  ************************************************************************/ 7  8 #include
    
      9 #include
     
      10 #include
      
       11 #include
       
        12 using namespace std;13 int main()14 {double n,p;15 while(cin>>n>>p)16 printf("%.0lf\n",pow(p,1.0/n));17 return 0;18 }
       
      
     
    

本来想高精度的看了大牛的代码。。。直接惊奇～！

转载地址：https://www.cnblogs.com/acmicpcstar/p/3683800.html 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！