QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#778839#9622. 有限小数Yoshinow2001#WA 96ms3544kbC++201.4kb2024-11-24 16:30:372024-11-24 16:30:37

Judging History

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

  • [2024-11-24 16:30:37]
  • 评测
  • 测评结果:WA
  • 用时:96ms
  • 内存:3544kb
  • [2024-11-24 16:30:37]
  • 提交

answer

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define endl '\n'
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
constexpr ll INF=std::numeric_limits<int>::max();
int main(){
    fastio;
    int tc;cin>>tc;
    while(tc--){
        long long a,b;
        cin>>a>>b;
        int p2=0,p5=0;
        while(b%2==0){
            b/=2;
            p2++;
        }
        while(b%5==0){
            b/=5;
            p5++;
        }
        pair<long long,long long> ans={INF,INF};
        for(int x=0,v2=1;x<=20;x++){
            for(int y=0,v5=1;y<=8;y++){
                long long fm=(long long)v2*v5;//1e12
                ll l=0,r=fm,ret=-1;
                while(l<=r){
                    long long mid=(l+r)>>1;
                    if((long long)mid*b>=(long long)fm*a){//mid/fm>=a/b
                        ret=mid;
                        r=mid-1;
                    }else l=mid+1;
                }
                if(ret!=-1){
                    //ret:1e12
                    long long c=(long long)ret*b-(long long)a*fm;
                    long long d=(long long)fm*b;
                    long long g=__gcd(c,d);
                    ans=min(ans,{c/g,d/g});
                }
                v5*=5;
            }
            v2*=2;
        }
        cout<<ans.first<<' '<<ans.second<<endl;
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3536kb

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: 96ms
memory: 3544kb

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:

2147483647 2147483647
1 54272
2147483647 2147483647
1 70
1 231680000
23 3936
1 36096000
3 2086400000
1 63360
2147483647 2147483647
1 31232
2147483647 2147483647
1 4880
1 5375
1 9250
1 11714560
1 331250
1 2944
1 31
2147483647 2147483647
1 289600000
1 455000
1 58880
1 51840
0 1
1 152
2147483647 214748...

result:

wrong answer Integer 2147483647 violates the range [0, 10^9]