/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 2ms 316.0 KiB
#4 Wrong Answer 1ms 532.0 KiB
#5 Wrong Answer 2ms 528.0 KiB
#6 Wrong Answer 4ms 616.0 KiB
#7 Wrong Answer 29ms 1.793 MiB
#8 Wrong Answer 28ms 1.477 MiB
#9 Wrong Answer 30ms 1.84 MiB
#10 Wrong Answer 29ms 2.172 MiB
#11 Wrong Answer 30ms 1.984 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define all(n)  n.begin(),n.end()
#define sz(n) (ll) n.size()
#define endl '\n'
const double PI = 3.14159265358979323846;
const ll mod = 1e9 + 7;


void test_case() {
    ll n,k;
    cin >> n >> k;
    ll ans = 0;
    ll i = 0;
    ll ini = 0;
    while(k > 0) {
        k = k - ((1 << i)*n);
        if (k > 0) {
            ini = ini + (1 << i);
            ans = max(ans,k*ini); 
        }
        i++;
    }
    cout << ans << endl;
}


int32_t main() {
    //freopen("input.txt","r", stdin);
    //freopen("output.txt","w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    cin >> t;
    while(t--) {
        test_case();
    }
}

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:32:03
Judged At
2024-10-03 13:07:09
Judged By
Score
1
Total Time
30ms
Peak Memory
2.172 MiB