Alice and Bob

最新推荐文章于 2021-09-17 19:04:07 发布

原创最新推荐文章于 2021-09-17 19:04:07 发布 · 702 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++

ACM算法专栏收录该内容

15 篇文章

订阅专栏

Alice和Bob玩了一个在n×n棋盘上的游戏，每次可以将棋子水平或垂直移动到未访问过的相邻方格。如果双方都完美地进行游戏，谁会赢得比赛？输入是一个整数序列，每个整数表示棋盘的大小，输出是每个输入行的赢家（Alice或Bob）。

1798. Alice and Bob

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

Bob is very famous because he likes to play games. Today he puts a chessboard in the desktop, and plays a game with Alice. The size of the chessboard is n by n. A stone is placed in a corner square. They play alternatively with Alice 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, indicating the size of the chessboard. The end of the input is indicated by a zero.

Output

Output the winner (“Alice” or “Bob”) for each input line except the last zero. No other characters should be inserted in the output.

// Alice_and_Bob.cpp
#include <iostream>
using namespace std ;
int main (){
	int x ;
	while (cin >> x && x != 0){
		if(x % 2 == 0){
			cout << "Alice" << endl ;
			continue ;
		}
		cout << "Bob" << endl ; 
	}
	return 0 ;
}