UVa 113 - Power of Cryptography
2013-02-25 00:07
411 查看
题目链接http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=24&problem=49&mosmsg=Submission+received+with+ID+11335297
算对数
开始天真的认为简单的做个循环就搞定,呵呵!最后那组一直实现不了。多亏了高人指点,多学了两个函数
#include"stdio.h"
#include"math.h"
int main()
{
double apple,peao,range;
while(scanf("%lf%lf",&apple,&pea)!=EOF)
{
orange=exp(log(pea)/apple);
printf("%.0lf\n",orange);
}
return 0;
}
算对数
开始天真的认为简单的做个循环就搞定,呵呵!最后那组一直实现不了。多亏了高人指点,多学了两个函数
#include"stdio.h"
#include"math.h"
int main()
{
double apple,peao,range;
while(scanf("%lf%lf",&apple,&pea)!=EOF)
{
orange=exp(log(pea)/apple);
printf("%.0lf\n",orange);
}
return 0;
}
相关文章推荐
- 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
- UVa 113|Power of Cryptography|牛顿迭代法|pow函数的应用
- UVA 113 (暑假-数学-A - Power of Cryptography)