zoukankan      html  css  js  c++  java
  • POJ2484

    A Funny Game

    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 6178   Accepted: 3861

    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

    Source

    POJ Contest,Author:Mathematica@ZSU
     
    题意:每人每次可以取一个或两个连续的硬币,硬币之间有空位视作不连续。取完最后一个硬币的人获胜。问先手必胜还是后手必胜。
    思路:n<=2时,先手必胜。n>2时,后手以中心对称模仿先手,必胜。
     1 //2017-10-26
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 int main()
    10 {
    11     int n;
    12     while(cin>>n && n){
    13         if(n <= 2)cout<<"Alice"<<endl;
    14         else cout<<"Bob"<<endl;
    15     }
    16 
    17     return 0;
    18 }
     1 import java.util.*;
     2 
     3 public class Main{
     4     public static void main(String args[]){
     5         int n;
     6         Scanner cin = new Scanner(System.in);
     7         while(cin.hasNext()){
     8             n = cin.nextInt();
     9             if(n == 0)break;
    10             if(n <= 2)System.out.println("Alice");
    11             else System.out.println("Bob");
    12         }
    13     }
    14 }
  • 相关阅读:
    Android平台下基于XMPP的IM研究
    Android File数据存储
    Android 获取屏幕分辨率的方式
    Android TabHost 动态修改图标或者动态改变标题
    Android DatePickerDialog用法
    SharedPreference Demo
    progressdialog 去边框
    [LCT学习时的一些笔记]
    [ZJOI2007]最大半连通子图
    【Matrixtree Theorem学习笔记】
  • 原文地址:https://www.cnblogs.com/Penn000/p/7739564.html
Copyright © 2011-2022 走看看