poj 2109 Power of Cryptography
来源:互联网 发布:淘宝供销怎么改分销 编辑:程序博客网 时间:2024/06/06 04:06
p的范围…相当可怕,本来以为…要上高精度…然后二分…结果…
看代码吧…
double,一个神奇的类型。
(当然啦这题高精度和二分也能过…但是我这么懒…怎么会写呢…
(逃
#include <iostream>#include <cmath>int main(int argc, char *argv[]) { double n, p; while(std::cin >> n >> p) { std::cout << pow(p, 1/n) << std::endl; } return 0;}
阅读全文
0 0
- poj 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 : Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- poj-2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- urlencode & quote & unquote (url 中带中文参数)
- 浏览器兼容性测试的分类
- VS中Debug模式和Release模式的区别
- "HEVC Complexity and Implementation Analysis"阅读笔记
- STM32外部中断(EXTI)分析和应用
- poj 2109 Power of Cryptography
- JSON.parse()方法,将数据(字符串)转化为javascript对象
- 文档管理Qoppa 商家PDF 系列产品2016R1更新合集
- 利用libevent 和线程池实现高并发服务器的设计
- Bigdecimal类型判断是否等于0(用equals方法的坑)
- QLineEdit
- JavaScript中神奇的call()方法
- Codeforces 520B Two Buttons 题解
- LibLinear使用总结(L1,L2正则)