当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
2 3 3 1 2 2 4 2 1 1 1 2
Case #1: 0.5000000000 Case #2: 0.4000000000
The first test case is the sample in the problem. In the second test case, the best lottery program is: Assume groups are A(1), B(1), C(1), D(2), For [0, 0.2) persons in A, B are the winners. For [0.2, 0.4) persons in B, C are the winners. For [0.4, 0.6) persons in A, C are the winners. For [0.6, 1) persons in D are the winners.
Recommend | liuyiding |
时间上限 | 内存上限 |
2000/1000MS(Java/Others) | 65536/65536K(Java/Others) |