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

    第一道ACM的数学题。。。做了好久的字符串排序搜索高精度,终于到了数学了 ,

    起初以为要用高精度来做。。后来看看发现double就够了 double的范围-1.7*10^(-308) ~ 1.7*10^308 没超过p的范围 输出时注意用%.0lf消去小数尾数0

    然后开n次方就是root的1/n次方 UVA目前瘫痪ing POJ AC  题目及AC代码如下:

     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 p, p 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 k, tex2html_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
     1 #include<math.h>
     2 #include<cstdio>
     3 #include<string>
     4 using namespace std;
     5 int main(void)
     6 {
     7     double root, power;
     8     while (scanf("%lf%lf", &power, &root) == 2)
     9     {
    10         printf("%.0lf
    ", pow(root, 1 / power));                //难得这么精简的代码 用double就可以了 开n次根就相当于根的 1/n次方 输出注意用.0lf去除小数位
    11     }
    12 }
  • 相关阅读:
    spring复杂数据类型传递
    spring表单—乱码解决方案
    spring重定向与转发
    线程在WPF中的使用
    xheditor编辑器上传截图图片抓取远程图片代码
    js window.open()弹出窗口参数说明及居中设置
    INFORMATION_SCHEMA.COLUMNS 查询表字段语句
    SQL 使用Cursor(游标)遍历结果集
    js禁止浏览器滚屏方法
    基础-ADO插入数据后返回自增ID @@IDENTITY
  • 原文地址:https://www.cnblogs.com/VOID-133/p/3573045.html
Copyright © 2011-2022 走看看