菜单 学习猿地 - LMONKEY

VIP

开通学习猿地VIP

尊享10项VIP特权 持续新增

知识通关挑战

打卡带练!告别无效练习

接私单赚外块

VIP优先接,累计金额超百万

学习猿地私房课免费学

大厂实战课仅对VIP开放

你的一对一导师

每月可免费咨询大牛30次

领取更多软件工程师实用特权

入驻
457
0

Equation

原创
05/13 14:22
阅读数 38280

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.

Example

Input
1 -5 6
Output
2
2.0000000000
3.0000000000

分类讨论。。如果根是0,单独讨论,不然会输出-0。
代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
    double a,b,c,det;
    scanf("%lf%lf%lf",&a,&b,&c);
    det = b * b - 4 * a * c;
    if(a == 0)
    {
        if(b == 0 && c == 0)printf("%d",-1);
        else if(b == 0)printf("%d",0);
        else if(c == 0)printf("%d\n%.10f",1,0);
        else printf("%d\n%.10f",1,-1.0 * c / b);
    }
    else if(b == 0 && c == 0)
    {
        printf("%d\n%.10f",1,0);
    }
    else if(det < 0)printf("%d",0);
    else if(det == 0)
    {
        printf("%d\n%.10f",1,-0.5 * b / a);
    }
    else
    {
        if(a > 0)printf("%d\n%.10f\n%.10f",2,0.5 / a * (- b - sqrt(det)),0.5 / a * (sqrt(det) - b));
        else printf("%d\n%.10f\n%.10f",2,0.5 / a * (sqrt(det) - b),0.5 / a * (- b - sqrt(det)));
    }
}

 

发表评论

0/200
457 点赞
0 评论
收藏