Power of Cryptography
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 22533 | Accepted: 11366 |
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
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
这题有毒;
真的有毒;
首先这不一定是有k,当没有k存在时,就向下取整;
我想到的是高精度+二分;
头一次用java,java的大数类真的很好用;
import java.util.Scanner;
import java.math.*;
import java.text.*;
public class Main
{
public static void main(String args[])
{
Scanner cin = new Scanner (System.in);
BigInteger temp,p;
int n,ans,left,right,mid;
while(cin.hasNext())
{
n = cin.nextInt();
p = cin.nextBigInteger();
left = 1;
right = 1000000000;
ans = -1;
while(left<=right)
{
mid = (left+right)/2;
temp=BigInteger.valueOf(1);
for(int i=1;i<=n;++i)
{
temp=temp.multiply(BigInteger.valueOf(mid));
}
int flag = temp.compareTo(p);
if(flag == 0)
{
ans = mid;
break;
}
else if(flag == -1)
{
ans = mid;
left = mid+1;
}
else
{
right = mid-1;
}
}
System.out.println(ans);
}
}
}
但当我看到别人的程序时惊了个呆,double就可以了;
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
double n,p;
while(scanf("%lf %lf",&n,&p)!=EOF)
{
cout<<pow(p,1.0/n)<<endl;
}
return 0;
}
为什么这是可行的,可以看一下这个博客
http://blog.csdn.net/synapse7/article/details/11672691