uva 113 Power of Cryptography
来源：互联网 发布：晨曦软件 编辑：程序博客网 时间：2024/04/30 08:34
题意：给出n和p，求k，使得k^n=p;
#include <iostream>#include <cstdio>#include <cmath>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { double m; scanf("%lf",&m); printf("%d\n",(int)(pow(m,1.0/n)+0.5)); } return 0;}- UVa 113 Power of Cryptography
- uva 113Power of Cryptography
- uva 113 Power of Cryptography
- UVA 113 - Power of Cryptography
- uva 113 - Power of Cryptography
- UVa 113 - Power of Cryptography
- UVA 113 - Power of Cryptography
- UVa 113Power of Cryptography
- UVa 113: Power of Cryptography
- uva 113 - Power of Cryptography
- UVA 113 Power of Cryptography
- uva 113 Power of Cryptography
- UVA 113 Power of Cryptography
- uva - 113 - Power of Cryptography
- uva 113 power of Cryptography
- UVa 113 - Power of Cryptography
- uva 113 - Power of Cryptography
- UVa 113 - Power of Cryptography
- vim scope 用法
- 关于C语言中的复合赋值操作符
- Linux内核简介
- C++虚析构函数
- Nginx源码分析--master进程
- uva 113 Power of Cryptography
- utf gb 等区别
- 说不尽的string字符串
- static 类成员
- Oracle：启动 Database Control 时出错
- 编写递归算法，计算二叉树中叶子结点的数目
- Visual C++通过ADO连接 SQL SERVER 2008
- 分析ms11-80 poc某些细节
- css属性~（积少成多）
