結果
問題 | No.1022 Power Equation |
ユーザー |
|
提出日時 | 2020-05-23 19:06:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 9 ms / 2,000 ms |
コード長 | 7,016 bytes |
コンパイル時間 | 1,810 ms |
コンパイル使用メモリ | 201,232 KB |
最終ジャッジ日時 | 2025-01-10 15:24:35 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 8 |
ソースコード
#include <bits/stdc++.h>// created [2020/05/23] 18:36:15#pragma GCC diagnostic ignored "-Wsign-compare"#pragma GCC diagnostic ignored "-Wsign-conversion"using i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;using uint = unsigned int;using usize = std::size_t;using ll = long long;using ull = unsigned long long;using ld = long double;template<typename T, usize n>using arr = T (&)[n];template<typename T, usize n>using c_arr = const T (&)[n];template<typename T>using max_heap = std::priority_queue<T>;template<typename T>using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask)<< (64 - ind)) >> (64 - ind)); }template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }constexpr unsigned int mod = 1000000007;template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};auto mfp = [](auto&& f) { return [=](auto&&... args) { return f(f, std::forward<decltype(args)>(args)...); }; };template<typename T>T in(){T v;return std::cin >> v, v;}template<typename T>T in(const T offset) { return in<T>() - offset; }template<typename T, typename Uint, usize n, usize i>T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type) { return in<T>(); }template<typename T, typename Uint, usize n, usize i>auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs){const usize s = (usize)szs[i];std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs); }return ans;}template<typename T, typename Uint, usize n>auto in_v(c_arr<Uint, n> szs) { return in_v<T, Uint, n, 0>(szs); }template<typename T, typename Uint, usize n, usize i>T in_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T offset) { return in<T>(offset); }template<typename T, typename Uint, usize n, usize i>auto in_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type& szs, const T offset){const usize s = (usize)szs[i];std::vector<decltype(in_v<T, Uint, n, i + 1>(szs))> ans(s);for (usize j = 0; j < s; j++) { ans[j] = in_v<T, Uint, n, i + 1>(szs, offset); }return ans;}template<typename T, typename Uint, usize n>auto in_v(c_arr<Uint, n> szs, const T offset) { return in_v<T, Uint, n, 0>(szs, offset); }template<typename... Types>auto in_t() { return std::tuple<std::decay_t<Types>...>{in<Types>()...}; }template<typename... Types>auto in_t(Types... offsets) { return std::tuple<std::decay_t<Types>...>{in<Types>(offsets)...}; }struct io_init{io_init(){std::cin.tie(nullptr), std::ios::sync_with_stdio(false);std::cout << std::fixed << std::setprecision(20);}void clear(){std::cin.tie(), std::ios::sync_with_stdio(true);}} io_setting;int out() { return 0; }template<typename T>int out(const T& v) { return std::cout << v, 0; }template<typename T>int out(const std::vector<T>& v){for (usize i = 0; i < v.size(); i++) {if (i > 0) { std::cout << ' '; }out(v[i]);}return 0;}template<typename T1, typename T2>int out(const std::pair<T1, T2>& v) { return out(v.first), std::cout << ' ', out(v.second), 0; }template<typename T, typename... Args>int out(const T& v, const Args... args) { return out(v), std::cout << ' ', out(args...), 0; }template<typename... Args>int outln(const Args... args) { return out(args...), std::cout << '\n', 0; }template<typename... Args>int outel(const Args... args) { return out(args...), std::cout << std::endl, 0; }# define SHOW(...) static_cast<void>(0)constexpr ull TEN(const usize n) { return n == 0 ? 1ULL : TEN(n - 1) * 10ULL; }template<typename T, typename Uint, usize n, usize i>auto make_v(typename std::enable_if<(i == n), c_arr<Uint, n>>::type, const T& v = T{}) { return v; }template<typename T, typename Uint, usize n, usize i>auto make_v(typename std::enable_if<(i < n), c_arr<Uint, n>>::type szs, const T& v = T{}){const usize s = (usize)szs[i];return std::vector<decltype(make_v<T, Uint, n, i + 1>(szs, v))>(s, make_v<T, Uint, n, i + 1>(szs, v));}template<typename T, typename Uint, usize n>auto make_v(c_arr<Uint, n> szs, const T& t = T{}) { return make_v<T, Uint, n, 0>(szs, t); }int main(){using pll = std::pair<ll, ll>;std::set<pll> b_d;for (int i = 1; i < 30; i++) {for (int j = i + 1; j < 30; j++) {const int g = std::gcd(i, j);b_d.insert({i / g, j / g});}}const auto T = in<int>();for (int t = 0; t < T; t++) {const auto N = in<ll>();ll ans = (2LL * N - 1) * N;for (const auto [b, d] : b_d) {const ll dn = N / d;ll inf = 0, sup = std::pow(N, ld(1) / d) + 5LL;while (sup - inf > 1) {const ll mid = (inf + sup) / 2;ll v = 1;for (int i = 0; i < d; i++) { v *= mid; }(v <= N ? inf : sup) = mid;}const ll an = inf - 1;ans += an * dn * 2LL;}outln(ans);}return 0;}