acm 1012 大数问题
来源:互联网 发布:远程桌面控制软件 编辑:程序博客网 时间:2024/05/19 12:36
1.1012
2.
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
3.给n和p,求k,且k^n=p,p限定在10-101
4.大数问题,呵呵TUTdouble开n次方吧
5.
#include<iostream>
#include<math.h>
using namespacestd;
int main()
{ int k;
double n,p;
while(cin>>n)
{ cin>>p;
k=pow(p,(1/n))+0.5;
cout<<k<<endl;
}
return 0;
}
0 0
- acm 1012 大数问题
- ACM大数阶乘问题
- 杭电acm 大数问题
- ACM内部函数--数学问题--大数相加
- ACM内部函数--数学问题--大数阶乘
- ACM内部函数--数学问题--大数相乘
- ACM 大数问题的知识点与算法
- ACM 大数问题函数及应用
- ACM 大数 大数阶乘
- 求大数阶乘的位数(ACM Big Number问题)
- ACM内部函数--数学问题--大数乘小数
- ACM内部函数--数学问题--大数相减
- ACM内部函数--数学问题--大数除法和取余
- ACM大数的处理
- c++ 大数模板 acm
- ACM JAVA大数
- ACM(一)大数相乘
- ACM 大数加法
- Lintcode 合并两个排序的链表
- leetcode 77. Combinations
- CodeForces 332B Maximum Absurdity
- Struts2内建的拦截器
- matlab 轻松绘制出曲线的动画效果
- acm 1012 大数问题
- java中this的用法
- 笔试真题-计算大位数的乘积
- codeforces 610A Pasha and Stick
- Attributes的使用
- Android-GridView的使用
- Linux Is Not Matrix——zabbix安装
- matlab读取xml文件
- MATLAB读入视频出错的解决方法