QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741321 | #9622. 有限小数 | PHarr | WA | 32ms | 3624kb | C++20 | 963b | 2024-11-13 14:05:57 | 2024-11-13 14:06:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MAXN = 2e9;
const i64 inf = LLONG_MAX / 2;
i64 exgcd(i64 a, i64 b, i64 &x, i64 &y) {
if(b == 0){
x = 1, y = 0;
return a;
}
i64 d = exgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
i64 calc(i64 a, i64 b, i64 c) {
i64 x, y;
i64 d = exgcd(a, b, x, y);
d = abs(d);
if(c % d != 0) return inf;
x *= c / d;
i64 t = abs(b / d);
return (x % t + t) % t;
}
void solve() {
i64 a, b;
cin >> a >> b;
i64 w = b;
while(w % 2 == 0) w /= 2;
while(w % 5 == 0) w /= 5;
if(w == 1) {
cout << "0 1\n";
return;
}
i64 resc = inf, resd;
for(i64 p5 = w; p5 <= MAXN; p5 *= 5)
for(i64 d = p5, c; d <= MAXN; d *= 2) {
c = calc(b, w * w, -a * d);
if(c < resc) resc = c, resd = d;
}
cout << resc << " " << resd << "\n";
return;
}
int main() {
int T;
cin >> T;
while(T --)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
input:
4 1 2 2 3 3 7 19 79
output:
0 1 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 32ms
memory: 3600kb
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 3 1 54272 1 6 1 7 1 231680000 23 3936 1 36096000 4 1591796875 1 63360 0 1 1 31232 0 1 1 4880 1 44032 1 757760 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 1 304 0 1 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 775 1 3 3 347500 1 944 1 43600 1 76 1 1761280 1 6...
result:
wrong answer Integer 1591796875 violates the range [1, 10^9]