1 #include
      
        2 #include
       
         3 #include
        
          4 #include
         
           5 #include
          
            6  7 const  int MAXN=10000; 8 using namespace std; 9 struct node10 {11     double x1,x2;12 } p[MAXN];13 bool cmp(node a,node b)14 {15    return a.x2
           
            m) flag=1;30 double c=sqrt(m*m-y*y);31 p[i].x1=x+c;32 p[i].x2=x-c;33 }34 if(flag==1)35 {36 printf("Case %d: %d\n",ii,-1);37 continue;38 }39 sort(p,p+n,cmp);40 double c=p[0].x1;41 int t=1;42 for(int i=1; i
            
             c)49 {50 t++;51 c=p[i].x1;52 }53 }54 printf("Case %d: %d\n",ii,t);55 }56 return 0;57 }