|
||||||||||
Maple is a good techerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 310 Accepted Submission(s): 18 Problem Description Recently, Mr. Maple feels it more and more boring to check the students' homework, especially those with multiple choice questions. Then he emerges an idea of using computer to help him check the answers. So that Mr. Maple needs a program, which can recognize what letters the students filled in after the answer sheets are scanned into the computer. So far, the answer sheets have been transfered into square-like patterns (refer to the sample), in which ¡®X¡¯ presents the painted pixel, and ¡®.¡¯ presents blank. It¡¯s your turn to write a program for recognition. Go! * Some details about the patterns: 1) The size of patterns is always 16 * 16. 2) Each pattern can have one and only one character. 3) The character belongs to {A, B, C, D}. 4) The written character won¡¯t be too small. 5) The character may be distorted or rotated (a little). 6) Redundant pixels would turn up in a few cases. 7) Necessary pixels would be missing in a few cases. 8) It is guaranteed that all the test data can be easily judged by eye. Input The first line contains the number T of testcases (1 ¡Ü T ¡Ü 50). Then T patterns below. Note that there is a blank line between the patterns. Output For each pattern print a line consisting of the corresponding character. Sample Input
Sample Output
Author 3xian@GDUT Source | ||||||||||
|