結果
問題 | No.2 素因数ゲーム |
ユーザー | 37kt_ |
提出日時 | 2016-01-13 20:56:01 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 74 ms / 5,000 ms |
コード長 | 3,472 bytes |
コンパイル時間 | 1,599 ms |
コンパイル使用メモリ | 172,020 KB |
実行使用メモリ | 21,228 KB |
最終ジャッジ日時 | 2024-06-08 00:16:07 |
合計ジャッジ時間 | 4,754 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
21,100 KB |
testcase_01 | AC | 73 ms
21,096 KB |
testcase_02 | AC | 73 ms
20,976 KB |
testcase_03 | AC | 72 ms
20,972 KB |
testcase_04 | AC | 72 ms
21,096 KB |
testcase_05 | AC | 73 ms
20,972 KB |
testcase_06 | AC | 72 ms
21,100 KB |
testcase_07 | AC | 74 ms
20,968 KB |
testcase_08 | AC | 74 ms
21,100 KB |
testcase_09 | AC | 73 ms
21,100 KB |
testcase_10 | AC | 73 ms
21,100 KB |
testcase_11 | AC | 73 ms
21,228 KB |
testcase_12 | AC | 74 ms
21,108 KB |
testcase_13 | AC | 72 ms
20,972 KB |
testcase_14 | AC | 72 ms
20,976 KB |
testcase_15 | AC | 73 ms
21,100 KB |
testcase_16 | AC | 73 ms
21,100 KB |
testcase_17 | AC | 74 ms
21,096 KB |
testcase_18 | AC | 73 ms
21,100 KB |
testcase_19 | AC | 74 ms
21,100 KB |
testcase_20 | AC | 73 ms
21,100 KB |
testcase_21 | AC | 73 ms
21,096 KB |
testcase_22 | AC | 73 ms
21,100 KB |
testcase_23 | AC | 72 ms
21,100 KB |
testcase_24 | AC | 74 ms
21,100 KB |
testcase_25 | AC | 73 ms
20,972 KB |
testcase_26 | AC | 74 ms
20,972 KB |
testcase_27 | AC | 73 ms
21,096 KB |
testcase_28 | AC | 73 ms
20,972 KB |
testcase_29 | AC | 73 ms
21,032 KB |
testcase_30 | AC | 73 ms
21,096 KB |
ソースコード
// template {{{ #include <bits/stdc++.h> using namespace std; // #define int long long #define GET_MACRO(a, b, c, d, NAME, ...) NAME #define REP2(i, n) REP3(i, 0, n) #define REP3(i, a, b) REP4(i, a, b, 1) #define REP4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += s) #define RREP2(i, n) RREP3(i, 0, n) #define RREP3(i, a, b) for (ll i = (b) - 1; i >= (ll)(a); i--) #define rep(...) GET_MACRO(__VA_ARGS__, REP4, REP3, REP2)(__VA_ARGS__) #define rrep(...) GET_MACRO(__VA_ARGS__,, RREP3, RREP2)(__VA_ARGS__) #define eb emplace_back #define ef emplace_front #define pb pop_back #define pf pop_front #define all(c) begin(c), end(c) #define mp make_pair #define mt make_tuple #define fi first #define se second #define popcnt __builtin_popcountll using uint = unsigned; using ll = long long; using ull = unsigned long long; using ld = long double; using vi = vector<int>; using vvi = vector<vi>; template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>; template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; const int INF = 1e9 + 10; const ll LLINF = 1e18 + 10; const int dx[] = {-1, 0, 1, 0}; const int dy[] = {0, -1, 0, 1}; const int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1}; const int dy8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template<typename T> inline T sq(T x){ return x * x; } template<typename T, typename U> inline bool chmax(T &x, U y){ if (x >= y) return false; x = y; return true; } template<typename T, typename U> inline bool chmin(T &x, U y){ if (x <= y) return false; x = y; return true; } template<typename T> inline T& sort(T &c){ sort(all(c)); return c; } template<typename T> inline T& reverse(T &c){ reverse(all(c)); return c; } template<typename T> inline T& unique(T &c){ sort(all(c)); c.erase(unique(all(c)), end(c)); return c; } template<typename T> inline T sorted(const T &c){ T d = c; return sort(d); } template<typename T> inline T reversed(const T &c){ T d = c; return reverse(d); } template<typename T> inline T uniqued(const T &c){ T d = c; return unique(d); } template<typename T> T power(T x, long long r, const T &e = 1){ T res(e); while (r){ if (r & 1) res = res * x; x = x * x; r >>= 1; } return res; } // }}} // prime {{{ namespace { const int PRIME_N = 10000010; bool prime[PRIME_N]; vector<ll> primes; bool isPrime(ll x){ for (ll i = 2; i * i <= x; i++){ if (x % i == 0) return false; } return true; } vector<ll> primeFactor(ll x){ vector<ll> res; for (ll i = 2, xx = x; i * i <= xx; i++){ while (x % i == 0){ res.push_back(i); x /= i; } } if (x > 1) res.push_back(x); return res; } vector<ll> divisors(ll x){ vector<ll> res; for (ll i = 1; i * i <= x; i++){ if (x % i == 0){ res.push_back(i); res.push_back(x / i); } } return unique(res); } struct prepare { prepare(){ for (ll i = 2; i < PRIME_N; i++){ prime[i] = true; } for (ll i = 2; i * i < PRIME_N; i++){ if (!prime[i]) continue; for (ll j = i * i; j < PRIME_N; j += i){ prime[j] = false; } } for (ll i = 0; i < PRIME_N; i++){ if (prime[i]){ primes.push_back(i); } } } } prepare_; } // }}} ll n; vector<ll> v; map<ll, int> dp; int calc(ll x) { if (x == 1) return -1; if (dp[x]) return dp[x]; ll r = 1; for (ll a : v){ ll t = x; while (t % a == 0){ chmin(r, calc(t /= a)); } } return dp[x] = -r; } int main() { cin >> n; v = uniqued(primeFactor(n)); cout << (calc(n) > 0 ? "Alice" : "Bob") << endl; }