poj 2109 : Power of Cryptography
来源：互联网 发布：急需网络兼职工作 编辑：程序博客网 时间：2024/05/21 20:21
求一个k，使得k的n次方等于p。
#include<iostream>#include<math.h>using namespace std;int main(){double n,p;while(scanf("%lf%lf",&n,&p)!=EOF)printf("%.0lf\n",pow(p,1.0/n));return 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
- ExtJs4.0颜色控件
- Java设计模式（五）Facade(外观),Composite(组合),Decorator(油漆工)
- 利用FindFirstFile和CreateDirectory函数实现多层目录的检测和创建
- 禁止火狐浏览器缓存input标签
- 获取窗口激活消息的钩子函数
- poj 2109 : Power of Cryptography
- ExtJs4.0 TreePanel+CheckBox全选
- 众多Android 开源项目推荐，给力工作给力学习
- SQL 行列转换
- extern ,EXPORT_SYMBOL
- poj1691(状态压缩，树型DP)
- Linux文件查找命令find,xargs详述
- Log4net的使用
- 不靠谱的tooltip
