QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#741641#9622. 有限小数chatoyane#WA 174ms3704kbC++201.2kb2024-11-13 14:52:232024-11-13 14:52:23

Judging History

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

  • [2024-11-13 14:52:23]
  • 评测
  • 测评结果:WA
  • 用时:174ms
  • 内存:3704kb
  • [2024-11-13 14:52:23]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using db = double;
#define endl '\n'

const LL inf = 1e16;

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

    auto check = [&](int x) -> bool
    {
        while (x % 2 == 0)
            x /= 2;
        while (x % 5 == 0)
            x /= 5;
        return (x == 1);
    };

    if (check(b))
    {
        cout << "0 1" << endl;
        return;
    }

    LL c1 = b - a;
    LL d = b;
    LL pw2 = 1;
    LL ans1 = inf;
    LL ans2 = -1;
    for (int k1 = 0; pw2 * d <= inf; ++k1)
    {
        LL pw5 = 1;
        for (int k2 = 0; pw2 * pw5 * d <= inf; ++k2)
        {
            LL c2 = (c1 * pw2 * pw5) % d;
            LL d2 = d * pw2 * pw5;
            LL g = gcd(c2, d2);
            c2 /= g, d2 /= g;
            if (c2 < ans1 && d2 <= 1e9)
                ans1 = c2, ans2 = d * pw2 * pw5;
            pw5 *= 5;
        }
        pw2 *= 2;
    }
    cout << ans1 << " " << ans2 << endl;
    assert(ans2 != -1);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    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: 3704kb

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: 174ms
memory: 3568kb

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 600
1 175
1 231680000
23 960937500
1 36096000
5 326
1 63360
0 1
1 61000
0 1
1 4880
1 10750
1 37000
1 11714560
1 331250
1 898437500
1 31
1 6
1 289600000
1 455000
1 115000000
1 1265625
0 1
1 5937500
0 1
1 415
1 235937500
1 765000000
1 181250
1 2968750
1 4406250
3 12400
1 12000
3 347...

result:

wrong answer The result is not terminating.(Testcase 4)