POJ 2484-A Funny Game (symmetric Game)

POJ 2484-A Funny Game (symmetric Game)

Question link: Click the open link

Question: n numbers are numbered 1-n in a ring. Two people take turns and can only take two adjacent rings or only one ring at a time.

Consider such a problem. If it is not a ring but a line, that is, from 1-N to a line, the first hand can take two or one of the middle to form equal numbers (symmetric between left and right ), then the first hand will be able to stand undefeated (simply put, no matter which side the opponent takes, the first hand will be able to win in the same way as the other side ).

However, this problem is a ring. In special cases, when the ring length is less than 3, the first hand will win (directly remove all), but greater than or equal to 3, any one of them can break the ring into a line (chain). Then, because the first hand wins the line, the answer to this question is "first hand wins.

#include #include 
 
  #include 
  
   #include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         #include 
         
          #include 
          
           #include 
           #include 
            
             #define maxn 10000002#define _ll __int64#define ll long long#define INF 0x3f3f3f3f#define Mod 10000007#define pp pair
             
              #define ull unsigned long longusing namespace std;int n;int main(){while(scanf("%d",&n)&&n){ if(n<3)puts("Alice");else puts("Bob");}return 0;}