QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#770320 | #9622. 有限小数 | k1nsom# | WA | 207ms | 3676kb | C++20 | 1015b | 2024-11-21 21:27:19 | 2024-11-21 21:27:19 |
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;
int cs = 1;
while (b % 2 == 0)
b /= 2, cs *= 2;
while (b % 5 == 0)
b /= 5, cs *= 5;
const int up = 1e18;
pair<int, int> ans = {up, up};
for (int i = 1; b * i <= up; i *= 2)
{
for (int j = 1; b * i * j <= up; j *= 5)
{
int d = b * i * j;
if (d > up)
break;
int v = a * i * j;
int k = (v + b - 1) / b;
int aa = k * b - v, bb = d, gd = __gcd(aa, bb);
aa /= gd, bb /= gd;
if (bb * cs <= 1e9)
ans = min(ans, {aa, bb * cs});
}
}
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;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3676kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 207ms
memory: 3652kb
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 -9071744073709551616 1 350 1 231680000 23 3936 1 36096000 5 326 1 63360 0 64 1 31232 0 32 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 2 1 304 0 160 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 24800 1 -9223372036854775808 3 ...
result:
wrong answer Integer -9071744073709551616 violates the range [1, 10^9]