Power of Cryptography(二分+pow)
来源:互联网 发布:淘宝苹果旗舰店靠谱吗 编辑:程序博客网 时间:2024/05/29 17:34
D - Power of Cryptography
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uAppoint description:
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 163 277 4357186184021382204544
Sample Output
431234
AC代码:
#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cstdio>#include<vector>#include<cmath>using namespace std;#define T 1005double n,m;int BS(int L,int R){int mid;while(R>L){mid = (L+R)>>1;if(pow((double)mid,n)==m){return mid;}if(pow((double)mid,n)>m)R = mid;elseL = mid+1;}return 0;}int main(){/*freopen("input.txt","r",stdin);*/int i,j,k;while(~scanf("%lf%lf",&n,&m)){printf("%d\n",BS(1,1000000000));}return 0;}
0 0
- Power of Cryptography(二分+pow)
- POJ2109 Power of Cryptography 二分
- Power of Cryptography(POJ 2109)(二分)
- UVA - 113 Power of Cryptography (大数幂+二分)
- POJ2109 Power of Cryptography (高精度+二分) (可以double水過去)
- 【二分答案】POJ-2109 Power of Cryptography
- POJ2109《Power of Cryptography》方法:pow(p, 1/n)
- poj 2109 Power of Cryptography(pow() 和 double 的妙用)
- Power of Cryptography(高精度)
- Power of Cryptography(2109)
- poj2109 Power of Cryptography —— 技巧性(高精度+二分的方法还没写)
- UVA 113-Power of Cryptography(二分+double处理大数据)
- (模板题)poj 2190 Power of Cryptography(二分查找)
- POJ 2109 Power of Cryptography(二分+高精)
- POJ 2109 Power of Cryptography 二分+高精度 【未AC】
- UVA 113 - Power of Cryptography(数学)
- UVA 113 - Power of Cryptography(数学)
- Power of Cryptography(2109,数学)
- R字首类破解补丁速查
- IOS UILabe及UIFont用法总结
- Mysql的安装
- 很果断地选择了黑马
- S字首类破解补丁速查
- Power of Cryptography(二分+pow)
- POJ 2785 4 Values whose Sum is 0 (折半搜索 )
- T字首类破解补丁速查
- B字首类破解补丁速查
- C字首类破解补丁速查
- IOS控件之UITableView详解
- [Leetcode] Ugly Number
- U字首类破解补丁速查
- JavaScript权威指南_164_第17章_事件处理_17.2-注册事件处理程序-addEventListener()