QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#736451 | #9622. 有限小数 | xianggui | WA | 10ms | 3952kb | C++14 | 1.4kb | 2024-11-12 11:10:29 | 2024-11-12 11:10:30 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int exgcd(int a, int b, int &x, int &y) {
if (!b) {
x = 1, y = 0;
return a;
}
int d = exgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return d;
}
// bool getans(int cur2) {
// int x, y;
// exgcd()
// }
void solve() {
int a, b;
scanf("%lld%lld", &a, &b);
int cur = 1;
int ans = 1000000000, ans2 = 0;
// int
auto getans = [&b, &a](int cur2) -> int {
int x, y;
// cerr << b << ' ' << 1 << '\n';
exgcd(b, 1, x, y);
y = -y;
// cerr << x << ' ' << y << '\n';
x *= cur2 * a;
y *= cur2 * a;
y %= b;
y += b;
y %= b;
return y;
};
for (int i = 0; i <= 20; ++i) {
// int cu
int cur2 = cur;
for (int j = 0; j <= 20; ++j) {
int tmp = getans(cur2);
if (tmp < ans) {
ans = tmp;
ans2 = cur2 * b;
}
if (cur2 > 1000000000 / (5 * b)) break;
cur2 *= 5;
}
if (cur > 1000000000 / (2 * b)) break;
cur *= 2;
}
printf("%lld %lld\n", ans, ans2);
}
signed main() {
int T;
scanf("%lld", &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: 3952kb
input:
4 1 2 2 3 3 7 19 79
output:
0 4 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 10ms
memory: 3900kb
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 828125000 10 600 3 560 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 4096 1 61000 0 1024 1 4880 1 10750 2 37000 1 11714560 1 331250 1 898437500 1 31 1 6 1 289600000 1 455000 1 115000000 1 1265625 0 4 2 59375000 0 25600 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 12 99200 ...
result:
wrong answer Jury found better answer than participant's 1 < 10 (Testcase 3)