0
点赞
收藏
分享

微信扫一扫

P4702 取石子

南陵王梁枫 2022-04-05 阅读 41
算法

取石子 - 洛谷

/*
 * @Description: To iterate is human, to recurse divine.
 * @Autor: Recursion
 * @Date: 2022-04-05 12:18:55
 * @LastEditTime: 2022-04-05 12:21:26
 */
#include <bits/stdc++.h>
#define LL long long 
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e6;
int main()
{
    ios::sync_with_stdio(false);
    LL sum = 0;
    int n;
    cin >> n;
    for(int i = 1;i <= n;i ++){
        int x;
        cin >> x;
        sum += x;
    }
    if(sum % 2 != 0)
        cout << "Alice" << endl;
    else
        cout << "Bob" << endl;

    return 0;
}
举报

相关推荐

0 条评论