QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#770484 | #9622. 有限小数 | RongYu# | WA | 64ms | 3600kb | C++17 | 917b | 2024-11-21 22:03:46 | 2024-11-21 22:03:46 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
void solve() {
int a, b; cin >> a >> b;
const int up = 1e9;
pair<int, int> ans = {up, up};
for(int i = 1; i <= up; i *= 2) {
for(int j = 1; i * j <= up; j *= 5) {
int d = b * i * j;
if(d > up) break;
// c = kb - a * 2 ^ i * 5 ^ j
// k >= (a * i * j + b - 1) / b
int v = a * i * j;
int k = (v + b - 1) / b;
while(k % 2 == 0 || k % 5 == 0) k++;
int c = k * b - v, g = gcd(c, d);
c /= g, d /= g;
ans = min(ans, {c, d});
}
}
auto [c, d] = ans;
cout << c << ' ' << d << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 64ms
memory: 3600kb
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 15 1 7 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 1 16 1 4880 1 44032 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 103750 1 19328000 1 765000000 1 4640 1 608 1 72192 3 775 1 12 3 347500 1 944 1 43600 1 1520 1 430000 1 6...
result:
wrong answer Jury found better answer than participant's 0 < 1 (Testcase 12)