QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#836565 | #9868. GCD | potpot | WA | 2ms | 3708kb | C++20 | 917b | 2024-12-29 00:42:27 | 2024-12-29 00:42:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int ans = INT_MAX;
void brute_force(long long a, long long b, int cnt) {
// cout << a << " " << b << " " << cnt << "\n";
if (cnt > ans) return;
if (a > b) swap(a, b);
if (a == 0) {
if (b != 0) cnt++;
ans = min(ans, cnt);
return;
}
if (a % 2 == 0 && b % 2 == 0) {
a /= 2;
b /= 2;
brute_force(a, b, cnt);
}
else {
long long diff = __gcd(a, b);
cnt++;
if (a % 2 == 1) brute_force(a-diff, b, cnt);
if (b % 2 == 1) brute_force(a, b-diff, cnt);
}
}
void solve() {
long long a, b;
cin >> a >> b;
ans = INT_MAX;
brute_force(a, b, 0);
cout << ans << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
int T=1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3708kb
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 185th lines differ - expected: '3', found: '4'