Power of Cryptography

//只用一行核心代码就可以过的天坑题目............= =

题目:

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).

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 16
3 27
7 4357186184021382204544

Sample Output

4
3
1234
 
哎~不多说了,代码如下:
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    double n,p;
    while(cin>>n>>p)
    {
        cout<<pow(p,1/n)<<endl;
    }
    return 0;
}


 正解:二分+高精
代码:
 1 #include <stdio.h>
 2 #include <string.h>
 3 
 4 // 交换字符串函数
 5 void swap_str(char str[]) {
 6     int len = strlen(str);
 7     for (int i=0; i<len/2; i++) {
 8         int tmp = str[i];
 9         str[i] = str[len-i-1];
10         str[len-i-1] = tmp;
11     }
12 }
13 
14 // 大数与整型相乘函数(大数以字符串形式给出)
15 void my_mul(char str[], int x) {
16     int len = strlen(str);
17     int cp = 0, i, tmp;
18     swap_str(str);
19     for (i=0; i<len; i++) {
20         tmp = (str[i]-'0')*x + cp;
21         str[i] = (tmp%10) + '0';
22         cp = tmp / 10;
23     }
24     while (cp) {
25         str[i++] = (cp%10) + '0';
26         cp /= 10;
27     }
28     while ('0'==str[i-1] && i>1)
29         i--;
30     str[i] = '\0';
31     swap_str(str);
32 }
33 // 比较两个大数的大小(大数前没有0)
34 int my_numCmp(char str1[], char str2[]) {
35     int len1, len2;
36     len1 = strlen(str1);
37     len2 = strlen(str2);
38     if (len1 > len2)
39         return 1;
40     if (len1 < len2)
41         return -1;
42     return strcmp(str1, str2);
43 }
44 
45 // 字符串存储开方结果
46 void my_pow(char str[], int k, int n) {
47     str[0] = '1', str[1] = '\0';
48     while (n--) {
49         my_mul(str, k);
50     }
51 }
52 
53 // 二分查找正确答案
54 int my_binary_search(int n, char str[]) {
55     int high = 1e9, low = 0;
56     int mid;
57     char tot[2005];
58 
59     while (low < high) {
60         mid = low + (high-low)/2;
61         my_pow(tot, mid, n);
62         int tmp = my_numCmp(tot, str);
63         if (0 == tmp)
64             return mid;
65         if (tmp < 0)
66             low = mid + 1;
67         else
68             high = mid;
69     }
70     return mid;
71 }
72 
73 int main() {
74     char str[105];
75     int n;
76     while (scanf("%d%s", &n, str) != EOF) {
77         printf("%d\n", my_binary_search(n, str));
78     }
79     return 0;
80 }

代码来源:http://blog.csdn.net/zcube/article/details/8545523

转载于:https://www.cnblogs.com/teilawll/p/3204786.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值