2850: ABC173B - Judge Status Summary
Memory Limit：128 MB
Time Limit：1.000 S
Judge Style：Text Compare
Creator：
Submit：13
Solved：6
Description
Time Limit: 2 sec / Memory Limit: 1024 MB
Problem Statement
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.
The problem has N test cases.
For each test case i (1≤i≤N), you are given a string Si representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.
See the Output section for the output format.
The problem has N test cases.
For each test case i (1≤i≤N), you are given a string Si representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.
See the Output section for the output format.
Constraints
- 1≤N≤105
- Si is AC, WA, TLE, or RE.
Input
Input is given from Standard Input in the following format:
NS1⋮SN
Output
Let C0, C1, C2, and C3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:
AC x C0
WA x C1
TLE x C2
RE x C3
Sample Input Copy
6
AC
TLE
AC
AC
WA
TLE
Sample Output Copy
AC x 3
WA x 1
TLE x 2
RE x 0