QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741604 | #9622. 有限小数 | ucup-team4479# | WA | 4ms | 3600kb | C++23 | 1000b | 2024-11-13 14:46:05 | 2024-11-13 14:46:06 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector <int> A;
int P(int x) {
int res = x;
while (res % 2 == 0) res /= 2;
while (res % 5 == 0) res /= 5;
return res;
}
void solve() {
ll a, b;
cin >> a >> b;
ll Pb = P(b), t = b / Pb;
if (Pb == 1) {
cout << "0 1" << endl;
return;
}
ll inf = 1e9, d = b, c = b - a;
for (int k : A) {
if (k * Pb > inf) break;
int ret = b - (a * k) % b;
if (ret % t) continue;
if (ret < c) {
c = ret;
d = k * Pb;
}
}
cout << c << " " << d << endl;
}
int main() {
cin.tie(nullptr) -> ios::sync_with_stdio(false);
cout.tie(0);
for (ll x = 1; x <= 1e9; x *= 2)
for (ll y = x; y <= 1e9; y *= 5) {
A.push_back(y);
}
sort(A.begin(), A.end());
int T;
cin >> T;
while (T--) solve();
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3600kb
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: 4ms
memory: 3544kb
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 20 60 5 350 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 0 1 1 4880 2 10750 2 18500 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 2 304 0 1 1 415 1 19328000 1 765000000 2 4640 1 608 1 72192 12 24800 32 192 3 347500 1 944 1 43600 8 1520 1 430000...
result:
wrong answer The result is not terminating.(Testcase 3)