|Online MIPT programming contest||РУССКИЙ|
Time limit = 5Your program should determine whether all roots of 4-degree polynom have modulus less than 1.
Input Input consists of one line with 5 coefficients delimited with space. Coefficients are real numbers less than 1 000 000 in absolute value.
1 2 3 4 5corresponds to
x4 + 2x3 + 3x2 + 4x + 5
Note that coefficients may be equal to zero, and actual degree of the polynom may be less than 4. It's known that root's set is not empty.
In input tests there are no polynoms having maximum modulus of root equal to exactly 1.
Output One line with 'YES' (if absolute values of all roots less than 1) or 'NO' (otherwise).
1 1 1 1 0.5
5 4 3 2 10
© acm.mipt DevGroup
The page was generated in 200ms