Bruteforcing length gives WA, bruteforcing angle gives AC

My accepted program 9380769 fails on the test:
1 3 100 1.1 3

Ternary search

for all-integer comparison you have to use int64_t

do not derive the inequality by hand, use Maxima:

rot(c,s) := matrix([c,-s],[s,c]);
/* D: sqrt(a^2+b^2); */
ma: rot(e/D, sqrt(D^2-e^2)/D);
mb: rot(b/D, a/D);
dd: (ma.mb.[a,-b])[1][1],ratsimp;

load(ineq)$
assume(D>0)$ assume(a>0)$ assume(b>0)$ assume(d>0)$ assume(e>0)$
ne: d >= dd;
ne: (ne * D^2)-2*a*b*e,ratsimp;

In what position brick can fall through the hole? Why program like follows doesn't work properly?

var
 a, b, c, d, e: real;
begin
 readln(a, b, c, d, e);
  if (a<=d)and(b<=e)or
     (a<=e)and(b<=d)or
     (a<=d)and(c<=e)or
     (a<=e)and(c<=d)or
     (b<=d)and(c<=e)or
     (b<=e)and(c<=d) then
    writeln('YES')
  else
    writeln('NO')
end.

tanx...

Edited by author 07.11.2008 21:32

Can anyone help me with test #16? Keep getting WA. If anyone knows what is test#16.
Thanks in advance!

I had good formula but couldn't get AC because of precision problems. So, I multiplied input by 10, put it to integers, and transformed formula to avoid "sqrt" and "/". If every variable is integer => there are no precision problems and there is AC.

here is my code
please give some tests...

program brick(input,output);
var
a,b:array[1..3] of real;
c:array[1..2,1..3] of real;
i,j,k:integer;
u:integer;
t,y:boolean;
begin
for i:=1 to 3 do
read(a[i]);
for i:=1 to 2 do
read(b[i]);

for i:=1 to 2 do begin
for j:=1 to 3 do begin
c[i,j]:=b[i]-a[j];
end;
end;
for j:=1 to 3 do begin
if (c[1,j]>=0) then begin
t:=true;
u:=j;
end;
end;

for j:=1 to 3 do begin
if (c[2,j]>=0) and (u<>j) then y:=true;
end;
if t and y then begin
writeln('YES');
halt;
end;
writeln('NO');
end.

give me any hint?

Can somebody give me hint about this test

Help me please. I got WA on test #14 in problem 1234. give me anybody any tests.