#590799 (C++14) No.1312 Snake Eyes

• 問題: No.1312 Snake Eyes
• ユーザー: fuppy_kyopro
• 提出日時: 2020-12-09 00:16:54
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 3,700 bytes
• コンパイル時間: 3,145 ms
• コンパイル使用メモリ: 184,376 KB
• 実行使用メモリ: 4,388 KB
• 最終ジャッジ日時: 2023-08-20 11:08:54
• 合計ジャッジ時間: 6,135 ms
• ジャッジサーバーID （参考情報）: judge13 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,384 KB
testcase_01	AC	2 ms; 4,384 KB
testcase_02	AC	2 ms; 4,384 KB
testcase_03	AC	2 ms; 4,384 KB
testcase_04	AC	2 ms; 4,380 KB
testcase_05	AC	2 ms; 4,380 KB
testcase_06	AC	1 ms; 4,384 KB
testcase_07	AC	2 ms; 4,380 KB
testcase_08	AC	2 ms; 4,380 KB
testcase_09	AC	2 ms; 4,380 KB
testcase_10	AC	1 ms; 4,384 KB
testcase_11	AC	2 ms; 4,380 KB
testcase_12	AC	2 ms; 4,380 KB
testcase_13	AC	1 ms; 4,384 KB
testcase_14	AC	2 ms; 4,380 KB
testcase_15	AC	2 ms; 4,380 KB
testcase_16	AC	2 ms; 4,384 KB
testcase_17	AC	2 ms; 4,380 KB
testcase_18	AC	2 ms; 4,384 KB
testcase_19	AC	2 ms; 4,384 KB
testcase_20	AC	2 ms; 4,384 KB
testcase_21	AC	1 ms; 4,384 KB
testcase_22	AC	1 ms; 4,380 KB
testcase_23	AC	2 ms; 4,384 KB
testcase_24	AC	2 ms; 4,380 KB
testcase_25	AC	2 ms; 4,380 KB
testcase_26	AC	2 ms; 4,384 KB
testcase_27	AC	2 ms; 4,384 KB
testcase_28	AC	2 ms; 4,380 KB
testcase_29	AC	2 ms; 4,384 KB
testcase_30	AC	2 ms; 4,380 KB
testcase_31	AC	2 ms; 4,384 KB
testcase_32	AC	1 ms; 4,380 KB
testcase_33	AC	2 ms; 4,388 KB
testcase_34	AC	2 ms; 4,380 KB
testcase_35	AC	1 ms; 4,380 KB
testcase_36	AC	2 ms; 4,384 KB
testcase_37	AC	2 ms; 4,380 KB
testcase_38	AC	2 ms; 4,384 KB
testcase_39	AC	3 ms; 4,384 KB
testcase_40	AC	3 ms; 4,380 KB
testcase_41	AC	3 ms; 4,380 KB
testcase_42	AC	2 ms; 4,380 KB
testcase_43	AC	3 ms; 4,384 KB
testcase_44	AC	2 ms; 4,380 KB
testcase_45	AC	3 ms; 4,380 KB
testcase_46	AC	3 ms; 4,384 KB
testcase_47	AC	2 ms; 4,380 KB
testcase_48	AC	32 ms; 4,380 KB
testcase_49	AC	28 ms; 4,380 KB
testcase_50	AC	23 ms; 4,380 KB
testcase_51	AC	12 ms; 4,384 KB
testcase_52	AC	35 ms; 4,384 KB
testcase_53	AC	26 ms; 4,384 KB
testcase_54	AC	31 ms; 4,380 KB
testcase_55	AC	16 ms; 4,384 KB
testcase_56	AC	20 ms; 4,384 KB
testcase_57	AC	20 ms; 4,384 KB
testcase_58	AC	27 ms; 4,384 KB
testcase_59	AC	11 ms; 4,384 KB
testcase_60	AC	20 ms; 4,384 KB
testcase_61	AC	35 ms; 4,384 KB
testcase_62	AC	15 ms; 4,384 KB
testcase_63	AC	1 ms; 4,384 KB
testcase_64	AC	1 ms; 4,384 KB
testcase_65	AC	2 ms; 4,380 KB
testcase_66	AC	2 ms; 4,384 KB
testcase_67	AC	2 ms; 4,384 KB
testcase_68	AC	2 ms; 4,384 KB
testcase_69	AC	1 ms; 4,380 KB
testcase_70	AC	2 ms; 4,380 KB
testcase_71	AC	2 ms; 4,380 KB
testcase_72	AC	1 ms; 4,384 KB
testcase_73	AC	1 ms; 4,380 KB
testcase_74	AC	2 ms; 4,380 KB
testcase_75	AC	2 ms; 4,384 KB
testcase_76	AC	34 ms; 4,380 KB
testcase_77	AC	35 ms; 4,384 KB
testcase_78	AC	35 ms; 4,380 KB
testcase_79	AC	2 ms; 4,380 KB
testcase_80	AC	24 ms; 4,384 KB
testcase_81	AC	18 ms; 4,380 KB
testcase_82	AC	2 ms; 4,380 KB
testcase_83	AC	35 ms; 4,380 KB
testcase_84	AC	35 ms; 4,384 KB
testcase_85	AC	2 ms; 4,384 KB
testcase_86	AC	2 ms; 4,384 KB
testcase_87	AC	18 ms; 4,384 KB

ソースコード

//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
 
#include <bits/stdc++.h>
 
// #include <atcoder/all>
 
using namespace std;
// using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}
void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}
void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}
void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}
void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}
void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

signed main() {
    fio();
    
    ll n;
    cin >> n;
    if (n <= 2) {
        cout << n + 1 << endl;
        return 0;
    }

    ll two = -1;
    for (ll p = 2; p < n; p++) {
        ll max = 1;
        for (int keta = 1; keta < 50; keta++) {
            max *= p;
            if (n >= max) continue;
            if (keta == 2) {
                DEBUG(pll(p, max));
                two = p;
                break;
            }
            else {
                ll base = (max - 1) / (p - 1);
                if (n % base == 0) {
                    cout << p << endl;
                    return 0;
                }
                break;
            }
        }
        if (two != -1) break;
    }
    DEBUG(two);

    ll ans = INF;
    for (ll x = 1; x * x <= n; x++) {
        if (n % x != 0) continue;
        vl temp = {x, n / x};

        for (ll y: temp) {
            ll p = y - 1;
            if (p < two) continue;
            if (p >= n) continue;
            chmin(ans, p);
        }
    }
    cout << ans << endl;
}