POJ 2109 Power of Cryptography 语言技巧

Power of Cryptography

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 16457		Accepted: 8327

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和p，存在k的n次方等于p，求k是多少，其实这道题第一眼看是个大数题，数据竟然达到了10的101次方，但是看了别人的解题报告，才发现，其实这道题不是在看算法，而是编译语言的技巧，对于double类型的数字，数据可以达到10的308次方，所以完全可以满足10的101次方，直接调用pow求成k，并且直接输出k的整数部分，这道题就这么愉快的AC了

下面是AC代码：

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

PS：从来木有见过10行一下的代码可以AC，长见识了