text: # Problem 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 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 Examples Input 6 AC TLE AC AC WA TLE Output AC x 3 WA x 1 TLE x 2 RE x 0 Input 10 AC AC AC AC AC AC AC AC AC AC Output AC x 10 WA x 0 TLE x 0 RE x 0 # Solution #include <bits/stdc++.h> using namespace std; int n,cnt[30]; char S[5]; int main() { scanf("%d",&n); for (int i=1;i<=n;i++) { scanf("%s",S); cnt[S[0]-65]++; } printf("AC x %d\n",cnt[0]); printf("WA x %d\n",cnt['W'-65]); printf("TLE x %d\n",cnt['T'-65]); printf("RE x %d\n",cnt['R'-65]); return 0; }