zoukankan      html  css  js  c++  java
  • SOJ 1017 Power of Cryptography 库函数精度

    Background

    Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of 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 of only theoretical interest.

    This problem involves the efficient computation of integer roots of numbers.

    The Problem

    Given an integer tex2html_wrap_inline32 and an integer tex2html_wrap_inline34 you are to write a program that determines tex2html_wrap_inline36 , the positive tex2html_wrap_inline38 root of p. In this problem, given such integers n and pp will always be of the form tex2html_wrap_inline48 for an integer k (this integer is what your program must find).

    The 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 tex2html_wrap_inline56 , tex2html_wrap_inline58 and there exists an integer ktex2html_wrap_inline62 such that tex2html_wrap_inline64 .

    The Output

    For each integer pair n and p the value tex2html_wrap_inline36 should be printed, i.e., the number k such that tex2html_wrap_inline64 .

    Sample Input

    2
    16
    3
    27
    7
    4357186184021382204544

    Sample Output

    4
    3
    1234

    解题思路:
      本题直接用pow求解就好,不过可能存在四舍五入一类的精度问题需要处理,所以要特别小心
    AC代码:
    #include<stdio.h>
    #include<math.h>
    int main()
    {
        double p,k;
        double n;
        while(scanf("%lf%lf",&n,&p)==2)
        {
            k=  pow (p,1.0/n);
            long long ans=k;
            if(pow(ans,n)!=p)printf("%ld
    ",ans+1);
            else printf("%ld
    ",ans);
        }
        return 0;
    } 
  • 相关阅读:
    注意安全 保重身体
    抽象和接口的区别
    哪些设计模式最值得学习
    超级扫盲什么是设计模式?
    简单工厂、工厂方法和抽象工厂模式
    通过领域模型设计物流系统
    json过滤特殊字符
    数据库性能优化JOIN方法说明[转]
    策略模式
    观察者模式
  • 原文地址:https://www.cnblogs.com/87hbteo/p/7631289.html
Copyright © 2011-2022 走看看