結果
問題 | No.1176 少ない質問 |
ユーザー |
![]() |
提出日時 | 2020-08-21 21:41:35 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 1,000 ms |
コード長 | 3,299 bytes |
コンパイル時間 | 1,536 ms |
コンパイル使用メモリ | 170,084 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 05:27:09 |
合計ジャッジ時間 | 2,291 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long#define rep(i, n) for (int i = 0; i < (int) (n); i++)#define reps(i, n) for (int i = 1; i <= (int) (n); i++)#define all(x) (x).begin(), (x).end()#define uniq(x) (x).erase(unique(all(x)), (x).end())#define bit(n) (1LL << (n))#define dump(x) cerr << #x " = " << (x) << endlusing vint = vector<int>;using vvint = vector<vint>;using pint = pair<int, int>;using vpint = vector<pint>;template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;constexpr double PI = 3.1415926535897932384626433832795028;constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};int sign(int x) { return (x > 0) - (x < 0); }int gcd(int a, int b) {while (b) { swap(a %= b, b); }return a;}int lcm(int a, int b) { return a / gcd(a, b) * b; }int cdiv(int a, int b) { return (a - 1 + b) / b; }template<typename T> void fin(T mes) {cout << mes << endl;exit(0);}template<typename T, typename U> bool chmax(T &a, const U &b) {if (a < b) {a = b;return true;}return false;}template<typename T, typename U> bool chmin(T &a, const U &b) {if (b < a) {a = b;return true;}return false;}template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {os << "(" << rhs.first << ", " << rhs.second << ")";return os;}template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T> ostream &operator<<(ostream &os, const deque<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T> ostream &operator<<(ostream &os, const set<T> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &rhs) {os << "{";for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {os << *itr << (next(itr) != rhs.end() ? ", " : "");}os << "}";return os;}struct setup {static constexpr int PREC = 20;setup() {cout << fixed << setprecision(PREC);cerr << fixed << setprecision(PREC);};} setup;template<typename F> long long discrete_binary_search(long long ok, long long ng, F is_ok) {while (abs(ok - ng) > 1) {long long mid = (ok + ng) / 2;(is_ok(mid) ? ok : ng) = mid;}return ok;}int pw(int a, int n) {if (n == 0) { return 1; }int ret = pw(a, n / 2);ret = ret * ret;if (n % 2) { ret *= a; }return ret;}signed main() {int A;cin >> A;int ans = LLONG_MAX;for (int i = 2; i <= 10; i++) {chmin(ans, discrete_binary_search((int) (log(A) / log(i)) + 2, 0, [&](int x) {return pw(i, x) >= A;}) * i);}cout << ans << endl;}