結果
問題 | No.1666 累乗数 |
ユーザー | au7777 |
提出日時 | 2022-07-24 01:55:36 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,597 bytes |
コンパイル時間 | 4,032 ms |
コンパイル使用メモリ | 239,780 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-05 17:32:54 |
合計ジャッジ時間 | 4,361 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>typedef long long int ll;using namespace std;using namespace atcoder;typedef pair<ll, ll> P;// const ll MOD = 998244353;const ll MOD = 1000000007;// using mint = modint998244353;using mint = modint1000000007;const double pi = 3.1415926536;const int MAX = 2000005;long long fac[MAX], finv[MAX], inv[MAX];template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;void COMinit() {fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}// 二項係数計算long long COM(int n, int k){if (n < k) return 0;if (n < 0 || k < 0) return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}ll gcd(ll x, ll y) {if (y == 0) return x;else if (y > x) {return gcd (y, x);}else return gcd(x % y, y);}ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}ll my_sqrt(ll x) {ll m = 0;ll M = 3000000001;while (M - m > 1) {ll now = (M + m) / 2;if (now * now <= x) {m = now;}else {M = now;}}return m;}ll keta(ll n, ll hou) {ll ret = 0;while (n) {n /= hou;ret++;}return ret;}ll ceil(ll n, ll m) {// n > 0, m > 0ll ret = n / m;if (n % m) ret++;return ret;}ll pow_ll(ll x, ll n) {if (n == 0) return 1;if (n % 2) {return pow_ll(x, n - 1) * x;}else {ll tmp = pow_ll(x, n / 2);return tmp * tmp;}}vector<ll> compress(vector<ll> v) {// [3 5 5 6 1 1 10 1] -> [1 2 2 3 0 0 4 0]vector<ll> u = v;sort(u.begin(), u.end());u.erase(unique(u.begin(),u.end()),u.end());map<ll, ll> mp;for (int i = 0; i < u.size(); i++) {mp[u[i]] = i;}for (int i = 0; i < v.size(); i++) {v[i] = mp[v[i]];}return v;}ll g(ll n, ll x) {// a^n <= xなるaの個数 (a >= 2)ll M = 1000000001;ll m = 1;while (M - m > 1) {ll mid = (M + m) / 2;ll st = 1;bool ok = true;for (int i = 0; i < n; i++) {if (st > x / mid) {ok = false;break;}st *= mid;}if (st > x) ok = false;if (ok) {m = mid;}else {M = mid;}}return m - 1;}ll f(ll x) {// x以下の累乗数の個数ll ret = 0;for (ll i = 2; i <= 64; i++) {// i乗数bool ok = true;int cnt = 0;ll tmp = i;for (ll j = 2; j <= 61; j++) {if (tmp % (j * j) == 0) ok = false;if (tmp % j == 0) cnt++;while (tmp % j == 0) {tmp /= j;}}if (!ok) continue;if (cnt % 2) {// ret += g(i, x);}else {// ret -= g(i, x);}}return ret + 1;}int main() {int t;cin>>t;ll k[t];for (int i = 0; i < t; i++) {cin>>k[i];}for (int i=0; i < t; i++) {ll M = (ll)1e18;ll m = 0;while (M - m > 1) {ll mid = (M + m) / 2;if (f(mid) < k[i]) {m = mid;}else {M = mid;}}cout << M << endl;}return 0;}