/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 540.0 KiB
#2 Wrong Answer 2ms 496.0 KiB
#3 Wrong Answer 2ms 484.0 KiB
#4 Wrong Answer 2ms 492.0 KiB
#5 Wrong Answer 3ms 588.0 KiB
#6 Wrong Answer 9ms 596.0 KiB
#7 Wrong Answer 69ms 2.363 MiB
#8 Wrong Answer 67ms 1.988 MiB
#9 Wrong Answer 68ms 2.316 MiB
#10 Wrong Answer 62ms 2.324 MiB
#11 Wrong Answer 61ms 2.336 MiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

int main ()
{
    Tasrik;
    ll t=1,n,k;
    cin>>t;
    while(t--)
    {
        cin>>n>>k;

        if(k<=n)
        {
            cout<<0<<endl;
            continue;
        }


         k-=n;
        ll ans=k;

        for(int i=30; i>=0; i--)
        {
            ll pw=(1<<i);
            if(pw<=(k-1))
            {
                k-=pw;
                ll x=k*pw;
                ans=max(ans,x);
            }
        }
        cout<<ans<<endl;
    }
}


Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 16:54:25
Judged At
2024-10-03 13:05:48
Judged By
Score
1
Total Time
69ms
Peak Memory
2.363 MiB