QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#802474#9868. GCDucup-team3282#WA 2ms3636kbC++14721b2024-12-07 13:47:042024-12-07 13:47:13

Judging History

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

  • [2024-12-07 13:47:13]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3636kb
  • [2024-12-07 13:47:04]
  • 提交

answer

#include<iostream>
using namespace std;
long long gcd(long long x,long long y){
    if(x*y==0)return x+y;
    if(x>y)swap(x,y);
    if(y%x==0)return x;
    return gcd(x,y%x);
}
int main(){
    int t;cin>>t;while(t--){
        long long x,y;
        cin>>x>>y;
        // cout<<gcd(x,y)<<endl;
        if(x>y)swap(x,y);
        int cnt=0;
        while(x!=0&&y!=0){
            long long G=gcd(x,y);
            x/=G;
            y/=G;
            if(gcd(x-1,y)>gcd(x,y-1)){
                x--;
            }else{
                y--;
            }
            cnt++;
        }
        if(x+y)
            cout<<cnt+1<<endl;
        else 
            cout<<cnt<<endl;
    }
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3588kb

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: 3636kb

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 264th lines differ - expected: '4', found: '5'