{"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 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.\nSee the Output section for the output format.\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^5$\n*   $S_i$ is `AC`, `WA`, `TLE`, or `RE`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc173_b","tags":[],"sample_group":[["6\nAC\nTLE\nAC\nAC\nWA\nTLE","AC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have $3$, $1$, $2$, and $0$ test case(s) for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively."],["10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC","AC x 10\nWA x 0\nTLE x 0\nRE x 0"]],"created_at":"2026-03-03 11:01:14"}}