QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#738369 | #9622. 有限小数 | ucup-team4975# | WA | 679ms | 3816kb | C++14 | 1.1kb | 2024-11-12 18:52:19 | 2024-11-12 18:52:21 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define el '\n'
using namespace std;
using ll = __int128_t;
const ll inf = 2e18;
__int128_t gcd(__int128_t x, __int128_t y) {
return y?gcd(y,x%y):x;
}
void solve() {
int _a,_b;
cin >> _a >> _b;
ll a = _a, b = _b;
long long ans = b - a, ansd = b;
for (ll i = 1; i <= 2 * inf; i *= 2) {
for (ll j = 1; j <= 2 * inf; j*= 5) {
__int128_t res = i * j;
__int128_t A = a * res;
if (a * res % b == 0) {
cout << "0 " << _b << el;
return;
}
__int128_t y = A / b + 1;
__int128_t c = b * y - A;
__int128_t d = b * res;
__int128_t g = gcd(c, d);
c /= g, d/= g;
if (d > 1e9)
continue;
if (c < ans) {
ans = c, ansd = d;
}
}
}
cout << ans << " " << ansd << el;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3608kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 679ms
memory: 3816kb
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 1 60 1 7 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 64 1 61000 0 32 1 4880 1 10750 1 18500 1 11714560 1 331250 1 898437500 1 31 1 6 1 289600000 1 455000 1 115000000 1 1265625 0 2 1 1484375 0 160 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 1 -34587645138205409...
result:
wrong answer Integer -3458764513820540928 violates the range [1, 10^9]