In a circle there are $2019$ plates, on each lies one cake. Petya and Vasya are playing a game. In one move, Petya points at a cake and calls number from $1$ to $16$, and Vasya moves the specified cake to the specified number of check clockwise or counterclockwise (Vasya chooses the direction each time). Petya wants at least some $k$ pastries to accumulate on one of the plates and Vasya wants to stop him. What is the largest $k$ Petya can succeed?

Antonio and Beltran have impeccable logical reasoning, they put on a hat with a integer between $0$ and $19$ (including both) so that each of them sees the number that has the other (but cannot see his own number), and they must try to guess the number that have on their hat. They have a timer that a bell rings every minute and the moment it rings. This is when they must say if they know the number on their hat. A third person tells them: ''the sum of the numbers is $6$ or $11$ or $19$''. At that moment it begins to run time. After a minute the bell rings and neither of them says anything. The second minute passes , the doorbell rings and neither of us says anything. Time continues to pass and when the bell rings for the tenth time Antonio says that he already knows what is his number. Just determine the number each has in his hat.

Elza draws $2013$ cities on the map and connects some of them with $N$ roads. Then Elza and Susy erase cities in turns until just two cities left (first city is to be erased by Elza). If these cities are connected with a road then Elza wins, otherwise Susy wins. Find the smallest $N$ for which Elza has a winning strategy.

An investigator works out that he needs to ask at most $91$ questions on the basis that all the answers will be yes or no and all will be true. The questions may depend upon the earlier answers. Show that he can make do with $105$ questions if at most one answer could be a lie.

Consider 2009 cards which are lying in sequence on a table. Initially, all cards have their top face white and bottom face black. The cards are enumerated from 1 to 2009. Two players, Amir and Ercole, make alternating moves, with Amir starting. Each move consists of a player choosing a card with the number $k$ such that $k < 1969$ whose top face is white, and then this player turns all cards at positions $k,k+1,\ldots,k+40.$ The last player who can make a legal move wins. (a) Does the game necessarily end? (b) Does there exist a winning strategy for the starting player? [i]Also compare shortlist 2009, combinatorics problem C1.[/i]

Amy and Bec play the following game. Initially, there are three piles, each containing $2020$ stones. The players take turns to make a move, with Amy going first. Each move consists of choosing one of the piles available, removing the unchosen pile(s) from the game, and then dividing the chosen pile into $2$ or $3$ non-empty piles. A player loses the game if he/she is unable to make a move. Prove that Bec can always win the game, no matter how Amy plays.

Nicholas and Peter are dividing $(2n+1)$ nuts. Each wants to get more. Three ways for that were suggested. (Each consist of three stages.) First two stages are common. 1 stage: Peter divides nuts onto $2$ heaps, each contain not less than $2$ nuts. 2 stage: Nicholas divides both heaps onto $2$ heaps, each contain not less than $1$ nut. 3 stage: 1 way: Nicholas takes the biggest and the least heaps. 2 way: Nicholas takes two middle size heaps. 3 way: Nicholas takes either the biggest and the least heaps or two middle size heaps, but gives one nut to the Peter for the right of choice. Find the most and the least profitable method for the Nicholas.

A point $P$ is interior to the triangle $ABC$ such that $AP \perp BC$. Let $E, F$ be the projections of $CA, AB$. Suppose that the tangents at $E, F$ of the circumcircle of triangle $AEF$ meets at a point on $BC$. Prove that $P$ is the orthocenter of triangle $ABC$. Do Thanh Son, High School of Natural Sciences, National University, Hanoi

Let $m$ and $n$ be natural numbers with $mn$ even. Jetze is going to cover an $m \times n$ board (consisting of $m$ rows and $n$ columns) with dominoes, so that every domino covers exactly two squares, dominos do not protrude or overlap, and all squares are covered by a domino. Merlin then moves all the dominoe color red or blue on the board. Find the smallest non-negative integer $V$ (in terms of $m$ and $n$) so that Merlin can always ensure that in each row the number squares covered by a red domino and the number of squares covered by a blue one dominoes are not more than $V$, no matter how Jetze covers the board.

Mathematicians $M$ and $N$ each have their own favorite collection of manuals on the book, which he often uses in his work. Once they decided to make a statement in which each mathematician proves at each turn any theorem from his handbook which neither has yet been proven. Everything is done in turn, the mathematician starts $M$. The theorems of the handbook can win first all proven; if the theorems of both manuals can proved at once, wins the last theorem proved by a mathematician. Let $m$ be a theorem in the mathematician's handbook $M$. Find all values of $m$ for which the mathematician $M$ has a winning strategy if is It is known that there are $222$ theorems in the mathematician's handbook $N$ and $101$ of them also appears in the mathematician's $M$ handbook.

