QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #736320 | #9622. 有限小数 | ucup-team4352# | WA | 8ms | 3692kb | C++23 | 717b | 2024-11-12 09:52:53 | 2024-11-12 09:52:55 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
void solve(){
ll a,b;
cin>>a>>b;
ll c=1e18,d=0;
ll now2=1,tmp=1;
while(b%2==0)b>>=1,tmp<<=1;
while(b%5==0)b/=5,tmp*=5;
if(b==1){
cout<<"0 1\n";
return;
}
while(1){
ll now5=1;
while(1){
ll t=a*now2*now5;
ll res=t/b+1;
if(res*b-t<c&&b*now2*now5*tmp<=1e9){
c=res*b-t;
d=b*now2*now5;
// cout<<c<<" "<<d<<" "<<res<<"\n";
}
now5*=5;
if(now5*now2*tmp>1e9)break;
}
now2*=2;
if(now2*tmp>1e9)break;
}
cout<<c<<" "<<d<<"\n";
}
int main(){
ios::sync_with_stdio(0),cin.tie(0);
int t=1;
cin>>t;
while(t--)solve();
return 0;
}
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
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: 8ms
memory: 3692kb
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 3 1 828125000 1 3 1 21875 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 1 1 61000 0 1 1 4880 1 5375 1 9250 1 11714560 1 331250 1 898437500 1 31 1 3 1 289600000 1 455000 1 115000000 1 1265625 0 1 1 14843750 0 1 1 415 1 235937500 1 765000000 1 90625 1 2968750 1 4406250 3 6200 1 15 3 347500 1 9...
result:
wrong answer The result is not terminating.(Testcase 3)