Each cell of a $3 $ × $3$ grid is labeled with a digit in the set {$1, 2, 3, 4, 5$} Then, the maximum entry in each row and each column is recorded. Compute the number of labelings for which every digit from $1$ to $5$ is recorded at least once.

A plane is divided into unit squares by two collections of parallel lines. For any $n\times n$ square with sides on the division lines, we define its frame as the set of those unit squares which internally touch the boundary of the $n\times n$ square. Prove that there exists only one way of covering a given $100\times 100$ square whose sides are on the division lines with frames of $50$ squares (not necessarily contained in the $100\times 100$ square). (A. Perlin)

A board $ n \times n$ ($n \ge 3$) is divided into $n^2$ unit squares. Integers from $O$ to $n$ included, are written down: one integer in each unit square, in such a way that the sums of integers in each $2\times 2$ square of the board are different. Find all $n$ for which such boards exist.

Given a $m\times n$ grid rectangle with $m,n \ge 4$ and a closed path $P$ that is not self intersecting from inner points of the grid, let $A$ be the number of points on $P$ such that $P$ does not turn in them and let $B$ be the number of squares that $P$ goes through two non-adjacent sides of them furthermore let $C$ be the number of squares with no side in $P$. Prove that $$A=B-C+m+n-1.$$

A number is placed in each cell of an $n \times n$ board so that the following holds: (A) the cells on the boundary all contain 0; (B) other cells on the main diagonal are each1 greater than the mean of the numbers to the left and right; (C) other cells are the mean of the numbers to the left and right. Show that (B) and (C) remain true if ''left and right'' is replaced by ''above and below''.

It is known that a cells square can be cut into $n$ equal figures of $k$ cells. Prove that it is possible to cut it into $k$ equal figures of $n$ cells.

Bethan is playing a game on an $n\times n$ grid consisting of $n^2$ cells. A move consists of placing a counter in an unoccupied cell $C$ where the $2n-2$ other cells in the same row or column as $C$ contain an even number of counters. After making $M$ moves Bethan realises she cannot make any more moves. Determine the minimum value of $M$. [i]United Kingdom, Sam Bealing[/i]

There are $10000$ trees in a park, arranged in a square grid with $100$ rows and $100$ columns. Find the largest number of trees that can be cut down, so that sitting on any of the tree stumps one cannot see any other tree stump.

