Sofia and Viktor are playing the following game on a $2022 \times 2022$ board: - Firstly, Sofia covers the table completely by dominoes, no two are overlapping and all are inside the table; - Then Viktor without seeing the table, chooses a positive integer $n$; - After that Viktor looks at the table covered with dominoes, chooses and fixes $n$ of them; - Finally, Sofia removes the remaining dominoes that aren't fixed and tries to recover the table with dominoes differently from before. If she achieves that, she wins, otherwise Viktor wins. What is the minimum number $n$ for which Viktor can always win, no matter the starting covering of dominoes. [i]Proposed by Viktor Simjanoski[/i]

In how many ways can $31$ squares be marked on an $8 \times 8$ chessboard so that no two of the marked squares have a common side? (R Zhenodarov)

A $100 \times 100$ table is given. At the beginning, every unit square has number $"0"$ written in them. Two players playing a game and the game stops after $200$ steps (each player plays $100$ steps). In every step, one can choose a row or a column and add $1$ to the written number in all of it's squares $\pmod 3.$ First player is the winner if more than half of the squares ($5000$ squares) have the number $"1"$ written in them, Second player is the winner if more than half of the squares ($5000$ squares) have the number $"0"$ written in them. Otherwise, the game is draw. Assume that both players play at their best. What will be the result of the game ? [i]Proposed by Mahyar Sefidgaran[/i]

a) Given a big square consisting of $7\times 7$ squares. You should mark the centres of $k$ points in such a way, that no quadruple of the marked points will be the vertices of a rectangle with the sides parallel to the sides of the given squares. What is the greatest $k$ such that the problem has solution? b) The same problem for $13\times 13$ square.

Cells of a $2000\times2000$ board are colored according to the following rules: 1)At any moment a cell can be colored, if none of its neighbors are colored 2)At any moment a $1\times2$ rectangle can be colored, if exactly two of its neighbors are colored. 3)At any moment a $2\times2$ squared can be colored, if 8 of its neighbors are colored (Two cells are considered to be neighboring, if they share a common side). Can the entire $2000\times2000$ board be colored? [I]Proposed by K. Kohas[/i]

Each $1 \times 1$ square of an $n \times n$ table contains a different number. The smallest number in each row is marked, and these marked numbers are in different columns. Then the smallest number in each column is marked, and these marked numbers are in different rows. Prove that the two sets of marked numbers are identical. (V Klepcyn)

Consider a triangular table of positive integers \[ \begin{matrix} & & & a_{11} & a_{12} & a_{13} & & & \\ & & a_{21} & a_{22} & a_{23} & a_{24} & a_{25} & & \\ & a_{31} & a_{32} & a_{33} & a_{34} & a_{35} & a_{36} & a_{37} & \\ \iddots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \ddots \end{matrix} \] The first row consists of odd numbers only. For $i>1,j\ge1$ we have \[a_{ij}=a_{i-1,j-2}+a_{i-1,j-1}+a_{i-1,j}.\] If we get out of range with the second index, we consider such $a$ to be zero (eg. $a_{22}=0+a_{11}+a_{12}$ and $a_{37}=a_{25}+0+0$). Show that for every $i>1$ there is $j\in\{1,\ldots,2i+1\}$ such that $a_{ij}$ is even.

Let $x$ and $y$ be odd positive integers. A table $x$ x $y$ is given in which the squares with coordinates $(2,1)$, $(x - 2, y)$, and $(x, y)$ are cut. The remaining part of the table is covered in dominoes and squares [b]2 x 2[/b]. Prove that the dominoes in a valid covering of the table are at least $\frac{3}{2}(x+y)-6$

Pairwise distinct real numbers are arranged into an $m \times n$ rectangular array. In each row the entries are arranged increasingly from left to right. Each column is then rearranged in decreasing order from top to bottom. Prove that in the reorganized array, the rows remain arranged increasingly.

A cricket wants to move across a $2n \times 2n$ board that is entirely covered by dominoes, with no overlap. He jumps along the vertical lines of the board, always going from the midpoint of the vertical segment of a $1 \times 1$ square to another midpoint of the vertical segment, according to the rules: $(i)$ When the domino is horizontal, the cricket jumps to the opposite vertical segment (such as from $P_2$ to $P_3$); $(ii)$ When the domino is vertical downwards in relation to its position, the cricket jumps diagonally downwards (such as from $P_1$ to $P_2$); $(iii)$ When the domino is vertically upwards relative to its position, the cricket jumps diagonally upwards (such as from $P_3$ to $P_4$). The image illustrates a possible covering and path on the $4 \times 4$ board. Considering that the starting point is on the first vertical line and the finishing point is on the last vertical line, prove that, regardless of the covering of the board and the height at which the cricket starts its path, the path ends at the same initial height.

A table consisting of $9$ rows and $2001$ columns is filfed with integers $1,2,..., 2001$ in such a way that each of these integers occurs in the table exactly $9$ times and the integers in any column differ by no more than $3$. Find the maximum possible value of the minimal column sum (sum of the numbers in one column).

Nine numbers are arranged in a square table: $a_1 \,\,\, a_2 \,\,\,a_3$ $b_1 \,\,\,b_2 \,\,\,b_3$ $c_1\,\,\, c_2 \,\,\,c_3$ . It is known that the six numbers obtained by summing the rows and columns of the table are equal: $a_1 + a_2 + a_3 = b_1 + b_2 + b_3 = c_1 + c_2 + c_3 = a_1 + b_1 + c_1 = a_2 + b_2 + c_2 = a_3 + b_3 + c_3$ . Prove that the sum of products of numbers in the rows is equal to the sum of products of numbers in the columns: $a_1 b_1 c_1 + a_2 b_2c_2 + a_3b_3c_3 = a_1a_2a_3 + b_1 b_2 b_3 + c_1 c_2c_3$ . (V Proizvolov)

