QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#742976#9622. 有限小数QOJericWA 40ms3688kbC++171.1kb2024-11-13 17:47:052024-11-13 17:47:11

Judging History

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

  • [2024-11-13 17:47:11]
  • 评测
  • 测评结果:WA
  • 用时:40ms
  • 内存:3688kb
  • [2024-11-13 17:47:05]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long

using namespace std;
int n;
vector<int>i2j5;
void init(){
    for(ll i=1;i<=1e9;i*=2){
        for(ll j=i;j<=1e9;j*=5){
            i2j5.push_back(j);
        }
    }
    sort(i2j5.begin(),i2j5.end());
    //cerr<<i2j5.size()<<endl;
}
void f(ll b,ll &_b,ll &fb){
    _b=1;
    while(b%2==0){
        b/=2;
        _b*=2;
    }
    while(b%5==0){
        b/=5;
        _b*=5;
    }
    fb = b;
}

int main(){
    //cout<<(int)5e9<<endl;
    init();
    int _;cin>>_;
    while(_--){
        ll a,b,_b,fb;//fb*_b=b
        cin >> a >>b;
        ll c=b-a,d=b;
        f(b,_b,fb);

        if(fb==1){
            cout<<"0 1\n";
            continue;
        }
        
        for(ll i:i2j5){
            ll ai=a*i;
            ll cur =(ai/fb+1)*fb;//cur=p*fb
            while((cur-ai)%_b){
                cur+=fb;
            }
            ll cur_c = (cur-ai)/_b;
            if (cur_c<c){
                c= cur_c;
                d=fb*i;
            }
        }

        cout<<c<<" "<<d<<'\n';

    }
}

詳細信息

Test #1:

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

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 40ms
memory: 3592kb

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 6
1 7
1 231680000
23 3936
1 36096000
3 2086400000
1 63360
0 1
1 31232
0 1
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 1
1 304
0 1
1 415
1 19328000
1 765000000
1 4640
1 608
1 72192
3 775
1 3
1 3558400000
1 944
1 43600
1 76
1 430000
...

result:

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