贪心算法5之1012
来源:互联网 发布:潭州学院java视频下载 编辑:程序博客网 时间:2024/05/16 15:28
1 题目编号:1012 problemM
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 解题思路形成过程:此题较为简单,只需注意需要用double类型防止数据溢出即可。
4 代码:
#include <iostream>
#include<math.h>
using namespace std;
int main()
{
double num1 = 1.0;
double num2 = 1.0;
while (cin >> num2 >> num1 )
{
double N = (int)(pow(num1, 1.0 / num2) + 0.5);
cout << N << endl;
}
return 0;
}
1 0
- 贪心算法5之1012
- 算法之贪心算法
- 算法之贪心算法
- acm之贪心算法题目5
- 贪心算法之找钱
- 贪心算法之Dijkstra
- 常用算法之贪心
- 算法之贪心思想
- 贪心算法之Entropy
- 贪心算法之Packets
- 贪心算法之Stripies
- 算法设计之贪心
- leetcode之贪心算法
- c++算法之贪心
- 算法之贪心书架
- 算法进阶之贪心
- 贪心算法之+-字符串
- 常用算法之贪心算法
- poj-2965-The Pilots Brothers' refrigerator(巧妙的位运算)
- contiki入门学习
- 【LA3516】Exploring Pyramids——动态规划+乘法原理
- 商业日志管理系统发展史
- Android自定义控件三部曲文章索引
- 贪心算法5之1012
- corethink功能模块探索开发(八)净化后台首页的系统信息
- 用面向对象的思维去解决数三退一。关键字,双向环形链表。
- day11 JSP和EL的入门,两个会话技术:cookies和session
- C# 已知圆心和两点,用DrawArc()画圆弧(算法)
- 银线蕨-我的啊银
- 红眼病
- 简述泛型算法之 三bind_参数绑定
- 总结Cocos2d-x 3.0 中新字体标签Label