题目:Problem M
Problem 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).
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<sup>101</sup> and there exists an integer k, 1<=k<=10<sup>9</sup> such that k<sup>n</sup> = 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
题意:
输入一个数a,一个数b,求b的根下a次方是多少;
思路:
二分法查找,设置mid=(0+b)/2,然后看mid的a次方x与b的关系,如果x>b,则b= mid,mid=(0+b)/2;如果x<b,则mid = (mid+b)/2,直到x = b,然后输出mid;
感想:
对特别大的数不怎么会处理,做完这题后有了不少经验
代码:# include <iostream>
# include <cmath>
using namespace std;
int main()
{
double a, b;
while(cin >> a >> b)
{
double hight= b, low = 0,mid;
while(1)
{
mid = (low + hight)/2;
if(pow(mid, a) == b)
{
cout << mid <<endl;
break;
}
else if (pow(mid, a) > b)
{
hight = mid;
}
else if (pow(mid, a) < b)
{
low = mid;
}
}
}
return 0;
}
# include <iostream>
# include <cmath>
using namespace std;
int main()
{
double a, b;
while(cin >> a >> b)
{
double hight= b, low = 0,mid;
while(1)
{
mid = (low + hight)/2;
if(pow(mid, a) == b)
{
cout << mid <<endl;
break;
}
else if (pow(mid, a) > b)
{
hight = mid;
}
else if (pow(mid, a) < b)
{
low = mid;
}
}
}
return 0;
}