hdu4371 Alice and Bob---博弈------多校联合8

最新推荐文章于 2021-07-17 18:43:33 发布

qiqijianglu

最新推荐文章于 2021-07-17 18:43:33 发布

阅读量1.6k

点赞数

分类专栏：博弈文章标签： training integer numbers random input

本文链接：https://blog.csdn.net/qiqijianglu/article/details/7874787

版权

博弈专栏收录该内容

53 篇文章 0 订阅

订阅专栏

Alice and Bob

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 99 Accepted Submission(s): 62

Problem Description

Alice and Bob are interested in playing games. One day, they invent a game which has rules below:
1. Firstly, Alice and Bob choose some random positive integers, and here we describe them as n, d₁, d₂,..., d_m.
2. Then they begin to write numbers alternately. At the first step, Alice has to write a “0”, here we let s₁ = 0 ; Then, at the second step, Bob has to write a number s₂ which satisfies the condition that s₂ = s₁ + d_k and s₂ <= n, 1<= k <= m ; From the third step, the person who has to write a number in this step must write a number s_i which satisfies the condition that s_i = s_i-1 + d_k or s_i = s_i-1 - d_k , and s_i-2 < s_i <= n, 1 <= k <= m, i >= 3 at the same time.
3. The person who can’t write a legal number at his own step firstly lose the game.
Here’s the question, please tell me who will win the game if both Alice and Bob play the game optimally.

Input

At the beginning, an integer T indicating the total number of test cases.
Every test case begins with two integers n and m, which are described before. And on the next line are m positive integers d₁, d₂,..., d_m.
T <= 100;
1 <= n <= 10⁶;
1 <= m <= 100;
1 <= d_k <= 10⁶, 1 <= k <= m.

Output

For every test case, print “Case #k: ” firstly, where k indicates the index of the test case and begins from 1. Then if Alice will win the game, print “Alice”, otherwise “Bob”.

Sample Input

Sample Output

  
  
   
   Case #1: Alice
Case #2: Bob

Author

standy from UESTC

Source

2012 Multi-University Training Contest 8

Recommend

zhuyuanchen520

选一个最小的di

#include<iostream>
#include<cstdlib>
#include<stdio.h>
using namespace std;
int main()
{
    int t,n,m;
    int cc=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        int mm=1000010;
        int num;
        for(int i=0;i<m;i++)
        {
            scanf("%d",&num);
            if(num<mm)
            mm=num;
        }
        int s=0;
        printf("Case #%d: ",cc++);
        int count=0;
        while(s<=n)
        {
            s+=mm;count++;
        }
        if(count%2==0)
        cout<<"Bob"<<endl;
        else
        cout<<"Alice"<<endl;
    }
}