結果

問題 No.1664 Unstable f(n)
ユーザー miscalc
提出日時 2021-09-03 21:39:16
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,433 bytes
コンパイル時間 2,255 ms
コンパイル使用メモリ 193,572 KB
最終ジャッジ日時 2025-01-24 05:07:52
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
ll isok(ll a, ll b, ll c)
{
ll tmp = 1;
for (ll i = 0; i < b; i++)
{
if (tmp > c / a)
return false;
tmp *= a;
}
return true;
}
ll rt(ll b, ll c)
{
ll ok = 0, ng = 1e9 + 10;
while (abs(ok - ng) > 1)
{
ll mid = (ok + ng) / 2;
if (isok(mid, b, c))
ok = mid;
else
ng = mid;
}
return ok;
}
int main()
{
ll N;
cin >> N;
ll ans = N;
for (ll j = 2; j < 64; j++)
{
ll i = rt(j, N);
ll tmp = 1;
for (ll jj = 0; jj < j; jj++)
{
tmp *= i;
}
ll k = N - tmp;
chmin(ans, i + j + k);
//cerr << i << " " << j << " " << k << endl;
}
cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0