Hdu.1564.Play a game（巴什博奕）

最新推荐文章于 2019-07-27 19:42:40 发布

MiaoPlus

最新推荐文章于 2019-07-27 19:42:40 发布

阅读量179

点赞数

CC 4.0 BY-SA版权

分类专栏： ===========数学知识=========== 文章标签： Hdu.1564.Play a game 博弈论巴什博奕

本文链接：https://blog.youkuaiyun.com/XxxxxM1/article/details/80257595

===========数学知识=========== 专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一个基于博弈论的游戏胜负预测问题。在一个n*n的棋盘上，两名玩家交替移动棋子，谁先无法移动谁输。文章通过简单的数学判断（奇偶数），预测了在双方都采取最优策略的情况下哪一方将获胜。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

F - Play a game

Time Limit: 1000 MS Memory Limit: 32768 KB

64-bit integer IO format: %I64d , %I64u Java class name: Main

[Submit] [Status]

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

考点：博弈论，巴什博奕

#include<iostream>
using namespace std;
int main()
{
    int n;
    while(cin>>n&&n){
        if(n%2==0)cout<<"8600"<<endl;
    else cout<<"ailyanlu"<<endl;
    }
}