Hackerrank | 30 days of code | Day 29-Solution in c++| Bitwise-AND-hackerrank-Solution-in-c++

Hackerrank | 30 days of code | Day 29-Solution in c++| Bitwise-AND-hackerrank-Solution-in-c++

https://www.hackerrank.com/challenges/30-bitwise-and/problem

Day 29: Bitwise AND Solution in Cpp

#include <bits/stdc++.h>

using namespace std;

int main()
{    
 int T, n, k, i, j, val;
 cin>>T;
    
 while(T>0)
    {    
        int maximum = 0;
        cin>>n>>k;
        
        for (i=1;i<n-1;i++) 
 {
            for (j=i+1;j<=n;j++) 
 {
                val=i&j;
                           
 if (val>maximum&&val<k) 
                    maximum = val;                    
            }    
        }
            cout<<maximum<<endl;
        T--;
    }
 return 0;
}