Codeforces 493 D Vasya and Chess "game"

Test instructions: Give N*n chess board, White in (first), Black in (1,n), each step can go up and down diagonally, which first caught another, then it won

Can draw, found that N is an odd time, white first go, no matter how it goes, black and it go symmetrical, black side will be able to win

When n is an even number, the white side will go to an odd number of cases, white win

1#include <iostream>2#include <cstdio>3#include <cstring>4#include <cmath>5#include <stack>6#include <vector>7#include <map>8#include <Set>9#include <queue>Ten#include <algorithm> One using namespacestd; A  -typedefLong LongLL; - Const intINF = (1<< -)-1; the Const intMod=1000000007; - Const intmaxn=1000005; -  - intMain () { +     intN; -scanf"%d",&n); +     if(n&1) puts ("Black"); A     Elseprintf"white\n1 2\n"); at     return 0; -}

View Code

Codeforces 493 D Vasya and Chess "game"