結果
問題 | No.2 素因数ゲーム |
ユーザー | Hitsuji |
提出日時 | 2020-07-12 17:09:15 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 5,000 ms |
コード長 | 8,227 bytes |
コンパイル時間 | 2,133 ms |
コンパイル使用メモリ | 175,228 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 15:26:35 |
合計ジャッジ時間 | 2,808 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 1 ms
5,248 KB |
testcase_04 | AC | 1 ms
5,248 KB |
testcase_05 | AC | 1 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 1 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 1 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 1 ms
5,248 KB |
testcase_25 | AC | 2 ms
5,248 KB |
testcase_26 | AC | 1 ms
5,248 KB |
testcase_27 | AC | 2 ms
5,248 KB |
testcase_28 | AC | 1 ms
5,248 KB |
testcase_29 | AC | 2 ms
5,248 KB |
testcase_30 | AC | 1 ms
5,248 KB |
ソースコード
/*****/ #define TRUE true #define FALSE false #include <bits/stdc++.h> /**/ #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") /**/ using namespace std; using ll = long long; using ld = long double; using pint = pair<int, int>; using pll = pair<long long, long long>; template <class T> using vec = vector<T>; template <class T> using vec2 = vector<vector<T>>; template <class T> using vec3 = vector<vector<vector<T>>>; constexpr int INF = numeric_limits<int>::max(); constexpr ll INFL = numeric_limits<ll>::max(); constexpr ll MOD = 1000000007; // 10^9+7 #ifdef TRUE #define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i) #define rep1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i) #define rrep(i, n) for (ll i = (n)-1; i >= 0; --i) #define rrep1(i, n) for (ll i = (n); i > 0; --i) #define step(i, a, n) for (ll i = (a), i##_len = (a) + (n); i < i##_len; ++i) #define rstep(i, a, n) for (ll i = (a) + (n)-1, i##_len = (a); i >= i##_len; --i) #define range(i, a, b) for (ll i = (a), i##_len = (b); i < i##_len; ++i) #define rrange(i, a, b) for (ll i = (b)-1, i##_len = (a); i >= i##_len; --i) std::string strMulti(const int n, const std::string &t) { std::string out = ""; for (int i = 0; i < n; i++) { out += t; } return out; } std::string tab(const int n) { return string(n, '\t'); } std::string join(const vector<string> &v, const char *delim = 0) { std::string s; if (!v.empty()) { s += v[0]; for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) { if (delim) s += delim; s += v[i]; } } return s; } string to_string(string &s) { return '"' + s + '"'; } string to_string(char &c) { return string({'\'', c, '\''}); } template <class T1, class T2> string to_string(pair<T1, T2> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template <class Tuple, size_t... I> string _to_string_tuple(Tuple &&t, std::index_sequence<I...>) { return "(" + join({to_string(std::get<I>(t))...}, ", ") + ")"; } template <class... Args> string to_string(tuple<Args...> t) { return _to_string_tuple(std::forward<tuple<Args...>>(t), std::make_index_sequence<std::tuple_size<std::decay_t<tuple<Args...>>>::value>{}); } template <class T> string to_string(vector<T> ar) { vector<string> texts(ar.size()); for (size_t i = 0; i < ar.size(); ++i) { texts[i] = to_string(ar[i]); } return "{" + join(texts, ", ") + "}"; } template <class T> string to_string(initializer_list<T> il) { vector<string> texts(il.size()); size_t i = 0; for (T v : il) { texts[i] = to_string(v); i++; } return "{" + join(texts, ", ") + "}"; } void debug(string name); void debugn(string name); template <class T> void debug(string name, T v); template <class T> void debugn(string name, T v); template <class T> void debug(string name, initializer_list<T> il); template <class T> void debugn(string name, initializer_list<T> il); template <class... Args> void debug(string name, Args... args); template <class... Args> void debugn(string name, Args... args); void debugdo(function<void()> func); #ifdef DEBUG_BUILD #define debugvar(x) debugn(#x, (x)) #define debugvartab(x, t) debugn(tab(t) + #x, (x)) void debug(string name) { std::cerr << name; } void debugn(string name) { std::cerr << name << '\n'; } template <class T> void debug(string name, T v) { std::cerr << name << " = " << to_string(v); } template <class T> void debugn(string name, T v) { std::cerr << name << " = " << to_string(v) << '\n'; } template <class T> void debug(string name, initializer_list<T> il) { std::cerr << name << " = " << to_string(il); } template <class T> void debugn(string name, initializer_list<T> il) { std::cerr << name << " = " << to_string(il) << '\n'; } template <class... Args> void debug(string name, Args... args) { std::cerr << name << " = " << to_string(tuple<Args...>(args...)); } template <class... Args> void debugn(string name, Args... args) { std::cerr << name << " = " << to_string(tuple<Args...>(args...)) << '\n'; } void debugdo(function<void()> func) { func(); } #else #define debugvar(x) #define debugvartab(x, t) void debug(string name) { } void debugn(string name) {} template <class T> void debug(string name, T v) {} template <class T> void debugn(string name, T v) {} template <class T> void debug(string name, initializer_list<T> il) {} template <class T> void debugn(string name, initializer_list<T> il) {} template <class... Args> void debug(string name, Args... args) {} template <class... Args> void debugn(string name, Args... args) {} void debugdo(function<void()> func) {} #endif #define all(x) (x).begin(), (x).end() #define pair(a, b) make_pair(a, b) template <class T> bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; } template <class T> bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; } template <class T> T divup(const T a, const T b) { if (a % b == 0) { return a / b; } return a / b + 1; } template <class T> bool cmp_2nd(pair<T, T> a, pair<T, T> b) { if (a.second != b.second) { return a.second < b.second; } return a.first < b.first; } ll modpow(ll x, ll n, const ll &p) { ll ret = 1; while (n > 0) { if (n & 1) { (ret *= x) %= p; } (x *= x) %= p; n >>= 1; } return ret; } template <class T> T modinv(T a, const T &p) { T b = p, u = 1, v = 0; while (b) { T t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= p; if (u < 0) { u += p; } return u; } template <class T> T math_P(T m, T n) { T ret = 1; for (T i = m; i > m - n; i--) { ret *= i; } return ret; } template <class T> T math_C(T m, T n) { T ret = math_P(m, n); for (T i = 2; i <= n; i++) { ret /= i; } return ret; } ll extended_euclidean(ll u, ll v) { ll r0 = u; ll r1 = v; ll s0 = 1; ll s1 = 0; ll t0 = 0; ll t1 = 1; while (r1 != 0) { ll q = r0 / r1; ll r = r0 - q * r1; ll s = s0 - q * s1; ll t = t0 - q * t1; r0 = r1; s0 = s1; t0 = t1; r1 = r; s1 = s; t1 = t; } if (t0 < 0) { return t0 + u; } else { return t0; } } ll math_C_mod(ll n, ll c, const ll &p) { ll upe = 1; ll dow = 1; for (ll i = 1; i < c + 1; ++i) { upe = upe * n % p; dow = dow * i % p; n -= 1; } return (upe * extended_euclidean(p, dow)) % p; } template <class T> T math_gcd(T a, T b) { if (b == 0) { return a; } else { return math_gcd(b, a % b); } } template <class T> T math_lcm(T a, T b) { return a / math_gcd(a, b) * b; } template <class T> T SumStep(T a, T n, T d) { return n * (2 * a + (n - 1) * d) / 2; } template <class T> T SumRange(T a, T b, T d) { return SumStep(a, (b - a) / d, d); } #endif /*****/ // 素因数分解する O(sprt(n)) vector<pair<long long, long long>> prime_factorize(long long n) { vector<pair<long long, long long>> res; for (long long i = 2; i * i <= n; ++i) { if (n % i != 0) continue; long long ex = 0; // 指数 while (n % i == 0) { ++ex; n /= i; } res.push_back({i, ex}); } if (n != 1) res.push_back({n, 1}); return res; } void Main() { ll N; cin >> N; vector<pll> pfs = prime_factorize(N); debugvar(pfs); ll xorpf = 0; for (pll pf : pfs) { xorpf ^= pf.second; } debugvar(xorpf); if (xorpf == 0) cout << "Bob\n"; else cout << "Alice\n"; } /*****/ int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout << std::fixed << std::setprecision(10); Main(); std::cerr << flush; std::cout << flush; return 0; }