Power of Cryptography
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
101 and there exists an integer k, 1<=k<=10
9 such that k
n = 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 Source
本来看到这么大的数据,还把自己吓了一跳,想着还要用大数乘法,懒人在hypo那里得知double可以装得下这么大的数据,这样直接乘方就可以过了。于是我交了好多遍下面的代码,总觉得没什么错误,可就是会返回WA:
郁闷了好长时间,忽然间想起上午敲代码的时候处理过精度问题,对于这种双精度数据再加上(1/n),很容易产生小数并且在计算的时候也会出现精度误差,于是代码就变成了下面这个样子:
对于 为什么double型开n次方能够通过,我参看了别人的博客,得知: 首先,题目中的数据强度并不弱,这一点确实如题目中所说:“For all such pairs 1<=n<= 200, 1<=p<10101,所以,double型是不能精确地表示出所给数据,但是却能表示出一个近似值。 当向double型变量中存入 4357186184021382204544 然后再输出,得到的是 4357186184021382000000 后六位的值变为了0,这一点和int型变量是有很大区别的。也就是说当存入double型变量的值超出了它的精度表示范围时,将低位的数据截断。 在本题中,如果测试数据为: 7 4357186184021382204544 实际上所处理数据是: 7 4357186184021382000000 拿4357186184021382000000开7次方的结果自然就是1234。 为什么不是1233或者1235呢? 12337=4332529576639313702577 12347=4357186184021382204544 12357=4381962969567270546875 可以看出在double型所能表示的精度范围内,它们三个值已经不同了。 所以,此题中的测试数据也都是类似于上述情况,所以才能使用double型开n次方的方法 |
贪心——Power of Cryptography
最新推荐文章于 2018-02-04 20:32:00 发布