hdu 1564 Play a game (博弈)

Play a game

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1182    Accepted Submission(s): 969


Problem Description
New Year is Coming!  
ailyanlu is very happy today! and he is playing a chessboard game with 8600.  
The size of the chessboard is n*n. A stone is placed in a corner square. They play alternatively with 8600 having the first move. Each time, player is allowed to move the stone to an unvisited neighbor square horizontally or vertically. The one who can't make a move will lose the game. If both play perfectly, who will win the game?
 

 

Input
The input is a sequence of positive integers each in a separate line.  
The integers are between 1 and 10000, inclusive,(means 1 <= n <= 10000) indicating the size of the chessboard. The end of the input is indicated by a zero.
 

 

Output
Output the winner ("8600" or "ailyanlu") for each input line except the last zero.  
No other characters should be inserted in the output.
 

 

Sample Input
2 0
 

 

Sample Output
8600
 

 

Author
ailyanlu
 

 

Source
 

 

Recommend
8600   |   We have carefully selected several similar problems for you:   1404  1524  1729  1730  1849 
 
 1 //0MS    228K    195 B    G++
 2 /*
 3 
 4     题意:
 5         有一块石头在某个角,两个人轮着推,无法推时输
 6          
 7     博弈:
 8         水题 
 9 
10 */
11 #include<stdio.h>
12 #include<string.h>
13 int main(void)
14 {
15     int n;
16     while(scanf("%d",&n),n)
17     {
18         if(n%2) puts("ailyanlu");
19         else puts("8600");
20     }
21     return 0;
22 } 

 

转载于:https://www.cnblogs.com/GO-NO-1/p/3478831.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值