H_Arbiter的专栏

#include using namespace std;long long swap_bits(long long x, int i, int j) { if (((x >> i) & 1) != ((x >> j) & 1)) { x ^= (1LL << i) | (1LL << j); } return x;}int main(int a

#include #include using namespace std;int parity1(unsigned long long n) { int p = 0; while (n) { p ^= (n & 1); n >>= 1; } return p;}int parity2(unsigned long lon

#include #include #include #include #include using namespace std;string intToString(int x) { bool is_negative = false; if (x < 0) { is_negative = true; x = -x; }

#include #include using namespace std;int ssDecodeColID(const string& col) { int x = 0; for (const char &c : col) { x = x * 26 + c - 'A' + 1; } return x;}string rand_str

#include #include #include using namespace std;unsigned long long closest_int_same_bits(unsigned long long x) { for (int i = 0; i < 63; i++) { if (((x >> i) & 1) != ((x >> (i + 1)) &

#include #include using namespace std;template void generate_power_set(const vector& S) { for (int i = 1; i < (1 << S.size()); i++) { int x = i; for (int j = 0; x >> j; j++) {

#include #include #include using namespace std;string convert_base(const string& s, const int b1, const int b2) { bool neg = (s[0] == '-'); int x = 0; for (int i = neg; i < s.size();

#include #include using namespace std;long long swap_bits(long long x, int i, int j) { if (((x >> i) & 1) != ((x >> j) & 1)) { x ^= (1LL << i) | (1LL << j); } return x;}long