def bin_pow(a, x):
if a == 1 or x == 0:
return 1
if x == 1:
return a
if x & 1:
return bin_pow(a, x - 1) * a
else:
temp = bin_pow(a, x >> 1)
return temp * temp
def fact(n):
i = 1
while n:
i *= n
n -= 1
return i
a, b, c = map(int, input().split())
d = (b * b - 4 * a * c) ** 0.5
print(max((-b + d) / 2 / a, (-b - d) / 2 / a))
print(min((-b + d) / 2 / a, (-b - d) / 2 / a))#include<bits/stdc++.h>
using namespace std;
int main()
{
double a,b,c;
cin>>a>>b>>c;
double d=sqrt((b*b)-(4*a*c));
double x1=(-b+d)/(2*a);
double x2=(-b-d)/(2*a);
double mx1=max(x1,x2);
double min1=min(x1,x2);
printf("%.16lf\n",mx1);
printf("%.16lf\n",min1);
}1692B - All Distinct | 1156C - Match Points |
1675A - Food for Animals | 1328C - Ternary XOR |
1689A - Lex String | 1708B - Difference of GCDs |
863A - Quasi-palindrome | 1478A - Nezzar and Colorful Balls |
1581B - Diameter of Graph | 404A - Valera and X |
908A - New Year and Counting Cards | 146A - Lucky Ticket |
1594C - Make Them Equal | 1676A - Lucky |
1700B - Palindromic Numbers | 702C - Cellular Network |
1672C - Unequal Array | 1706C - Qpwoeirut And The City |
1697A - Parkway Walk | 1505B - DMCA |
478B - Random Teams | 1705C - Mark and His Unfinished Essay |
1401C - Mere Array | 1613B - Absent Remainder |
1536B - Prinzessin der Verurteilung | 1699B - Almost Ternary Matrix |
1545A - AquaMoon and Strange Sort | 538B - Quasi Binary |
424A - Squats | 1703A - YES or YES |