HackerRank C- Bitwise Operators

Given set S={1,2,3......,n}, find:

the maximum value of a&b which is less than a given integer k, where a and b (where a

the maximum value of a|b which is less than a given integer k, where a and b (where a

the maximum value of a^b which is less than a given integer k, where a and b (where a

#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,i=0,j=0,a=0,b=0,c=0;
  for(i=1;i<=n;i++)
  {
      for(j=i+1;j<=n;j++)
      {
          a=i&j;
          b=i|j;
          c=i^j;
        if (a<k&&a>max_and) {
            max_and=a;
        }
        if (b<k&&b>max_or) {
            max_or=b;
        }
        if (c<k&&c>max_xor) {
            max_xor=c;
        }
      }
  }
  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;
}