QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#806229 | #9868. GCD | ir101 | WA | 1ms | 3836kb | C++23 | 931b | 2024-12-08 23:59:02 | 2024-12-08 23:59:03 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
#define PII pair<int,int>
#define i64 long long
//#define int long long
constexpr int mod = 998244353, N = 2e5 + 5, M = 2e5 + 5;
void solve(){
i64 a,b;
cin>>a>>b;
assert(a <= 5000);
int ans=26;
function <void (int cur,int a,int b)> rec = [&]( int cur, i64 a, i64 b) -> void {
if (a == 0 && b == 0) {
ans = min(ans, cur);
return;
}
if (cur >= ans) {
return;
}
i64 g = gcd(a, b);
if (a > 0) {
rec( cur + 1, a - g, b);
}
if (b > 0) {
rec( cur + 1, a, b - g);
}
};
rec( 0, a, b);
cout << ans << '\n';
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
cin >> t;
while(t --) solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3836kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3608kb
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:
ok 990 lines
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3832kb
input:
2 4859 299556476011016293 4859 911621905353047038
output:
10 26
result:
wrong answer 1st lines differ - expected: '13', found: '10'