关闭

poj2109——Power of Cryptography

标签: powerpojnumbersacmc
826人阅读 评论(0) 收藏 举报
分类:

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 nth. 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<10101 and there exists an integer k, 1<=k<=109 such that kn = 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

double能表示的范围为10^308范围的数,强制转化为int会WA…

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>
//#include <set>
#include <vector>
#include <iomanip>
#include <stack>
#include <map>
#include <queue>
#define MAXN 1010
#define mod 2012
#define INF 0x3f3f3f3f
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    double n,p;
    while(cin>>n>>p)
    {
        cout<<pow(p,1/n)<<endl;
    }
    return 0;
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:364858次
    • 积分:10655
    • 等级:
    • 排名:第1741名
    • 原创:675篇
    • 转载:2篇
    • 译文:0篇
    • 评论:115条
    博主信箱
    博客专栏
    文章分类
    最新评论