101731: [AtCoder]ABC173 B - Judge Status Summary

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $200$ points

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\leq i \leq N$), you are given a string $S_i$ 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 \leq N \leq 10^5$
  • $S_i$ is AC, WA, TLE, or RE.

Input

Input is given from Standard Input in the following format:

$N$
$S_1$
$\vdots$
$S_N$

Output

Let $C_0$, $C_1$, $C_2$, and $C_3$ be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:

AC x $C_0$
WA x $C_1$
TLE x $C_2$
RE x $C_3$

Sample Input 1

6
AC
TLE
AC
AC
WA
TLE

Sample Output 1

AC x 3
WA x 1
TLE x 2
RE x 0

We have $3$, $1$, $2$, and $0$ test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.


Sample Input 2

10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC

Sample Output 2

AC x 10
WA x 0
TLE x 0
RE x 0

Input

题意翻译

给定 $n$ 个字符串,每个字符串都是“AC”“WA”“TLE”“RE”中的一个(不含双引号)。要求统计这些字符串中这四种字符串各有多少个,并按照指定格式输出。

加入题单

算法标签: