#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template std::pair operator+(const std::pair &l, const std::pair &r) { return std::make_pair(l.first + r.first, l.second + r.second); } template std::pair operator-(const std::pair &l, const std::pair &r) { return std::make_pair(l.first - r.first, l.second - r.second); } template std::vector sort_unique(std::vector vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template int arglb(const std::vector &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); } template int argub(const std::vector &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); } template IStream &operator>>(IStream &is, std::vector &vec) { for (auto &v : vec) is >> v; return is; } template OStream &operator<<(OStream &os, const std::vector &vec); template OStream &operator<<(OStream &os, const std::array &arr); template OStream &operator<<(OStream &os, const std::unordered_set &vec); template OStream &operator<<(OStream &os, const pair &pa); template OStream &operator<<(OStream &os, const std::deque &vec); template OStream &operator<<(OStream &os, const std::set &vec); template OStream &operator<<(OStream &os, const std::multiset &vec); template OStream &operator<<(OStream &os, const std::unordered_multiset &vec); template OStream &operator<<(OStream &os, const std::pair &pa); template OStream &operator<<(OStream &os, const std::map &mp); template OStream &operator<<(OStream &os, const std::unordered_map &mp); template OStream &operator<<(OStream &os, const std::tuple &tpl); template OStream &operator<<(OStream &os, const std::vector &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::array &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template std::istream &operator>>(std::istream &is, std::tuple &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template OStream &operator<<(OStream &os, const std::tuple &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; } #endif template OStream &operator<<(OStream &os, const std::unordered_set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::deque &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template OStream &operator<<(OStream &os, const std::set &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_multiset &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::pair &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; } template OStream &operator<<(OStream &os, const std::map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template OStream &operator<<(OStream &os, const std::unordered_map &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl #define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr) #else #define dbg(x) ((void)0) #define dbgif(cond, x) ((void)0) #endif #include namespace dual_number_ { struct has_id_method_impl { template static auto check(T_ *) -> decltype(T_::id(), std::true_type()); template static auto check(...) -> std::false_type; }; template struct has_id : decltype(has_id_method_impl::check(nullptr)) {}; } // namespace dual_number_ // Dual number (二重数) // Verified: https://atcoder.jp/contests/abc235/tasks/abc235_f template struct DualNumber { T a, b; // a + bx template ::value>::type * = nullptr> static T2 _T_id() { return T2::id(); } template ::value>::type * = nullptr> static T2 _T_id() { return T2(1); } DualNumber(T x = T(), T y = T()) : a(x), b(y) {} static DualNumber id() { return DualNumber(_T_id(), T()); } explicit operator bool() const { return a != T() or b != T(); } DualNumber operator+(const DualNumber &x) const { return DualNumber(a + x.a, b + x.b); } DualNumber operator-(const DualNumber &x) const { return DualNumber(a - x.a, b - x.b); } DualNumber operator*(const DualNumber &x) const { return DualNumber(a * x.a, b * x.a + a * x.b); } DualNumber operator/(const DualNumber &x) const { T cinv = _T_id() / x.a; return DualNumber(a * cinv, (b * x.a - a * x.b) * cinv * cinv); } DualNumber operator-() const { return DualNumber(-a, -b); } DualNumber &operator+=(const DualNumber &x) { return *this = *this + x; } DualNumber &operator-=(const DualNumber &x) { return *this = *this - x; } DualNumber &operator*=(const DualNumber &x) { return *this = *this * x; } DualNumber &operator/=(const DualNumber &x) { return *this = *this / x; } bool operator==(const DualNumber &x) const { return a == x.a and b == x.b; } bool operator!=(const DualNumber &x) const { return !(*this == x); } bool operator<(const DualNumber &x) const { return (a != x.a ? a < x.a : b < x.b); } template friend OStream &operator<<(OStream &os, const DualNumber &x) { return os << '{' << x.a << ',' << x.b << '}'; } T eval(const T &x) const { return a + b * x; } T root() const { return (-a) / b; } // Solve a + bx = 0 (b \neq 0 is assumed) }; using dual = DualNumber; lint solve(lint N) { vector dp(2, vector(2, vector(2))); // dp[strictly lower][last digit][10101-type or not] dp[0][0][1] = 1; IREP(d, 60) { vector dpnxt(2, vector(2, vector(2))); // dp[strictly lower][last digit][10101-type or not] bool b = ((N << 2) >> d) & 1; REP(islower, 2) REP(lastdigit, 2) REP(is10101, 2) { if (!dp[islower][lastdigit][is10101]) continue; REP(nxtdigit, 2) { if (d <= 1 and nxtdigit) continue; if (!islower and !b and nxtdigit) continue; bool nxt_is10101 = (is10101 & (lastdigit != nxtdigit)) or (!lastdigit and !nxtdigit); lint coeff = 0; if (is10101 and nxt_is10101 and nxtdigit) coeff = 1; if (is10101 and !nxt_is10101 and nxtdigit) coeff = 1; if (!is10101 and !lastdigit and nxtdigit) coeff = 1; dpnxt[islower | (b > nxtdigit)][nxtdigit][nxt_is10101] += dp[islower][lastdigit][is10101] * dual(1, coeff); } } dp = dpnxt; } lint ret = 0; for (auto mat : dp) { for (auto vec : mat) { for (auto x : vec) { ret += x.b; } } } return ret; } int main() { int T; cin >> T; while (T--) { lint N; cin >> N; cout << solve(N) << '\n'; } vector dp(200, 1 << 20); dp[0] = 0; REP(_, 10) { for (int d = 1; d <= 128; d *= 2) { REP(i, dp.size()) { if (i + d < dp.size()) chmin(dp[i + d], dp[i] + 1); if (i - d >= 0) chmin(dp[i - d], dp[i] + 1); } } } FOR(i, 1, 100) { int su = solve(i) - solve(i - 1); int xo = __builtin_popcount(i ^ (3 * i)); if (xo != su) { dbg(make_tuple(i, su, xo)); } } }