QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#763092#9622. 有限小数superguymj#WA 7ms3716kbC++201.3kb2024-11-19 18:09:262024-11-19 18:09:27

Judging History

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

  • [2024-11-19 18:09:27]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:3716kb
  • [2024-11-19 18:09:26]
  • 提交

answer

#include <bits/stdc++.h>
#define rep(i,x,y) for (int i = x; i <= y; i++)
#define repd(i,x,y) for (int i = x; i >= y; i--)
#define mid ((l + r) >> 1)
#define lch (rt << 1)
#define rch (rt << 1 | 1)

using namespace std;

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

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

    int p = b;
    while (p % 2 == 0) {
        p /= 2;
    }
    while (p % 5 == 0) {
        p /= 5;
    }
    a = (-a % p + p) % p;
    int c = a, d = b;

    constexpr int inf = 1E9;

    i64 A = a, B = b;
    rep(i,0,50) {
        A = A * 2 % p;
        B = B * 2;

        if (B > inf) {
            break;
        }
        if (A < c) {
            c = A;
            d = B;
        }

        i64 _A = A, _B = B;
        rep(j,0,50) {
            _A = _A * 5 % p;
            _B = _B * 5;
            if (_B > inf) {
                break;
            }
            if (_A < c) {
                c = _A;
                d = _B;
            }
        }
    }

    cout << c << ' ' << d << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T;
    cin >> T;

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

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3680kb

input:

4
1 2
2 3
3 7
19 79

output:

0 2
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 7ms
memory: 3716kb

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 350
1 231680000
23 960937500
1 36096000
5 326
1 63360
0 64
1 61000
0 32
1 4880
1 43000000
1 18500
1 11714560
1 331250
1 898437500
1 31
1 6
1 289600000
1 455000
1 115000000
1 51840
0 2
1 29687500
0 160
1 103750
1 235937500
1 765000000
1 4640
1 2968750
1 4406250
3 24800
1 192
3...

result:

wrong answer Jury found better answer than participant's 1 < 2 (Testcase 86)