Check if a pair of integers from two ranges exists such that their Bitwise XOR exceeds both the ranges | Function to check if there exists any pair ( P , Q ) whose Bitwise XOR is greater than the Bitwise XOR of X and Y ; Stores the Bitwise XOR of X & Y ; Traverse all possible pairs ; If a pair exists ; If a pair is found ; Driver code
function findWinner ( X , Y ) { let playerA = ( X ^ Y ) ; let flag = false ; for ( let i = 1 ; i <= X ; i ++ ) { for ( let j = 1 ; j <= Y ; j ++ ) { let val = ( i ^ j ) ; if ( val > playerA ) { flag = true ; break ; } } if ( flag ) { break ; } } if ( flag ) { document . write ( " " ) ; } else { document . write ( " " ) ; } } let A = 2 , B = 4 ; findWinner ( A , B ) ;