UVa OJ Board

hi yourself! 't was just a thought. Sure, there is only one shortest route in the input I made up, the route via 'Ag' is longer (9) then via 'Ba' (8). I just didn't see your routefinder rule out traveling from 'Bb' (mtime=8) to 'Ag' (mtime=6), since conn['Bb']['Ag']==1 (it's a station), while the ac...

I have no C-compiler at hand, so I did a little 'mind-debugging'. Consider the input: 3 A:a=Cabcdefg=Bb B:a=Cbb=Ag C:a=Aab=Ca BbAa # The correct answer is: 8:Bba=Cba=Aa but I think your program produces: 8:Bb=Agfedcba Your floodfill fills mtime['Ag'] with 6 and mtime['Ba'] with 7. Both values are co...

no problem, mate. thx for looking into it.
I encountered more PEs with other problems. I could report them, if you like, but they could as well be caused by programming errors made by myself.

Thanx for your reply. But whatever I try (:0, or no formatting at all) I still get PE. And there is no extra blank line after the last case. So for the sake of argument, I'll post my solution for #231: [pascal]program p231(input,output); {$IFNDEF ONLINE_JUDGE} type integer=system.longint; {$ENDIF} v...

200 is still too small then... there's no penalty for using large arrays, so why don't try something like 10000?

your arrays are too small. the program tries to access elements outside the range [0..100].

You are right re #138. Now I looked at the problem again, I see the 'zero time' solution, so my statement about the 700 solvers was too hasty, altough I still suspect that a great deal of them (including myself) uses 10 printf statements. This is, however, more a matter of 'personal satisfaction' th...

everything is permitted in love and war...
look at the ranking for #138: the first 700 or so have CPU times of 0ms, so they just outputted the 10 asked values (like i did, btw).
the only thing that counts is a solution that is approved by the judge.
and hey, you saved it some clock cycles!

type integer is signed 32 bits. type cardinal is unsigned 32 bits (could be more, I don't know). this code works: [pascal]var n,r:cardinal; begin repeat readln(n); if (n=0) then break; r:=trunc(sqrt(n)); if (r*r=n) then writeln('yes') else writeln('no'); until false; end. [/pascal] so there's no rou...

Can anybody tell me how to properly format integers? I get a lot of PEs and sometimes WAs because my code obviously does something wrong. I don't use gpp on linux, as advised, but always put the ':1' formatter after a number. In problem 231 I get PE when outputting with: [pascal] writeln('Test #',te...