QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#772725 | #9622. 有限小数 | KeeperHihi | WA | 253ms | 3716kb | C++23 | 980b | 2024-11-22 21:24:28 | 2024-11-22 21:24:29 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int i64
const int inf = 1e17;
void solve() {
int a, b;
cin >> a >> b;
int k = b;
while (k % 2 == 0) k /= 2;
while (k % 5 == 0) k /= 5;
if (k == 1) {
cout << "0 1\n";
return;
}
pair<int, int> ans = {inf, inf};
for (int i = 1; i * k <= inf; i *= 2) {
for (int j = 1; j * i * k <= inf; j *= 5) {
int v = i * j * a;
int c = k - v % k;
int d = b * i * j;
int g = gcd(c, d);
c /= g;
d /= g;
if (d <= 1e9) {
ans = min(ans, {c, d});
}
}
}
cout << ans.first << ' ' << ans.second << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3716kb
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: 0
Accepted
time: 214ms
memory: 3688kb
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 12 1 54272 1 60 1 7 1 231680000 23 3936 1 36096000 5 326 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 48 3 347500 1 944 1 43600 1 76 1 430000 1 6336 1 ...
result:
ok 10000 case(s)
Test #3:
score: -100
Wrong Answer
time: 253ms
memory: 3672kb
input:
10000 649 915 163 504 53 235 130 131 109 475 214 757 719 788 479 975 515 811 367 972 69 221 21 44 53 157 77 398 227 332 38 87 145 976 396 403 203 381 675 838 157 309 827 962 17 56 455 654 377 809 605 908 907 929 631 978 286 621 289 462 425 428 139 144 259 368 623 642 767 773 32 281 235 624 88 871 39...
output:
1 11712 1 630 1 192512 1 131 1 95 9 19379200 1 15760 7 9750 33 129760000 1 199065600 1 3536 1 44 2 98125 9 31840 1 66400 1 1392 1 9994240 4 31484375 1 243840 9 838000 1 98880000 3 4925440 1 14 1 10464000 17 2071040 1 2270000 4 2903125 7 1222500 31 79488 17 288750 1 107000 1 288 1 115 1 64200000 6 77...
result:
wrong answer Integer -6727994073709551616 violates the range [1, 10^9]