uva1388 Graveyard
2014-05-12 21:34
399 查看
题目来源:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=4134
刘汝佳《算法竞赛入门经典训练指南》1.1例4
刘汝佳《算法竞赛入门经典训练指南》1.1例4
///2014.4.12 ///uva1388 ///刘汝佳《算法竞赛入门经典训练指南》1.1例4 #include <iostream> #include <cstdio> #include <string> #include <cmath> #include <algorithm> #include <climits> using namespace std; int main() { // freopen("in","r",stdin); // freopen("out","w",stdout); int n,m; while( cin>>n>>m ){ double sum = 0; for(int i=1 ; i<n ; i++){ double d1 = 1.0/n; double d2 = 1.0/(m+n); int num = d1*i/d2; double a = fabs(d1*i-num*d2); double b = fabs(d1*i-(num+1)*d2); if(a<b) sum += a; else sum += b; } sum *= 10000; printf("%.4lf\n",sum ); } return 0; }
相关文章推荐
- uva1388 Graveyard
- uva1388 Graveyard
- UVA-1388 - Graveyard-2014年4月20日021827
- uva 1388 - Graveyard
- uva 1388 - Graveyard(数论)
- UVA - 1388 Graveyard 四舍五入
- uva1388 Graveyard
- uva 1388 - Graveyard(贪心)
- UVa1388 - Graveyard
- uva 1388 - Graveyard
- UVa1388 - Graveyard (数学,思维)
- uva 1388 - Graveyard(数论)
- UVAlive3708 UVA1388 POJ3154 Graveyard【水题】
- UVA - 1388 Graveyard
- Uva 1388 Graveyard - 水题
- Uva 1388 Graveyard 解题报告(数学)
- Graveyard(UVa1388)
- UVa 1388 Graveyard 墓地雕塑
- NEERC 2006 / UVa 1388 Graveyard (数学&想法题&找最近整数)
- UVA 1388 - Graveyard