結果

問題 No.1666 累乗数
ユーザー fuppy_kyoprofuppy_kyopro
提出日時 2021-09-03 21:46:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 572 ms / 2,000 ms
コード長 4,461 bytes
コンパイル時間 2,174 ms
コンパイル使用メモリ 202,440 KB
実行使用メモリ 4,504 KB
最終ジャッジ日時 2023-08-21 20:56:37
合計ジャッジ時間 13,901 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
4,380 KB
testcase_01 AC 556 ms
4,380 KB
testcase_02 AC 554 ms
4,376 KB
testcase_03 AC 554 ms
4,380 KB
testcase_04 AC 554 ms
4,380 KB
testcase_05 AC 569 ms
4,380 KB
testcase_06 AC 572 ms
4,380 KB
testcase_07 AC 570 ms
4,380 KB
testcase_08 AC 567 ms
4,380 KB
testcase_09 AC 561 ms
4,504 KB
testcase_10 AC 558 ms
4,376 KB
testcase_11 AC 560 ms
4,380 KB
testcase_12 AC 561 ms
4,380 KB
testcase_13 AC 569 ms
4,376 KB
testcase_14 AC 571 ms
4,376 KB
testcase_15 AC 571 ms
4,380 KB
testcase_16 AC 572 ms
4,376 KB
testcase_17 AC 564 ms
4,380 KB
testcase_18 AC 566 ms
4,380 KB
testcase_19 AC 566 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

#include <bits/stdc++.h>

// #include <atcoder/all>
// #include <atcoder/string>

using namespace std;
// using namespace atcoder;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                            \
    cerr << #v << endl;                         \
    for (int i = 0; i < v.size(); i++) {        \
        for (int j = 0; j < v[i].size(); j++) { \
            cerr << v[i][j] << " ";             \
        }                                       \
        cerr << endl;                           \
    }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

ll f(ll x) {
    int m = 62;
    vl ans(m);
    for (int b = m - 1; b >= 2; b--) {
        ll ok = 1, ng = (ll)1e9 + 10;
        while (ok + 1 < ng) {
            ll mid = (ok + ng) / 2;

            ll now = 1;
            rep(_, b) {
                if ((double)now * mid > 2 * INF) {
                    now = 2 * INF;
                    break;
                }
                now *= mid;
            }
            if (now <= x)
                ok = mid;
            else
                ng = mid;
        }

        ans[b] = ok - 1;
        for (int i = 2; i * b < m; i++)
            ans[b] -= ans[i * b];
    }
    // DEBUG(x);
    // DEBUG_VEC(ans);

    ll res = 0;
    rep(i, m) res += ans[i];
    return res + 1;
}

void solve() {
    ll k;
    cin >> k;

    ll ng = 0, ok = INF;
    while (ng + 1 < ok) {
        ll x = (ng + ok) / 2;
        ll num = f(x);

        if (num >= k)
            ok = x;
        else
            ng = x;
    }
    cout << ok << endl;
}

signed main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}
0