#include #include int n; double x[1000], y[1000], r[1000]; int top[1000]; int possible = 1; double ne = 1000, nw = 1000; main(){ int i,j,k; scanf("%d",&n); for (i=0;i 1000) visit(i); if (possible) printf( "Bill enters at (0.00, %0.2lf) and leaves at (1000.00, %0.2lf).\n",nw,ne); else printf("Bill will be bitten.\n"); } visit(int i){ int j,k; double yy; if (top[i]++) return; for (j=0;j 1000) { yy = y[i] - sqrt(r[i]*r[i] - (1000-x[i])*(1000-x[i])); if (yy < ne) ne = yy; } }