Bitwise_Operations.cpp

#include <bits/stdc++.h>
using namespace std;

// Check if x is odd or even
bool is_odd(int x) {
    return x & 1;
}

// Check if kth bit of x is set
bool check_kth_bit(int x, int k) {
    return x >> k & 1;
}

// Return the count of set bits
int count_set_bits(int x) {
    int res = 0;
    for (int k = 0; k < 32; k++) {
        res += x >> k & 1;
    }
    return res;
}

// Set the kth bit of x
int set_kth_bit(int x, int k) {
    return x | (1 << k);
}

// Unset the kth bit of x
int unset_kth_bit(int x, int k) {
    return x & (~(1 << k));
}

// Toggle the kth bit of x
int toggle_kth_bit(int x, int k) {
    return x ^ (1 << k);
}

// Check if x is a power of 2
bool check_power_of_2(int x) {
    return count_set_bits(x) == 1;
}

// Return the lowest bit of x
int lowest_bit(int x) {
    return x & -x;
}

// Unset the lowest bit of x
int unset_lowest_bit(int x) {
    return x & (x - 1);
}

// Print the binary representation of x
void to_binary(int x) {
    for (int k = 31; k >= 0; k--) {
        cout << (x >> k & 1);
    }
    cout << '\n';
}

void solve() {
    int n;
    cin >> n;

    to_binary(n);

    // Builtin function in GCC
    // __builtin_popcountll, __builtin_ffsll, __builtin_clzll, __builtin_ctzll
    // Count set bits
    cout << __builtin_popcount(n) << '\n';
    // Index of the lowest set bit
    cout << __builtin_ffs(n) << '\n';
    // Count of leading zeros
    cout << __builtin_clz(n) << '\n';
    // Count of trailing zeros
    cout << __builtin_ctz(n) << '\n';

    // Count set bits
    cout << __popcount(n) << '\n';
    // Return lenght of number
    cout << __bit_width(n) << '\n';;
    // Round up/down to the next power of two
    cout << __bit_floor(n) << ' ' << __bit_ceil(n) << '\n';
    // Count the leading/trailing zeros/ones
    cout << __countl_zero(n) << ' ' << __countr_zero(n) << ' ' << __countl_one(n) << ' ' << __countr_one(n) << '\n';
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}