Is it possible to write positive integers from $1$ to $2025$ in the cells of a \( 45 \times 45 \) grid such that each number is used exactly once, and at the same time, each written number is either greater than all the numbers located in its side-adjacent cells or smaller than all the numbers located in its side-adjacent cells? [i]Proposed by Anton Trygub[/i]

Ana draws a checkered board that has at least 20 rows and at least 24 columns. Then, Beto must completely cover that board, without holes or overlaps, using only pieces of the following two types: Each piece must cover exactly 4 or 3 squares of the board, as shown in the figure, without leaving the board. It is permitted to rotate the pieces and it is not necessary to use all types of pieces. Explain why, regardless of how many rows and how many columns Ana's board has, Beto can always complete his task.

On grid paper, mark three nodes so that in the triangle they formed, the sum of the two smallest medians equals to half-perimeter.

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

How many paths are there from$ A$ to the line $BC$ if the path does not go through any vertex twice and always moves to the left? [img]https://cdn.artofproblemsolving.com/attachments/e/6/a4bc3a9decc06eaeed6f7e99cb58f7b2524471.jpg[/img]

Let $a$ and $b$ be two positive integers satifying $gcd(a, b) = 1$. Consider a pawn standing on the grid point $(x, y)$. A step of type A consists of moving the pawn to one of the following grid points: $(x+a, y+a),(x+a,y-a), (x-a, y + a)$ or $(x - a, y - a)$. A step of type B consists of moving the pawn to $(x + b,y + b),(x + b,y - b), (x - b,y + b)$ or $(x - b,y - b)$. Now put a pawn on $(0, 0)$. You can make a (nite) number of steps, alternatingly of type A and type B, starting with a step of type A. You can make an even or odd number of steps, i.e., the last step could be of either type A or type B. Determine the set of all grid points $(x,y)$ that you can reach with such a series of steps.

Twenty-five people of different heights stand in a $5\times 5$ grid of squares, with one person in each square. We know that each row has a shortest person, suppose Ana is the tallest of these five people. Similarly, we know that each column has a tallest person, suppose Bev is the shortest of these five people. Assuming Ana and Bev are not the same person, who is taller: Ana or Bev? Prove that your answer is always correct.

For some positive integer $n$, consider the board $n\times n$. On this board you can put any rectangles with sides along the sides of the grid. What is the smallest number of such rectangles that must be placed so that all the cells of the board are covered by distinct numbers of rectangles (possibly $0$)? The rectangles are allowed to have the same sizes. [i]Proposed by Anton Trygub[/i]

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)

There is a rectangular plot of size $1 \times n$. This has to be covered by three types of tiles - red, blue and black. The red tiles are of size $1 \times 1$, the blue tiles are of size $1 \times 1$ and the black tiles are of size $1 \times 2$. Let $t_n$ denote the number of ways this can be done. For example, clearly $t_1 = 2$ because we can have either a red or a blue tile. Also $t_2 = 5$ since we could have tiled the plot as: two red tiles, two blue tiles, a red tile on the left and a blue tile on the right, a blue tile on the left and a red tile on the right, or a single black tile. [list=a] [*]Prove that $t_{2n+1} = t_n(t_{n-1} + t_{n+1})$ for all $n > 1$. [*]Prove that $t_n = \sum_{d \ge 0} \binom{n-d}{d}2^{n-2d}$ for all $n >0$. [/list] Here, \[ \binom{m}{r} = \begin{cases} \dfrac{m!}{r!(m-r)!}, &\text{ if $0 \le r \le m$,} \\ 0, &\text{ otherwise} \end{cases}\] for integers $m,r$.

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

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]

For positive integers $m,n \geq 2$, let $S_{m,n} = \{(i,j): i \in \{1,2,\ldots,m\}, j\in \{1,2,\ldots,n\}\}$ be a grid of $mn$ lattice points on the coordinate plane. Determine all pairs $(m,n)$ for which there exists a simple polygon $P$ with vertices in $S_{m,n}$ such that all points in $S_{m,n}$ are on the boundary of $P$, all interior angles of $P$ are either $90^{\circ}$ or $270^{\circ}$ and all side lengths of $P$ are $1$ or $3$.

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

Let $a$, $b$, $n$ be positive integers such that $a + b \leq n^2$. Alice and Bob play a game on an (initially uncoloured) $n\times n$ grid as follows: - First, Alice paints $a$ cells green. - Then, Bob paints $b$ other (i.e.uncoloured) cells blue. Alice wins if she can find a path of non-blue cells starting with the bottom left cell and ending with the top right cell (where a path is a sequence of cells such that any two consecutive ones have a common side), otherwise Bob wins. Determine, in terms of $a$, $b$ and $n$, who has a winning strategy.

On grid paper, mark three nodes so that in the triangle they formed, the sum of the two smallest medians equals to half-perimeter.

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.

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?

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.)

Leticia has a $9\times 9$ board. She says that two squares are [i]friends[/i] is they share a side, if they are at opposite ends of the same row or if they are at opposite ends of the same column. Every square has $4$ friends on the board. Leticia will paint every square one of three colors: green, blue or red. In each square a number will be written based on the following rules: - If the square is green, write the number of red friends plus twice the number of blue friends. - If the square is red, write the number of blue friends plus twice the number of green friends. - If the square is blue, write the number of green friends plus twice the number of red friends. Considering that Leticia can choose the coloring of the squares on the board, find the maximum possible value she can obtain when she sums the numbers in all the squares.

On grid paper, mark three nodes so that in the triangle they formed, the sum of the two smallest medians equals to half-perimeter.

In a town there are $n$ avenues running from south to north. They are numbered $1$ through $n$ (from west to east). There are $n$ streets running from west to east – they are also numbered $1$ through $n$ (from south to north). If you drive through the junction of the $k$th avenue and the $\ell$th street, you have to pay $k\ell$ kroner. How much do you at least have to pay for driving from the junction of the $1$st avenue and the $1$st street to the junction of the nth avenue and the $n$th street? (You also pay for the starting and finishing junctions.)

Let $n$ be an odd positive integer and consider an $n \times n$ chessboard of $n^2$ unit squares. In some of the cells of the chessboard, we place a knight. A knight in a cell $c$ is said to [i]attack [/i] a cell $c'$ if the distance between the centers of $c$ and $c'$ is exactly $\sqrt{5}$ (in particular, a knight does not attack the cell which it occupies). Suppose each cell of the board is attacked by an even number of knights (possibly zero). Show that the configuration of knights is symmetric with respect to all four axes of symmetry of the board (i.e. the configuration of knights is both horizontally and vertically symmetric, and also unchanged by reflection along either diagonal of the chessboard). [i]NIkolai Beluhov[/i]

$N$ cells chosen on a rectangular grid. Let $a_i$ is number of chosen cells in $i$-th row, $b_j$ is number of chosen cells in $j$-th column. Prove that $$ \prod_{i} a_i! \cdot \prod_{j} b_j! \leq N! $$

Two player are playing in an $100 \times 100$ grid. Initially the whole board is black. On $A$'s move, he selects $4 \times 4$ subgrid and color it white. On $B$'s move, he selects a $3 \times 3$ subgrid and colors it black. $A$ wants to make the whole board white. Can he do it? [i]Proposed by S M A Nahian[/i]