結果

問題 No.1666 累乗数
コンテスト
ユーザー PCTprobability
提出日時 2021-09-03 22:13:54
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,699 bytes
コンパイル時間 26,957 ms
コンパイル使用メモリ 360,528 KB
最終ジャッジ日時 2025-01-24 06:00:47
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other WA * 10 TLE * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'll subsolve(ll, ll)':
main.cpp:284:1: warning: control reaches end of non-void function [-Wreturn-type]
  284 | }
      | ^

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<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 (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
bool check(ll a,ll b,ll c){//a<=b^cかどうか
  ll now=a;
  for(int i=0;i<c;i++){
    now/=b;
    if(now==0) return false;
  }
  return true;
}
ll subsolve(ll a,ll b){//a以下でi^bと表されるものの数
  ll ans=1;
  if(b==2){
    ll ok=1,ng=2000000000;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(t*t<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i<=a&&(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==3){
    ll ok=1,ng=2000000;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(t*t*t<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i<=a&&(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==4){
    ll ok=1,ng=38000;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(t*t*t*t<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==5){
    ll ok=1,ng=4580;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,5,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==6){
    ll ok=1,ng=1130;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,6,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==7){
    ll ok=1,ng=420;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,7,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==8){
    ll ok=1,ng=200;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,8,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==9){
    ll ok=1,ng=110;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,9,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else if(b==10){
    ll ok=1,ng=70;
    while(abs(ok-ng)>1){
      ll t=(ok+ng)/2;
      if(modPow(t,10,inf)<=a){
        ok=t;
      }
      else{
        ng=t;
      }
    }
    for(ll i=ok-3;i<=ok+3;i++){
      if(i<=0) continue;
      if(i*i*i*i*i*i*i*i*i*i<=a&&(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)*(i+1)>a){
        return max(i-1,0ll);
      }
    }
  }
  else{
    if(b>=40){
      ll ans=0;
      if(check(a,2,b)) ans++;
      return ans;
    }
    if(b>=32){
      ll ans=0;
      if(check(a,2,b)) ans++;
      if(check(a,3,b)) ans++;
      return ans;
    }
    for(ll i=2;i<=a;i++){
      ll k=a;
      for(int j=0;j<b;j++){
        k/=i;
        if(k==0) return max(i-2,0ll);
      }
    }
  }
}
void solve(){
  ll k;
  cin>>k;
  ll ok=0,ng=2000000000000000000ll;
  while(abs(ok-ng)>1){
    ll t=(ok+ng)/2;
    ll now=0;
    for(ll i=2;i<=64;i++){
      ll p=subsolve(t,i);
      ll z=1;
     // cout<<t<<" "<<i<<" "<<subsolve(t,i)<<" "<<now<<endl;
      for(ll j=2;j<i;j++){
        if(i%j==0){//(x^j)^(i/j)型を除く
          z--;
        }
      }
    //  cout<<p<<" "<<z<<endl;
      now+=p*z;
    }
    now++;
   // cout<<t<<" "<<now<<endl;
    if(now>=k){
      ng=t;
    }
    else{
      ok=t;
    }
  }
  cout<<ng<<endl;
}
int main() {
  cincout();
  ll t;
  cin>>t;
  while(t--){
    solve();
  }
}
0