You are viewing a single comment's thread. Return to all comments →
void calculate_the_maximum(int n, int k) { int max_and = 0, max_or = 0, max_xor = 0; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int temp_and = i & j; int temp_or = i | j; int temp_xor = i ^ j; if (temp_and > max_and && temp_and < k) { max_and = temp_and; } if (temp_or > max_or && temp_or < k) { max_or = temp_or; } if (temp_xor > max_xor && temp_xor < k) { max_xor = temp_xor; } } } printf("%d\n%d\n%d", max_and, max_or, max_xor); }
int main() { int n, k;
scanf("%d %d", &n, &k); calculate_the_maximum(n, k); return 0;
}
Seems like cookies are disabled on this browser, please enable them to open this website
Bitwise Operators
You are viewing a single comment's thread. Return to all comments →
include
include
include
include
void calculate_the_maximum(int n, int k) { int max_and = 0, max_or = 0, max_xor = 0; for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int temp_and = i & j; int temp_or = i | j; int temp_xor = i ^ j; if (temp_and > max_and && temp_and < k) { max_and = temp_and; } if (temp_or > max_or && temp_or < k) { max_or = temp_or; } if (temp_xor > max_xor && temp_xor < k) { max_xor = temp_xor; } } } printf("%d\n%d\n%d", max_and, max_or, max_xor); }
int main() { int n, k;
}