QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#758331#9622. 有限小数zzfs#WA 148ms3604kbC++171.1kb2024-11-17 17:49:412024-11-17 17:49:42

Judging History

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

  • [2024-11-17 17:49:42]
  • 评测
  • 测评结果:WA
  • 用时:148ms
  • 内存:3604kb
  • [2024-11-17 17:49:41]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int int64_t

int64_t p2_arr[31];
int64_t p5_arr[14];

void init_pow()
{
    p2_arr[0] = 1;
    p5_arr[0] = 1;
    for (int i = 1; i < 31; i++)
    {
        p2_arr[i] = p2_arr[i - 1] * 2;
    }
    for (int i = 1; i < 14; i++)
    {
        p5_arr[i] = p5_arr[i - 1] * 5;
    }
    
}


void sol()
{
    int a, b;
    cin >> a >> b;
    // c, d
    set<pair<int, int>> ps;
    for (int p2 = 0; p2 < 31; p2++)
    {
        //cout << p2 << endl;
        for (int p5 = 0; p5 < 14; p5++)
        {
            __int128_t num = p2_arr[p2] * p5_arr[p5];
            if(num > 2e9) continue;
            __int128_t d = b * num;
            __int128_t c = b - a * num % b;
            c %= b;
            if(d > 1e9) continue;
            ps.insert(make_pair(c, d));
        }
        
    }
    auto [cc, dd] = *ps.begin();
    cout << cc << " " << dd << "\n";
    
}
int32_t main()
{
    init_pow();
    int T;
    cin >> T;
    while (T--)
    {
        sol();
    }
    
    
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4
1 2
2 3
3 7
19 79

output:

0 4
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 148ms
memory: 3588kb

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
10 600
3 560
1 231680000
23 3936
1 36096000
5 326
1 63360
0 4096
1 31232
0 1024
1 4880
1 10750
2 37000
1 11714560
1 331250
1 2944
1 31
1 6
1 289600000
1 455000
1 58880
1 51840
0 4
2 608
0 25600
1 415
1 19328000
1 765000000
1 181250
1 608
1 72192
12 99200
1 12000
3 347500
1 944
1 43600
6...

result:

wrong answer Jury found better answer than participant's 1 < 10 (Testcase 3)