#696142 (C++14) No.1666 累乗数

• 問題: No.1666 累乗数
• ユーザー: kwm_t
• 提出日時: 2021-09-04 00:28:17
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,851 ms / 2,000 ms
• コード長: 2,031 bytes
• コンパイル時間: 1,758 ms
• コンパイル使用メモリ: 168,304 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-09 09:00:49
• 合計ジャッジ時間: 36,862 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	37 ms; 5,248 KB
testcase_01	AC	1,772 ms; 5,376 KB
testcase_02	AC	1,762 ms; 5,376 KB
testcase_03	AC	1,766 ms; 5,376 KB
testcase_04	AC	1,769 ms; 5,376 KB
testcase_05	AC	1,802 ms; 5,376 KB
testcase_06	AC	1,801 ms; 5,376 KB
testcase_07	AC	1,801 ms; 5,376 KB
testcase_08	AC	1,803 ms; 5,376 KB
testcase_09	AC	1,794 ms; 5,376 KB
testcase_10	AC	1,796 ms; 5,376 KB
testcase_11	AC	1,798 ms; 5,376 KB
testcase_12	AC	1,796 ms; 5,376 KB
testcase_13	AC	1,817 ms; 5,376 KB
testcase_14	AC	1,814 ms; 5,376 KB
testcase_15	AC	1,815 ms; 5,376 KB
testcase_16	AC	1,827 ms; 5,376 KB
testcase_17	AC	1,823 ms; 5,376 KB
testcase_18	AC	1,819 ms; 5,376 KB
testcase_19	AC	1,851 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
void lldebug(vector<long long>v) {
	rep(i, v.size()) cout << v[i] << " ";
	cout << endl;
}
bool f2(long long x, int y, long long z) {
	//	true:x^y <= z
	long long mul = 1;
	rep(i, y) {
		if (mul <= (z / x))mul *= x;
		else return false;
	}
	return  true;
}
long long calc(int x, long long y) {
	// x^? <= y なmax 
	long long ok = 0;
	long long ng = LINF + 1;
	while (1 < abs(ok - ng)) {
		long long c = (ng + ok) / 2;
		if (f2(c, x, y)) ok = c;
		else ng = c;
	}
	return ok;
}
bool f(long long x, long long k) {
	long long count = 1;
	vector<long long>c(61);
	//c[0]とc[1]はないよ
	rep2(i, 2, 61) c[i] = max(0LL, calc(i, x) - 1);
	//lldebug(c);
	rrep2(i, 2, 61)rep2(j, 2, i)if (0 == (i%j))c[j] -= c[i];
	rep2(i, 2, 61)count += c[i];
	//lldebug(c);
	//cout << x << " " << k << " " << count << endl;
	return k <= count;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	//cout << f(50, 10) << endl;
	//return 0;
	int t; cin >> t;
	while (t--) {
		int k; cin >> k;
		long long ng = 0;
		long long ok = LINF + 1;
		while (1 < abs(ok - ng)) {
			long long c = (ng + ok) / 2;
			if (f(c, k)) ok = c;
			else ng = c;
		}
		cout << ok << endl;
	}
	return 0;
}