QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#737156 | #9622. 有限小数 | kjhhjki# | WA | 11ms | 3672kb | C++20 | 1.1kb | 2024-11-12 14:50:23 | 2024-11-12 14:50:23 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
using f64 = long double;
constexpr int P = 998244353;
i64 exgcd(i64 &x, i64 &y, i64 a, i64 b)
{
if(!b) {
x = 1, y = 0;
return a;
}
i64 g = exgcd(x, y, b, a % b);
i64 t = x; x = y;
y = t - a / b * y;
return g;
}
void solve()
{
int a, b;
std::cin >> a >> b;
int t = 1;
while(b % 2 == 0) {
b /= 2;
t *= 2;
}
while(b % 5 == 0) {
b /= 5;
t *= 5;
}
i64 tx, ty;
exgcd(tx, ty, t, b);
i64 c = b - a, d = b;
constexpr int Inf = 1e9;
for(i64 p2 = 1; p2 * b <= Inf; p2 *= 2) {
for(i64 p5 = p2; p5 * b <= Inf; p5 *= 5) {
i64 den = -a * p5;
i64 x = tx * den;
x = (x % b + b) % b;
if(x < c) {
c = x;
d = b * p5;
}
}
}
std::cout << c << ' ' << d << '\n';
}
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T = 1;
std::cin >> T;
while(T --) solve();
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
input:
4 1 2 2 3 3 7 19 79
output:
0 1 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 11ms
memory: 3672kb
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:
-8 3 1 828125000 -14 3 1 7 1 231680000 23 960937500 1 36096000 5 326 1 63360 -12 1 1 61000 -14 1 1 4880 1 10750 1 18500 1 11714560 1 331250 1 898437500 1 31 -2 3 1 289600000 1 455000 1 115000000 1 1265625 0 1 1 1484375 -116 1 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 -64 31 -40 3 3 ...
result:
wrong answer Integer -8 violates the range [0, 10^9]