uva 113 Power of Cryptography
2011-02-10 20:34
435 查看
这个题做的很无语，刚开始用高精度，二分查找，结果总是TLE。实在没招了，看了解题报告…囧…原来可以用double，原来可以用pow()，以前没这么用过。然后把代码改了，还是WA了2次，精度问题。以后注意用pow()，fabs()，返回值都要强制类型转换，否则很容易出错。代码不贴了，太……
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 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
- 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 (暑假-数学-A - Power of Cryptography)
- UVa 113 Power of Cryptography