5447: Irrational Division 

描述

Your family has been blessed with chocolate! A huge piece of chocolate has been given to you and your sister to share. However, as you gobbled up the large majority last time, your parents have invented a game to keep things fair (and to keep you occupied while they hide all the other chocolate). To keep things interesting, they have given you a rectangular piece of chocolate, which consists of little squares of both dark chocolate and white chocolate in a chessboard pattern. While you and your sister both love dark chocolate, you hate white chocolate! So, both you and your sister want as much dark chocolate as possible, while simultaneously obtaining as little white chocolate as possible. Every dark piece of chocolate you obtain gives you 1 meaningless unit of happiness, while a white piece lowers your happiness by 1 meaningless unit (and the same holds for your sister). Now, while you love your sister very much, there is always heavy competition between siblings, so your goal is to maximize the difference of your obtained happiness and her obtained happiness (while she tries to do the opposite, obviously). 

The game works as follows. Your parents place a p×q-rectangle of the aforementioned mixed chocolate on a table. You are situated on the west side of the table and your sister on the south side. The side of length p is parallel to the north-south line, while the side of length q is parallel to the east-west line. Furthermore, the north-west square is made of dark chocolate. Then, starting with yourself, you take turns breaking off blocks of chocolate (which you can keep). You can break off any positive number of entire columns from the west side, while your sister breaks off any positive number of entire rows from the south side. You repeat this process until no more chocolate is left. Your sister is very smart and will always play the game perfectly. 

A game might proceed like this, for example: you and your sister start with a 3 ×4-rectangle. You decide to break off 2 columns, obtaining 3 dark and 3 white chocolate squares, netting a happiness of zero. Your sister then breaks off 1 row, obtaining 1 dark and 1 white squares as well, so no happiness for her either. You then take a single column, which nets you nothing again, after which your sister decides to break off one row, which nets her 1 happiness! You then take the last piece, which makes you lose a unit of happiness, so your total score is −1 − 1 = −2. See the figure. (Note: the strategies used here might not be optimal.)

輸入

Multiple cases.

Each case given are two positive integers p and q, both at most 100, the height and width of the chocolate rectangle.

輸出

Each case output the largest possible difference (in your favour) between your net happiness and your sister’s net happiness.

樣例輸入

 1 2

樣例輸出

 2

題目來源

BAPC 2017

題目連結：http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=5447

題目大意：有一塊黑白交替的巧克力，黑色的巧克力幸福值+1，白色巧克力幸福值-1，一人可以選任意行，一人可以選任意列，求兩人幸福值的差值。

根據題目進行博弈模擬後發現結果只會存在0 1 2這3種情況

m為偶數b為奇數並且m>n時兩人一人為1分1人為-1分，差值為2

m和n都是奇數是，一人為1分一人人為0分，差值為1

其他情況兩人分數一樣，差值為0

#include <bits/stdc++.h>
using namespace std;
int main(){
	int n,m;
	while(cin>>n>>m){
		if(!(m&1)&&(n&1)&&m>n)puts("2");
		else if((n&1)&&(m&1))puts("1");
		else puts("0");
	} 
}