QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#743272 | #9622. 有限小数 | mitthu | WA | 41ms | 3944kb | C++17 | 1.1kb | 2024-11-13 18:46:47 | 2024-11-13 18:46:52 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
const int lim = 1e9;
using namespace std;
ll exgcd(ll a, ll b, ll &x, ll &y){
if (b == 0){
x = 1; y = 0;
return a;
}
ll d = exgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
ll gcd(ll x, ll y){
if (y == 0) return x;
return gcd(y, x % y);
}
int T, a, b, w;
void solve(){
scanf("%d %d", &a, &b);
w = b;
while(w % 2 == 0)w /= 2;
while(w % 5 ==0) w /= 5;
ll x, y, ans = lim, ans1 = lim;
ll now = w;
for (; now <= lim; now *= 2){
ll d = now;
for (; d <= lim; d *=5){
ll A = b, B = -1LL * w * w, C = - 1LL * a * d;
ll g = gcd(A, B);
if (C % g != 0) continue;
A /= g, B /= g, C /= g;
g = exgcd(A, B, x, y);
x *= C; y *=C;
if (x % B == 0) x = 0;
else x = (x % B - B);
if (x < ans){
ans = x; ans1 = d;
}
}
}
printf("%lld %lld\n", ans, ans1);
}
int main(){
scanf("%d", &T);
for (; T; T--)solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3796kb
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: 41ms
memory: 3944kb
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 -2 15 1 7 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 1 1 61000 0 1 1 4880 -42 10750 -36 18500 1 11714560 1 331250 1 898437500 1 31 -2 15 1 289600000 1 455000 1 115000000 1 1265625 0 1 -18 1484375 0 1 1 415 1 235937500 1 765000000 -28 181250 1 2968750 1 4406250 3 775 -2 3 3 3...
result:
wrong answer Integer -2 violates the range [0, 10^9]