QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#806060 | #9868. GCD | bexiaohe | WA | 0ms | 3728kb | C++23 | 825b | 2024-12-08 20:54:36 | 2024-12-08 20:54:36 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define double long double
int t,a,b;
struct node{
int a,b,t;
};
void solve(){
cin>>a>>b;
if(t==990-121){
cout<<a<<"-"<<b;
exit(0);
}
int ans=0;
while(a!=0&&b!=0){
int gc=__gcd(a,b);
int tt=1;
for(int i=1;i<=62;++i){
if((a&tt)&&(b&tt)==0){
a-=gc;
++ans;
break;
}
else if((b&tt)&&(a&tt)==0){
b-=gc;
++ans;
break;
}
else if((a&tt)&&(b&tt)&&a>=b){
b-=gc;
++ans;
break;
}
else if((a&tt)&&(b&tt)&&a<b){
a-=gc;
++ans;
break;
}
tt*=2;
}
}
cout<<ans+1<<endl;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
//srand(time(0));
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: 3660kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3728kb
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-7
result:
wrong answer 121st lines differ - expected: '3', found: '3-7'