QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #739872 | #9622. 有限小数 | Your-Sun | WA | 2ms | 3656kb | C++20 | 699b | 2024-11-12 23:36:16 | 2024-11-12 23:36:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
vector<ll> p2(40), p5(40);
void solve()
{
ll a,b;
cin>>a>>b;
if(b==1 || b==2 || b==5)
{
cout<<"0 1\n";
return;
}
ll c=1e9,d;
ll i,j,k;
for(i=0;a*p2[i]<=b;i++)
{
for(j=0;a*p2[i]*p5[j]<=b;j++)
{
if(c>b-a*p2[i]*p5[j] && b*p2[i]*p5[j]<=1e9)
{
c=b-a*p2[i]*p5[j];
d=b*p2[i]*p5[j];
}
}
}
cout<<c<<' '<<d<<endl;
}
void ini()
{
ll i,j,k;
p2[0]=p5[0]=1;
for(i=1;i<40;i++)
p2[i]=p2[i-1]*2LL,
p5[i]=p5[i-1]*5LL;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
ini();
int 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: 3592kb
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: 2ms
memory: 3656kb
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 25 53 26 120 3 560 11 1810 43 123 5 282 5 326 28 99 12 256 28 61 2 64 29 122 31 430 8 148 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 3 190 43 160 17 166 22 151 65 153 8 116 3 19 46 705 29 124 10 192 68 139 4 295 3 109 59 152 9 43 14 495 7 2850 59 795 9 25 23 730 11 170 7 179 3 65 64...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)