結果
問題 | No.1312 Snake Eyes |
ユーザー | rniya |
提出日時 | 2020-12-09 00:29:02 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 4,368 bytes |
コンパイル時間 | 2,333 ms |
コンパイル使用メモリ | 202,744 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-08-20 11:10:12 |
合計ジャッジ時間 | 7,640 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,380 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 1 ms
4,380 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 2 ms
4,376 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 2 ms
4,376 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 2 ms
4,380 KB |
testcase_29 | AC | 2 ms
4,380 KB |
testcase_30 | AC | 2 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,384 KB |
testcase_32 | AC | 2 ms
4,376 KB |
testcase_33 | AC | 2 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,376 KB |
testcase_35 | AC | 2 ms
4,376 KB |
testcase_36 | AC | 2 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 3 ms
4,376 KB |
testcase_39 | AC | 6 ms
4,376 KB |
testcase_40 | AC | 6 ms
4,380 KB |
testcase_41 | AC | 5 ms
4,380 KB |
testcase_42 | AC | 3 ms
4,376 KB |
testcase_43 | AC | 5 ms
4,384 KB |
testcase_44 | AC | 3 ms
4,376 KB |
testcase_45 | AC | 4 ms
4,380 KB |
testcase_46 | AC | 5 ms
4,384 KB |
testcase_47 | AC | 3 ms
4,380 KB |
testcase_48 | AC | 118 ms
4,380 KB |
testcase_49 | AC | 106 ms
4,380 KB |
testcase_50 | AC | 84 ms
4,380 KB |
testcase_51 | AC | 44 ms
4,380 KB |
testcase_52 | AC | 132 ms
4,384 KB |
testcase_53 | AC | 99 ms
4,380 KB |
testcase_54 | AC | 117 ms
4,380 KB |
testcase_55 | AC | 57 ms
4,376 KB |
testcase_56 | AC | 75 ms
4,380 KB |
testcase_57 | AC | 76 ms
4,380 KB |
testcase_58 | AC | 101 ms
4,380 KB |
testcase_59 | AC | 38 ms
4,376 KB |
testcase_60 | AC | 73 ms
4,380 KB |
testcase_61 | AC | 131 ms
4,380 KB |
testcase_62 | AC | 51 ms
4,380 KB |
testcase_63 | AC | 2 ms
4,380 KB |
testcase_64 | AC | 1 ms
4,380 KB |
testcase_65 | AC | 2 ms
4,380 KB |
testcase_66 | AC | 1 ms
4,376 KB |
testcase_67 | AC | 1 ms
4,380 KB |
testcase_68 | AC | 2 ms
4,384 KB |
testcase_69 | AC | 2 ms
4,380 KB |
testcase_70 | AC | 1 ms
4,380 KB |
testcase_71 | AC | 2 ms
4,376 KB |
testcase_72 | AC | 2 ms
4,380 KB |
testcase_73 | AC | 1 ms
4,376 KB |
testcase_74 | AC | 2 ms
4,376 KB |
testcase_75 | AC | 2 ms
4,376 KB |
testcase_76 | AC | 131 ms
4,376 KB |
testcase_77 | AC | 133 ms
4,380 KB |
testcase_78 | AC | 133 ms
4,380 KB |
testcase_79 | AC | 1 ms
4,380 KB |
testcase_80 | AC | 124 ms
4,376 KB |
testcase_81 | AC | 87 ms
4,376 KB |
testcase_82 | AC | 3 ms
4,380 KB |
testcase_83 | AC | 133 ms
4,376 KB |
testcase_84 | AC | 133 ms
4,376 KB |
testcase_85 | AC | 2 ms
4,380 KB |
testcase_86 | AC | 2 ms
4,376 KB |
testcase_87 | AC | 66 ms
4,380 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD=1000000007; // const long long MOD=998244353; #define LOCAL #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(),(x).end() const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U,typename V> ostream&operator<<(ostream &os,const tuple<T,U,V> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template<typename T,typename U,typename V,typename W> ostream&operator<<(ostream &os,const tuple<T,U,V,W> &t){ os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const unordered_map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const multiset<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const unordered_set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();){ os << *itr; if (++itr!=s.end()) os << ','; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const deque<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; auto check=[&](int p){ vector<int> v; for (ll n=N;n>0;n/=p){ v.emplace_back(n%p); } for (int i=1;i<v.size();++i){ if (v[i]!=v[0]){ return false; } } return true; }; for (int i=2;(ll)i*i<=N;++i){ if (check(i)){ cout << i << '\n'; return 0; } } auto divisor=[](ll n){ vector<ll> res; for (int i=1;(ll)i*i<=n;++i){ if (n%i==0){ res.emplace_back(i); if (n/i!=i) res.emplace_back(n/i); } } return res; }; vector<ll> d=divisor(N); ll ans=N+1; for (ll x:d){ ll p=N/x-1; if (x<p) ans=min(ans,p); } cout << ans << '\n'; }