QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#837119#9622. 有限小数propane#WA 128ms3816kbC++201.2kb2024-12-29 16:24:222024-12-29 16:24:22

Judging History

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

  • [2024-12-29 16:24:22]
  • 评测
  • 测评结果:WA
  • 用时:128ms
  • 内存:3816kb
  • [2024-12-29 16:24:22]
  • 提交

answer

#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    const LL lim = 1e12;

    vector<LL> cand;
    for(int i = 0; ; i++){
        LL t = 1LL << i;
        if (t > lim) break;
        for(int j = 0; ; j++){
            if (t > lim) break;
            cand.push_back(t);
            t *= 5;
        }
    }

    int T;
    cin >> T;
    while(T--){
        int a, b;
        cin >> a >> b;
        LL mul = 1;
        while(b % 2 == 0) b /= 2, mul *= 2;
        while(b % 5 == 0) b /= 5, mul *= 5;

        if (b == 1){
            cout << 0 << ' ' << 1 << '\n';
            continue;
        }
        a %= b;

        pair<LL, LL> ans{1e18, 1e18};
        for(auto t : cand){
            LL l = (1LL * a * t + b - 1) / b;
            LL nc = l * b - t * a;
            LL nd = b * t;
            LL g = gcd(nc, nd);
            ans = min(ans, pair(nc / g, nd / g));
        }
        cout << ans.first << ' ' << ans.second * mul << '\n';
    }

}

详细

Test #1:

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

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 128ms
memory: 3496kb

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 54272
1 60
1 350
1 231680000
23 3936
1 36096000
1 2608000000000
1 63360
0 1
1 31232
0 1
1 4880
1 10750
1 18500
1 11714560
1 331250
1 2944
1 31
1 6
1 289600000
1 455000
1 58880
1 51840
0 1
1 304
0 1
1 415
1 19328000
1 765000000
1 4640
1 608
1 72192
3 24800
1 192
1 3558400000
1 944
1 43600
1 15...

result:

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