結果
問題 | No.1312 Snake Eyes |
ユーザー |
|
提出日時 | 2020-12-25 13:27:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 2,307 bytes |
コンパイル時間 | 1,384 ms |
コンパイル使用メモリ | 134,220 KB |
最終ジャッジ日時 | 2025-01-17 07:10:13 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 85 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <cmath>#include <queue>#include <string>#include <map>#include <set>#include <stack>#include <tuple>#include <deque>#include <array>#include <numeric>#include <bitset>#include <iomanip>#include <cassert>#include <chrono>#include <random>#include <limits>#include <iterator>#include <functional>#include <sstream>#include <fstream>#include <complex>#include <cstring>#include <unordered_map>using namespace std;using ll = long long;using P = pair<int, int>;constexpr int INF = 1001001001;constexpr int mod = 1000000007;// constexpr int mod = 998244353;template<class T>inline bool chmax(T& x, T y){if(x < y){x = y;return true;}return false;}template<class T>inline bool chmin(T& x, T y){if(x > y){x = y;return true;}return false;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);ll N;cin >> N;vector<ll> d;for(ll i = 1; i * i <= N; ++i){if(N % i == 0){d.emplace_back(i);if(i * i != N) d.emplace_back(N / i);}}sort(d.begin(), d.end());vector<ll> lb(40, 2), ub(40);for(int k = 2; k < 40; ++k){ll l = 2, r = N + 1;while(r - l > 1){ll m = (l + r) / 2;bool ok = true;ll prod = 1;for(int i = 1; i < k; ++i){if(prod > (ll)1e+15 / m){ok = false;break;}prod *= m;}if(ok) l = m;else r = m;}ub[k] = r;}auto func = [](ll r, int n){ll res = 1, a = 1;for(int i = 1; i < n; ++i) res += (a *= r);return res;};ll ans = N + 1;for(ll x : d){ll y = N / x, p = 1e+17;if(y == 1) continue;for(int k = 2; k < 40; ++k){ll l = lb[k], r = ub[k];while(r - l > 1){ll m = (l + r) / 2;if(func(m, k) <= y) l = m;else r = m;}if(x < l && func(l, k) == y) chmin(p, l);}chmin(ans, p);}cout << ans << endl;return 0;}