zoukankan      html  css  js  c++  java
  • 博弈论(男人八题):POJ 1740 A New Stone Game

    A New Stone Game
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 5694   Accepted: 3119

    Description

    Alice and Bob decide to play a new stone game.At the beginning of the game they pick n(1<=n<=10) piles of stones in a line. Alice and Bob move the stones in turn.
    At each step of the game,the player choose a pile,remove at least one stones,then freely move stones from this pile to any other pile that still has stones.
    For example:n=4 and the piles have (3,1,4,2) stones.If the player chose the first pile and remove one.Then it can reach the follow states.
    2 1 4 2
    1 2 4 2(move one stone to Pile 2)
    1 1 5 2(move one stone to Pile 3)
    1 1 4 3(move one stone to Pile 4)
    0 2 5 2(move one stone to Pile 2 and another one to Pile 3)
    0 2 4 3(move one stone to Pile 2 and another one to Pile 4)
    0 1 5 3(move one stone to Pile 3 and another one to Pile 4)
    0 3 4 2(move two stones to Pile 2)
    0 1 6 2(move two stones to Pile 3)
    0 1 4 4(move two stones to Pile 4)
    Alice always moves first. 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

    The input contains several test cases. The first line of each test case contains an integer number n, denoting the number of piles. The following n integers describe the number of stones in each pile at the beginning of the game, you may assume the number of stones in each pile will not exceed 100.
    The last test case is followed by one zero.

    Output

    For each test case, if Alice win the game,output 1,otherwise output 0.

    Sample Input

    3
    2 1 3
    2
    1 1
    0

    Sample Output

    1
    0
    http://blog.csdn.net/zhang20072844/article/details/8113381这个题解很清楚。
     1 #include <algorithm>
     2 #include <iostream>
     3 #include <cstring>
     4 #include <cstdio>
     5 using namespace std;
     6 int a[15],f,n;
     7 int main(){
     8     while(scanf("%d",&n)!=EOF&&n){
     9         for(int i=1;i<=n;i++)
    10             scanf("%d",&a[i]);
    11         if(n%2==1)printf("1
    ");
    12         else{
    13             f=0;sort(a+1,a+n+1);
    14             for(int i=1;i<n;i+=2)
    15                 if(a[i]!=a[i+1])f=1;
    16             printf("%d
    ",f);    
    17         }    
    18     }
    19     return 0;
    20 }

  • 相关阅读:
    随想24:中国终将发展成第一强国
    随想23:所见的并不一定是真实
    工作4年之后对人性、社会的疯言
    随想22:出路
    开源视频会议bigbluebutton开发(3)——架构体系图
    开源视频会议bigbluebutton开发(2)——配置命令工具
    开源视频会议bigbluebutton开发(1)——初始化安装以及配置
    视频会议之BigBlueButton
    26款 网络会议/视频会议开源软件
    Tomcat 7最大并发连接数的正确修改方法
  • 原文地址:https://www.cnblogs.com/TenderRun/p/5814350.html
Copyright © 2011-2022 走看看