QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#806220#9868. GCDir101TL 102ms3556kbC++23730b2024-12-08 23:55:562024-12-08 23:55:56

Judging History

你现在查看的是最新测评结果

  • [2024-12-08 23:55:56]
  • 评测
  • 测评结果:TL
  • 用时:102ms
  • 内存:3556kb
  • [2024-12-08 23:55:56]
  • 提交

answer

#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
using namespace std;
#define PII pair<int,int>
#define int long long
constexpr int mod = 998244353, N = 2e5 + 5, M = 2e5 + 5;

void solve(){
    int a,b;
    cin>>a>>b;
    int ans=26;
    function<void (int res,int a,int b)> dfs=[&](int res,int a,int b){
        if(a==b and b==0){
            ans=min(ans,res);
            return ;
        }
        if(res>=ans)return;
        int d=gcd(a,b);
        dfs(res+1,a-d,b);
        dfs(res+1,a,b-d);
    };
    dfs(0,a,b);
    cout<<ans<<endl;


}

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: 102ms
memory: 3556kb

input:

3
3 4
12 20
114 514

output:

3
4
6

result:

ok 3 lines

Test #2:

score: -100
Time Limit Exceeded

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:


result: