結果

問題 No.1666 累乗数
ユーザー miscalc
提出日時 2021-09-03 22:39:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 946 ms / 2,000 ms
コード長 1,874 bytes
コンパイル時間 2,215 ms
コンパイル使用メモリ 196,596 KB
最終ジャッジ日時 2025-01-24 06:29:15
ジャッジサーバーID
（参考情報） 		judge5 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
ll isok(ll a, ll b, ll c)
{
  ll tmp = 1;
  for (ll i = 0; i < b; i++)
  {
    if (tmp > c / a)
      return false;
    tmp *= a;
  }
  return true;
}
ll rt(ll b, ll c)
{
  ll ok = 0, ng = 1e9 + 10;
  while (abs(ok - ng) > 1)
  {
    ll mid = (ok + ng) / 2;
    if (isok(mid, b, c))
      ok = mid;
    else
      ng = mid;
  }
  return ok;
}
vector<ll> mb = {0, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, 1, 0, -1, 0, -1, 0, 1, 1, -1, 0, 0, 1, 0, 0, -1, -1, -1, 0, 1, 1, 1, 0, -1, 1, 1, 
    0, -1, -1, -1, 0, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 1, 0, 1, 1, -1, 0, -1, 1, 0, 0, 1, -1, -1, 0, 1, -1, -1, 0, -1, 1, 0, 0, 1, -1};
ll count(ll c)
{
  ll ret = 0;
  for (ll b = 2; b < 64; b++)
  {
    ll tmp = -mb.at(b) * rt(b, c);
    ret += tmp;
  }
  return ret;
}
int main()
{
  cerr << count(10) << endl;
  ll T;
  cin >> T;
  for (ll t = 0; t < T; t++)
  {
    ll K;
    cin >> K;
    ll ok = 0, ng = 1e18 + 10;
    while (abs(ok - ng) > 1)
    {
      ll mid = (ok + ng) / 2;
      if (count(mid) <= K)
        ok = mid;
      else
        ng = mid;
    }
    cout << ok + 1 << '\n';
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0