Задача 22 (Integer numbers 2. Euclidean algorithm)

Задача 22.

* Consider a chocolate bar that has a form of an equilateral triangle with a side length $n$ and is divided by grooves into equilateral triangles with side lengths $1$. Two people play a game. A turn consists of breaking off a triangle from the bar along a groove, eating eat and passing the rest to the other player. The one who gets the last piece with a side length $1$ is the winner. If a player cannot make a move, the player loses. If both players play perfectly, who will win?


Чтобы послать решение задачи на проверку, или задать вопрос по условию, войдите на сайт под своим аккаунтом.