HDOJ 题目1564 play a game(博弈)
来源:互联网 发布:百世汇通软件 编辑:程序博客网 时间:2024/06/07 19:27
Play a game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1397 Accepted Submission(s): 1141
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
思路:题目意思是每个人可以垂直方向走,也可以水平方向走,每回走一步,但是走过的地方就不能走了,无论怎么走都能看成转着圈走,走到中间就走不了了,奇数时走偶数步,偶数时走奇数步,所以规律就有了
ac代码
#include<stdio.h>int main(){int n;while(scanf("%d",&n)!=EOF,n){if(n%2)printf("ailyanlu\n");elseprintf("8600\n");}}
0 0
- HDOJ 题目1564 play a game(博弈)
- hdoj 1564 Play a game(博弈问题(寻找必胜点))
- hdoj 1564 Play a game
- HDOJ 题目1851A Simple Game(简单sg博弈)
- HDOJ 题目1524A Chess Game(sg博弈)
- HDOJ 题目1760 A New Tetris Game(DFS,博弈)
- 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 [博弈]
- HDU 1564 Play a game 规律博弈
- HDU 1564 Play a game(博弈)
- HDU 1564 Play a game 博弈
- TCP提供了流量控制和网络拥塞功能的目的
- Spring.net与Asp.net Mvc结合示例
- hdu 2844 多重背包
- hdu4906 Our happy ending --- 状压dp
- HDU 1166 敌兵布阵 (线段树)
- HDOJ 题目1564 play a game(博弈)
- windows下Android源码的分模块下载
- Minimum Depth of Binary Tree(LeetCode)
- git学习 - 忽略版本控制文件
- 登陆界面 LinearLayout的属性的用法
- 我之见--java进程,线程
- VS自定义代码折叠的位置
- 中期报告:多平台网络探测器
- poj 1088 滑雪 【记忆化搜索】+【DFS】