Preparando MOJI

Equation

1000ms 262144K

Description:

You are given an equation:

Ax2 + Bx + C = 0.

Your task is to find the number of distinct roots of the equation and print all of them in ascending order.

Input:

The first line contains three integer numbers A, B and C ( - 105 ≤ A, B, C ≤ 105). Any coefficient may be equal to 0.

Output:

In case of infinite root count print the only integer -1. In case of no roots print the only integer 0. In other cases print the number of root on the first line and the roots on the following lines in the ascending order. Print roots with at least 5 digits after the decimal point.

Sample Input:

1 -5 6

Sample Output:

2
2.0000000000
3.0000000000

Informação

Codeforces

Provedor Codeforces

Código CF20B

Tags

math

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:27:10

Relacionados

Nada ainda