OJ Board

I got WA many time. I checked my program using the data I found in http://plg.uwaterloo.ca/~acm00/, and it was right.

Who can tell my program's bug? Thanks.
[pascal]
const
maxn = 10010;
var
f,g : array[0 .. maxn] of boolean;
pre : array[0 .. maxn] of integer;
w : array[1 .. 210] of integer ...

Emm~, I changed my algorithm.
First, I use three loops to find the best position for both "I" and agents.
[pascal]
noe := true;
for i := 1 to 32 do if dist[m, i] < 100 then begin
now := true;
for j := 1 to 32 do if (i <> j) and (dist[a1, j] < 100) and (dist[a1, i] > dist[m, i]) then
for k ...

Can I solve it like this :
First calc both "my" and agents' min-dist to all the girds from own position, then compare the dist. If "mine" is shorter than two agents', "I" can escape. Otherwise, "I" may be eliminated or trapped in the Matrix.

I think it may be right. But it got WA.

I also got WA. So i want to know whether i should keep abs(portlen - starboardlen) is minimal. Can anyone who got AC tell me that?

Thanks! I got AC now.

I think my program is no problem. But it got runtime error.

[pascal]
const
name1 = '';
name2 = '';
maxn = 10000;
var
s,t : array[1 .. maxn] of char;
ls,lt : integer;

procedure init;
var w : char;
begin
ls := 0; lt := 0;
fillchar(s, sizeof(s), 0);
fillchar(t, sizeof(t), 0);
read(w ...

I find my bugs.~~~~~


[pascal]
for i := l downto 2 do
if (cp > 0) and (w > 0) then begin
inc(cp[w], cp);
inc(cp[i div w], cp);
cp := 0;
end;
[/pascal]

cp > 0 should be cp <> 0

So far as I know, Longint is a 64bit integer, it can reach 2^63. Right?

I think my algorith is right. But it got WA. Maybe i have some input mistakes.

[pascal]
const
name1 = '';
name2 = '';
maxn = 22;
var
cp,w : array[1 .. maxn] of integer;
ck : array[1 .. maxn] of boolean;
n,l,p : integer;
st : string[maxn];

procedure init;
begin
readln(st);
l := length(st ...

It says "The villages are numbered from 1."
Does it mean the villages are numberd 1, 2, 3, 4, ..., n, when the number of village is n.

DP is OK.
Consider that F is the result when n = i, F[i + 1] = F * (i + 1) / i + 1.

When i compile my program, everything is ok. But when i make the executable file, it didn't work. It just generated a file named ppas.sh. So I can't continue. Why?

It's very obvious that i forgot i had moved it. I'm sorry! Thanks a lot!

Oh, sorry. When I submited it, I deleted it. So it's not the problem.

Well, thank you for your help. But I have already used what you said to improve my programme's speed. It got TLE. I am interested why your programmes is so fast. I post my program. I think you can tell me what's the different between yours and mine.
[pascal]
const
name1 = '';
name2 = '';
maxn ...