QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741892 | #9622. 有限小数 | ucup-team073# | WA | 19ms | 3752kb | C++23 | 1.1kb | 2024-11-13 15:26:01 | 2024-11-13 15:26:40 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf=1e9;
int exgcd(int a,int b,int &x,int &y){
if(!b){
x=1,y=0;
return a;
}
int g=exgcd(b,a%b,x,y);
int t=x;
x=y;
y=t-a/b*y;
return g;
}
int a,b,c,d,X,yy;
void chk(int Y){
int u,v,w;
w=a*Y;
u=b;
v=-X;
int lambda,_c;
int g=exgcd(u,v,lambda,_c);
if(w%g!=0)return;
int delta=w/g,cyc=u/g;
_c=_c*delta;
cyc=abs(cyc);
_c=(_c%cyc+cyc)%cyc;
// c=min(c,_c*delta);
if(c>_c){
c=_c;
yy=Y;
}
return;
}
void solve(){
cin>>a>>b;
c=b-a;
yy=1;
X=1;
while(b%2==0){
X*=2;
b/=2;
}
while(b%5==0){
X*=5;
b/=5;
}
if(b==1){
puts("0 1");
return;
}
d=b;
chk(2);
for(int A=1;A*b<=inf;A*=2){
for(int B=1;A*B*b<=inf;B*=5){
chk(A*B);
}
}
printf("%lld %lld\n",c,b*yy);
return;
}
signed main(){
int t;cin>>t;
while(t--)solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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: 19ms
memory: 3748kb
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 6 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 3 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 1...
result:
wrong answer The result is not terminating.(Testcase 20)