結果

問題 No.1666 累乗数
ユーザー Aoxiang CuiAoxiang Cui
提出日時 2021-09-03 21:51:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 414 ms / 2,000 ms
コード長 4,468 bytes
コンパイル時間 1,155 ms
コンパイル使用メモリ 116,860 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-05-09 03:24:23
合計ジャッジ時間 9,766 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
5,248 KB
testcase_01 AC 414 ms
5,376 KB
testcase_02 AC 412 ms
5,376 KB
testcase_03 AC 411 ms
5,376 KB
testcase_04 AC 411 ms
5,376 KB
testcase_05 AC 411 ms
5,376 KB
testcase_06 AC 412 ms
5,376 KB
testcase_07 AC 411 ms
5,376 KB
testcase_08 AC 410 ms
5,376 KB
testcase_09 AC 411 ms
5,376 KB
testcase_10 AC 411 ms
5,376 KB
testcase_11 AC 410 ms
5,376 KB
testcase_12 AC 412 ms
5,376 KB
testcase_13 AC 412 ms
5,376 KB
testcase_14 AC 410 ms
5,376 KB
testcase_15 AC 410 ms
5,376 KB
testcase_16 AC 410 ms
5,376 KB
testcase_17 AC 411 ms
5,376 KB
testcase_18 AC 410 ms
5,376 KB
testcase_19 AC 410 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
// mt19937_64 mrand(random_device{}());
// int64 rnd(int64 x) { return mrand() % x; }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 100;
bool flag[N];
int mu[N];
vector<int> prime;

void mu_gen(int n = N) {
  fill(flag, flag + n, false);
  mu[1] = 1;
  for (int i = 2; i < n; ++i) {
    if (!flag[i]) {
      prime.push_back(i);
      mu[i] = -1;
    }
    for (int j = 0, k; j < SZ(prime) && (k = prime[j] * i) < n; ++j) {
      flag[k] = true;
      if (i % prime[j]) {
        mu[k] = -mu[i];
      } else {
        mu[k] = 0;
        break;
      }
    }
  }
}

__int128 power(int64 x, int64 n) {
  __int128 ret = 1;
  for (int i = 0; i < n; ++i) ret *= x;
  return ret;
}

int64 solve(int64 n) {
  int64 ret = 1;
  for (int k = 2; k <= 60; ++k) {
    int64 x = (int64)pow(1.0 * n, 1.0 / k);
    while (power(x + 1, k) <= n) ++x;
    while (power(x, k) > n) --x;
    ret -= (x - 1) * mu[k];
  }
  return ret;
}

int main() {
  mu_gen();
  // for (int i = 2; i < N; ++i) {
  //   trace(i, mu[i]);
  // }
  int cas;
  cin >> cas;
  while (cas--) {
    int m;
    cin >> m;
    int64 low = 1, high = 1LL << 60;
    while (low != high) {
      int64 mid = (low + high) / 2;
      // trace(mid, solve(mid));
      if (solve(mid) < m) {
        low = mid + 1;
      } else {
        high = mid;
      }
    }
    cout << high << '\n';
  }

  return 0;
}
0