QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#747792#9622. 有限小数guodong#WA 33ms3940kbC++171.2kb2024-11-14 18:16:482024-11-14 18:16:49

Judging History

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

  • [2024-11-14 18:16:49]
  • 评测
  • 测评结果:WA
  • 用时:33ms
  • 内存:3940kb
  • [2024-11-14 18:16:48]
  • 提交

answer

#include <bits/stdc++.h>
#define  int long long 
#define rep(x, l, r) for(int x = l; x <= r; x++)
using namespace std;
typedef long long ll;
int pw2[105], pw5[105];

const int INF = 0x3f3f3f3f;
const ll XX = 1ll << 45;

signed main(){
    int t;
    scanf("%lld", &t);
    while(t--){
        int a, b, res = 1;
        scanf("%lld%lld", &a, &b);
        while(b % 2 == 0){
            res = res * 2;
            b /= 2;
        }
        while(b % 5 == 0){
            res = res * 5;
            b /= 5;
        }
        // printf(" %lld %lld\n", a, b);
        int ans = INF;
        ll s = 1, ans2;
        rep(i, 0, 60){
            ll ss = s;
            rep(j, 0, 60){
                // printf("%lld %lld : %lld %lld %lld \n", i, j, s, ss, (b - (ss % b * a) % b) % b );
                if((b - (ss % b * a) % b) % b < ans){
                    ans = (b - (ss % b * a) % b) % b;
                    ans2 = res * ss * b;
                }
                // ans = max((ll)ans, ss % b);
                if(res * b * ss * 5 > XX) break;
                ss = ss * 5;
            }
            if(res * b * s * 2 > XX) break;
            s = s * 2;
        }
        printf("%lld %lld\n", ans, ans2);
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4
1 2
2 3
3 7
19 79

output:

0 2
1 3
1 4375
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 33ms
memory: 3940kb

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 109375
1 231680000
23 3753662109375
1 2203125000
1 2608000000000
1 63360
0 64
1 744628906250
0 32
1 59570312500
1 10750
1 451660156250
1 1117187500
1 331250
1 140380859375
1 31
1 6
1 289600000
1 455000
1 35095214843750
1 1265625
0 2
1 29687500
0 160
1 415
1 235937500
1 186767...

result:

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