루미 알고리즘

#1339플래티넘The Board Game

PO 2014 훈련 캠프코딩출제 Erik Odenman영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

Ann-Charlotte and Berit have invented their own board game. The game is played with a board of size N × M and a chainsaw, and is intended for two players. The players take turns making a move until one of them cannot make a move, that player loses. A move works the following way:

The player who's turn it is chooses a horizontal or vertical line, and splits the board along it into two non-empty parts. This can only be done at integer coordinates (so that the two resulting board pieces have integer dimensions). The other player then chooses which of the pieces the game should continue on, while the other board piece is thrown away. Since the dimensions always have to be integers, the loser will always be the one who's turn it is to use the chainsaw when the board has size 1 × 1.

Given the size of the original board, and the fact that Ann-Charlotte always starts, can you determine who wins if both players play optimally?

(그림은 원문 저장소에서 볼 수 있습니다)

Figure 1: An illustration of the first example

Input

Input consists of one line containing the two numbers N and M (1 ≤ N,M ≤ 100).

Output

Output the letter “A” if Ann-Charlotte wins and “B” if Berit wins, given that they both play optimally. More precisely, if Ann-Charlotte can win no matter how Berit plays you should write “A”, otherwise you should write “B”.

Scoring

Your solution will be tested on several groups of test cases. To get points for a group you need to pass all the tests of that group.

GroupPointsConstraints
120N, M ≤ 10
280No additional constraints

Explanation of sample 1

In the first example A wins by splitting the board into two pieces of size 1 × 3. No matter what B does afterwards, A will get to choose between pieces of size 1 × 2 and 1 × 1. The correct strategy is to pick 1 × 2 (the other option immediately leads to defeat). B will then be forced to choose between two pieces of size 1 × 1, which both will result in defeat for B.

예제

예제 1

입력
2 3
출력
A

예제 2

입력
2 6
출력
B

예제 3

입력
6 8
출력
A

출처 표기

출처: Programmeringsolympiaden 2014년 훈련 캠프 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.