Judge Status Summary

AtCoder
IDabc173_b
Time2000ms
Memory256MB
Difficulty
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$ [samples]
Samples
Input #1
6
AC
TLE
AC
AC
WA
TLE
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.
Input #2
10
AC
AC
AC
AC
AC
AC
AC
AC
AC
AC
Output #2
AC x 10
WA x 0
TLE x 0
RE x 0
API Response (JSON)
{
  "problem": {
    "name": "Judge Status Summary",
    "description": {
      "content": "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 g",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc173_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\nThe problem has $N$ test cases.\nFor each test case $i$ ($1\\leq i \\leq N$), you are g...",
      "is_translate": false,
      "language": "English"
    }
  ]
}
Full JSON Raw Segments