UVa OJ Board

there are two ways: the first, which i used, is: readln(input,count); while (count>0) do begin readln(input); {read blank space} .... {read input like usual problem} count:=count-1; end. or you can also use this: readln(input,temp); while not eof(input) do begin readln(input); {read blank space} ......

i can't find anything wrong with your program, it produce the same output with my AC program for any test case i've tried. Maybe the problem is from reading the input? And will there be more than 1 car waiting for one car park? If yes, my programme can't solve the problem. no, there won't be such ca...

fpnc wrote:... but you'll get a perfect "Restricted function" when doing that in our system, as file access is forbiden.

i used it on the local contest, i've never used it on the program i submit to OJ

Just use input as the file for the keyboard, and output as the file for the console, and do not try to open or close them. btw, just want to add that we still can open/close that special input/output file and direct them to standard input/output by using '' as parameter. for example: [pascal] assig...

hi,
i think it's not the problem with FPC, it's just that the input data is badly formatted. Instead of readln, i use read, and i get AC using Pascal

so the input could be like this:

Why do you have to sort it? You only have to check the _absolute difference_ between the current number and its pred. If it match the required condition then it's a jolly, else it's not a jolly jumper. Be careful, i've got WA for several times too because i misunderstand the problem. I hope you don'...

hmmm, sometimes it's about how to READ the input, not to write it. You know, the input could be ugly for some problem, lot of blank space, empty line, etc etc etc.

i guess no cell number > 10000, although 10000 will occur.
maybe you can try this:
answer is: good luck

thank you very much Even, and all who help me
i'm still not getting AC, but now i got TLE. I think it's much better than WA just need a little tweak here and there...
once again, thank you thank you thank you

hi even, first, thank you so much for your help according to your hint, i change my algo to the following, please tell me where i go wrong... min = inf, nmin = -1 for all intersect i do for all intersect j do if no firestation in intersection j and distance[i,j]<min then nmin = j min = distance[i,j]...

so i have to find the intersection which have the most/average shortest path to another intersection? from the matrix, can i just sum the total distance of every intersection to other intersection and find the minimum? for the previous test case, my floydd matrix is: 0 10 20 20 10 0 10 10 20 10 0 20...

i think you misunderstood the problem :) first, 5 is the number of test case... 2nd, for 10 blocks, the possible arrangement is 1*1*10 or 1*2*5. that goes to 26 blocks, which have possible arrangement of 1*1*26 or 1*2*13. For 27 blocks, the possible arrangement is 1*1*27, 1*3*9, and 3*3*3. For each ...

okay, now could you tell me why the 3rd case output from Even is 2? i still don't understand it

output is
is it correct?

hmmm, same as mine... i still got WA too.. i have test the judge input using halt() (pascal), and it looks like there's an input when there's already one or more firestation in every intersection. So i think i have to find how to solve that case, but how :-? some of my though: 1. put the firestation...