QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#776589 | #9622. 有限小数 | ucup-team3548# | WA | 6ms | 3636kb | C++20 | 900b | 2024-11-23 19:34:17 | 2024-11-23 19:34:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
ll a, b; cin >> a >> b;
ll bb = b;
while (bb % 2 == 0) bb /= 2;
while (bb % 5 == 0) bb /= 5;
if (a % bb == 0) {
cout << "0 1\n";
return;
}
ll ansc = INT_MAX, d = 0;
for (ll x2 = 1; x2 * b <= 1e9; x2 *= 2) {
for (ll x = x2; x * b <= 1e9; x *= 5) {
ll xa = x * a;
ll k = (xa / bb) + 1;
ll c = k * bb - xa;
if (c < ansc) {
ansc = c;
d = x * b;
} else if (c == ansc) {
d = min(d, x * b);
}
}
}
cout << ansc << " " << d << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int T; cin >> T;
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 6ms
memory: 3636kb
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 350 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 24800 1 192 3 347500 1 944 1 43600 1 1520 1 430000 1 ...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)