OJ Board

For my solution I've got the following answer:

>Dear Magus:
>
>Your program has not solved the problem. It ran during 0.000 seconds.
>
>--
>
>PS: Check the board at http://acm.uva.es/board/
>
>The Online Judge (Linux acm.uva.es 2.4.9-31 i686)
>Judge software version 2.8 [http://acm.uva.es/problemset/]
>jue may 9 07:15:11 UTC 2002

Is there any chance to get information about what is wrong?
Wchich input data has not this same output?

The problem I solved is 10720. I would like to know if my program
gave more or less squares as it should.

greetz
Magus

First, I doubt that you tried to solve #10720 : it does not exists.

Second, try to search the board (use the Search feature above this) to find out if there are any thread about the problem you refer.

If it exists, read it. If you don't find it useful, post a new message IN THAT SAME thread and hope that someone will help you.

If there is no thread about your problem, find the volume to which your problem belongs (eg: C for 10001, 7 for 734) and place a new thread within that volume, with the problem number in the subject. But before doing that, please verify that there is no thread about your problem already.

We, the judge staff, do not give you the input and output files we use to test your program. Read the problem description carefully, try to find "hard cases" or "limit cases" (for example, input is provided sorted or unsorted? have you considered when N is the maximum or 0? etc), and ask other users...

Best regards,