MathDB

1999 Tournament Of Towns

Part of Tournament Of Towns

Subcontests

(7)
7
1
6
3

TOT 1999 Spring AJ6 64 moves of a rook in a 8x8 chessboard

A rook is allowed to move one cell either horizontally or vertically. After 6464 moves the rook visited all cells of the 8×88 \times 8 chessboard and returned back to the initial cell. Prove that the number of moves in the vertical direction and the number of moves in the horizontal direction cannot be equal.
(A Shapovalov, R Sadykov)

n rectangular holes in rectangle paper

Inside a rectangular piece of paper nn rectangular holes with sides parallel to the sides of the paper have been cut out. Into what minimal number of rectangular pieces (without holes) is it always possible to cut this piece of paper?
(A Shapovalov)

TOT 1999 Autumn AS6 rook on a large chessboard, rectangle combo

On a large chessboard 2n2n of its 1×11 \times 1 squares have been marked such thar the rook (which moves only horizontally or vertically) can visit all the marked squares without jumpin over any unmarked ones. Prove that the figure consisting of all the marked squares can be cut into rectangles.
(A Shapovalov)
2
7
5
7
4
6
3
5
1
8