Hello, I am you after 5 years.
You are stupid looser.
Bye.

Thanks. I had the same mistake.

WA5 many times.


Var X,Y,Z:Array[0..51]of DoubLe;
ii,jj,i,j,n:LongInt;
Ans,Ans1:DoubLe;


Procedure SWEP(Var a,b:DoubLe);
Var tmp:DoubLe;
Begin
tmp:=a;a:=b; b:=tmp;
End;

Procedure Crash;
Begin
i:=0;
i:=5 Div i;
End;


Procedure Go(x1,y1,x2,y2:DoubLe);
Var i:LongInt;
Last,S:DoubLe;
Begin
If x2<=x1 Then Crash;
If y2<=y1 Then Crash;

S:=(x2-x1)*(y2-y1);
If S*Z[n]<=Ans Then Exit;

Last:=0;
For i:=1 To N Do
 If (X[i]>x1)And(X[i]<x2)And(Y[i]>y1)And(Y[i]<y2) Then
  Begin
   If Ans<S*(Z[i]-Last) Then Ans:=S*(Z[i]-Last);
   Last:=Z[i];
   If S*(Z[n]-Last)<=Ans Then Exit;
  End;

If Ans<S*(Z[N]-Last) Then Ans:=S*(Z[N]-Last);
End;


Begin
ReadLn(X[0],Y[0],Z[0]);
ReadLn(N);
If n=0 Then Crash;
If N>50 Then Crash;
For i:=1 To N Do ReadLn(X[i],Y[i],Z[i]);

Inc(N);
X[n]:=0;Y[n]:=0;Z[n]:=0;

For i:=0 To N-1 Do
 For j:=i+1 To N Do
   If Z[i]>Z[j] Then
     Begin
      SWEP(X[i],X[j]);
      SWEP(Y[i],Y[j]);
      SWEP(Z[i],Z[j]);
     End;

Ans:=0;
For i:=0 To N Do
 For j:=0 To N Do
  For ii:=0 To N Do  If X[ii]>X[i] Then
    For jj:=0 To N Do
     If Y[jj]>Y[j] Then Go(X[i],Y[j],X[ii],Y[jj]);

Write(Ans:2:2);
End.


Please give hints or tests.

I wrote code like this (in reading data):

 scanf( "%lf", &x );
 if( fabs( int(x*100)-x*100 )>1e-2 )
  throw 0;

and my program have been crashed.

There are five nested cycles. Is it so strange? I think, many people have a same solution. Could you say something about O(n^4) algorithm?