/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 2ms 320.0 KiB
#3 Wrong Answer 3ms 548.0 KiB
#4 Wrong Answer 3ms 532.0 KiB
#5 Wrong Answer 4ms 532.0 KiB
#6 Wrong Answer 26ms 636.0 KiB
#7 Wrong Answer 243ms 1.414 MiB
#8 Wrong Answer 245ms 1.383 MiB
#9 Wrong Answer 251ms 1.453 MiB
#10 Wrong Answer 232ms 1.402 MiB
#11 Wrong Answer 233ms 1.438 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
   int T;
    cin >> T;
    
    while (T--) {
        ll n , k , x , y ;
        cin >> n >> k ;
        
        if (k >= n) {
            // We can increment all elements to at least 1
            x  = k - n;  // Remaining operations after making all elements >= 1
            y  = 1;      // The AND of all elements will be 1
            cout << x * y << endl;
        } 
        else {
            // We cannot make all elements >= 1, so Y will be 0
            cout << 0 << 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 16:15:03
Judged At
2024-10-03 13:08:25
Judged By
Score
1
Total Time
251ms
Peak Memory
1.453 MiB