Special Encoding (APCS 2018-06 Beginner)

Points 100 1.0s 256M

When any letter or digit is stored in a computer, it is stored using binary encoding, which is a sequence consisting of $0$s and $1$s. In this problem, the six characters A ~ F are encoded in a special way: each of these six characters is encoded as a binary sequence of length \(4\), according to the following table:

Character A B C D E F
Code 0101 0111 0010 1101 1000 1100

Write a program that identifies these six characters from their codes.

Input

The first line is a positive integer \(N\), \(1 \le N \le 4\). The following \(N\) lines each contain \(4\) digits (\(0\) or \(1\)) separated by spaces. Each line is guaranteed to be the code of one of the six characters above.

Output

Output the \(N\) characters represented by the codes, with no spaces or line breaks between the characters.

Scoring

The time limit for each test case is \(1\) second; your score is the sum over the test cases you pass. The subtasks are:

  • Subtask 1 (\(50\) points): \(N = 1\)
  • Subtask 2 (\(50\) points): \(N \le 4\)

Sample Input 1

1
0 1 0 1

Sample Output 1

A

Sample Input 2

1
0 0 1 0

Sample Output 2

C

Sample Input 3

2
1 0 0 0
1 1 0 0

Sample Output 3

EF

Sample Input 4

4
1 1 0 1
1 0 0 0
0 1 1 1
1 1 0 1

Sample Output 4

DEBD

Source

APCS programming exam, June 2018, Problem 1.

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test and sample test share the sandbox; about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test and sample test both have a 15 second wall-clock cap (the official judge still uses the problem time limit)
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.