QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#808944#9868. GCDhjh123455TL 27ms3620kbC++23821b2024-12-11 09:54:032024-12-11 09:54:05

Judging History

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

  • [2024-12-11 09:54:05]
  • 评测
  • 测评结果:TL
  • 用时:27ms
  • 内存:3620kb
  • [2024-12-11 09:54:03]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
int gcd(int a,int b){
    return b?gcd(b,a%b):a;
}
void solve(){
    int x,y;
    cin>>x>>y;
    int id=0;
    for(int i=20;i>=0;i--){
        if(x>>i&1){
            id=i+1;
            break;
        }
    }
    id*=2;
    int ans=1e18;
    for(int i=0;i<(1<<id);i++){
        int x1=x,y1=y;
        for(int j=0;j<id;j++){
            if(i>>j&1){
                y1-=gcd(x1,y1);
            }
            else x1-=gcd(x1,y1);
            if(x1==0&&y1==0){
                ans=min(ans,j+1);
                break;
            }
        }
    }
    cout<<ans<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}

详细

Test #1:

score: 100
Accepted
time: 3ms
memory: 3620kb

input:

3
3 4
12 20
114 514

output:

3
4
6

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 27ms
memory: 3584kb

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
Time Limit Exceeded

input:

2
4859 299556476011016293
4859 911621905353047038

output:


result: