OJ Board

I am getting a WA. My algo is to try all the possible permutations. For our answer the bitwise and of all the test cases with the permutation should be distinct #include<cstdio> #include<set> #define isOn(S, j) (S & (1 << j)) #define setBit(S, j) (S |= (1 << j)) using namespace std; int tcases[1...

thanks brianfry713

Guys i am using the union-find algo and map.
However I am getting TLE. Can anybody help ?
Below is my code

Thanks, Mukit Chowdhury

Hello,
I am getting WA for this problem even though i have tried the tricky cases. Below is my code Please try to help