QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738424 | #9622. 有限小数 | Wolam# | WA | 674ms | 184200kb | C++20 | 1.8kb | 2024-11-12 19:01:53 | 2024-11-12 19:01:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int lim=1e9;
int a,b,c,d,x,y;
vector<int> fac[1000005];
void exgcd(int u,int v,int &x,int &y)
{
if(!v)
{
x=1;y=0;
return;
}
exgcd(v,u%v,y,x);
y-=u/v*x;
}
void sol()
{
cin>>a>>b;
c=lim+1;d=lim+1;
x=1;
while(b%2==0)
{
x*=2;
b/=2;
}
while(b%5==0)
{
x*=5;
b/=5;
}
y=b;
b=x*y;
if(y==1)
{
cout<<"0 1\n";
return;
}
for(int i=1;i*b<=lim;i*=2)
{
for(int j=1;i*j*b<=lim;j*=5)
{
int now=i*j*b;
for(auto it:fac[y])
{
if(it==1)continue;
int u=now/(it*i*j);
int v=y;
int w=-i*j*a;
int X,Y;
int g=gcd(u,v);
if(w%g)continue;
exgcd(u,v,X,Y);
u/=g;v/=g;w/=g;
X=X*w;
Y=Y*w;
int k=Y%u;
if(k>0)k-=u;
int nc=X-(k-Y)/u*v;
// if(i==1&&j==1)
// cerr<<u<<" "<<v<<" "<<w<<" "<<X<<" "<<Y<<" "<<k<<" "<<nc<<endl;
if(nc<0)
nc=nc%v+v;
if(nc<c)
{
//cerr<<i<<" "<<j<<" "<<it<<endl;
c=nc;
d=it*i*j;
}
}
//cerr<<i<<" "<<j<<endl;
}
}
cout<<c<<" "<<d<<'\n';
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
for(int i=1;i<=1000000;i++)
{
for(int j=i;j<=1000000;j+=i)
{
fac[j].push_back(i);
}
}
int t=1;
cin>>t;
while(t--)
sol();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 621ms
memory: 184196kb
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: 674ms
memory: 184200kb
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 15 1 7 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 1 1 61000 0 1 1 4880 1 10750 1 18500 1 11714560 1 331250 1 898437500 1 31 1 15 1 289600000 1 455000 1 115000000 1 1265625 0 1 1 1484375 0 1 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 775 1 3 3 347500 1 944...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 597)