QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#770358 | #9622. 有限小数 | k1nsom# | WA | 1ms | 3604kb | C++20 | 962b | 2024-11-21 21:33:02 | 2024-11-21 21:33:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int __int128
void solve()
{
int a, b;
long long xx;
cin >> xx;
a = xx;
cin >> xx;
b = xx;
const int up = 1e35;
pair<long long, long long> 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 <= 1e9)
ans = min(ans, {aa, bb});
}
}
auto [c, d] = ans;
cout << c << ' ' << d << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
long long T = 1;
cin >> T;
while (T--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3604kb
input:
4 1 2 2 3 3 7 19 79
output:
0 0 0 0 0 0 0 0
result:
wrong answer Integer 0 violates the range [1, 10^9]