QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#808221 | #9868. GCD | hyjhyj111 | WA | 0ms | 3860kb | C++20 | 1009b | 2024-12-10 18:17:28 | 2024-12-10 18:17:29 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
consteval auto operator"" _f(const char* str, std::size_t len) {
return [fmt = std::string_view(str, len)](auto&&... args) {
return std::vformat(fmt, std::make_format_args(args...));
};
}
void solve() {
i64 a, b;
std::cin >> a >> b;
int ans = std::log2(a) + 3;
auto dfs = [&](auto &&self, i64 a, i64 b, int cur) -> void {
if (a == 0 && b == 0) {
ans = std::min(ans, cur);
return;
}
if (a == 0 || b == 0) {
ans = std::min(ans, cur + 1);
return;
}
if (cur > ans) return;
i64 g = std::gcd(a, b);
self(self, a - g, b, cur + 1);
self(self, a, b - g, cur + 1);
};
dfs(dfs, a, b, 0);
std::cout << ans << "\n";
}
signed main() {
std::cin.tie(nullptr)->sync_with_stdio(false);
int _ = 1;
std::cin >> _;
while (_ --) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3860kb
input:
990 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 2 3 2 4 2...
output:
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 ...
result:
wrong answer 379th lines differ - expected: '6', found: '5'