Alina and Bogdan play the following game. They have a heap and $330$ stones in it. They take turns. In one turn it is allowed to take from the heap exactly $1$, exactly $n$ or exactly $m$ stones. The player who takes the last stone wins. Before the beginning Alina says the number $n$, ($1 < n < 10$). After that Bogdan says the number $m$, ($m \ne n, 1 < m < 10$). Alina goes first. Which of the two players has a winning strategy? What if initially there are 2018 stones in the heap? adapted from a Belarus Olympiad problem

Consider the set of all integer points in $Z^3$. Sasha and Masha play such a game. At first, Masha marks an arbitrary point. After that, Sasha marks all the points on some a plane perpendicular to one of the coordinate axes and at no point, which Masha noted. Next, they continue to take turns (Masha can't to select previously marked points, Sasha cannot choose the planes on which there are points said Masha). Masha wants to mark $n$ consecutive points on some line that parallel to one of the coordinate axes, and Sasha seeks to interfere with it. Find all $n$, in which Masha can achieve the desired result.

Veronica, Ana and Gabriela are forming a round and have fun with the following game. One of them chooses a number and says out loud, the one to its left divides it by its largest prime divisor and says the result out loud and so on. The one who says the number out loud $1$ wins , at which point the game ends. Ana chose a number greater than $50$ and less than $100$ and won. Veronica chose the number following the one chosen by Ana and also won. Determine all the numbers that could have been chosen by Ana.

Alice and Bob play a game on the infinite side of a checkered strip, in which the cells are numbered with consecutive integers from left to right (..., $-2$, $-1$, $0$, $1$, $2$, ...). Alice in her turn puts one cross in any free cell, and Bob in his turn puts zeros in any 2020 free cells. Alice will win if he manages to get such 4 cells marked with crosses, the corresponding cell numbers will form an arithmetic progression. Bob's goal in this game is to prevent Alice from winning. They take turns and Alice moves first. Will Alice be able to win no matter how Bob plays?

Ana and Bogdan play the following turn based game: Ana starts with a pile of $n$ ($n \ge 3$) stones. At his turn each player has to split one pile. The winner is the player who can make at his turn all the piles to have at most two stones. Depending on $n$, determine which player has a winning strategy.

There are a) $2022$, b) $2023$ plates placed around a round table and on each of them there is one coin. Alice and Bob are playing a game that proceeds in rounds indefinitely as follows. In each round, Alice first chooses a plate on which there is at least one coin. Then Bob moves one coin from this plate to one of the two adjacent plates, chosen by him. Determine whether it is possible for Bob to select his moves so that, no matter how Alice selects her moves, there are never more than two coins on any plate.

With $2018$ points, a network composed of hexagons is formed as a sample the figure: [asy] unitsize(1 cm); int i; path hex = dir(30)--(0,1)--dir(150)--dir(210)--(0,-1)--dir(330)--cycle; draw(hex); draw(shift((sqrt(3),0))*(hex)); draw(shift((2*sqrt(3),0))*(hex)); draw(shift((4*sqrt(3),0))*(hex)); draw(shift((5*sqrt(3),0))*(hex)); dot((3*sqrt(3) - 0.3,0)); dot((3*sqrt(3),0)); dot((3*sqrt(3) + 0.3,0)); dot(dir(150)); dot(dir(210)); for (i = 0; i <= 5; ++i) { if (i != 3) { dot((0,1) + i*(sqrt(3),0)); dot(dir(30) + i*(sqrt(3),0)); dot(dir(330) + i*(sqrt(3),0)); dot((0,-1) + i*(sqrt(3),0)); } } dot(dir(150) + 4*(sqrt(3),0)); dot(dir(210) + 4*(sqrt(3),0)); [/asy] A bee and a fly play the following game: initially the bee chooses one of the $2018$ dots and paints it red, then the fly chooses one of the $2017$ unpainted dots and paint it blue. Then the bee chooses an unpainted point and paints it red and then the fly chooses an unpainted one and paints it blue and so they alternate. If at the end of the game there is an equilateral triangle with red vertices, the bee wins, otherwise Otherwise the fly wins. Determine which of the two insects has a winning strategy.

