编号 题目 状态 分数 总时间 内存 代码 / 答案文件 提交者 提交时间
#22200 #1007. G. 兼济天下 Accepted 100 3 ms 264 K C / 790 B ZeroKelvin 2020-02-11 23:27:20
显示原始代码
#include <stdio.h>
#include <stdlib.h>

int main() {
    int T;
    scanf("%d", &T);
    int** List = (int**)malloc(T * sizeof(int*));
    for (int i = 0; i < T; i++) {
        List[i] = (int*)malloc(2 * sizeof(int));
    }
    for (int i = 0; i < T; i++) {
        scanf("%d%d", &List[i][0], &List[i][1]);
    }
    double q, r;
    for (int i = 0; i < T; i++) {
        int m = List[i][1];
        int n = List[i][0];
        q = (double)m / ((double)n - 1);
        if (m % (n - 1) == 0) {
            r = 0;
        } else {
            r = (n - 2) * (1 - (q - (int)q));
        }
        if (r > 0) {
            printf("%.6lf\n", r);
        } else {
            printf("CSFNB!\n");
        }
    }
    return 0;
}
子任务 #1
Accepted
得分:100
测试点 #1
Accepted
得分:100
用时:3 ms
内存:264 KiB

输入文件(1.in

10
3 17
4 21
2 0
2 1000000000
1000000000 999999999
1000000000 1000000000
1000000000 999999998
154236
<37 bytes omitted>

答案文件(1.ans

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

系统信息

Exited with return code 0