UVA12230 - Crossing Rivers
2015-03-11 21:22
369 查看
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int main () { int cas = 1; int N; double D, p, l, v; while (scanf("%d%lf", &N, &D) == 2 && (N || D)) { for (int i = 0; i < N; i++) { scanf("%lf%lf%lf", &p, &l, &v); D = D - l + 2 * l / v; } printf("Case %d: %.3lf\n\n", cas++, D); } return 0; }
相关文章推荐
- UVA 12230 Crossing Rivers
- UVa12230 - Crossing Rivers (数学期望)
- 数学·期望·UVA-12230·Crossing Rivers
- UVa 12230 (期望) Crossing Rivers
- uva 12230 - Crossing Rivers(概率)
- UVA - 12230 Crossing Rivers 概率期望
- UVA 12230(p333)----Crossing Rivers
- UVa 12230 && HDU 3232 Crossing Rivers (数学期望水题)
- UVA - 12230 Crossing Rivers (期望)
- UVA - 12230 Crossing Rivers (期望)
- UVA.12230.Crossing Rivers(期望)
- UVA 12230 Crossing Rivers——期望
- uva 12230 - Crossing Rivers(概率)
- UVA 12230 - Crossing Rivers(概率)
- uva 12230 Crossing Rivers
- UVA 12230 - Crossing Rivers(概率)
- UVA - 12230 Crossing Rivers
- uva 12230 - Crossing Rivers(求数学期望)
- 【数学期望】Crossing Rivers, ACM/ICPC Wuhan 2009, UVa12230
- UVa12230 - Crossing Rivers(期望初步)