You are viewing a single comment's thread. Return to all comments →
Solution in C# public static int maximizingXor(int l, int r) { int maxValue =0; for(int i = l;i<=r;i++) { for(int j=l;j<=r;j++) { int value = i ^ j; // Console.WriteLine("value " + value); //Console.WriteLine("i " + i); // Console.WriteLine("j " + j); if (maxValue < value) { // Console.WriteLine("i " + i); // Console.WriteLine("j " + j); maxValue = value; }
} } return maxValue; }
Seems like cookies are disabled on this browser, please enable them to open this website
Maximizing XOR
You are viewing a single comment's thread. Return to all comments →
Solution in C# public static int maximizingXor(int l, int r) { int maxValue =0; for(int i = l;i<=r;i++) { for(int j=l;j<=r;j++) { int value = i ^ j; // Console.WriteLine("value " + value); //Console.WriteLine("i " + i); // Console.WriteLine("j " + j); if (maxValue < value) { // Console.WriteLine("i " + i); // Console.WriteLine("j " + j); maxValue = value;
}