zoukankan      html  css  js  c++  java
  • A Funny Game

     
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 5858   Accepted: 3649

    Description

    Alice and Bob decide to play a funny game. At the beginning of the game they pick n(1 <= n <= 106) coins in a circle, as Figure 1 shows. A move consists in removing one or two adjacent coins, leaving all other coins untouched. At least one coin must be removed. Players alternate moves with Alice starting. The player that removes the last coin wins. (The last player to move wins. If you can't move, you lose.) 
     
    Figure 1

    Note: For n > 3, we use c1, c2, ..., cn to denote the coins clockwise and if Alice remove c2, then c1 and c3 are NOT adjacent! (Because there is an empty place between c1 and c3.) 

    Suppose that both Alice and Bob do their best in the game. 
    You are to write a program to determine who will finally win the game.

    Input

    There are several test cases. Each test case has only one line, which contains a positive integer n (1 <= n <= 106). There are no blank lines between cases. A line with a single 0 terminates the input. 

    Output

    For each test case, if Alice win the game,output "Alice", otherwise output "Bob". 

    Sample Input

    1
    2
    3
    0
    

    Sample Output

    Alice
    Alice
    Bob

    一个简单的博弈论程序,,
    #include<cstdio>
    using namespace std;
    int main(){
        int x;
        while(scanf("%d",&x)!=EOF&&x!=0){
            if(x<=2)printf("Alice
    ");else printf("Bob
    ");
        }
    }
  • 相关阅读:
    pytorch实现yolov3(1) yolov3基本原理
    python随机选取目录下的若干个文件
    转 Yolov3转化Caffe框架详解
    特征金字塔网络Feature Pyramid Networks
    基于区域的目标检测
    聚类kmeans算法在yolov3中的应用
    车位iou计算
    git常用命令
    opencv 图像旋转
    简单的选项卡制作
  • 原文地址:https://www.cnblogs.com/muzu/p/7149244.html
Copyright © 2011-2022 走看看