| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #81327 | #1007. G. 兼济天下 | Wrong Answer | 0 | 3 ms | 364 K | C++ / 290 B | Number_L | 2022-09-18 14:45:40 |
#include <bits/stdc++.h>
using namespace std;
int T, n, m;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d%d", &n, &m);
n--;
int x;
double fl;
x = ceil(m * 1.0 / n);
fl = (m * 1.0 / n) + x * (n - 1) - m;
if (fl == 0)
printf("CSFNB!");
else
printf("%.6lf\n", fl);
}
}10
3 17
4 21
2 0
2 1000000000
1000000000 999999999
1000000000 1000000000
1000000000 999999998
154236
<37 bytes omitted>0.500000
CSFNB!
CSFNB!
CSFNB!
CSFNB!
999999997.000000
1.000000
9737972.368635
158.314655
99
<16 bytes omitted>用户输出
0.500000
CSFNB!CSFNB!CSFNB!CSFNB!999999997.000000
1.000000
9737972.368635
158.314655
999999997.000000
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0