QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#740297#9622. 有限小数ZariaWA 21ms3660kbC++171.3kb2024-11-13 08:40:032024-11-13 08:40:05

Judging History

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

  • [2024-11-13 08:40:05]
  • 评测
  • 测评结果:WA
  • 用时:21ms
  • 内存:3660kb
  • [2024-11-13 08:40:03]
  • 提交

answer

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

#define ll long long
#define i128 __int128_t
#define PLL pair<ll,ll>

ll p2[50],p5[50],t;
PLL res;

PLL fun(PLL a,PLL b){
    if(a.first<b.first) return a;
    if(a.first==b.first&&a.second<b.second) return a;
    return b;
}

void init(){
    p2[0]=p5[0]=1;
    for(int i=1;i<=35;i++){
        p2[i]=p2[i-1]*2;
    }
    for(int i=1;i<=15;i++){
        p5[i]=p5[i-1]*5;
    }
}

void solve(){
    PLL res={1e9+10,1e9+10};
    ll a,b,b0,num2=0,num5=0;
    cin>>a>>b;
    
    b0=b;
    while(b0%2==0){
        b0=b0/2;
        num2++;
    }
    b0=b;
    while(b0%5==0){
        b0=b0/5;
        num5++;
    }

    b0=b;
    while(b0%2==0) b0=b0/2;
    while(b0%5==0) b0=b0/5;

    for(int i=num2;i<=30;i++){
        for(int j=num5;j<=13;j++){
            ll d=p2[i]*p5[j];
            if(d>1e9) continue;
            d=d*b0;
            if(d>1e9) continue;

            ll aa=a*p2[i-num2]*p5[j-num5];
            ll k=aa/b0;
            ll c=k*b0-aa;
            if(c<0) c+=b0;
            res=fun(res,{c,d});
        }
    }
    cout<<res.first<<' '<<res.second<<endl;
    return;
}

int main(){
    init();
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

详细

Test #1:

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

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: 21ms
memory: 3660kb

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
5 326
1 63360
0 64
1 31232
0 32
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 2
1 304
0 160
1 415
1 19328000
1 765000000
1 4640
1 608
1 72192
3 24800
1 192
3 347500
1 944
1 43600
1 1520
1 43000...

result:

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