In this HackerRank Bitwise operators in the c programming problem solution, you need to Complete the calculate_the_maximum function.

calculate_the_maximum has the following parameters:

1. int n: the highest number to consider
2. int k: the result of comparison must be lower than this number to be considered

you need to Print the maximum values for the and, or and xor comparisons, each on a separate line.

## HackerRank Bitwise operators in c programming problem solution.

```#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
//Complete the following function.

void calculate_the_maximum(int n, int k) {
int maxAnd = 0;
int maxOr = 0;
int maxXor = 0;

for (int i=1; i<=n; i++) {
for (int j=i+1; j<=n; j++) {
if (((i&j) > maxAnd) && ((i&j) < k)) {
maxAnd = i&j;
}
if (((i|j) > maxOr) && ((i|j) < k)) {
maxOr = i|j;
}
if (((i^j) > maxXor) && ((i^j) < k)) {
maxXor = i^j;
}
}
}

printf("%d\n%d\n%d\n", maxAnd, maxOr, maxXor);
}

int main() {
int n, k;

scanf("%d %d", &n, &k);
calculate_the_maximum(n, k);

return 0;
}```

## Second solution

```#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
//Complete the following function.

void calculate_the_maximum(int n, int k) {
int max_and = 0, max_or = 0, max_xor = 0;
int v_and = 0, v_or = 0, v_xor = 0;
for (int i=1; i<=n; i++) {
for (int j=i+1; j<=n; j++) {
v_and = i & j;
v_or = i | j;
v_xor = i ^ j;
if (v_and > max_and && v_and < k) max_and = v_and;
if (v_or > max_or && v_or < k) max_or = v_or;
if (v_xor > max_xor && v_xor < k) max_xor = v_xor;
}
}
printf("%d\n%d\n%d\n", max_and, max_or, max_xor);
}
int main() {
int n, k;

scanf("%d %d", &n, &k);
calculate_the_maximum(n, k);

return 0;
}```