QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #737270 | #9622. 有限小数 | 3071752286 | WA | 159ms | 3892kb | C++14 | 1.5kb | 2024-11-12 15:16:28 | 2024-11-12 15:16:29 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
unsigned long long maxf=1e15;
unsigned long long a,b,c,d,e,f;
unsigned long long qu(unsigned long long x,unsigned long long y)
{
unsigned long long res=1;
while(y!=0)
{
if(y%2==1) res=res*x;
y/=2;
x=x*x;
}
return res;
}
unsigned long long twocut(unsigned long long l,unsigned long long r,unsigned long long x)
{
if(l*b>x*a) return l;
else return r;
unsigned long long mid=(l+r)/2;
if(b*mid>x*a) return twocut(l,mid,x);
else return twocut(mid,r,x);
}
unsigned long long gcd1(unsigned long long x,unsigned long long y)
{
if(x<y) swap(x,y);
unsigned long long res;
while(y!=0)
{
res=x;
x=y;
y=res%y;
}
return x;
}
int main()
{
unsigned long long T;
cin>>T;
while(T--)
{
unsigned long long minc=1e16,mind;
cin>>a>>b;
unsigned long long bb=b;
while(bb%5==0) bb/=5;
while(bb%2==0) bb/=2;
if(bb==1)
{
cout<<0<<" "<<1<<endl;
continue;
}
for(unsigned long long i=0;i<=(unsigned long long)(log(maxf)/log(5));i++)
{
for(unsigned long long j=0;j<=(unsigned long long)(log2(maxf)/log(2))&&qu(2,i)*qu(5,j)<=maxf;j++)
{
f=qu(2,i)*qu(5,j);
e=twocut(1,f,f);
d=b*f;
if(b*e<=f*a) break;
unsigned long long gcdd=gcd1(b*e-f*a,d);
c=(b*e-f*a)/gcdd;
d=d/gcdd;
if(minc>c)
{
minc=c;
mind=d;
}
}
}
cout<<minc<<" "<<mind<<endl;
}
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3892kb
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: 159ms
memory: 3852kb
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 13 60 1 7 11 1810 43 123 5 282 5 326 28 99 0 1 28 61 0 1 29 122 16 43 2 37 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 3 190 0 1 17 166 22 151 65 153 2 29 3 19 46 705 29 124 5 96 68 139 4 295 3 109 59 152 9 43 14 495 7 2850 59 795 0 1 23 730 11 170 7 179 3 65 16 85 7 172 27 130...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)