結果
問題 | No.1312 Snake Eyes |
ユーザー | 👑 hitonanode |
提出日時 | 2020-12-17 01:19:05 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 81 ms / 2,000 ms |
コード長 | 6,895 bytes |
コンパイル時間 | 2,885 ms |
コンパイル使用メモリ | 216,188 KB |
実行使用メモリ | 7,772 KB |
最終ジャッジ日時 | 2023-08-20 11:26:28 |
合計ジャッジ時間 | 7,419 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,380 KB |
testcase_04 | AC | 2 ms
4,384 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,384 KB |
testcase_08 | AC | 2 ms
4,384 KB |
testcase_09 | AC | 1 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 | 2 ms
4,384 KB |
testcase_14 | AC | 2 ms
4,384 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,380 KB |
testcase_18 | AC | 2 ms
4,384 KB |
testcase_19 | AC | 1 ms
4,380 KB |
testcase_20 | AC | 1 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,384 KB |
testcase_22 | AC | 1 ms
4,384 KB |
testcase_23 | AC | 2 ms
4,380 KB |
testcase_24 | AC | 3 ms
4,380 KB |
testcase_25 | AC | 2 ms
4,380 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 9 ms
4,384 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,384 KB |
testcase_33 | AC | 5 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 6 ms
4,380 KB |
testcase_36 | AC | 2 ms
4,384 KB |
testcase_37 | AC | 3 ms
4,380 KB |
testcase_38 | AC | 3 ms
4,380 KB |
testcase_39 | AC | 79 ms
7,544 KB |
testcase_40 | AC | 8 ms
4,380 KB |
testcase_41 | AC | 55 ms
4,384 KB |
testcase_42 | AC | 80 ms
7,672 KB |
testcase_43 | AC | 79 ms
7,572 KB |
testcase_44 | AC | 59 ms
4,384 KB |
testcase_45 | AC | 9 ms
4,380 KB |
testcase_46 | AC | 80 ms
7,668 KB |
testcase_47 | AC | 79 ms
7,672 KB |
testcase_48 | AC | 33 ms
4,384 KB |
testcase_49 | AC | 54 ms
4,380 KB |
testcase_50 | AC | 80 ms
7,672 KB |
testcase_51 | AC | 81 ms
7,708 KB |
testcase_52 | AC | 80 ms
7,704 KB |
testcase_53 | AC | 79 ms
7,728 KB |
testcase_54 | AC | 79 ms
7,712 KB |
testcase_55 | AC | 80 ms
7,540 KB |
testcase_56 | AC | 22 ms
4,380 KB |
testcase_57 | AC | 80 ms
7,696 KB |
testcase_58 | AC | 80 ms
7,600 KB |
testcase_59 | AC | 13 ms
4,384 KB |
testcase_60 | AC | 80 ms
7,568 KB |
testcase_61 | AC | 53 ms
4,380 KB |
testcase_62 | AC | 15 ms
4,384 KB |
testcase_63 | AC | 1 ms
4,384 KB |
testcase_64 | AC | 1 ms
4,380 KB |
testcase_65 | AC | 2 ms
4,380 KB |
testcase_66 | AC | 2 ms
4,380 KB |
testcase_67 | AC | 2 ms
4,380 KB |
testcase_68 | AC | 2 ms
4,384 KB |
testcase_69 | AC | 1 ms
4,384 KB |
testcase_70 | AC | 2 ms
4,384 KB |
testcase_71 | AC | 2 ms
4,380 KB |
testcase_72 | AC | 2 ms
4,380 KB |
testcase_73 | AC | 2 ms
4,384 KB |
testcase_74 | AC | 2 ms
4,380 KB |
testcase_75 | AC | 2 ms
4,380 KB |
testcase_76 | AC | 34 ms
4,380 KB |
testcase_77 | AC | 79 ms
7,640 KB |
testcase_78 | AC | 33 ms
4,380 KB |
testcase_79 | AC | 2 ms
4,384 KB |
testcase_80 | AC | 34 ms
4,380 KB |
testcase_81 | AC | 25 ms
4,384 KB |
testcase_82 | AC | 2 ms
4,380 KB |
testcase_83 | AC | 43 ms
4,380 KB |
testcase_84 | AC | 79 ms
7,772 KB |
testcase_85 | AC | 2 ms
4,380 KB |
testcase_86 | AC | 2 ms
4,384 KB |
testcase_87 | AC | 80 ms
7,628 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using lint = long long; using pint = pair<int, int>; using plint = pair<lint, lint>; struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++) #define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template <typename T, typename V> void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); } template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); } template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); } template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); } template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; } template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; } #if __cplusplus >= 201703L template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; } template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; } #endif template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; } template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; } #ifdef HITONANODE_LOCAL const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m"; #define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl #else #define dbg(x) {} #endif // Sieve of Eratosthenes // (*this)[i] = (divisor of i, greater than 1) // Example: [0, 1, 2, 3, 2, 5, 3, 7, 2, 3, 2, 11, ...] // Complexity: Space O(MAXN), Time (construction) O(MAXNloglogMAXN) struct SieveOfEratosthenes : std::vector<int> { std::vector<int> primes; SieveOfEratosthenes(int MAXN) : std::vector<int>(MAXN + 1) { std::iota(begin(), end(), 0); for (int i = 2; i <= MAXN; i++) { if ((*this)[i] == i) { primes.push_back(i); for (int j = i; j <= MAXN; j += i) (*this)[j] = i; } } } using T = long long int; // Prime factorization for x <= MAXN^2 // Complexity: O(log x) (x <= MAXN) // O(MAXN / logMAXN) (MAXN < x <= MAXN^2) std::map<T, int> Factorize(T x) { assert(x <= 1LL * (int(size()) - 1) * (int(size()) - 1)); std::map<T, int> ret; if (x < int(size())) { while (x > 1) { ret[(*this)[x]]++; x /= (*this)[x]; } } else { for (auto p : primes) { while (!(x % p)) x /= p, ret[p]++; if (x == 1) break; } if (x > 1) ret[x]++; } return ret; } std::vector<T> Divisors(T x) { std::vector<T> ret{1}; for (auto p : Factorize(x)) { int n = ret.size(); for (int i = 0; i < n; i++) { for (T a = 1, d = 1; d <= p.second; d++) { a *= p.first; ret.push_back(ret[i] * a); } } } return ret; // Not sorted } // Moebius function Table // return: [0=>0, 1=>1, 2=>-1, 3=>-1, 4=>0, 5=>-1, 6=>1, 7=>-1, 8=>0, ...] std::vector<int> GenerateMoebiusFunctionTable() { std::vector<int> ret(size()); for (int i = 1; i < int(size()); i++) { if (i == 1) ret[i] = 1; else if ((i / (*this)[i]) % (*this)[i] == 0) ret[i] = 0; else ret[i] = -ret[i / (*this)[i]]; } return ret; } }; void test(lint N, int p) { const int d = N % p; while (N) { int m = N % p; if (d != m) return; N /= p; } cout << p << '\n'; exit(0); } int main() { lint N; cin >> N; FOR(p, 2, 2000000) test(N, p); SieveOfEratosthenes sieve(1000000); auto divs = sieve.Divisors(N); sort(divs.begin(), divs.end()); for (auto pp1 : divs) { lint p = pp1 - 1; if (p == 0) continue; lint y = N / pp1; if (y < p) { cout << p << '\n'; return 0; } } }