1

我是 Boost 的新手,并试图使用它的多精度库来乘以非常大的输入:

mp::uint1024_t my_1024_bit_int1 = 0b00100101101000100010010...010101;
mp::uint1024_t my_1024_bit_int2 = 0b0010101001000101000010100000001001...01010111; // bigger in practice
mp::uint1024_t my_1024_bit_result = my_1024_bit_int2*my_1024_bit_int1;

我需要能够将结果保存为二进制形式的字符串。我试图访问整数中“肢体”的数量:

int limbs = my_1024_bit_result.backend.limbs();

然后遍历每个肢体并使用该bitset函数将每个肢体转换为二进制字符串,但它不起作用。

我还能如何做到这一点?

4

1 回答 1

1

如果您实际上是指二进制数字:

template <typename Integer>
std::string to_bin(Integer num) {
    auto sign = num.sign();
    num = abs(num);

    std::string result;
    while (num) {
        result += "01"[int(num % 2)];
        num /= 2;
    }
    result += sign<0? "b0-": "b0";
    std::reverse(begin(result), end(result));
    return result;
}

注意它是如何支持有符号类型的

住在科利鲁

int main() {
    mp::uint1024_t a=0b00100101101000100010010010101;
    mp::uint1024_t b=0b001010100100010100001010000000100101010111; // bigger in practice
    mp::uint1024_t c = a * b;

    std::cout << a << " * " << b << " = " << c << "\n";
    std::cout << "\n" << to_bin(a) << " * " << to_bin(b) << "\n = " << to_bin(c) << "\n";
}

印刷

78922901 * 726187641175 = 57312835311878048675

0b100101101000100010010010101 * 0b1010100100010100001010000000100101010111 = 0b110001101101100000000110000000111101001001011110101

序列化?

如果您的意思是“二进制序列化”,请使用序列化:

于 2020-04-26T16:19:49.047 回答