cp/codeforces/1043/c.cc
2025-08-22 20:28:56 -05:00

104 lines
1.9 KiB
C++

#include <bits/stdc++.h> // {{{
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("O2,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using f128 = long double;
#if __cplusplus >= 202002L
template <typename T>
constexpr T MIN = std::numeric_limits<T>::min();
template <typename T>
constexpr T MAX = std::numeric_limits<T>::max();
template <typename T>
[[nodiscard]] static T sc(auto&& x) {
return static_cast<T>(x);
}
template <typename T>
[[nodiscard]] static T sz(auto&& x) {
return static_cast<T>(x.size());
}
#endif
static void NO() {
std::cout << "NO\n";
}
static void YES() {
std::cout << "YES\n";
}
template <typename T>
using vec = std::vector<T>;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ff first
#define ss second
#ifdef LOCAL
#define db(...) std::print(__VA_ARGS__)
#define dbln(...) std::println(__VA_ARGS__)
#else
#define db(...)
#define dbln(...)
#endif
// }}}
void solve() {
i64 n;
cin >> n;
map<i64, u64> w2c;
for (u32 x = 0; x <= 19; ++x) {
w2c[(i64)powl(3, x)] = (u64)powl(3, x + 1) + x * (u64)powl(3, x - 1);
}
u64 ans = 0, deals = 0;
// for (auto it = w2c.begin(); it != w2c.end(); ++it) {
// print("w: {} cost: {}; ", it->first, it->second);
// }
// println();
for (auto it = w2c.rbegin(); it != w2c.rend(); ++it) {
auto w = it->first;
auto c = it->second;
while (n >= w) {
// println("bought {} watermelons at cost {}", w, c);
ans += c;
n -= w;
++deals;
}
}
println("{}", ans);
// println("{} {}", ans, deals);
}
int main() { // {{{
cin.tie(nullptr)->sync_with_stdio(false);
cin.exceptions(cin.failbit);
u32 tc = 1;
cin >> tc;
for (u32 t = 0; t < tc; ++t) {
solve();
}
return 0;
}
// }}}