QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#813894 | #9622. 有限小数 | steven144 | WA | 14ms | 3948kb | C++14 | 1.1kb | 2024-12-14 13:25:52 | 2024-12-14 13:25:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define mk make_pair
#define fi first
#define se second
#define pb emplace_back
#define inf 0x3f3f3f3f3f3f3f3fll
const int maxn=1e9;
int rd()
{
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-') f=-f;
c=getchar();
}
while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c&15),c=getchar();
return f*x;
}
int x,y;
void exgcd(int a,int b)
{
if(!b)
{
x=1,y=0;
}
else
{
exgcd(b,a%b);
int t=x;
x=y;
y=t-a/b*y;
}
}
void chkmin(int &a,int b){a=a<b?a:b;}
void chkmax(int &a,int b){a=a>b?a:b;}
void work()
{
int a=rd(),b=rd(),c=maxn,d=maxn;
int bb=b;
while(bb%2==0) bb>>=1;
while(bb%5==0) bb/=5;
if(bb==1)
{
puts("0 1");
return ;
}
int k=b/bb;
exgcd(k,bb);
int invk=(x%bb+bb)%bb;
// cerr<<invk<<endl;
for(int p2=1;p2<=maxn;p2<<=1)
{
for(int p5=1;p2*p5<=maxn;p5*=5)
{
int dd=bb*p2*p5;
int cc=((-a*p2*p5*invk)%bb+bb)%bb;
if(cc<c||(cc==c&&dd<d)) c=cc,d=dd;
}
}
printf("%lld %lld\n",c,d);
}
signed main()
{
int T=rd();
while(T--) work();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3948kb
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: 14ms
memory: 3804kb
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 54272 1 6 1 7 1 231680000 23 3936 1 36096000 3 2086400000 1 63360 0 1 1 31232 0 1 1 4880 1 10750 1 18500 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 1 304 0 1 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 775 1 3 1 3558400000 1 944 1 43600 1 76 1 430000 1...
result:
wrong answer Integer 2086400000 violates the range [1, 10^9]