The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Let $x$ and $y$ be positive integers we have a table $x\times y$ where $(x + 1)(y + 1)$ points are red(the points are the vertices of the squares). Initially there is one ant in each red point, in a moment the ants walk by the lines of the table with same speed, each turn that an ant arrive in a red point the ant moves $90º$ to some direction. Determine all values of $x$ and $y$ where is possible that the ants move indefinitely where can't be in any moment two ants in the same red point.

Alice and Brian are playing a game on a $1\times (N + 2)$ board. To start the game, Alice places a checker on any of the $N$ interior squares. In each move, Brian chooses a positive integer $n$. Alice must move the checker to the $n$-th square on the left or the right of its current position. If the checker moves off the board, Alice wins. If it lands on either of the end squares, Brian wins. If it lands on another interior square, the game proceeds to the next move. For which values of $N$ does Brian have a strategy which allows him to win the game in a finite number of moves?

A $4\times 8$ grid is divided into $32$ unit squares. There are square tiles of sizes $1 \times 1$, $2 \times 2$, $3 \times 3$ and $4 \times 4$. The goal is to completely cover the grid using exactly $n$ of these tiles. [list=a] [*]Is it possible to do this if $n = 19$? [*]Is it possible to do this if $n = 14$? [*]Is it possible to do this if $n = 7$? [/list] [b]Note:[/b] The tiles cannot overlap or extend beyond the grid.

Let the set $A=${$ 1,2,3, \dots ,48n+24$ } , where $ n \in \mathbb {N^*}$ . Prove that there exist a subset $B $ of $A $ with $24n+12$ elements with the property : the sum of the squares of the elements of the set $B $ is equal to the sum of the squares of the elements of the set $A$ \ $B $ .

Ana and Bob are playing the following game. [list] [*] First, Bob draws triangle $ABC$ and a point $P$ inside it. [*] Then Ana and Bob alternate, starting with Ana, choosing three different permutations $\sigma_1$, $\sigma_2$ and $\sigma_3$ of $\{A, B, C\}$. [*] Finally, Ana draw a triangle $V_1V_2V_3$. [/list] For $i=1,2,3$, let $\psi_i$ be the similarity transformation which takes $\sigma_i(A), \sigma_i(B)$ and $\sigma_i(C)$ to $V_i, V_{i+1}$ and $ X_i$ respectively (here $V_4=V_1$) where triangle $\Delta V_iV_{i+1}X_i$ lies on the outside of triangle $V_1V_2V_3$. Finally, let $Q_i=\psi_i(P)$. Ana wins if triangles $Q_1Q_2Q_3$ and $ABC$ are similar (in some order of vertices) and Bob wins otherwise. Determine who has the winning strategy.

On a plane are given finitely many red and blue lines, no two parallel, such that any intersection point of two lines of the same color also lies on another line of the other color. Prove that all the lines pass through a single point.

In an examination, there are $3600$ students sitting in a $60 \times 60$ grid, where everyone is facing toward the top of the grid. After the exam, it is discovered that there are $901$ students who got infected by COVID-19. Each infected student has a spreading region, which consists of students to the left, to the right, or in the front of them. Student in spreading region of at least two students are considered a close contact. Given that no infected student sat in the spreading region of other infected student, prove that there is at least one close contact.

The numbers $\frac 32$, $\frac 43$ and $\frac 65$ are intially written on the blackboard. A move consists of erasing one of the numbers from the blackboard, call it $a$, and replacing it with $bc-b-c+2$, where $b,c$ are the other two numbers currently written on the blackboard. Is it possible that $\frac{1000}{999}$ would eventually appear on the blackboard? What about $\frac{113}{108}$? [i] (Andrei Bâra)[/i]

In the nation of Onewaynia, certain pairs of cities are connected by roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges). Some roads have a traffic capacity of 1 unit and other roads have a traffic capacity of 2 units. However, on every road, traffic is only allowed to travel in one direction. It is known that for every city, the sum of the capacities of the roads connected to it is always odd. The transportation minister needs to assign a direction to every road. Prove that he can do it in such a way that for every city, the difference between the sum of the capacities of roads entering the city and the sum of the capacities of roads leaving the city is always exactly one. [i]Proposed by Zuming Feng and Yufei Zhao[/i]

Let $n\ge 16$ be an integer, and consider the set of $n^2$ points in the plane: \[ G=\big\{(x,y)\mid x,y\in\{1,2,\ldots,n\}\big\}.\] Let $A$ be a subset of $G$ with at least $4n\sqrt{n}$ elements. Prove that there are at least $n^2$ convex quadrilaterals whose vertices are in $A$ and all of whose diagonals pass through a fixed point.