The numbers $3$, $4$ ,$...$, $2019$ are written on a blackboard. David and Edgardo play alternately, starting with David. On their turn, each player must erase a number from the board and write two positive integers whose sum is equal to the number just deleted. The winner is the one who makes all the numbers on the board equal. Determine who has a winning strategy and describe it.

Let $n\geq 3$ be a positive integer. Alice and Bob are playing a game in which they take turns colouring the vertices of a regular $n$-gon. Alice plays the first move. Initially, no vertex is coloured. Both players start the game with $0$ points. In their turn, a player colours a vertex $V$ which has not been coloured and gains $k$ points where $k$ is the number of already coloured neighbouring vertices of $V$. (Thus, $k$ is either $0$, $1$ or $2$.) The game ends when all vertices have been coloured and the player with more points wins; if they have the same number of points, no one wins. Determine all $n\geq 3$ for which Alice has a winning strategy and all $n\geq 3$ for which Bob has a winning strategy.

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Jesse and Tjeerd are playing a game. Jesse has access to $n\ge 2$ stones. There are two boxes: in the black box there is room for half of the stones (rounded down) and in the white box there is room for half of the stones (rounded up). Jesse and Tjeerd take turns, with Jesse starting. Jesse grabs in his turn, always one new stone, writes a positive real number on the stone and places put him in one of the boxes that isn't full yet. Tjeerd sees all these numbers on the stones in the boxes and on his turn may move any stone from one box to the other box if it is not yet full, but he may also choose to do nothing. The game stops when both boxes are full. If then the total value of the stones in the black box is greater than the total value of the stones in the white box, Jesse wins; otherwise win Tjeerd. For every $n \ge 2$, determine who can definitely win (and give a corresponding winning strategy).

(a) On each square of a squared sheet of paper of size $20 \times 20$ there is a soldier. Vanya chooses a number $d$ and Petya moves the soldiers to new squares in such a way that each soldier is moved through a distance of at least $d$ (the distance being measured between the centres of the initial and the new squares) and each square is occupied by exactly one soldier. For which $d$ is this possible? (Give the maximum possible $d$, prove that it is possible to move the soldiers through distances not less than $d$ and prove that there is no greater $d$ for which this procedure may be carried out.) (b) Answer the same question as (a), but with a sheet of size $21 \times 21$. (SS Krotov, Moscow)

Given an initial integer $ n_0 > 1$, two players, $ {\mathcal A}$ and $ {\mathcal B}$, choose integers $ n_1$, $ n_2$, $ n_3$, $ \ldots$ alternately according to the following rules : [b]I.)[/b] Knowing $ n_{2k}$, $ {\mathcal A}$ chooses any integer $ n_{2k \plus{} 1}$ such that \[ n_{2k} \leq n_{2k \plus{} 1} \leq n_{2k}^2. \] [b]II.)[/b] Knowing $ n_{2k \plus{} 1}$, $ {\mathcal B}$ chooses any integer $ n_{2k \plus{} 2}$ such that \[ \frac {n_{2k \plus{} 1}}{n_{2k \plus{} 2}} \] is a prime raised to a positive integer power. Player $ {\mathcal A}$ wins the game by choosing the number 1990; player $ {\mathcal B}$ wins by choosing the number 1. For which $ n_0$ does : [b]a.)[/b] $ {\mathcal A}$ have a winning strategy? [b]b.)[/b] $ {\mathcal B}$ have a winning strategy? [b]c.)[/b] Neither player have a winning strategy?

Javiera and Claudio play on a board consisting of a row with $2019$ cells. Claudio starts by placing a token anywhere on the board. Next Javiera says a natural number $k$, $1 \le k \le n$ and Claudio must move the token to the right or to the left at your choice $k$ squares and so on. Javiera wins if she manages to remove the piece that Claudio moves from the board. Determine the smallest $n$ such that Javiera always wins after a finite number of moves.

Mary and Pat play the following number game. Mary picks an initial integer greater than $2017$. She then multiplies this number by $2017$ and adds $2$ to the result. Pat will add $2019$ to this new number and it will again be Mary’s turn. Both players will continue to take alternating turns. Mary will always multiply the current number by $2017$ and add $2$ to the result when it is her turn. Pat will always add $2019$ to the current number when it is his turn. Pat wins if any of the numbers obtained by either player is divisible by $2018$. Mary wants to prevent Pat from winning the game. Determine, with proof, the smallest initial integer Mary could choose in order to achieve this.