杭电ACM1012
2016-04-01 16:55
281 查看
(1)题目大意:
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 nth. power,
for an integer k (this integer is what your program must find).
[align=left]Input[/align]
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<sup>101</sup> and there exists an integer k, 1<=k<=10<sup>9</sup> such that k<sup>n</sup> = p.
[align=left]Output[/align]
For each integer pair n and p the value k should be printed, i.e., the number k such that k n =p.
[align=left]Sample Input[/align]
2 16
3 27
7 4357186184021382204544
[align=left]Sample Output[/align]
4
3
1234
就是给出n和p,求出k,使得k^n=p,p的范围到10^101,用double类型就可以做。
(2)解题思路:
用pow函数进行比较,如果pow(k,n)==p则输出k,由于要遍历的范围过大,所以采用二分法,节省时间。
(3)感想:
略。
(4)代码:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
double begin = 0, end = 1000000000;
double n, p;
while (cin >> n >> p)
{
begin = 0;
end = 1000000000;
while (begin<end)
{
double mid = (double)((begin + end) / 2);
if (pow(mid, n) < p)
{
begin = mid;
}
else if (pow(mid, n) > p)
{
end = mid;
}
else if (pow(mid, n) == p)
{
cout << mid << endl;
break;
}
}
}
return 0;
}
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 nth. power,
for an integer k (this integer is what your program must find).
[align=left]Input[/align]
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<sup>101</sup> and there exists an integer k, 1<=k<=10<sup>9</sup> such that k<sup>n</sup> = p.
[align=left]Output[/align]
For each integer pair n and p the value k should be printed, i.e., the number k such that k n =p.
[align=left]Sample Input[/align]
2 16
3 27
7 4357186184021382204544
[align=left]Sample Output[/align]
4
3
1234
就是给出n和p,求出k,使得k^n=p,p的范围到10^101,用double类型就可以做。
(2)解题思路:
用pow函数进行比较,如果pow(k,n)==p则输出k,由于要遍历的范围过大,所以采用二分法,节省时间。
(3)感想:
略。
(4)代码:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
double begin = 0, end = 1000000000;
double n, p;
while (cin >> n >> p)
{
begin = 0;
end = 1000000000;
while (begin<end)
{
double mid = (double)((begin + end) / 2);
if (pow(mid, n) < p)
{
begin = mid;
}
else if (pow(mid, n) > p)
{
end = mid;
}
else if (pow(mid, n) == p)
{
cout << mid << endl;
break;
}
}
}
return 0;
}
相关文章推荐
- 简单的四则运算
- 数的奇偶性
- ACM网址
- 1272 小希的迷宫
- 1272 小希的迷宫
- hdu 1250 大数相加并用数组储存
- 矩阵的乘法操作
- 蚂蚁爬行问题
- 蚂蚁爬行问题
- 求两个数的最大公约数【ACM基础题】
- 打印出二进制中所有1的位置
- 杭电题目---一只小蜜蜂
- HDOJ 1002 A + B Problem II (Big Numbers Addition)
- 初学ACM - 半数集(Half Set)问题 NOJ 1010 / FOJ 1207
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1002
- 高精度加法——杭电1002
- POJ 2635 The Embarrassed Cryptographe
- POJ 3292 Semi-prime H-numbers
- POJ 2773 HAPPY 2006