HDU 1564-Play a game(博弈-找规律)
来源:互联网 发布:探险家时光相册软件 编辑:程序博客网 时间:2024/05/18 18:21
Play a game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2190 Accepted Submission(s): 1752
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?
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.
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.
No other characters should be inserted in the output.
Sample Input
20
Sample Output
8600
Author
ailyanlu
Source
Happy 2007
Recommend
8600 | We have carefully selected several similar problems for you: 1404 1536 1517 1524 1729
8600先行。
n为偶数是先手必胜。
8600先行。
n为偶数是先手必胜。
#include <iostream>#include<cstdio>using namespace std;int main() { int n; while(scanf("%d",&n)!=EOF){ if(n==0) break; if(n%2==0) printf("8600\n");//必胜点 else printf("ailyanlu\n"); } return 0;}
0 0
- HDU 1564-Play a game(博弈-找规律)
- HDU 1564 Play a game(博弈找规律)
- HDU 1564 Play a game (博弈、找规律)
- hdu 1564 Play a game(博弈——找规律)
- HDU 1564 Play a game 规律博弈
- HDU-1564-Play a game 【找规律】
- HDU 1564 Play a game(规律博弈)
- hdu 1564 play a game 博弈(规律)
- hdu 1564 Play a game (博弈 奇偶规律)
- hdu1564 Play a game【博弈 找规律】
- hdu1564——Play a game(找规律博弈)
- Play a game(巴什博弈丶找规律)
- HDOJ1564Play a game(找规律博弈)
- HDU--1564 -- play a game [博弈]
- HDU 1564 Play a game(博弈)
- HDU 1564 Play a game 博弈
- HDU 1564--Play a game【博弈】
- HDU 1564 Play a game 简单博弈
- POJ 1769 Minimizing maximizer
- 表达式组成方案
- 第十一周项目四 继承之时间日期类
- Java 文件上传组件 Apache Commons FileUpload 应用指南(二)——FileUpload如何工作?
- 蓝桥杯 BASIC_02 基础练习 01字串
- HDU 1564-Play a game(博弈-找规律)
- 支付宝接入
- Hadoop生态上几个技术的关系与区别:hive、pig、hbase 关系与区别
- 蓝桥杯 BASIC_03 基础练习 字母图形
- wke属性记录
- 简单的使用HttpClient访问网络
- Java LinkedHashMap工作原理及实现(一)
- Java 实现二维码及有Logo 的二维码(SpringMVC+Zxing+Jsp)
- Sqlite中文排序研究