1169:0-point-of-study algorithm 76--absolutely impartial referee

1169:0 starting point algorithm 76--absolute impartial referee time limit:1 Sec Memory limit:128 MB 64bit IO Format:%lld
submitted:510 accepted:336
[Submit] [Status] [Web Board] Description

Do you know the Onlinejudge of our school? , you know what he's going to tell you?
Compiling: The code you submitted is being compiled. Running: Your program is running on OJ. Judging:oj is checking that your program's output is correct. Accepted (AC): Your program is correct, congratulations! Presentation Error (PE): Although your program seems to output the correct results, the format of this result is somewhat problematic. Check that the program output is more or less ('), a tab (' \ t '), or a newline character (' \ n '). Wrong Answer (WA): The output is wrong, this is generally considered a problem with the algorithm. Runtime error (RE): Run-time errors, which are typically caused by an illegal operation performed by the program during operation. The common error types are listed below:
1. Your program wants to read from or write to some illegal address space. General examples such as pointers, array subscript out of bounds will cause this error.
2. Your program is attempting to access an array unit beyond the hardware support range.
3. A non-normal floating-point operation was performed. This is usually due to a non-normal floating-point number being involved in a floating-point operation, such as an incorrect floating-point format.
4, floating-point number division has a divisor of zero exception.
5. When integer division occurs, there is an exception with a divisor of zero.
6, Stack overflow. This is generally due to infinite recursion or the use of too large array variables in the function.
...... Other errors, including the C + + standard library/stl run-time library errors, are no longer examples.
Time limit Exceeded (TLE): Your program has run longer than the time limit for this topic. Memory limit Exceeded (MLE): Your program is running more than the memory limit for this topic. Output limit exceeded (OLE): Your program outputs too much, exceeding the output limit of this topic. Compilation Error (CE): There is a problem with your program syntax and the compiler cannot compile. Specific error messages can be viewed by clicking on the link.
Out of Contest time: This information will only appear when the game is played.
Now, if you enter an abbreviated phrase, ask for the output prototype, see the sample.

Input

The first line is an integer t (t <=), the number of test cash case
The first behavior is a number T (T<=20), which is the number of test data
Next, there is a T line to enter an abbreviation (abbreviated to include only AC,PE,WA,RE,TLE,MLE,OLE,CE)

Output

For each set of test data outputs a prototype that acts on this abbreviation

Sample Input

8ACPEWARETLEMLEOLECE

Sample Output

Acceptedpresentation errorwrong answerruntime errortime limit exceededmemory limit exceededoutput limit Exceededcompilation Error

Source

0 Starting point Learning algorithm

1#include <stdio.h>2#include <string.h>3 intMain () {4     intN;5     Chara[ -];6scanf"%d%*c",&n);7          while(n--){8 gets (a);9             if(a[0]=='A'&&a[1]=='C') printf ("accepted\n");Ten             if(a[0]=='P'&&a[1]=='E') printf ("Presentation error\n"); One             if(a[0]=='W'&&a[1]=='A') printf ("wrong answer\n"); A             if(a[0]=='R'&&a[1]=='E') printf ("Runtime error\n"); -             if(a[0]=='T'&&a[1]=='L'&&a[2]=='E') printf ("Time Limit exceeded\n"); -             if(a[0]=='M'&&a[1]=='L'&&a[2]=='E') printf ("Memory Limit exceeded\n"); the             if(a[0]=='O'&&a[1]=='L'&&a[2]=='E') printf ("Output Limit exceeded\n"); -             if(a[0]=='C'&&a[1]=='E') printf ("compilation error\n"); -         } -     return 0; +}

1169:0-point-of-study algorithm 76--absolutely impartial referee