#590755 (C++17) No.1312 Snake Eyes

• 問題: No.1312 Snake Eyes
• ユーザー: hotman78
• 提出日時: 2020-12-09 00:06:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 3,473 bytes
• コンパイル時間: 3,743 ms
• コンパイル使用メモリ: 228,656 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-18 21:54:17
• 合計ジャッジ時間: 8,854 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	WA	-
testcase_04	WA	-
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	3 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	3 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	2 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	3 ms; 5,376 KB
testcase_38	AC	4 ms; 5,376 KB
testcase_39	AC	7 ms; 5,376 KB
testcase_40	AC	7 ms; 5,376 KB
testcase_41	AC	6 ms; 5,376 KB
testcase_42	AC	4 ms; 5,376 KB
testcase_43	AC	6 ms; 5,376 KB
testcase_44	AC	3 ms; 5,376 KB
testcase_45	AC	5 ms; 5,376 KB
testcase_46	AC	5 ms; 5,376 KB
testcase_47	AC	4 ms; 5,376 KB
testcase_48	AC	124 ms; 5,376 KB
testcase_49	AC	113 ms; 5,376 KB
testcase_50	AC	88 ms; 5,376 KB
testcase_51	AC	46 ms; 5,376 KB
testcase_52	AC	137 ms; 5,376 KB
testcase_53	AC	103 ms; 5,376 KB
testcase_54	AC	122 ms; 5,376 KB
testcase_55	AC	59 ms; 5,376 KB
testcase_56	AC	78 ms; 5,376 KB
testcase_57	AC	80 ms; 5,376 KB
testcase_58	AC	107 ms; 5,376 KB
testcase_59	AC	41 ms; 5,376 KB
testcase_60	AC	77 ms; 5,376 KB
testcase_61	AC	135 ms; 5,376 KB
testcase_62	AC	54 ms; 5,376 KB
testcase_63	AC	3 ms; 5,376 KB
testcase_64	AC	7 ms; 5,376 KB
testcase_65	AC	17 ms; 5,376 KB
testcase_66	AC	2 ms; 5,376 KB
testcase_67	AC	2 ms; 5,376 KB
testcase_68	AC	8 ms; 5,376 KB
testcase_69	AC	2 ms; 5,376 KB
testcase_70	AC	112 ms; 5,376 KB
testcase_71	AC	68 ms; 5,376 KB
testcase_72	AC	7 ms; 5,376 KB
testcase_73	AC	2 ms; 5,376 KB
testcase_74	AC	2 ms; 5,376 KB
testcase_75	AC	2 ms; 5,376 KB
testcase_76	AC	137 ms; 5,376 KB
testcase_77	AC	140 ms; 5,376 KB
testcase_78	AC	139 ms; 5,376 KB
testcase_79	AC	104 ms; 5,376 KB
testcase_80	AC	140 ms; 5,376 KB
testcase_81	AC	139 ms; 5,376 KB
testcase_82	AC	139 ms; 5,376 KB
testcase_83	AC	140 ms; 5,376 KB
testcase_84	AC	140 ms; 5,376 KB
testcase_85	AC	128 ms; 5,376 KB
testcase_86	AC	120 ms; 5,376 KB
testcase_87	AC	68 ms; 5,376 KB

ソースコード

#line 2 "cpplib/util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
//#include "../graph_tree/graph_template.hpp"
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
#line 2 "code.cpp"

int main(){
    lint n;
    cin>>n;
    lint ans=n-1;
    for(lint i=2;i*i<=n;++i){
        vector<lint>v;
        lint t=n;
        while(t){
            v.push_back(t%i);
            t/=i;
        }
        if(count(all(v),v[0])==(lint)v.size()){
            chmin(ans,i);
        }
    }
    for(lint i=1;i*i<=n;++i){
        if(n%i)continue;
        if(i>=3&&n/i<i-1)chmin(ans,i-1);
        if(n/i>=3&&i<n/i-1)chmin(ans,n/i-1);
    }
    cout<<ans<<endl;
}