浙江财经大学
信息管理与工程学院

HDU 1564 Play a game

本文由 Ocrosoft 于 2016-08-03 15:21:53 发表

Play a game

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

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
 

Solution

找一下规律,n%2==0的时候8600赢,否则ailyanlu赢。

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <stack>
#include <queue>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cctype>
#include <climits>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define ms(a) memset(a,0,sizeof(a))
#define INF INT_MAX
#define MAXN 1000+10
using namespace std;
int main()
{
    int n;
    while(cin>>n&&n)
    {
        if(n%2==0)printf("8600\n");
        else printf("ailyanlu\n");
    }
    return 0;
}

 

欢迎转载,请保留出处与链接。Ocrosoft » HDU 1564 Play a game

点赞 (0)or拍砖 (0)

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址