How to understand the Online Judge answers
A few seconds after sending the E-Mail with your program, you'll receive a confirmation reply by E-Mail from the judge system (unless you have selected not to receive replies by E-Mail: note that there is enough information in the Web, updated in real time).
Your program will be compiled and run in our system, and the automatic judge will test it with some inputs and outputs, or perhaps with a specific judge tool. After some seconds or minutes, you'll receive by E-Mail (or you'll see in the Web) one of these answers:
Accepted (AC) (and the CPU time & memory used): OK! Your program is correct!. Note that during true contest perhaps only 1 CPU minute will be allowed If your program spents a reasonable time, it may be Ok, but this depends on the judge power in comparison with the true contest computers.
Presentation Error (PE): Your program outputs are correct but are not presented in the correct way. Check for spaces, justify, line feeds...
Accepted (P.E.): Same as above, but the Presentation Error is intended only for contests. The 24-hours judge takes it only as a warning. Don't worry a lot, since many of our problems have the output specification not very fine.
Wrong Answer (WA): Correct solution not reached for the inputs. The inputs and outputs that we use to test the programs are not public (it is recomendable to get accustomed to a true contest dynamic .
Crash - Runtime Error (RE): Your program failed during the execution (segmentation fault, floating point exception...). The exact cause is reported to the user.
Time Limit Exceeded (TL): Your program tried to run during too much time; this error don't allows you to know if your program would reach the correct solution to the problem.
Memory Limit Exceeded (ML): Your program tried to use more memory than the judge default settings. If you are sure that such problem needs more memory, please contact us.
Output Limit Exceeded (OL): Your program tried to write too much information. This usually occurs if it goes into a infinite loop.
Restricted Function (RF): Your source program tried to use a not allowed function (such as fork(), fopen(), ...)
Compile Error (CE): The compiler (gcc/g++/gpc) could not compile your ANSI program. Of course, warning messages are not error messages. The compiler output messages are reported you by E-Mail.
Submission Error (SE): You don't specified correctly the @JUDGE_ID fields (a incorrect User ID, number of problem...).
Can't Be Judged (CJ): The judge hasn't test input and outputs for the selected problem. While choosing a problem be careful to ensure that the judge will be able to judge it!.
Access Denied (AD): Your Internet address is not allowed to submit problems. Maybe you have setup to accept programs only from your E-Mail address: edit and update your personal information in the Web. Otherwise, contact us.
Non Authenticated (NA): Your E-Mail is not authenticated or the submit tool did not sent authentication information. If you aren't a hacker, please contact us.
Out Of Contest Time (OC): this message can only appear during a contest, if a program is submitted out of contest time.
Delayed (DL): if the judge host is too busy, the execution of programs which spent too much resources (inside the allowed limits) is delayed by some seconds or minutes. Don't re-submit again your program (the judge would spent even more time before replying).
Judge Disabled: this message may appear only during internal maintenance tasks, which are previously announced most times. Probably, your program will be processed later unless the letter explicitly tells you to resubmit it again in future.
Judge Not Ready!: By some reason, the judge host has just rebooted and the judge software is currently being loaded. Try to submit again your program within a few seconds.
All E-Mails (and submissions via Submit-o-matic) received and the results of their actions are logged; this would allow us to detect any possible intention to use the judge for incorrect purposes. If you submit several programs for the same problem and you get several accepted messages for it, you'll appear in the ranklist only with your better solution (less CPU time and/or memory spent).
The Owen Astrachan solution in language C, Java or the Pascal solution (thanks to [i:8bdb284ec5]Sultanbek Tezadov[/i:8bdb284ec5]!) for problem 100 (the 3n+1 problem) are available as a example (download their language C, Java or Pascal source code if you like).