M
来源:互联网 发布:java 数组遍历 编辑:程序博客网 时间:2024/04/28 18:41
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 nth. 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 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<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 163 277 4357186184021382204544
Sample Output
431234
感觉会有精度问题和超时问题。。。但是本人懒偷巧用了math.h里的pow函数。。
代码:
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
double n;
while (cin>>n)
{
#include<math.h>
using namespace std;
int main()
{
double n;
while (cin>>n)
{
double s;
cin>>s;
cin>>s;
cout<<pow(s, 1/n)<<endl;
}
return 0;
}
}
return 0;
}
0 0
- M
- m
- m,
- m
- m
- M
- ^M
- M
- m
- M
- M
- M
- M
- (?m)
- (?m)
- M
- M
- M
- angularJS过滤器和自定义的过滤器
- Java 中Static解析
- SQL 查询 逗号 分割的属性值
- git基本操作
- 1013_三角形判断
- M
- ubuntu上按文件名查找并替换文件内容
- SecureCRT通过脚本实现自动化登录
- 浅谈百度地图的简单开发之实现地图全景,内景展示功能(四)
- 使用genstring和NSLocalizedString实现App文本的本地化
- 1570: [JSOI2008]Blue Mary的旅行 最大流
- 了解堆和栈
- android selinux权限, Permission denied, 访问限制
- 基因数据处理17之使用scala对BWA运行结果进行各阶段程序时间提取和统计求和