#990465 (C++23) No.103 素因数ゲーム リターンズ

• 問題: No.103 素因数ゲーム リターンズ
• ユーザー: zubassyaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaanMAX
• 提出日時: 2024-06-22 17:04:50
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 2,218 bytes
• コンパイル時間: 5,553 ms
• コンパイル使用メモリ: 310,952 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-06-22 17:04:56
• 合計ジャッジ時間: 6,093 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 5
other	AC * 20

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
#include<bits/stdc++.h>
#include<unordered_set>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vl = vector<long long>;
using vvl = vector<vl>;
#define INF ((ll)2e18)
#define IINF ((int)1e9)
const double PI = 3.1415926535897932384626433832795028841971;
template<typename T>inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T>inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define yesno(ans) cout<<(ans?"Yes\n":"No\n")
#define all(v) (v).begin(),(v).end()
const int di[] = { 0, 1, 0,-1 };
const int dj[] = { 1, 0,-1, 0 };
//const int di[] = { 0, 1, 1, 1, 0, -1,-1,-1};
//const int dj[] = { 1, 1, 0,-1,-1, -1, 0, 1};
//const int di[]={-1,-1, 0, 0, 1, 1};
//const int dj[]={-1, 0,-1, 1, 0, 1};
const double EPS = 1e-11;
//using mint = modint998244353;
using mint = modint1000000007;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define MAX 300
int solve();
/*
#include <random>
std::random_device seed_gen;
std::mt19937 engine(seed_gen());
void generate() {
    int n = engine() %100000 ;
    //int n = 1000;
    cout << n << endl;
    rep(i, n) {
        cout<<(engine()%212122 * 10282)%1000000000<<endl;
    }
}//*/
int main() {
    std::cin.tie(0)->sync_with_stdio(0);
    //generate();
    int T = 1;
    while (T--)solve();
    return 0;
}
struct S {
    ll val, e;
};
int solve() {
    ll n; cin >> n;
    ll ans = 0;
    rep(i, n) {
        ll m; cin >> m;
        vector<S>s;
        for (ll i = 2; i * i <= m; i++) {
            ll k = 0;
            while (m % i == 0) {
                k++;
                m /= i;
            }
            if (k)
                s.push_back({ i,k });
        }
        if (m > 1)s.push_back({ m,1 });
        
        rep(i, s.size()) {
            ans ^= s[i].e % 3;
        }
        
    }
    cout << (ans ? ("Alice") : "Bob") << endl;
    return 0;
}
/*
compile
g++ a.cpp -std=c++17 -I .
./a
*/
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX