QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#751976#9622. 有限小数LittleXi#WA 4ms3676kbC++201.0kb2024-11-15 21:27:572024-11-15 21:27:57

Judging History

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

  • [2024-11-15 21:27:57]
  • 评测
  • 测评结果:WA
  • 用时:4ms
  • 内存:3676kb
  • [2024-11-15 21:27:57]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;

#define ll long long

vector<ll> p2 , p5;

void init(){
    p2.push_back(1);
    p5.push_back(1);
    for(ll i = 0;i<40;i++){
        p2.push_back(p2.back() * 2);
        p5.push_back(p5.back() * 5);
    }
}

const ll inf = 1000000000;

void solve(){   
    ll a,b;cin>>a>>b;
    ll p0 = 0 , q0 = 0;
    ll b2 = b;
    while(b2%2==0) p0 ++ ,b2>>=1;
    while(b2%5==0) q0 ++ ,b2/=5;
    if(b2==1){
        cout<<0<<" "<<1<<endl;return;
    }
    ll ac = inf , ad =0;
    for(ll p = p0;;p++){
        if(p2[p] > inf) break;
        for(ll q= q0;;q++){
            if(1ll * p2[p] * p5[q] * b2 > inf) break;
            ll a_ = p2[p - p0] * p5[q-q0] * a ;
            ll c = (a_ / b2 + 1) * b2 - a_;
            if(c < ac ){
                ac = c;ad = p2[p] * p5[q] * b2;
            }
        }
    }
    cout<<ac<<" "<<ad<<endl;
}
signed main(){
    cin.tie(0);cout.tie(0);
    ios::sync_with_stdio(0);
    init();
    ll t;cin>>t;while(t--)
    solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 4ms
memory: 3676kb

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 960937500
1 36096000
5 326
1 63360
0 1
1 61000
0 1
1 4880
1 10750
1 18500
1 11714560
1 331250
1 898437500
1 31
1 6
1 289600000
1 455000
1 115000000
1 1265625
0 1
1 29687500
0 1
1 415
1 235937500
1 765000000
1 181250
1 2968750
1 4406250
3 24800
1 480
3 34...

result:

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