QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#761949 | #9622. 有限小数 | abbcc_1 | WA | 21ms | 3716kb | C++20 | 1.2kb | 2024-11-19 11:50:21 | 2024-11-19 11:50:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
i64 d = a;
if (!b) {
x = 1, y = 0;
} else {
d = extgcd(b, a % b, y, x);
y -= x * (a / b);
}
return d;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int kase;
cin >> kase;
while (kase--) {
i64 a, b;
cin >> a >> b;
i64 w = b;
while (w % 2 == 0) {
w /= 2;
}
while (w % 5 == 0) {
w /= 5;
}
if (w == 1) {
cout << 0 << ' ' << 1 << '\n';
continue;
}
pair<i64, i64> res = {1e9, 1e9};
for (i64 j = 1; j <= 1'000'000'000; j *= 2) {
i64 cur = j;
while (cur * w <= 1'000'000'000) {
// cerr << "cur = " << cur << '\n';
i64 x, y;
extgcd(b / w, -w, x, y);
x *= -a * cur;
x = (x % w + w) % w;
res = min(res, pair{x, cur * w});
cur *= 5;
}
}
cout << res.first << ' ' << res.second << '\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
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: 21ms
memory: 3716kb
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 3 1 7 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 0 1 1 4880 1 344 1 118400 1 11714560 1 331250 1 2944 1 31 1 3 1 289600000 1 455000 1 58880 1 51840 0 1 1 4750 0 1 1 415 1 19328000 1 765000000 1 29000 1 608 1 72192 3 775 1 6 3 347500 1 944 1 43600 1 23750 1 430000 1 6336 1...
result:
wrong answer The result is not terminating.(Testcase 3)