QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#740913 | #9622. 有限小数 | DiaoTianhao# | WA | 15ms | 3672kb | C++14 | 759b | 2024-11-13 12:14:41 | 2024-11-13 12:14:42 |
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;
while(t % 2 == 0)
t /= 2;
while(t % 5 == 0)
t /= 5;
s = t - a % t, o = b / t;
std::pair<long long, long long> ans(3141592653589793238LL, 0);
for(long long j : v25) {
long long e = s * j / t, c = s * j % t;
ans = std::min(ans, std::make_pair(c, t * j));
// std::cout << e << '/' << j << ' ' << c << '/' << t * j << '\n';
}
std::cout << ans.first << ' ' << ans.second * o << '\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3672kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 15ms
memory: 3560kb
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 350 1 231680000 23 3936 1 36096000 1 2608000000000 1 63360 0 64 1 31232 0 32 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 2 1 304 0 160 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 24800 1 192 1 3558400000 1 944 1 43600 ...
result:
wrong answer Integer 2608000000000 violates the range [1, 10^9]