113 - Power of Cryptography
Root ::AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: Maths - Misc |
|
113 - Power of CryptographyTime limit: 3.000 seconds |
Power of Cryptography
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 ofp. In this problem, given such integers n and p,
p will always be of the form for an integerk (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 integerk,
such that
.
The Output
For each integer pair n and p the value should be printed, i.e., the numberk such that
.
Sample Input
2 16 3 27 7 4357186184021382204544
Sample Output
4 3 1234
题解
代码示例
/**** *@PoloShen *Title:UVa 113 */ #include <cstdio> #include <cmath> using namespace std; int main(){ double n, p; while (scanf("%lf%lf", &n, &p) != EOF) { printf("%.lf\n", pow(p, 1/n)); } return 0; }