RU-SPB 2013 Problem 104

There are $100$ numbers from $(0,1)$ on the board. On every move we replace two numbers $a,b$ with roots of $x^2-ax+b=0$ (if it has two roots). Prove that process is not endless.