HDU - 3389(40/600)

原创于 2017-07-16 11:35:08 发布 · 411 阅读

0 ·

CC 4.0 BY-SA版权

ACM练习同时被 2 个专栏收录

312 篇文章

订阅专栏

博弈

15 篇文章

订阅专栏

本文介绍了一个涉及游戏策略的编程问题，通过分析不同编号盒子中卡片的分布情况来预测游戏的胜负走向。玩家需要遵循特定的规则移动卡片，最终确定胜者。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Bob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. Bob and Alice move the cards in turn. In each turn the corresponding player should choose a non-empty box A and choose another box B that B

#include<bits/stdc++.h>
using namespace std;
#define int long long 
main()
{
    int T;
    cin>>T;
    int u=0;
    while(T--)
    {
        int n;
        cin>>n;
        int zz=0,ww;
        for(int a=1;a<=n;a++)
        {
            scanf("%lld",&ww);
            if(a%6!=2&&a%6!=5&&a%6!=0)continue;
            zz^=ww;
        }
        printf("Case %d: ",++u);
        if(zz)printf("Alice\n");
        else printf("Bob\n");
    }
}