HDU 2199 Can You solve this equation?_ two-point search

1#include <iostream>2#include <cstdio>3#include <cmath>4 #defineSC (x) scanf ("%d",& (x))5 #definePF (x) printf ("%.4lf\n", X)6 using namespacestd;7 intT;8 DoubleY;9 DoubleRDoublex)Ten { One     return(8*pow (x,4) +7*pow (x,3) +2*pow (x,2) +3*x +6); A } - DoubleFind () - { the     DoubleFront =0, rear = -, mid; -      while((Rear-front) > 1e-6) -     { -Mid = (front + rear)/2; +         if(R (Mid) <Y) -Front = mid + 1e-7; +         Else ARear = mid-1e-7; at     } -     return(front + rear)/2; - } - intMain () - { - SC (T); in      while(t--) -     { toCIN >>Y; +         if(R (0) <= y && y <= R ( -)) - PF (Find ()); the         Else *cout <<"No solution!"<<Endl; $     }Panax Notoginseng     return 0; -}

View Code

HDU 2199 Can You solve this equation?_ two-point search