UVa OJ 113-Power of Cryptography
2011-01-14 11:28
316 查看
double的强大：
{
Author:wzx961008
Problem:UVa 11461-Square Numbers
Verdict:Accepted
Language:PASCAL
Run Time:0.028s
Submission Date:2011-02-11 05:31:21
}
uses math;
var n,p:double;
begin
while not eof do begin
readln(n);
readln(p);
writeln(power(p,1/n):0:0);
end;
end.
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 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 【double避开高精度】
- 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|牛顿迭代法|pow函数的应用
- UVa 113 Power of Cryptography
- UVa 113 Power of Cryptography
- UVA - 113 Power of Cryptography
- UVA 113-Power of Cryptography
- Power of Cryptography（POJ-2109 && UVA-113）