Algorithm

B. Equation
time limit per test
1 second
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/20/B
input
standard input
output
standard output

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.

Examples
input
Copy
1 -5 6
output
Copy
2
2.0000000000
3.0000000000



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>
#include <cmath>

int main(){

    double a, b, c; scanf("%lf %lf %lf", &a, &b, &c);
    if(a == 0){
        if(b == 0){puts(c ? "0" : "-1");}
        else{printf("1\n%.6lf\n", -c/b);}
    }
    else{
        if(a < 0){a = -a; b = -b; c = -c;}
        double d = b * b - 4 * a * c;
        if(d < 0){puts("0");}
        else if(d == 0){printf("1\n%.6lf\n", - b / (2 * a));}
        else if(d > 0){printf("2\n%.6lf\n%.6lf\n", (-b - sqrt(d)) / (2 * a), (- b + sqrt(d)) / (2 * a));}
    }

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
1 -5 6

Output

x
–
+
cmd
2
2.0000000000
3.0000000000
Advertisements

Demonstration

Codeforces Solution-B. Equation-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+