OJ Board

I getting WA with this problem but I think that my solution is OK.
My algorithm:
I use matrix chain multiplication.
I send my solution to p10229( Modular Fibonacci ) and I got Accepted.
Are there any tricks?

Thanks a lot. I got Accepted now. I have to watch on accuracy

Can anyone find what's wrong with my solution? If h1 and h2 are heights of ladders on walls then sqr(d)=sqr(x)-sqr(h1) , sqr(d)=sqr(y)-sqr(h2) , and h/h2=(h1-h)/h1. From this we have equation (sqr(x)-sqr(h1)-sqr(y))*sqr(h-h1)+sqr(h*h1)=0. Now I'm finding h1 with binary search, and then d. What's ...

The problem is simple but I can't find out why WRONG ANSWER
[pascal]var i,j,k,l,o,n,m:integer;
x1,x2,y1,y2,y3,a1,b1,dis:real;
a:array[0..19,1..5] of real;
b:array[0..19,1..4] of real;

function dist(x1,y1,x2,y2:real):real;
begin
dist:=sqrt(sqr(x1-x2)+sqr(y2-y1));
end;

begin
read(n);
while n>=0 ...

Can anyone tell me what's wrong with my program?
:( HELP
var i,n:integer;
px,py,krx,kry,kx,ky,pox,poy,rj,rx,ry,srx,sry:extended;

function ud(px,py,kx,ky:extended):extended;
begin
ud:=sqrt(sqr(px-kx)+sqr(py-ky));
end;

function raz(a,b:extended):boolean;
var e:boolean;
a1,b1:real;
begin
e ...

Thanks. I got Accepted now. I always forgot about those blank lines

[/quote] I don't understand why my code gives Presentation Error. Can anyone tell me? var m,i,j,k,n,u,v,l:longint;
s:string[200];
a:array[0..100,0..300] of longint;
b:array[0..100,1..2] of integer;
begin
read(u);
for v:=1 to u do begin
for i:=0 to 100 do for j:=0 to 300 do a[i,j]:=2000000000 ...

[pascal]
Can anybody tell me what's wrong whit my solution? WA after Being Judged :( :program p123(input,output);
var b:array[0..1000] of boolean;
a:array[0..1000,1..2] of integer;
c:array[1..1000,1..2] of integer;
n,i,u,v,j,k,l:integer;

function ccw(k1,k2,k3:integer):boolean;
var p:real;
begin ...