Let $G$ is a graph and $x$ is a vertex of $G$. Define the transformation $\varphi_{x}$ over $G$ as deleting all incident edges with respect of $x$ and drawing the edges $xy$ such that $y\in G$ and $y$ is not connected with $x$ with edge in the beginning of the transformation. A graph $H$ is called $G-$[i]attainable[/i] if there exists a sequece of such transformations which transforms $G$ in $H.$ Let $n\in\mathbb{N}$ and $4|n.$ Prove that for each graph $G$ with $4n$ vertices and $n$ edges there exists $G-$[i]attainable[/i] graph with at least $9n^{2}/4$ triangles.

Find how many positive integers $k\in\{1,2,\ldots,2022\}$ have the following property: if $2022$ real numbers are written on a circle so that the sum of any $k$ consecutive numbers is equal to $2022$ then all of the $2022$ numbers are equal.

A class has $25$ students. The teacher wants to stock $N$ candies, hold the Olympics and give away all $N$ candies for success in it (those who solve equally tasks should get equally, those who solve less get less, including, possibly, zero candies). At what smallest $N$ this will be possible, regardless of the number of tasks on Olympiad and the student successes?

There are many opposition societies in the city of N. Each society consists of $10$ members. It is known that for every $2004$ societies there is a person belonging to at least $11$ of them. Prove that the government can arrest $2003$ people so that at least one member of each society is arrested. [i]Proposed by V.Dolnikov, D.Karpov[/i]

Set $A=\{1,2,\cdots,n\}$. If there exists nonempty sets $B,C$, such that $B\cap C=\varnothing,B\cup C=A$. Sum of Squares of all elements in $B$ is $M$, Sum of Squares of all elements in $C$ is $N$, $M-N=2016$. Find the minimum value of $n$.

The numbers from $1$ to $50$ are printed on cards. The cards are shuffled and then laid out face up in $5$ rows of $10$ cards each. The cards in each row are rearranged to make them increase from left to right. The cards in each column are then rearranged to make them increase from top to bottom. In the final arrangement, do the cards in the rows still increase from left to right?

Graphistan has $2011$ cities and Graph Air (GA) is running one-way flights between all pairs of these cities. Determine the maximum possible value of the integer $k$ such that no matter how these flights are arranged it is possible to travel between any two cities in Graphistan riding only GA flights as long as the absolute values of the difference between the number of flights originating and terminating at any city is not more than $k.$

There are $9$ point in the Cartezian plane with coordinates $(0,0),(0,1),(0,2),(1,0),(1,1),(1,2),(2,0),(2,1),(2,2).$ Some points are coloured in red and the others in blue. Prove that for any colouring of the points we can always find a right isosceles triangle whose vertexes have the same colour.

Sunny wants to send some secret message to usjl. The secret message is a three digit number, where each digit is one digit from $0$ to $9$ (so $000$ is also possibly the secret message). However, when Sunny sends the message to usjl, at most one digit might be altered. Therefore, Sunny decides to send usjl a longer message so that usjl can decipher the message to get the original secret message Sunny wants to send. Sunny and usjl can communicate the strategy beforehand. Show that sending a $4$-digit message does not suffice. Also show that sending a $6$-digit message suffices. If it is deduced that sending a $c$-digit message suffices for some $c>6$, then partial credits may be awarded.

For a natural number $n{},$ determine the number of ordered pairs $(S,T)$ of subsets of $\{1,2,\ldots,n\}$ for which $s>|T|$ for any element $s\in S$ and $t>|S|$ for any element $t\in T.$

Describe all the ways to color each natural number as one of three colors so that the following condition is satisfied: if the numbers $a$, $b$ and $c$ (not necessarily different) satisfy the condition $2000(a + b) = c$, then they either all the same color or three different colors

Consider $9$ points in the interior of a square of side $1$. Prove that there are three of them that form a triangle with an area less than or equal to $\frac18$ .

A regular hexagon with side length $ 1 $ is given. There are $ m $ points in its interior such that no $ 3 $ are collinear. The hexagon is divided into triangles (triangulated), such that every point of the $ m $ given and every vertex of the hexagon is a vertex of such a triangle. The triangles don't have common interior points. Prove that there exists a triangle with area not greater than $ \frac{3 \sqrt{3}}{4(m+2)}$.

How many permutations of the string $0123456$ are there such that no contiguous substrings of lengths $1<\ell<7$ have a sum of digits divisible by $7$? [i]Proposed by Srinivasan Sathiamurthy[/i]