For an integer $n \ge 2$, let $G_n$ be an $n \times n$ grid of unit cells. A subset of cells $H \subseteq G_n$ is considered \textit{quasi-complete} if and only if each row of $G_n$ has at least one cell in $H$ and each column of $G_n$ has at least one cell in $H$. A subset of cells $K \subseteq G_n$ is considered \textit{quasi-perfect} if and only if there is a proper subset $L \subset K$ such that $|L| = n$ and no two elements in $L$ are in the same row or column. Let $\vartheta(n)$ be the smallest positive integer such that every quasi-complete subset $H \subseteq G_n$ with $|H| \ge \vartheta(n)$ is also quasi-perfect. Moreover, let $\varrho(n)$ be the number of quasi-complete subsets $H \subseteq G_n$ with $|H| = \vartheta(n) - 1$ such that $H$ is not quasi-perfect. Compute $\vartheta(20) + \varrho(20)$.

In some squares of a $2012\times 2012$ grid there are some beetles, such that no square contain more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid again, also satisfying the condition that there is at most one beetle standing in each square. The vector from the centre of the square from which a beetle $B$ flies to the centre of the square on which it lands is called the [i]translation vector[/i] of beetle $B$. For all possible starting and ending configurations, find the maximum length of the sum of the [i]translation vectors[/i] of all beetles.

There are $N$ houses in a city. Every Christmas, Santa visits these $N$ houses in some order. Show that if $N$ is large enough, then it holds that for three consecutive years there are always are $13$ houses such that they have been visited in the same order for two years (out of the three consecutive years). Determine the smallest $N$ for which this holds.

In the beginning there are $100$ integers in a row on the blackboard. Kain and Abel then play the following game: A [i]move[/i] consists in Kain choosing a chain of consecutive numbers; the length of the chain can be any of the numbers $1,2,\dots,100$ and in particular it is allowed that Kain only chooses a single number. After Kain has chosen his chain of numbers, Abel has to decide whether he wants to add $1$ to each of the chosen numbers or instead subtract $1$ from of the numbers. After that the next move begins, and so on. If there are at least $98$ numbers on the blackboard that are divisible by $4$ after a move, then Kain has won. Prove that Kain can force a win in a finite number of moves.

Turbo the snail plays a game on a board with $2024$ rows and $2023$ columns. There are hidden monsters in $2022$ of the cells. Initially, Turbo does not know where any of the monsters are, but he knows that there is exactly one monster in each row except the first row and the last row, and that each column contains at most one monster. Turbo makes a series of attempts to go from the first row to the last row. On each attempt, he chooses to start on any cell in the first row, then repeatedly moves to an adjacent cell sharing a common side. (He is allowed to return to a previously visited cell.) If he reaches a cell with a monster, his attempt ends and he is transported back to the first row to start a new attempt. The monsters do not move, and Turbo remembers whether or not each cell he has visited contains a monster. If he reaches any cell in the last row, his attempt ends and the game is over. Determine the minimum value of $n$ for which Turbo has a strategy that guarantees reaching the last row on the $n$-th attempt or earlier, regardless of the locations of the monsters. [i]Proposed by Cheuk Hei Chu, Hong Kong[/i]

There is a finite number of towns in a country. They are connected by one direction roads. It is known that, for any two towns, one of them can be reached from another one. Prove that there is a town such that all remaining towns can be reached from it.

Let $m,n$ be positive integers with $m \le n$, and let $F$ be a family of $m$-element subsets of $\{1,2,...,n\}$ satisfying $A \cap B \ne \varnothing$ for all $A,B \in F$. Determine the maximum possible number of elements in $F$.

Consider $n$ points $A_1,A_2,A_3,\ldots, A_n$ ($n\geq 4$) in the plane, such that any three are not collinear. Some pairs of distinct points among $A_1,A_2,A_3,\ldots, A_n$ are connected by segments, such that every point is connected with at least three different points. Prove that there exists $k>1$ and the distinct points $X_1,X_2,\ldots, X_{2k}$ in the set $\{A_1,A_2,A_3,\ldots, A_n\}$, such that for every $i\in \overline{1,2k-1}$ the point $X_i$ is connected with $X_{i+1}$, and $X_{2k}$ is connected with $X_1$.

One have $n$ distinct circles(with the same radius) such that for any $k+1$ circles there are (at least) two circles that intersects in two points. Show that for each line $l$ one can make $k$ lines, each one parallel with $l$, such that each circle has (at least) one point of intersection with some of these lines.

A father and two sons went to visit their grandmother, who Raya lives $33$ km from the city. My father has a motor roller, the speed of which $25$ km/h, and with a passenger - $20$ km/h (with two passengers on a scooter It’s impossible to move). Each of the brothers walks along the road at a speed of $5$ km/h. Prove that all three can get to grandma's in $3$ hours

Given is a simple graph with $239$ vertices, such that it is not bipartite and each vertex has degree at least $3$. Find the smallest $k$, such that each odd cycle has length at most $k$.

There are $N$ points in the plane such that the [b]total number[/b] of pairwise distances of these $N$ points is at most $n$. Prove that $N \le (n + 1)^2$.

