zoukankan      html  css  js  c++  java
  • Power of Cryptography

    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
    对于这题,我实在无力吐槽,试着写了半天的大数模拟,结果一个double +pow竟然过了
     1 #include<stdio.h>
     2 #include<math.h>
     3 int main()
     4 {
     5     double x, y;
     6     int k;
     7     while(scanf("%lf%lf", &x, &y) != EOF)
     8     {
     9         k = (int)(pow(y, 1.0/x) + 0.5);
    10         printf("%d
    ", k);
    11     }
    12     return 0;
    13 }
    View Code
     
     
     
  • 相关阅读:
    Insert Sort Singly List
    Binary Search Tree Iterator
    React的组件化
    React的虚拟DOM
    如何依靠代码提高网络性能
    读高性能JavaScript编程 第三章
    读高性能JavaScript编程 第二章 让我知道了代码为什么要这样写
    读高性能JavaScript编程 第一章
    固本培元之一:栈和堆
    学习笔记
  • 原文地址:https://www.cnblogs.com/kongkaikai/p/3241791.html
Copyright © 2011-2022 走看看