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 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 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
#include<stdio.h> #include<math.h> int main() { double x, y; int k; while(scanf("%lf%lf", &x, &y) != EOF) { k = (int)(pow(y, 1.0/x) + 0.5); printf("%d\n", k); } return 0; }
解题思路:
说实话,大数的问题也让人做怕了,一开始拿到这题目看了之后真的是一点思路都没有啊,但后来…… (怎么就想起桃花源记的一句话呢:未果,寻病终)