#include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; const ll INF=1LL<<60; typedef pair P; typedef pair PP; const ll MOD=1e9+7; ll gcd(ll x,ll y){ return y==0?x:gcd(y,x%y); } double f(ll n){ const int N=100; double lb=0,ub=n+1; for(int t=0;t>a>>b>>c; if(a==0){ if(b==0){ if(c==0){ //a=b=c=0 //解xは∞個 cout<<-1<0){ double x1,x2; if(b>0){ x1=(1.0*(-b)-sqrt(D))/(2*a); x2=-1.0*b/a-x1; //x2=1.0*c/(a*x1); }else{ x1=(1.0*(-b)+sqrt(D))/(2*a); if(b*b==D){ //コーナーケース x1=0; } x2=-1.0*b/a-x1; //x2=1.0*c/(a*x1); } //double x2=(1.0*(-b)+sqrt(D))/(2*a); //double x2=-1.0*b/a-x1; //double x1=(1.0*(-b)-f(D))/(2*a); //double x2=(1.0*(-b)+f(D))/(2*a); cout<<2<