Problem

Source: 2009 Moldova NMO 9.4

Tags: geometry, combinatorial geometry



A side of an arbitrary triangle has a length greater than $1$. Prove that the given triangle it can be cut into at least $2$ triangles, so that each of them has a side of length equal to $1$.