QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746439 | #9622. 有限小数 | IllusionaryDominance# | RE | 0ms | 3836kb | C++20 | 933b | 2024-11-14 14:38:53 | 2024-11-14 14:38:53 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
ll d = exgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
}
int main() {
int T;
scanf("%d", &T);
while (T --) {
ll a, b;
scanf("%lld%lld", &a, &b);
ll x = 1;
while (~b & 1) {
b >>= 1;
x <<= 1;
}
while (b % 5 == 0) {
b /= 5;
x *= 5;
}
ll y, c;
ll d = exgcd(a, x, y, c), k = b / __gcd(b, d);
if (c < 0) {
c += a;
y -= x;
}
c *= k; y *= k;
k = c / a;
c -= a * k;
y += x * k;
assert(c >= 0 && y >= 0);
printf("%lld %lld\n", c, y * b);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3836kb
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
Runtime Error
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...