In a 2025 by 2025 grid, every cell initially contains a `1'. Every minute, we simultaneously replace the number in each cell with the sum of numbers in the cells that share an edge with it. (For example, after the first minute, the number 2 is written in each of the four corner cells.) After 2025 minutes, we colour the board in checkerboard fashion, such that the top left corner is black. Find the difference between the sum of numbers in black cells and the sum of numbers in white cells. [i]Proposed by chorn[/i]

A chess king was placed on a square of an \(8 \times 8\) board and made $64$ moves so that it visited all squares and returned to the starting square. At every moment, the distance from the center of the square the king was on to the center of the board was calculated. A move is called $\emph{pleasant}$ if this distance becomes smaller after the move. Find the maximum possible number of pleasant moves. (The chess king moves to a square adjacent either by side or by corner.)

Petya and Vasya live in neighboring houses (see the plan in the figure). Vasya lives in the fourth entrance. It is known that Petya runs to Vasya by the shortest route (it is not necessary walking along the sides of the cells) and it does not matter from which side he runs around his house. Determine in which entrance he lives Petya . [img]https://cdn.artofproblemsolving.com/attachments/b/1/741120341a54527b179e95680aaf1c4b98ff84.png[/img]

On a $100 \times 100$ chessboard, the plan is to place several $1 \times 3$ boards and $3 \times 1$ board, so that [list] [*] Each tile of the initial chessboard is covered by at most one small board. [*] The boards cover the entire chessboard tile, except for one tile. [*] The sides of the board are placed parallel to the chessboard. [/list] Suppose that to carry out the instructions above, it takes $H$ number of $1 \times 3$ boards and $V$ number of $3 \times 1$ boards. Determine all possible pairs of $(H,V)$. [i]Proposed by Muhammad Afifurrahman, Indonesia[/i]

Let $21$ pieces, some white and some black, be placed on the squares of a $3\times 7$ rectangle. Prove that there always exist four pieces of the same color standing at the vertices of a rectangle.

Determine all integer $n$ such that a surface of an $n \times n \times n$ grid cube can be pasted in one layer by paper $1 \times 2$ rectangles so that each rectangle has exactly five neighbors (by a line segment). (A.Shapovalov)

A [i]stick[/i] is defined as a $1 \times k$ or $k\times 1$ rectangle for any integer $k \ge 1$. We wish to partition the cells of a $2022 \times 2022$ chessboard into $m$ non-overlapping sticks, such that any two of these $m$ sticks share at most one unit of perimeter. Determine the smallest $m$ for which this is possible. [i]Holden Mui[/i]

Suppose a grid with $2m$ rows and $2n$ columns is given, where $m$ and $n$ are positive integers. You may place one pawn on any square of this grid, except the bottom left one or the top right one. After placing the pawn, a snail wants to undertake a journey on the grid. Starting from the bottom left square, it wants to visit every square exactly once, except the one with the pawn on it, which the snail wants to avoid. Moreover, it wants to finish in the top right square. It can only move horizontally or vertically on the grid. On which squares can you put the pawn for the snail to be able to finish its journey?

Let $p$ be a prime number. Determine the largest possible $n$ such that the following holds: it is possible to fill an $n\times n$ table with integers $a_{ik}$ in the $i$th row and $k$th column, for $1\le i,k\le n$, such that for any quadruple $i,j,k,l$ with $1\le i<j\le n$ and $1\le k<l\le n$, the number $a_{ik}a_{jl}-a_{il}a_{jk}$ is not divisible by $p$. [i]Proposed by oneplusone[/i]

Find the greatest number of depicted pieces composed of $4$ unit squares that can be placed without overlapping on an $n \times n$ grid (where n is a positive integer) in such a way that it is possible to move from some corner to the opposite corner via uncovered squares (moving between squares requires a common edge). The shapes can be rotated and reflected. [img]https://cdn.artofproblemsolving.com/attachments/b/d/f2978a24fdd737edfafa5927a8d2129eb586ee.png[/img]

Consider a table with $n$ rows and $2n$ columns. we put some blocks in some of the cells. After putting blocks in the table we put a robot on a cell and it starts moving in one of the directions right, left, down or up. It can change the direction only when it reaches a block or border. Find the smallest number $m$ such that we can put $m$ blocks on the table and choose a starting point for the robot so it can visit all of the unblocked cells. (the robot can't enter the blocked cells.) Proposed by Seyed Mohammad Seyedjavadi and Alireza Tavakoli

A $20 \times 20$ rectangular grid has been given. It is known that one of the grid's unit squares contains a hidden treasure. To find the treasure, we have been given an opportunity to order several scientific studies at the same time, results of which will be known only after some time. For each study we must choose one $1 \times 4$ rectangle, and the study will tell whether the rectangle contains the treasure. The $1 \times 4$ rectangle can be either horizontal or vertical, and it can extend over a side of the $20 \times 20$ grid, coming back in at the opposite side (you can think of the $20 \times 20$ grid as a torus - the opposite sides are connected). What is the minimal amount of studies that have to ordered for us to precisely determine the unit square containing the treasure?

Let $n$ be a positive integer. A grid of $n\times n$ has some black-colored cells. Drini can color a cell if at least three cells that share a side with it are also colored black. Drini discovers that by repeating this process, all the cells in the grid can be colored. Prove that if there are initially $k$ colored cells, then $$k\geq \frac{n^2+2n}{3}.$$

There is a village of pile-built dwellings on a lake, set on the gridpoints of an $m \times n$ rectangular grid. Each dwelling is connected by exactly $p$ bridges to some of the neighboring dwellings (diagonal connections are not allowed, two dwellings can be connected by more than one bridge). Determine for which values $m,n, p$ it is possible to place the bridges so that from any dwelling one can reach any other dwelling.

Show that a path on a rectangular grid which starts at the northwest corner, goes through each point on the grid exactly once, and ends at the southeast corner divides the grid into two equal halves: (a) those regions opening north or east; and (b) those regions opening south or west. [img]https://cdn.artofproblemsolving.com/attachments/b/e/aa20c9f9bc44bd1e5a9b9e86d49debf0f821b7.png[/img] (The figure above shows a path meeting the conditions of the problem on a $5 \times 8$ grid. The shaded regions are those opening north or east while the rest open south or west.)

A unit square is removed from the corner of an $n \times n$ grid, where $n \geq 2$. Prove that the remainder can be covered by copies of the figures of $3$ or $5$ unit squares depicted in the drawing below. [asy] import geometry; draw((-1.5,0)--(-3.5,0)--(-3.5,2)--(-2.5,2)--(-2.5,1)--(-1.5,1)--cycle); draw((-3.5,1)--(-2.5,1)--(-2.5,0)); draw((0.5,0)--(0.5,3)--(1.5,3)--(1.5,1)--(3.5,1)--(3.5,0)--cycle); draw((1.5,0)--(1.5,1)); draw((2.5,0)--(2.5,1)); draw((0.5,1)--(1.5,1)); draw((0.5,2)--(1.5,2)); [/asy] [b]Note:[/b] Every square must be covered once and figures must not go over the bounds of the grid.

Determine the number of paths from $A$ to $B$ on the picture that go along gridlines only, do not pass through any point twice, and never go upwards? [img]https://cdn.artofproblemsolving.com/attachments/0/2/87868e24a48a2e130fb5039daeb85af42f4b9d.png[/img]