UVa 138 Street Numbers
2014-03-25 14:53
417 查看
题意是:给出前十对数字m和n,满足1加到m-1的和与m+1加到n的和相等,转化后,就是解方程的问题。需要注意的是判断一个数是整数的方法,即它的整数部分与真实值的差值小于某个很小的值。
#include<cstdio>
#include<cmath>
int main()
{
long long _mid;
double mid;
for(int i=6; i<100000000; i++)
{
mid = (double)i*(i+1);
mid /= 2;
mid = sqrt(mid);
_mid = mid;
if(fabs(mid-(double)_mid) < 1e-10)
printf("%10d%10d\n",_mid,i);
}
return 0;
}
#include<cstdio>
#include<cmath>
int main()
{
long long _mid;
double mid;
for(int i=6; i<100000000; i++)
{
mid = (double)i*(i+1);
mid /= 2;
mid = sqrt(mid);
_mid = mid;
if(fabs(mid-(double)_mid) < 1e-10)
printf("%10d%10d\n",_mid,i);
}
return 0;
}
相关文章推荐
- Street Numbers - UVa 138 水题
- Uva 138-Street Numbers(佩尔方程)
- UVA - 138 Street Numbers 公式题
- UVa 138: Street Numbers
- uva 138 Street Numbers
- uva 138 street numbers
- uva138 - Street Numbers
- uva 138 - Street Numbers(等差数列求和)
- UVA - 138 Street Numbers
- uva 138 Street Numbers(打表大法好)
- UVa 138 - Street Numbers
- UVA138- Street Numbers
- UVA 138 Street Numbers
- UVA138 - Street Numbers(等差数列)
- UVA - 138 - Street Numbers (简单数论)
- UVA 138 - Street Numbers (数论)
- UVa 138 - Street Numbers
- UVA 138 - Street Numbers (佩尔方程递推求解)
- uva 138 - Street Numbers
- UVA 138 Street Numbers