/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 2ms 320.0 KiB
#3 Wrong Answer 3ms 324.0 KiB
#4 Wrong Answer 2ms 328.0 KiB
#5 Wrong Answer 4ms 324.0 KiB
#6 Wrong Answer 22ms 604.0 KiB
#7 Wrong Answer 206ms 1.867 MiB
#8 Wrong Answer 199ms 1.508 MiB
#9 Wrong Answer 204ms 1.816 MiB
#10 Wrong Answer 198ms 2.359 MiB
#11 Wrong Answer 202ms 1.977 MiB

Code

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

long long sir(int N, int K) {
    long long sir = 0;


    for (int bit = 30; bit >= 0; --bit) {
        long long Y = (1LL << bit);
        
        long long ops = Y * N;

        if (K >= ops) {
            
            long long X = K - ops;
            sir = max(sir, X * Y);
        }
    }

    return sir;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int T;
    cin >> T;
    
    while (T--) {
        int N, K;
        cin >> N >> K;
        cout << sir(N, K) << endl;
    }

    return 0;
}

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 17:44:26
Judged At
2024-10-03 13:02:49
Judged By
Score
1
Total Time
206ms
Peak Memory
2.359 MiB