On an infinite sheet of graph paper a table is drawn so that in each square of the table stands a number equal to the arithmetic mean of the four adjacent numbers. Out of the table a piece is cut along the lines of the graph paper. Prove that the largest number on the piece always occurs at an edge, where $x = \frac14 (a + b + c + d)$.

Let $n > 4$ be an integer. A square is divided into $n^2$ smaller identical squares, in some of which were [b]1’s[/b] and in the other – [b]0's[/b]. It is not allowed in one row or column to have the following arrangements of adjacent digits in this order: $101$, $111$ or $1001$. What is the biggest number of [b]1’s[/b] in the table? (The answer depends on $n$.)

A grid measuring $10 \times 11$ is given. How many "crosses" covering five unit squares can be placed on the grid? (pictured right) so that no two of them cover the same square? [img]https://cdn.artofproblemsolving.com/attachments/a/7/8a5944233785d960f6670e34ca7c90080f0bd6.png[/img]

In every unit square of a$ n \times n$ table ($n \ge 11$) a real number is written, such that the sum of the numbers in any $10 \times 10$ square is positive and the sum of the numbers in any $11\times 11$ square is negative. Determine all possible values for $n$

Consider a table of cyclic permutations ($n\ge2$) \[ \begin{matrix} 1, & 2, & \ldots, & n-1, & n \\ 2, & 3, & \ldots, & n, & 1, \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ n, & 1, & \ldots, & n-2, & n-1. \end{matrix} \] Then multiply each number of the first row by that number of the $k$-th row that is in the same column. Sum all these products and denote $s_k$ the result (e.g. $s_2=1\cdot2+2\cdot3+\cdots+(n-1)\cdot n+n\cdot1$). a) Find a recursive relation for $s_k$ in terms of $s_{k-1}$ and determine the explicit formula for $s_k$. b) Determine both an index $k$ and the value of $s_k$ such that the sum $s_k$ is minimal.

Consider a table with three rows and eleven columns. There are zeroes prefilled in the cell of the first row and the first column and in the cell of the second row and the last column. Determine the least real number $\alpha$ such that the table can be filled with non-negative numbers and the following conditions hold simultaneously: (1) the sum of numbers in every column is one, (2) the sum of every two neighboring numbers in the first row is at most one, (3) the sum of every two neighboring numbers in the second row is at most one, (4) the sum of every two neighboring numbers in the third row is at most $\alpha$.

In each square of the $100\times 100$ square table, type $1, 2$, or $3$. Consider all subtables $m \times n$, where $m = 2$ and $n = 2$. A subtable will be called [i]balanced [/i] if it has in its corner boxes of four identical numbers boxes . For as large a number $k$ prove, that we can always find $k$ balanced subtables, of which no two overlap, i.e. do not have a common box.

Consider the main diagonal and the cells above it in an \( n \times n \) grid. These cells form what we call a tabular triangle of length \( n \). We want to place a real number in each cell of a tabular triangle of length \( n \) such that for each cell, the sum of the numbers in the cells in the same row and the same column (including itself) is zero. For example, the sum of the cells marked with a circle is zero. It is known that the number in the topmost and leftmost cell is $1.$ Find all possible ways to fill the remaining cells.

For any column and any row in a rectangular numerical table, the product of the sum of the numbers in a column by the sum of the numbers in a row is equal to the number at the intersection of the column and the row. Prove that either the sum of all the numbers in the table is equal to $1$ or all the numbers are equal to $0$.

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?

An infinite squared sheet is given, with squares of side length $1$. The “distance” between two squares is defined as the length of the shortest path from one of these squares to the other if moving between them like a chess rook (measured along the trajectory of the centre of the rook). Determine the minimum number of colours with which it is possible to colour the sheet (each square being given a single colour) in such a way that each pair of squares with distance between them equal to $6$ units is given different colours. Give an example of such a colouring and prove that using a smaller number of colours we cannot achieve this goal. (AG Pechkovskiy, IV Itenberg)

Two people play a game on a $9 \times 9$ board. They move alternately. On each move, the first player draws a cross in an empty cell, and the second player draws a nought in an empty cell. When all $81$ cells are filled, the number $K$ of rows and columns in which there are more crosses and the number $H$ of rows and columns in which there are more noughts are counted. The score for the first player is the difference $B = K- H$. Find a value of $B$ such that the first player can guarantee a score of at least $B$, while the second player can hold the first player's score to at most B, regardless how the opponent plays. (A Kanel)

1.1 Let $f(A)$ denote the difference between the maximum value and the minimum value of a set $A$. Find the sum of $f(A)$ as $A$ ranges over the subsets of $\{1, 2, \dots, n\}$. 1.2 All cells of an $8 × 8$ board are initially white. A move consists of flipping the color (white to black or vice versa) of cells in a $1\times 3$ or $3\times 1$ rectangle. Determine whether there is a finite sequence of moves resulting in the state where all $64$ cells are black. 1.3 Prove that for all positive integers $m$, there exists a positive integer $n$ such that the set $\{n, n + 1, n + 2, \dots , 3n\}$ contains exactly $m$ perfect squares.