CodeForces 630N-Forecast-蒲公英云

CodeForces 630N-Forecast

N. Forecast

time limit per test

0.5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

The Department of economic development of IT City created a model of city development till year 2100.

To prepare report about growth perspectives it is required to get growth estimates from the model.

To get the growth estimates it is required to solve a quadratic equation. Since the Department of economic development of IT City creates realistic models only, that quadratic equation has a solution, moreover there are exactly two different real roots.

The greater of these roots corresponds to the optimistic scenario, the smaller one corresponds to the pessimistic one. Help to get these estimates, first the optimistic, then the pessimistic one.

Input

The only line of the input contains three integers a, b, c ( - 1000 ≤ a, b, c ≤ 1000) — the coefficients of ax2 + bx + c = 0 equation.

Output

In the first line output the greater of the equation roots, in the second line output the smaller one. Absolute or relative error should not be greater than 10 - 6.

Examples

input

1 30 200

output

-10.000000000000000
-20.000000000000000
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define LL __int64 
using namespace std;
int main()
{
    int a,b,c;
    while(scanf("%d%d%d",&a,&b,&c)!=EOF)
    {
        if(a==0)
        {
            if(b==0)
            {
                printf("0\n0\n");
            }
            else
            {
                double mm;
                mm=-1*(c/b);
                printf("%lf\n",mm);
                printf("%lf\n",mm);
            }
        }
        else
        {
            double aa,bb;
            aa=b*b-4*a*c;
            aa=sqrt(aa);
            double ans1,ans2,cc;
            cc=-1*b+aa;
            bb=-1*b-aa;
            cc=cc/(2*a);
            bb=bb/(2*a);
            ans1=min(cc,bb);
            ans2=max(cc,bb);
            printf("%lf\n%lf\n",ans2,ans1); 
        }
    }
    return 0;
}