的做我给keespeed

#include <iostream>
#include <string>
using namespace std;

int main() {
    int n;
    unsigned long long k;
    cin >> n >> k;

    // 计算格雷码: G(k) = k ^ (k >> 1)
    unsigned long long gray = k ^ (k >> 1);

    // 构建n位二进制字符串
    string binary;
    for (int i = n - 1; i >= 0; --i) {
        // 检查gray的第i位是否为1
        if ((gray >> i) & 1) {
            binary += '1';
        } else {
            binary += '0';
        }
    }

    cout << binary << endl;
    return 0;
}

:码代ca