QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#740959 | #9622. 有限小数 | DiaoTianhao# | WA | 127ms | 3616kb | C++14 | 716b | 2024-11-13 12:40:45 | 2024-11-13 12:40:45 |
Judging History
answer
#include <bits/stdc++.h>
constexpr long long Inf = 1000000000000;
std::vector<long long> v25;
int main() {
for(long long i = 1; i <= Inf; i *= 2)
for(long long j = 1; i * j <= Inf; j *= 5)
v25.push_back(i * j);
int T;
std::cin >> T;
while(T--) {
long long a, b, s, t, o;
std::cin >> a >> b, t = b, s = b - a, o = 1;
std::pair<long long, long long> ans(3141592653589793238LL, 0);
for(long long j : v25) {
long long e = s * j / t, c = s * j % t, r = std::__gcd(c, t * j);
ans = std::min(ans, std::make_pair(c / r, t * j / r));
// std::cout << e << '/' << j << ' ' << c << '/' << t * j << '\n';
}
std::cout << ans.first << ' ' << ans.second * o << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3616kb
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: 127ms
memory: 3608kb
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 60 1 7 1 231680000 23 3936 1 36096000 1 2608000000000 1 63360 0 1 1 31232 0 1 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 1 1 304 0 1 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 775 1 48 1 3558400000 1 944 1 43600 1 76 1 43...
result:
wrong answer Integer 2608000000000 violates the range [1, 10^9]