結果
問題 | No.1312 Snake Eyes |
ユーザー |
|
提出日時 | 2020-12-09 04:04:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 284 ms / 2,000 ms |
コード長 | 3,716 bytes |
コンパイル時間 | 2,724 ms |
コンパイル使用メモリ | 206,448 KB |
最終ジャッジ日時 | 2025-01-16 20:34:06 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 85 |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; #define ALL(obj) (obj).begin(),(obj).end() template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>; constexpr long long MOD = 1'000'000'000LL + 7; //' constexpr long long MOD2 = 998244353; constexpr long long HIGHINF = (long long)1e18; constexpr long long LOWINF = (long long)1e15; constexpr long double PI = 3.1415926535897932384626433L; template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);} template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));} template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}} template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;} template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;} template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;} template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;} void print(void) {cout << endl;} template <class Head> void print(Head&& head) {cout << head;print();} template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);} template <class T> void chmax(T& a, const T b){a=max(a,b);} template <class T> void chmin(T& a, const T b){a=min(a,b);} vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;} int msb(int x) {return x?31-__builtin_clz(x):-1;} void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;} void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;} void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;} /* * @title NBase - N進数 * @docs md/util/NBase.md */ class NBase{ public: inline static vector<long long> translate(long long X,long long N) { assert(abs(N)>1); vector<long long> res; while(1) { long long b = (X%abs(N)+abs(N)) % abs(N); res.push_back(b); (X -= b) /= N; if(X==0) break; } return res; } //Digit Sum inline static constexpr long long digit_sum(long long N, long long K) { long long sum = 0; for (; N > 0; N /= K) sum += N % K; return sum; } }; //divisor O(sqrt(N)) set<long long> Divisor(long long N) { set<long long> ret; for (long long i = 1; i*i <= N; ++i) { if (N%i == 0) { ret.insert(i); ret.insert(N / i); } } return ret; } //verify https://atcoder.jp/contests/abc112/tasks/abc112_d /** * @url * @est */ int main() { cin.tie(0);ios::sync_with_stdio(false); ll N; cin >> N; corner(N==1,2); ll ans = N+1; for(ll p=2;p*p<=N;++p) { auto v = NBase::translate(N,p); int flg=1; for(int i=0;i+1<v.size();++i)if(v[i]!=v[i+1])flg=0; if(flg) chmin(ans,p); } auto D = Divisor(N); for(ll k:D) { ll p = N/k-1; if(p>=2 && p>(N/p)) chmin(ans,p); } cout << ans << endl; return 0; }