All the squares of a $2022 \times 2022$ board will be colored white or black. Chips will be placed in several of these boxes, at most one per box. We say that two tokens attack each other, when the following two conditions are met: a) There is a path of squares that joins the squares where the pieces were placed. This path can have a horizontal, vertical, or diagonal direction. b) All the squares in this path, including the squares where the pieces are, are of the same color. For example, the following figure shows a small example of a possible coloring of a $6 \times 6$ board with $A, B, C, D$, and $E$ tiles placed. The pairs of checkers that attack each other are $(D, E)$, $(C, D)$, and $(B, E)$. [img]https://cdn.artofproblemsolving.com/attachments/2/0/52ec7b7d1c02e266b666e4f8b25e87c58f0c89.png[/img] What is the maximum value of $k$ such that it is possible to color the board and place $k$ tiles without any two of them attacking each other?

In a company of people some pairs are enemies. A group of people is called [i]unsociable[/i] if the number of members in the group is odd and at least $3$, and it is possible to arrange all its members around a round table so that every two neighbors are enemies. Given that there are at most $2015$ unsociable groups, prove that it is possible to partition the company into $11$ parts so that no two enemies are in the same part. [i]Proposed by Russia[/i]

Let $A$ be a set of $8$ elements, and $B := (B_1,...,B_7)$ be an ordered $7$-tuple of subsets of $A$. Let $N$ be the number of such $7$-tuples $B$ such that there exists a unique $4$-element subset $I \subseteq \{1,2,...,7\}$ for which the intersection $\cap _{ i\in I} B_i$ is nonempty. Find the remainder when $N$ is divided by $67$.

In one criminal kingdom, an underdeveloped state, the King decided to start a fight against corruption and, as an example, punish one of his $199$ ministers. The ministers were summoned to the palace and seated at a large round table. At first they wanted to find the one who had the most money in his bank account and declare him the main corrupt official. It takes $20$ minutes to determine the amount of money in the bank account of one minister. But the King ordered that the accused be found within four hours while he underwent medical procedures. According to the Noble Court Administrator, any minister can be accused, you just need to find a legal justification.The Chief Lawyer proposed that the first minister discovered, who has more money in his bank account than each of his two neighbors (one on the right and one on the left), be declared corrupt. How can one be sure to find a minister who meets this condition within the allotted $4$ hours? (During this time, it is possible to consistently determine the size of the bank accounts of no more than $12$ ministers. It is assumed that the amount of money in bank accounts is different.)

$n$ numbers are written on a blackboard. Someone then repeatedly erases two numbers and writes half their arithmetic mean instead, until only a single number remains. If all the original numbers were $1$, show that the final number is not less than $\frac{1}{n}$.

A game consists of a grid of $4\times 4$ and tiles of two colors (Yellow and White). A player chooses a type of token and gives it to the second player who places it where he wants, then the second player chooses a type of token and gives it to the first who places it where he wants, They continue in this way and the one who manages to form a line with three tiles of the same color wins (horizontal, vertical or diagonal and regardless of whether it is the tile you started with or not). Before starting the game, two yellow and two white pieces are already placed as shows the figure below. [img]https://cdn.artofproblemsolving.com/attachments/b/5/ba11377252c278c4154a8c3257faf363430ef7.png[/img] Yolanda and Xinia play a game. If Yolanda starts (choosing the token and giving it to Xinia for this to place) indicate if there is a winning strategy for either of the two players and, if any, describe the strategy.

In the table are written the positive integers $1, 2,3,...,2018$. John and Mary have the ability to make together the following move: [i]They select two of the written numbers in the table, let $a,b$ and they replace them with the numbers $5a-2b$ and $3a-4b$.[/i] John claims that after a finite number of such moves, it is possible to triple all the numbers in the table, e.g. have the numbers: $3, 6, 9,...,6054$. Mary thinks a while and replies that this is not possible. Who of them is right?

Find all values of positive integers $a$ and $b$ such that it is possible to put $a$ ones and $b$ zeros in every of vertices in polygon with $a+b$ sides so it is possible to rotate numbers in those vertices with respect to primary position and after rotation one neighboring $0$ and $1$ switch places and in every other vertices other than those two numbers remain the same.

A convex polygon has the property that its vertices are coloured by three colors, each colour occurring at least once and any two adjacent vertices having different colours. Prove that the polygon can be divided into triangles by diagonals, no two of which intersect in the [b]interior[/b] of the polygon, in such a way that all the resulting triangles have vertices of all three colours.

For real numbers $a_1, a_2, \ldots, a_{200}$, we consider the value $S = a_1a_2 + a_2a_3 + \ldots + a_{199}a_{200} + a_{200}a_1$. In one operation, you can change the sign of any number (that is, change $a_i$ to $-a_i$), and then calculate the value of $S$ for the new numbers again. What is the smallest number of operations needed to always be able to make $S$ nonnegative? [i]Proposed by Oleksii Masalitin[/i]

Any two members of a club with $3n+1$ people plays ping-pong, tennis or chess with each other. Everyone has exactly $n$ partners who plays ping-pong, $n$ who play tennis and $n$ who play chess. Prove that we can choose three members of the club who play three different games amongst each other.

