#include <iostream> #include <vector> using namespace std; using LL = long long; const LL MODULO = 998244353; vector<LL> values, counts; LL max_lose(LL n) { LL result = 0; ++n; while (n > 1) { n >>= 1; ++result; } return result; } LL seg_lower(LL lose_max) {...
yangjl：懒得理解你代码了，提供一组hack数据
8 1
答案应该是(1-1/2^3)=7/8=124780545
您的输出：606237885