/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 556.0 KiB
#2 Wrong Answer 1ms 552.0 KiB
#3 Wrong Answer 734ms 560.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ff       first
#define ss       second
#define MX       1000005
#define mod      1000000007
#define ll       long long
#define pb       push_back
#define pll      pair<ll,ll>
#define endl     "\n"
#define bug(a)   cerr<<#a<<" : "<<a<<endl
#define all(x)   (x).begin(),(x).end()
#define allr(x)  (x).rbegin(),(x).rend()
#define Mul(a,b) (a%mod * b%mod)%mod
#define Add(a,b) (a%mod + b%mod)%mod

bool isPowerOfTwo(ll n) {
    int p = 1;
    while(p<n) {
        p*=2;
    }
    return p==n;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    ll t;
    cin>>t;
    while(t--) {
        ll a,b;
        cin>>a>>b;
        if(a==b) cout<<0<<endl;
        else {
            ll cnt=0;
            while(!isPowerOfTwo(a) && a<b) {
                a++;
                cnt++;
            }

            while(!isPowerOfTwo(b) && a<b) {
                b--;
                cnt++;
            }

            while(a<b) {
                a*=2;
                cnt++;
            }

            cout<<cnt<<endl;
        }
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1044 Add or multiple
Contest
TLE_Headquarters - round #1
Language
C++20 (G++ 13.2.0)
Submit At
2024-03-27 16:43:46
Judged At
2024-11-11 03:38:12
Judged By
Score
20
Total Time
734ms
Peak Memory
560.0 KiB