Let $k$ be a positive integer, and set $n=2^k$, $N=\{1, 2, \cdots, n\}$. For any bijective function $f:N\rightarrow N$, if a set $A\subset N$ contains an element $a\in A$ such that $\{a, f(a), f(f(a)), \cdots\} = A$, then we call $A$ as a cycle of $f$. Prove that: among all bijective functions $f:N\rightarrow N$, at least $\frac{n!}{2}$ of them have number of cycles less than or equal to $2k-1$. [i]Note: A function is bijective if and only if it is injective and surjective; in other words, it is 1-1 and onto.[/i] [i]Proposed by CSJL[/i]

In a tennis tournament of $10$ players, everyone played against everyone once. In this tournament, if player $i$ won the match against player $j$, then the total number of matches $i$ lost plus the total number of matches $j$ won is greater than or equal to $8$. We will say that three players $i$, $j$, $k$ form an [i]atypical tri[/i]o if $i$ beat $j$, $j$ beat $k$ and $k$ beat $i$. Prove that in the tournament there were exactly $40$ atypical trios.

Let $n$ be an integer greater than or equal to $3$, and let $P_n$ be the collection of all planar (simple) $n$-gons no two distinct sides of which are parallel or lie along some line. For each member $P$ of $P_n$, let $f_n(P)$ be the least cardinal a cover of $P$ by triangles formed by lines of support of sides of $P$ may have. Determine the largest value $f_n(P)$ may achieve, as $P$ runs through $P_n$.

Consider a triangular grid of equilateral triangles with unit sides. Assume that $\mathcal{P}$ is a non-self-intersecting polygon with perimeter 1399 and sides from the grid. Prove that $\mathcal{P}$ has either an internal or an external 120-degree angle. [i]Proposed by Seyed Hessam Firouzi[/i]

Peter has many squares of equal side. Some of the squares are black, some are white. Peter wants to assemble a big square, with side equal to $n$ sides of the small squares, so that the big square has no rectangle formed by the small squares such that all the squares in the vertices of the rectangle are of equal colour. How big a square is Peter able to assemble?

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

Alberto chooses $2022$ integers $a_1,\,a_2,\dots,\,a_{2022}$ (not necessarily positive and not necessarily distinct) and places them on a $2022\times 2022$ table such that in the $(i,j)$ cell is the number $a_k$, with $k=\max\{i,j\}$, as shown in figure (in which, for a better readability, we have denoted $a_{2022}$ with $a_n$). Barbara does not know the numbers Alberto has chosen, but knows how they are displaced in the table. Given a positive integer $k$, with $1\leq k\leq 2022$, Barbara wants to determine the value of $a_k$ (and she is not interested in determining the values of the other $a_i$'s with $i\neq k$). To do so, Barbara is allowed to ask Alberto one or more questions, in each of which she demands the value of the sum of the numbers contained in the cells of a "path", where with the term "path" we indicate a sorted list of cells with the following characteristics: • the path starts from the top left cell and finishes with the bottom right cell, • the cells of the path are all distinct, • two consecutive cells of the path share a common side. Determine, as $k$ varies, the minimum number of questions Barbara needs to find $a_k$.

There are $N$ cities in the country. Any two of them are connected either by a road or by an airway. A tourist wants to visit every city exactly once and return to the city at which he started the trip. Prove that he can choose a starting city and make a path, changing means of transportation at most once.

Consider a finite binary string $b$ with at least $2017$ ones. Show that one can insert some plus signs in between pairs of digits such that the resulting sum, when performed in base $2$, is equal to a power of two. [i]Proposed by David Stoner

Kimia has a weird clock; the clock's second hand moves 34 or 47 seconds forward instead of each regular second, at random. As an example, if the clock displays the time as $\text{12:23:05}$, the following times could be displayed in this order: $$\text{12:23:39, 12:24:13, 12:25:00, 12:25:34, 12:26:21,\dots}$$ Prove that the clock's second hand would eventually land on a perfect square.

In each cell of a $4\times 4$ table, one of the numbers $1$ or $2$ is written. For each row, calculate the sum of the numbers written in it, and for each column, calculate the product of the numbers written in it. Show that some two of the eight results obtained are equal.

An equilateral triangle is partitioned into smaller equilateral triangular pieces. Prove that two of the pieces are the same size.

Square with side 100 was cut by 99 horizontal and 99 vertical lines into 10000 rectangles (not necessarily with integer sides). How many rectangles in this square with area not exceeding 1 at least can be?

A set $S=\{ s_1,s_2,...,s_k\}$ of positive real numbers is "polygonal" if $k\geq 3$ and there is a non-degenerate planar $k-$gon whose side lengths are exactly $s_1,s_2,...,s_k$; the set $S$ is multipolygonal if in every partition of $S$ into two subsets,each of which has at least three elements, exactly one of these two subsets in polygonal. Fix an integer $n\geq 7$. (a) Does there exist an $n-$element multipolygonal set, removal of whose maximal element leaves a multipolygonal set? (b) Is it possible that every $(n-1)-$element subset of an $n-$element set of positive real numbers be multipolygonal?