zoukankan      html  css  js  c++  java
  • poj 2109Power 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 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<10101 and there exists an integer k, 1<=k<=109 such that kn = 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

    大意为给你k和p,让你求满足k^n=p的n的值。。。发现p的最大也就10^101,而double的最大范围是10^308,所以可以用double水过。。
    View Code
    1 #include <stdio.h>
    2 #include <math.h>
    3 int main()
    4 {
    5     double n,p;
    6     while(scanf("%lf%lf",&n,&p)!=EOF)
    7         printf("%.lf\n",pow(p,1.0/n));
    8     return 0;
    9 }
  • 相关阅读:
    mysql中drop、delete、truncate的区别简述
    hadoop之数据倾斜
    Mysql相关:navicat for mysql 加注释
    泛型
    工银亚洲见证开户详细过程和攻略
    classpath:和classpath*:的区别
    单索引与唯一索引
    MySQL中SQL语句之反引号,单引号
    《集体智慧编程》学习笔记 第三章
    《集体智慧编程》 读书笔记 第二章
  • 原文地址:https://www.cnblogs.com/wilsonjuxta/p/2953706.html
Copyright © 2011-2022 走看看