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
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
题意:找到一个数k满足k的n次方等于p,其中k的范围是1-10^9 n的范围是1-200 p的范围是1-10^101。
二分1-10^9,找到一个数再用大数乘法做就行了
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<queue>
using namespace std;
typedef long long LL;
int n;
int c[2000];
void cf(LL a[],LL s){
LL sum=0;
for(int i=0;i<2000;i++){
LL d=(a[i]*s+sum);
a[i]=d%10;
sum=d/10;
}
}
int f(LL s){
LL a[2000];
memset(a,0,sizeof(a));
a[0]=1;
for(int i=0;i<n;i++)cf(a,s);
for(int i=1999;i>=0;i--){
if(c[i]>a[i])return 1;
if(c[i]<a[i])return 2;
}
return 0;
}
int main(){
char ch[120];
while(cin>>n>>ch){
memset(c,0,sizeof(c));
int len=strlen(ch);
for(int i=0;ch[i];i++,len--)c[i]=ch[len-1]-'0';
LL l=1,r=1000000000;
int flag = 0;
while(l<=r){
LL mid=(l+r)/2;
int fl=f(mid);
if(fl==1)
l=mid+1;
else if(fl==2)
r=mid-1;
else {
cout<<mid<<endl;
flag=1;
break;
}
}
if(!flag)cout<<r<<endl;
}
return 0;
}
还有一种水的方法,double型的范围大于10^101
所以可以用double水过
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<queue>
using namespace std;
typedef long long LL;
int main(){
double n,p;
while(cin>>n>>p){
double k=pow(p,1/n);
cout<<(int)(k+0.99)<<endl;
}
return 0;
}