QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#769751#9622. 有限小数333zhan#WA 254ms3728kbC++201.2kb2024-11-21 19:16:102024-11-21 19:16:10

Judging History

你现在查看的是最新测评结果

  • [2024-11-21 19:16:10]
  • 评测
  • 测评结果:WA
  • 用时:254ms
  • 内存:3728kb
  • [2024-11-21 19:16:10]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int inf = 1E9;

vector <int> f;
set <int> st;

void solve () {
    int a, b;
    cin >> a >> b;

    if (a == b || st.find (b) != st.end ()) {
        cout << 0 << " " << 1 << '\n';
        return;
    }

    int C = -1, D;
    for (auto x : f) {
        auto check = [&] (int t) {
            return a * x <= b * t;
        };
        int l = 1, r = inf;
        while (l < r) {
            int mid = (l + r) / 2;
            if (check (mid)) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        int c = l * b - a * x;
        int d = x * b;
        int gc = gcd (c, d);
        c /= gc;
        d /= gc;
        if (C == -1 || C > c) {
            C = c;
            D = d;
        }
    }

    cout << C << " " << D << '\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    for (int i = 1; i <= inf; i *= 2) {
        for (int j = i; j <= inf; j *= 5) {
            f.push_back (j);
            st.insert (j);
        }
    }

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3728kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 4375
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 254ms
memory: 3696kb

input:

10000
11 12
28 53
17 60
2 35
17 181
80 123
68 141
79 163
71 99
13 64
33 61
15 32
16 61
11 86
33 74
128 143
40 53
7 23
30 31
5 6
86 181
73 91
13 23
71 81
1 2
7 38
117 160
33 83
129 151
88 153
25 58
16 19
19 141
95 124
43 96
71 139
11 59
106 109
93 152
34 43
17 99
1 57
20 159
16 25
5 73
159 170
172 17...

output:

1 12
1 828125000
1 60
1 7
1 231680000
23 60058593750
1 2203125000
3 2086400000
1 63360
0 1
1 61000
0 1
1 59570312500
1 10750
1 18500
1 1117187500
1 331250
1 11230468750
1 31
1 6
1 289600000
1 455000
1 17968750000
1 1265625
0 1
1 1484375
0 1
1 415
1 235937500
1 765000000
1 181250
1 2968750
1 4406250
...

result:

wrong answer Integer 60058593750 violates the range [1, 10^9]