A designer took a wooden cube $5 \times 5 \times 5$, divided each face into unit squares and painted each square black, white or red so that any two squares with a common side have different colours. What is the least possible number of black squares? (Squares with a common side may belong to the same face of the cube or to two different faces.) [i](8 points)[/i] [i]Mikhail Evdokimov[/i]

Let $n$ and $k$ be positive integers, with $k \le n.$ Define a (simple, undirected) graph $G_{n,k}$ as follows: its vertices are all of the binary strings of length $n,$ and there is an edge between two strings if and only if they differ in exactly $k$ positions. If $c_{n,k}$ denotes the number of connected components of $G_{n,k},$ compute $$\sum_{n=1}^{10} \sum_{k=1}^n c_{n,k}.$$ (For example, $G_{3,2}$ has two connected components.)

At each integer point of the numerical line a lamp with a toggle button is placed. If the button is pressed, a lit lamp is turned off, an unlit one is turned on. Initially all the lamps are unlit. A stencil with a finite set of fixed holes at integer distances is chosen. The stencil may be moved along the line as a rigid body, and for any fixed position of the stencil, one may push simultaneously all the buttons accessible through the holes. Prove that for any stencil it is possible to get exactly two lit lamps after several such operations. (B Ginsburg)

On a board the numbers $(n-1, n, n+1)$ are written where $n$ is positive integer. On a move choose 2 numbers $a$ and $b$, delete them and write $2a-b$ and $2b-a$. After a succession of moves, on the board there are 2 zeros. Find all possible values for $n$. Proposed by Andrei Eckstein

There are two circles of perimeter $1979$. Let $1979$ points be marked on the first circle, and several arcs with the total length of $1$ on the second. Show that it is possible to place the second circle onto the first in such a way that none of the marked points is covered by a marked arc.

A bagel is a loop of $2a+2b+4$ unit squares which can be obtained by cutting a concentric $a\times b$ hole out of an $(a +2)\times (b+2)$ rectangle, for some positive integers a and b. (The side of length a of the hole is parallel to the side of length $a+2$ of the rectangle.) Consider an infinite grid of unit square cells. For each even integer $n \ge 8$, a bakery of order $n$ is a finite set of cells $ S$ such that, for every $n$-cell bagel $B$ in the grid, there exists a congruent copy of $B$ all of whose cells are in $S$. (The copy can be translated and rotated.) We denote by $f(n)$ the smallest possible number of cells in a bakery of order $ n$. Find a real number $\alpha$ such that, for all sufficiently large even integers $n \ge 8$, we have $$\frac{1}{100}<\frac{f (n)}{n^ {\alpha}}<100$$ [i]Proposed by Nikolai Beluhov[/i]

A $k$-coloring of a graph $G$ is a coloring of its vertices using $k$ possible colors such that the end points of any edge have different colors. We say a graph $G$ is uniquely $k$-colorable if one hand it has a $k$-coloring, on the other hand there do not exist vertices $u$ and $v$ such that $u$ and $v$ have the same color in one $k$-coloring and $u$ and $v$ have different colors in another $k$-coloring. Prove that if a graph $G$ with $n$ vertices $(n \ge 3)$ is uniquely $3$-colorable, then it has at least $2n-3$ edges.

The positive integers from $1$ to $n^2$ are placed arbitrarily on the squares of a chess board with dimensions $n\times n$. Prove that there are two adjacent squares (having a common vertex or a common side) such that the difference between the numbers placed on them is not less than $n + 1$. (N Sedrakyan, Yerevan)

Circle is divided into $n$ arcs by $n$ marked points on the circle. After that circle rotate an angle $ 2\pi k/n $ (for some positive integer $ k $), marked points moved to $n$ [i] new points [/i], dividing the circle into $ n $ [i] new arcs[/i]. Prove that there is a new arc that lies entirely in the one of the old arсs. (It is believed that the endpoints of arcs belong to it.) [i]I. Mitrophanov[/i]

A conference has $ 47$ people attending. One woman knows $ 16$ of the men who are attending, another knows $ 17$, and so on up to the $ m$-th woman who knows all $ n$ of the men who are attending. Find $ m$ and $ n$.

Ana has $22$ coins. She can take from her friends either $6$ coins or $18$ coins, or she can give $12$ coins to her friends. She can do these operations many times she wants. Find the least number of coins Ana can have.

There are $k$ points in the interior of a pentagon. Together with the vertices of the pentagon they form a $(k + 5)$-element set $M$. The area of the pentagon is defined by connecting lines between the points of $M$ into sub-areas in such a way that it is divided into sub-areas in such a way that no sub-areas have a point on their interior of $M$ and contains exactly three points of $M$ on the boundary of each part. None of the connecting lines has a point in common with any other connecting line or pentagon side, which does not belong to $M$. With such a decomposition of the pentagon, there can be an even number of connecting lines (including the pentagon sides) go out? The answer has to be justified.

Prove that for any integer $n$ greater than $5$, a square can be divided into $n$ squares.