QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#743279 | #9622. 有限小数 | Yehhhh | WA | 7ms | 3632kb | C++17 | 1.3kb | 2024-11-13 18:49:15 | 2024-11-13 18:49:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
vector<int> d;
void Init() {
int pre = 1;
for (int i = 0; i < 20; i++) {
int pree = pre;
for (int j = 0; j < 9; j++) {
if (pree > 1e6) {
break;
}
d.push_back(pree);
pree *= 5;
}
pre *= 2;
}
sort(d.begin(), d.end());
}
int f(int x) {
while (x % 2 == 0) {
x /= 2;
}
while (x % 5 == 0) {
x /= 5;
}
return x;
}
void solve() {
int a, b;
cin >> a >> b;
int fb = f(b);
if (fb == 1) {
cout << "0 1\n";
return;
}
int ans = b - a;
int ansd = b;
for (auto x : d) {
if (1LL * x * fb > 1LL * 1e9) {
break;
}
int k = floor(1.0 * 1LL * a * x / 1.0 / fb) + 1;
for (int i = k; i <= b / fb; i++) {
double c = 1.0 * (i * fb - a * x) / (b / fb);
if (c == (int)c && c < ans && c > 0) {
ans = c;
ansd = x * fb;
}
}
}
cout << ans << " " << ansd << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
Init();
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 7ms
memory: 3580kb
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 25 53 1 6 1 7 11 1810 43 123 5 282 5 326 28 99 0 1 28 61 0 1 29 122 16 43 2 37 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 5 76 0 1 17 166 22 151 65 153 2 29 3 19 46 705 29 124 1 3 68 139 4 295 3 109 5 19 9 43 14 495 7 2850 59 795 0 1 23 730 11 170 7 179 3 65 3 34 7 172 27 130 61 274...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)