codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1695B.md (1625B)


      1 Source: https://codeforces.com/problemset/problem/1695/B
      2 
      3 B. Circle Game
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Mike and Joe are playing a game with some stones. Specifically, they have $n$ piles of stones of sizes $a_1, a_2, \ldots, a_n$. These piles are arranged in a circle.
     22 
     23 The game goes as follows. Players take turns removing some positive number of stones from a pile in clockwise order starting from pile $1$. Formally, if a player removed stones from pile $i$ on a turn, the other player removes stones from pile $((i\bmod n) + 1)$ on the next turn.
     24 
     25 If a player cannot remove any stones on their turn (because the pile is empty), they lose. Mike goes first.
     26 
     27 If Mike and Joe play optimally, who will win?
     28 
     29 Input
     30 
     31 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 1000$). Description of the test cases follows.
     32 
     33 The first line of each test case contains a single integer $n$ ($1 \le n \le 50$)  — the number of piles.
     34 
     35 The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 10^9$)  — the size of the piles.
     36 
     37 Output
     38 
     39 For each test case print the winner of the game, either "Mike" or "Joe" on its own line (without quotes).
     40 
     41 Example
     42 
     43 Input
     44 
     45 ```
     46 2
     47 
     48 1
     49 
     50 37
     51 
     52 2
     53 
     54 100 100
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 Mike
     61 Joe
     62 ```
     63 
     64 Note
     65 
     66 In the first test case, Mike just takes all $37$ stones on his first turn.
     67 
     68 In the second test case, Joe can just copy Mike's moves every time. Since Mike went first, he will hit $0$ on the first pile one move before Joe does so on the second pile.