After login you will be able to create your own lists of problems.

Problems

Sort

Age

Difficulty

Clear filters

Found: 92

Problem #PRU-97880

Problems Set theory and logic Theory of algotithms Game theory Game theory (other) Theory of algorithms (other)

10–12 2.0

A cat tries to catch a mouse in labyrinths A, B, and C. The cat walks first, beginning with the node marked with the letter “K”. Then the mouse (from the node “M”) moves, then again the cat moves, etc. From any node the cat and mouse go to any adjacent node. If at some point the cat and mouse are in the same node, then the cat eats the mouse.

Can the cat catch the mouse in each of the cases A, B, C?

Problem #PRU-98363

Problems Algebra and arithmetic Word problems Tables and tournaments Chessboards and chess pieces Set theory and logic Theory of algotithms Theory of algorithms (other)

10–13 2.0

Initially, on each cell of a \(1 \times n\) board a checker is placed. The first move allows you to move any checker onto an adjacent cell (one of the two, if the checker is not on the edge), so that a column of two pieces is formed. Then one can move each column in any direction by as many cells as there are checkers in it (within the board); if the column is on a non-empty cell, it is placed on a column standing there and unites with it. Prove that in \(n - 1\) moves you can collect all of the checkers on one square.