CodeForces-630 N. Forecast【求根公式】

最新推荐文章于 2021-08-15 21:01:35 发布

原创最新推荐文章于 2021-08-15 21:01:35 发布 · 433 阅读

0 ·

CC 4.0 BY-SA版权

=====codeforces===== 同时被 2 个专栏收录

75 篇文章

订阅专栏

简单数学知识

58 篇文章

订阅专栏

本文提供了一段代码实现一元二次方程的解，并按大小顺序输出，适用于经济城市发展模型中预测增长前景的需求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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<math.h>
int main()
{
    double a,b,c;
    while(~scanf("%lf%lf%lf",&a,&b,&c))
    {
        double tp=sqrt(b*b-4*a*c),x1,x2;
        x1=(-b+tp)/(2*a);x2=(-b-tp)/(2*a);
        if(x1<x2)
        {
            tp=x1;x1=x2;x2=tp;
        }
        printf("%.7f\n%.7f\n",x1,x2);
    }
    return 0;
}