Problem:


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



Sample input:
6
AC
TLE
AC
AC
WA
TLE


Sample output:
AC x 3
WA x 1
TLE x 2
RE x 0

Submission status: Runtime Error

Solution code:
case = input()
import numpy as np
case = np.array(case)
for i in range(len(case)):
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  others = 0
  if case[i] == "AC":
    AC += 1
    return AC
  elif case[i] == "WA":
    WA += 1
    return WA
  elif case[i] == "TLE":
    TLE += 1
    return TLE
  elif case[i] == "RE":
    RE += 1
    return RE
  else :
    others += 1
    return others
print("AC"+"x"+AC)
print("WA"+"x"+WA)
print("TLE"+"x"+TLE)
print("RE"+"x"+RE)

Submission status: Runtime Error

Solution code:
n = int(input())
dict = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
    s = input()
    c
        dict[s] = dict[s] + 1
for k, l  in dict.items():
    print(k + ' x ' + str(l))

Submission status: Runtime Error

Solution code:
case = input()
case = array(case)
for i in range(len(case)):
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  others = 0
  if case[i] == "AC":
    AC += 1
    return AC
  elif case[i] == "WA":
    WA += 1
    return WA
  elif case[i] == "TLE":
    TLE += 1
    return TLE
  elif case[i] == "RE":
    RE += 1
    return RE
  else :
    others += 1
    return others
print("AC"+"x"+AC)
print("WA"+"x"+WA)
print("TLE"+"x"+TLE)
print("RE"+"x"+RE)

Submission status: Runtime Error

Solution code:
def main():
    N = int(input())
    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    for i in range(N):
        St = input()
        if St == 'AC':
            AC += 1
        elif St == 'WA':
            WA += 1
        elif St == 'TLE':
            TLE += 1
        elif St == 'RE':
            RE += 1
        else:

    print('AC x ' + str(AC))
    print('AC x ' + str(WA))
    print('AC x ' + str(TLE))
    print('AC x ' + str(RE))
main()

Submission status: Runtime Error

Solution code:
case = input()
for i in range(len(case)):
  AC = 0
  WA = 0
  TLE = 0
  RE = 0
  others = 0
  if case[i] == "AC":
    AC += 1
    return AC
  elif case[i] == "WA":
    WA += 1
    return WA
  elif case[i] == "TLE":
    TLE += 1
    return TLE
  elif case[i] == "RE":
    RE += 1
    return RE
  else :
    others += 1
    return others
print("AC"+"x"+AC)
print("WA"+"x"+WA)
print("TLE"+"x"+TLE)
print("RE"+"x"+RE)

Submission status: Runtime Error

Solution code:
N = input()
list = [input() for i in range(N)]
print('AC x '+str(list.count(AC)))
print('WA x '+str(list.count(WA)))
print('TLE x '+str(list.count(TLE)))
print('RE x '+str(list.count(RE)))

Submission status: Runtime Error

Solution code:
t = int(input())
wlist = [0]*4
for i in range(t):
    w = input()
    if w == "AC":
        wlist[0] += 1
    elif w == "WA":
   	    wlist[1] += 1
    elif w == "TEL":
        wlist[2] += 1
    else:
        wlist[3] += 1
print("AC x " + wlist[0])
print("WA x " + wlist[1])
print("TEL x " + wlist[2])
print("RE x " + wlist[3])

Submission status: Runtime Error

Solution code:
n = int(input())
s = [input() for _ in range(n)]
c = collections.Counter(s)

print('AC x ', c['AC'])
print('WA x ', c['WA'])
print('TLE x ', c['TLE'])
print('RE x ', c['RE'])

Submission status: Runtime Error

Solution code:
t = int(input())
wlist = [0]*4
for i in range(t):
  w = input()
  if w == "AC":
    wlist[0] += 1
  elif w = "WA":
   	wlist[1] += 1
  elif w = "TEL":
    wlist[2] += 1
  else:
    wlist[3] += 1
print("AC x " + wlist[0])
print("WA x " + wlist[1])
print("TEL x " + wlist[2])
print("RE x " + wlist[3])

Submission status: Runtime Error

Solution code:
N = int(input())
SAC = 0
SWA = 0
STLE = 0
SRE = 0
for i in range(N):
  tmp = imput()
  if tmp == 'AC':
    SAC += 1
  elif tmp == 'WA':
    SWA += 1
  elif tmp == 'TLE':
    STLE += 1
  elif tmp == 'RE':
    SRE += 1

print("AC x " + str(SAC))
print("WA x "+ str(SWA))
print("TLE x "+str(STLE))
print("RE x "+str(SRE))

Submission status: Runtime Error

Solution code:
N=int(input())
S=list(map(input().split())
A=0
W=0
T=0
R=0
for i in range(0,N):
    i=i+0
    if S[i]=="AC":
       A=A+1
    elif S[i]=="WA":
       W=W+1
    elif S[i]=="TLE":
       T=T+1
    else:
       R=R+1
       
print("AC x " + A)
print("WA x " + W)
print("TLE x " + T)
print("RE x " + R)

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
m = [input() for i in range(n)]

ans = [0,0,0,0]

for i in m:
    if i == "AC":
        ans[0] += 1
    elif i == "WA":
        ans[1] += 1
    elif i == "TLE":
        ans[2] += 1
    elif i == "RE":
        nas[3] += 1
    
    
    
print("AC x "+str(ans[0])) 
print("WA x "+str(ans[1]))
print("TLE x "+str(ans[2]))
print("RE x"+str(ans[3]))

Submission status: Runtime Error

Solution code:
def main(self, case):
  for i in range(len(case)):
    AC = 0
    WA = 0
    TLE = 0
    RE = 0
    others = 0
    if case = "AC":
      AC += 1
      return AC
    elif case = "WA":
      WA += 1
      return WA
    elif case = "TLE":
      TLE += 1
      return TLE
    elif case = "RE":
      RE += 1
      return RE
    elif :
      others += 1
      return others
  print("AC"+"x"+AC)
  print("WA"+"x"+WA)
  print("TLE"+"x"+TLE)
  print("RE"+"x"+RE)

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
s = []
for l in sys.stdin:
    s.append(int(l))
    
a = s.count("AC")
b = s.count("WA")
c = s.count("TLE")
d = s.count("RE")
 
print("AC"+"x"+str(a))
print("WA"+"x"+str(b))
print("TLE"+"x"+str(c))
print("RE"+"x"+str(d))

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(input().split())

if s == "AC":
  a = sum(s)
elif s== "WA":
  w = sum(s)
elif s== "TLE":
  t = sum(s)
else:
  e = sum(s)
  
print("AC × ",a)
print("WA × ",w)
print("TLE × ",t)
print("RE × ",r)

Submission status: Runtime Error

Solution code:
print(N)

S = [input() for i in range(N)]
print(S)

ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    if S[i] == 'AC':
        ac += 1
    elif S[i] == 'WA':
        wa += 1
    elif S[i] == 'TLE':
        tle += 1
    elif S[i] == 'RE':
        re += 1

print('AC x' , ac)
print('WA x' ,wa)
print('TLE x' ,tle)
print('RE x' , re)

Submission status: Runtime Error

Solution code:
N = input()
list = [input() for i in range(N)]
print(AC x list.count(AC))
print(WA x list.count(WA))
print(TLE x list.count(TLE))
print(RE x list.count(RE))

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
while True:
    ia = input()
    if ia == "AC":
        ac += 1
    elif ia == "WA":
        wa += 1
    elif ia == "TLE":
        tle += 1
    elif ia == "RE":
        re += 1
    else:
        break

print(f"""\
AC x {ac}
WA x {wa}
TLE x {tle}
RE x {re}""")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#include<iostream>
#include <math.h>//pow(x,y)=x^y
#include <algorithm>//sort(a.begin(), a.end());reverse(a.begin(), a.end());
#define rep(i,n) for (int i=0; i <(n);i++)
#define ll long long
#define rev(s) reverse(s.begin(),s.end())
#define sor(v) sort(v.begin(),v.end())

using namespace std;


int main() {
int N;
cin >> N;
vector<string> S(N);
rep(i,N){
    cin >> S.at(i);
}
int ac = 0;
int wa = 0;
int tle = 0;
int re = 0;

rep(i,N){
    if(S.at(i).at(0)=='A'){
        ac += 1;
    }else if(S.at(i).at(0)=='W'){
        wa += 1;
    }else if(S.at(i).at(0)=='T'){
        tle += 1;
    }else if(S.at(i).at(0)=='R'){
        re += 1;
    }
}
cout << "AC x " << ac << endl;
cout << "WA x " << wa << endl;
cout << "TLE x " << tle << endl;
cout << "RE x " << re << endl;


}

Submission status: Runtime Error

Solution code:
N = int(input())
l = [input() for _ in range(N)]
ch = {'AC': 0, 'WA':0, 'TLE':0, 'RE':0}

for key, value in ch.items():
  ch[key] = l.count(key)

for key, value in ch.items():
  print(key + ' x ' + value)

Submission status: Runtime Error

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
n = int(input())
s = [input()for _ in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for i in s:
    if i == "AC":
        ac += 1
    elif i == "WA":
        wa += 1
    elif i == "TLE":
        tle += 1
    else:
        re += 1

print("AC" + " x", end = "")
print( ac)
print("WA" + " x", end = "")
print( wa)
print("TLE" + " x", end = "")
print( tle)
print("RE" + " x", end = "")
print( re)
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
n = int(input())
s = [input()for _ in range(n)]
ac = 0
wa = 0
tle = 0
re = 0

for i in s:
    if i == "AC":
        ac += 1
    elif i == "WA":
        wa += 1
    elif i == "TLE":
        tle += 1
    else:
        re += 1

print("AC" + " x", end = "")
print( ac)
print("WA" + " x", end = "")
print( wa)
print("TLE" + " x", end = "")
print( tle)
print("RE" + " x", end = "")
print( re)

Submission status: Runtime Error

Solution code:
C:\pycharm\code_atcoder\venv\Scripts\python.exe C:/pycharm/code_atcoder/173B.py
6
AC
TLE
AC
AC
WA
TLE
AC x 3
WA x 1
TLE x 2
RE x 0

プロセスは終了コード 0 で完了しました

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(map(int, input().split()))

  if s == "AC":
    a = sum(s)
  elif s== "WA":
    w = sum(s)
  elif s== "TLE":
    t = sum(s)
  else:
    e = sum(s)
  
  print("AC × ",a)
  print("WA × ",w)
  print("TLE × ",t)
  print("RE × ",r)

Submission status: Runtime Error

Solution code:
import sys
N = int(input())
s = []
for l in sys.stdin:
    s.append(int(l))
    
a = s.count("AC")
b = s.count("WA")
c = s.count("TLE")
d = s.count("RE")

print("AC"+"x"+a)
print("WA"+"x"+b)
print("TLE"+"x"+c)
print("RE"+"x"+d)

Submission status: Runtime Error

Solution code:
N = int(input())

ac, wa, tle, re = 0, 0, 0, 0

for i in range(N):
  S = int(input())
  if S=='AC':
    ac+=1
  elif S=='WA':
    wa+=1
  elif S=='TLE':
    tle+=1
  elif S=='RE':
    re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Submission status: Runtime Error

Solution code:
x = [input() for i in range(N)]
AC = 0
WA = 0
TLE = 0
RE = 0
for t in range(N):
    if x[t] == 'AC':
        AC += 1
    elif x[t] == 'WA':
        WA += 1
    elif x[t] == 'TLE':
        TLE += 1
    else:
        RE += 1
print('AC x',AC)
print('WA x',WA)
print('TLE x',TLE)
print('RE x',RE)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h> 
using namespace std; 

typedef long long ll;
typedef double ld;


int main() 
{ 
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("data.in", "r", stdin);
	
	int n;
	cin >> n;
	int a = 0, w = 0, t = 0, r = 0;
	while (n--) {
		string s; cin >> s;
		if (s == "AC") a++; 
		else if (s == "WA") w++;
		else if (s == "TLE") t++;
		else if (s == "RE") r++;
	} 
	
	printf("AC x %d\n", a);
	printf("WA x %d\n", w);
	printf("TLE x %d\n", t);
	printf("RE x %d\n", r);
	
	
	
    return 0; 
}

Submission status: Runtime Error

Solution code:
N=int(input())
test_case=[input() for _ in range(N)]
a=test_case.count('AC')
b=test_case.count('WA')
c=test_case.count('TLE')
d=test_case.count('RE')
print('AC x '+a)
print('WA x '+b)
print('TLE x '+c)
print('RE x '+d)

Submission status: Runtime Error

Solution code:
n = int((

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0

for i in range(N):
    S = str(input())
    if S == 'AC':
        ac += 1
    elif S == 'WA':
        wa += 1
    elif S == 'TLE':
        tle += 1
    elif S == 'RE':
        re += 1
print('AC x '+ac)
print('WA x '+wa)
print('TLE x '+tle)
print('RE x '+re)

Submission status: Runtime Error

Solution code:
n=int(input())
a=0
w=0
t=0
r=0
for i in range(n):
    code=input()
    if code=='AC':
        a += 1
    elif code=='WA':
        w += 1
    elif code=='TLE':
        t += 1
    else:
        r += 1
print('AC x 'a)
print('WA x 'w)
print('TLE x 't)
print('RE x 'r)

Submission status: Runtime Error

Solution code:
N = int(input())
ac, wa, tle, re = 0, 0, 0, 0
for _ in range(10):
  S = int(input())
  if S == 'AC':
    ac+=1
  elif S == 'WA':
    wa+=1
  elif S == 'TLE':
    tle+=1
  elif S == 'RE':
    re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Submission status: Runtime Error

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy
from functools import reduce

def main():
    n = int(input())
    lists = []
    ans = [0]*4
    for i in range(n):
        s = input()
        if not s in lists:
            lists.append(s)


        if s == "AC":
            ans[0] += 1
        elif s == "WA" :
            ans[1] += 1
        elif s == "TLE":
            ans[2] += 1
        else:
            ans[3] += 1
    

    for i in range(ans):
        if i == 0:
            print("AC x", ans[i])
        elif i == 1 :
            print("WA x", ans[i])
        elif i == 2:
            print("TLE x", ans[i])
        else:
            print("RE x", ans[i])


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
N=int(input())
test_case=[input() for_in range(N)]
a=test_case.count(''AC'')
b=test_case.count(''WA'')
c=test_case.count(''TLE'')
d=test_case.count(''RE'')
print('AC x '+a)
print('WA x '+b)
print('TLE x '+c)
print('RE x '+d)

Submission status: Runtime Error

Solution code:
N=int(input())
s = [input() for i in range(N)]

print('AC x '+'s.count('AC')')
print('WA x '+'s.count('WA')')
print('TLE x '+'s.count('TLE')')
print('RE x '+'s.count('RE')')

Submission status: Runtime Error

Solution code:
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    test = input()
    if test == "AC":
        c0 += 1
    elif test == "WA":
        c1 += 1
    elif test == "TLE":
        c2 +=1
    elif test == "RE":
        c3 += 1
print("AC x", c0)
print("WA x", c1)
print("TLE x", c2)
ptint("RE x", c3)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [0,0,0,0]
for i in range(n):
  s = input()
  if s=="AC":
    a[0] += 1
  elif s=="WA":
    a[1] += 1
  elif s=="TLE":
    a[2] += 1
  elif :
    a[3] += 1
print("AC x ",end="")
print(a[0])
print("WA x ",end="")
print(a[1])
print("TLE x ",end="")
print(a[2])
print("RE x ",end="")
print(a[3])

Submission status: Runtime Error

Solution code:
N = int(input())
ac, wa, tle, re = 0, 0, 0, 0
for _ in range(N):
  S = int(input())
  if S == 'AC':
    ac+=1
  elif S == 'WA':
    wa+=1
  elif S == 'TLE':
    tle+=1
  elif S == 'RE':
    re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Submission status: Runtime Error

Solution code:
N=int(input())
test_case=[input() for_in range(N)]
a=test_case.count('AC')
b=test_case.count('WA')
c=test_case.count('TLE')
d=test_case.count('RE')
print('AC x '+ a)
print('WA x '+ b)
print('TLE x '+ c)
print('RE x '+ d)

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(map(int, input().split()))
a = 0
w = 0
t = 0
r = 0

for i in range(n):
  if s == "AC":
    a += 1
  elif s== "WA":
    w += 1
  elif s== "TLE":
    t += 1
  else:
    e += 1
  
  print("AC ×", a)
  print("WA ×", w)
  print("TLE ×", t)
  print("RE ×", r)

Submission status: Runtime Error

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for _ in range(n):
    s = input()
    if s == "AC":
        ac += 1
    elif s == "WA":
        wa += 1
    elif s == "TLE":
        tle += 1
    elif sv == "RE":
        re += 1

print("AC x", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)

Submission status: Runtime Error

Solution code:
loop = int(input())
ac = 0
wa = 0
tle =0
re = 0

for _ in range(loop):
  judge = input()
  if judge == 'AC':
    ac += 1
  elif judge == 'WA':
    wa += 1
  elif judge == 'TLE':
  	tle += 1
  elif judge == 'RE':
    
print('AC × {}'.format(ac))
print('WA × {}'.format(wa))
print('TLE × {}'.format(tle))
print('RE × {}'.format(re))

Submission status: Runtime Error

Solution code:
n = int(input())
a = [0,0,0,0]
for i in range(n):
  if input()=="AC":
    a[0] += 1
  elif input()=="WA":
    a[1] += 1
  elif input()=="TLE":
    a[2] += 1
  else:
    a[3] += 1
print("AC x ",end="")
print(a[0])
print("WA x ",end="")
print(a[1])
print("TLE x ",end="")
print(a[2])
print("RE x ",end="")
print(a[3])

Submission status: Runtime Error

Solution code:
n = int(input())
c0 = 0
c1 = 0
c2 = 0
c3 = 0

for i in range(n):
    test = input()
    if test == "AC":
        c0 += 1
    elif test == "WA":
        c1 += 1
    elif test == "TLE":
        c2 +=1
    elif test == "RE":
        c3 += 1
print("AC x", c0)
print("WA x", c1)
print("TLE x", c2)
ptinr("RE x", c3)

Submission status: Runtime Error

Solution code:
N = int(input())

ac, wa, tle, re = 0, 0, 0, 0

for _ in range(N):
    S = int(input())
    if S == 'AC':
        ac+=1
    elif S == 'WA':
        wa+=1
    elif S == 'TLE':
        tle+=1
    elif S == 'RE':
        re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Submission status: Runtime Error

Solution code:
N=int(input())
s = [int(input()) for i in range(N)]

print('AC x '+s.count('AC'))
print('WA x '+s.count('WA'))
print('TLE x '+s.count('TLE'))
print('RE x '+s.count('RE'))

Submission status: Runtime Error

Solution code:
N=int(input())
a=0
b=0
c=0
d=0
for i in range(N):
    if input()=="AC":
        a+=1
    elif input()=="WA":
        b+=1
    elif input()=="TLE":
        c+=1
    else:
        d+=1
print("AC ×",a)
print("WA ×",b)
print("TLE ×",c)
print("RE ×",d)

Submission status: Runtime Error

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
    if input() == "AC":
        ac += 1
    elif input() == "WA":
        wa += 1
    elif input() == "TLE":
        tle += 1
    elif input() == "RE":
        re += 1

print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Submission status: Runtime Error

Solution code:
N = int(input())

ac, wa, tle, re = 0, 0, 0, 0

for _ in range(N):
    S = int(input())
    if S == 'AC':
        ac+=1
    elif S == 'WA':
        wa+=1
    elif S == 'TLE':
        tle+=1
    elif S == 'RE':
        re+=1

print('AC x %d'%ac)
print('WA x %d'%wa)
print('TLE x %d'%tle)
print('RE x %d'%re)

Submission status: Runtime Error

Solution code:
N = int(input())
AC = 0
WA = 0
TLE = 0
RE = 0
for i in range(N):
  S = input()
  if S == "AC
   AC += 1
  if S == "WA":
    WA+= 1
  if S == "TLE":
    TLE += 1
  if S == "RE":
    RE+= 1

print("AC x " + str(AC))
print("WA x " + str(WA))
print("TLE x " + str(TLE))
print("RE x " + str(RE))

Submission status: Runtime Error

Solution code:
verdicts = {'AC':0, 'WA':0, 'TLE':0, 'RE':0}

v = input()
while v:
    verdicts[v] += 1
    v = input()

for v, f in verdicts.items():
    print(f'{v} x {f}')

Submission status: Runtime Error

Solution code:
n = int(input())
s = [int(input()) for i in range(n)]
 
print("AC x " +  str(s.count('AC')))
print("WA x " +  str(s.count('WA')))
print("TLE x " +  str(s.count('TLE')))
print("RE x " +  str(s.count('RE')))

Submission status: Runtime Error

Solution code:
n = int(input())
ac = wa = tle = re = 0
for i in range(n):
  m = int(input())
  if m == 'AC':
    ac += 1
  elif m == 'WA':
    wa += 1
  elif m == 'TLE':
    tle += 1
  else:
    re += 1
print('AC x', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]

ac = S.count('AC')
wa = S.count('WA')
tle = S.count('TLE')
re = S.count('RE')

print('AC x',ac())
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)

Submission status: Runtime Error

Solution code:
N=int(input())
test_case=[input() for_in range(N)]
a=test_case.count('AC')
b=test_case.count('WA')
c=test_case.count('TLE')
d=test_case.count('RE')
print('AC x '+a)
print('WA x '+b)
print('TLE x '+c)
print('RE x '+d)

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    S = input()
    if S == AC:
        ac+=1
    elif S == "WA":
        wa += 1
    elif S== "TLE":
        tle += 1
    elif S == "RE":
        re += 1
print(f'AC x {ac}')
print(f'WA x {wa}')
print(f'TLE x {tle}' )
print(f'RE x {re}')

Submission status: Runtime Error

Solution code:
n = int(input())
list = [0,0,0,0]

for i in range(n):
  judge = input()
  if judge === 'AC':
    list[0] += 1
  elif judge === 'WA':
    list[1] += 1
  elif judge === 'TLE':
    list[2] += 1
  elif judge === 'RE':
    list[3] += 1

print( 'AC x {}'.format(list[0]) )
print( 'WA x {}'.format(list[1]) )
print( 'TLE x {}'.format(list[2]) )
print( 'RE x {}'.format(list[3]) )

Submission status: Runtime Error

Solution code:
n=int(input())
a,b,c,d=0,0,0,0
for i in range(n):
    if str(input())=='AC':a+=1
    elif str(input())=='WA':b+=1
    elif str(input())=='TLE':c+=1
    else:d+=1
print('AC','x',a)
print('WA','x',b)
print('TLE','x',c)
print('RE','x',d)

Submission status: Runtime Error

Solution code:



N = int(input())
cnt = [0] * 4
for n in range(N):
    s = int(input())
    if s == 'AC':
        cnt[0] += 1
    elif s == 'WA':
        cnt[1] += 1
    elif s == 'TLE':
        cnt[2] += 1
    elif s == 'RE':
        cnt[3] += 1

print('AC x ',cnt[0])
print('WA x ',cnt[1])
print('TLE x ',cnt[2])
print('RE x ',cnt[3])

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    S = input()
    if S == AC:
        ac+=1
    elif S == "WA":
        wa += 1
    elif S== "TLE":
        tle += 1
    elif S == "RE":
        re += 1
print(f'AC x {ac}'' )
print(f'WA x {wa}'' )
print(f'TLE x {tle}'' )
print(f'RE x {re}'' )

Submission status: Runtime Error

Solution code:
IN = iter(Input.split('\n')).__next__
def input():
    return IN()


#######以下コード##############################





N = int(input())
S = list(input() for _ in range(N))

ac = 0
wa = 0
tle = 0
re = 0

for s in S:
    if s == "AC":
        ac += 1
    elif s == "WA":
        wa += 1
    elif s == "TLE":
        tle += 1
    elif s == "RE":
        re += 1

print("AC x",ac)
print("WA x",wa)
print("TLE x",tle)
print("RE x",re)

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
while True:
    ia = input()
    if ia == "AC":
        ac += 1
    elif ia == "WA":
        wa += 1
    elif ia == "TLE":
        tle += 1
    elif ia == "RE":
        re += 1
    else:
        break

print("AC x", ac)
print("WA x", wa)
print("TLE x", tle)
print("RE x", re)

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input() for i in range(N)]

ac = S.count('AC')
wa = S.count('WA')
tle = S.count('TLE')
re = S.count('RE')

print('AC', x, ac)
print('WA', x, wa)
print('TLE', x, tle)
print('RE', x, re)

Submission status: Runtime Error

Solution code:
N = int(input())

result = {}
for _ in range(N):
  s = input()
  result[s] = result.get(s, 0) + 1

print(f"AC x {result['AC']}")
print(f"WA x {result['WA']}")
print(f"TLE x {result['TLE']}")
print(f"RE x {result['RE']}")

Submission status: Runtime Error

Solution code:
n=int(input())
x= list()
for i in range n:
  x.append(input())
print("AC x", x.count("AC"))
print("WA x", x.count("WA"))
print("TLE x", x.count("TLE"))
print("RE x", x.count("RE"))

Submission status: Runtime Error

Solution code:
N = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(N):
    S = input()
    if S == AC:
        ac+=1
    elif S == "WA":
        wa += 1
    elif S== "TLE"
        tle += 1
    elif S == "RE"
        re += 1
print(f'AC x {ac}'' )
print(f'WA x {wa}'' )
print(f'TLE x {tle}'' )
print(f'RE x {re}'' )

Submission status: Runtime Error

Solution code:
n = int(input())
d = {'AC':0,'WA':0,'TLE':0,'Re':0}
for j in range(n):
    i = input()
    d[i] += 1

for i in ['AC','WA','TLE','Re']:
    print('%s x %d' % (i, d[i]))

Submission status: Runtime Error

Solution code:
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

#define ALL(a)  (a).begin(),(a).end()

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int N;
	cin >> N;

	int ret[4] = {};

	REP(i, N)
	{
		string s;
		cin >> s;
		if(s == "AC") ret[0]++;
		else if(s == "WA") ret[1]++;
		else if(s == "TLE") ret[2]++;
		else if(s == "RE") ret[3]++;
	}

	cout << "AC x " << ret[0] << endl;
	cout << "WA x " << ret[1] << endl;
	cout << "TLE x " << ret[2] << endl;
	cout << "RE x " << ret[3] << endl;

	return 0;
}

Submission status: Runtime Error

Solution code:
n=int(input())
a,b,c,d=0,0,0,0
for i in range(n):
    if input()=='AC':a+=1
    elif input()=='WA':b+=1
    elif input()=='TLE':c+=1
    else:d+=1
print('AC','x',a)
print('WA','x',b)
print('TLE','x',c)
print('RE','x',d)

Submission status: Runtime Error

Solution code:
def abc173_b():
    N = int(input())

    #AC WA TLE RE
    l = [0 for i in range(N)]

    for i in range(N):
        Inp = input()
        if Inp == "AC":
            l[0] += 1
        if Inp == "WA":
            l[1] += 1
        if Inp == "TLE":
            l[2] += 1
        if Inp== "RE":
            l[3] += 1

    print("AC x "+str(l[0]))
    print("WA x "+str(l[1]))
    print("TLE x "+str(l[2]))
    print("RE x "+str(l[3]))



abc173_b()

Submission status: Runtime Error

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')

file = 1

def solve():
    



    # for _ in range(ii()):

    n=ii()
    m={}
    a=["AC","WA","TLE","RE"]
    m['WA']=0
    m['TLE']=0
    m["AC"]=0
    m["RE"]=0
    for i in range(n):
        s=si()
        m[s]+=1
    for i in a:
        print(i,end=" x ")
        print(m[i])












  
















if __name__ =="__main__":

    if(file):

        if path.exists('input1.txt'):
            sys.stdin=open('input1.txt', 'r')
            sys.stdout=open('output1.txt','w')
        else:
            input=sys.stdin.readline
    solve()

Submission status: Runtime Error

Solution code:
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for _ in range(int(input()):
	d[input()]+=1
print('AC X',d['AC'])
print('WA X',d['WA'])
print('TLE X',d['TLE'])
print('RE X',d['RE'])

Submission status: Runtime Error

Solution code:
n = int(input())
s = []
for i in range(n):
    s += [input()]
c0 = s.count("AC")
c1 = s.count("WA")
c2 = s.count("TLE")
c3 = s.count("RE")
print("AC × " + str(c0))
print("WA × " + str(c1))
print("TLE × " + str(c2))
print("RE × " + str(c3))6

Submission status: Runtime Error

Solution code:
n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
  m = int(input())
  if m == 'AC':
    ac += 1
  elif m == 'WA':
    wa += 1
  elif m == 'TLE':
    tle += 1
  elif m == 'RE':
    re += 1
print('AC x', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re)

Submission status: Runtime Error

Solution code:
n = int(input())
s = [int(input()) for i in range(n)]

print("AC x " +  str(l.count('AC')))
print("WA x " +  str(l.count('WA')))
print("TLE x " +  str(l.count('TLE')))
print("RE x " +  str(l.count('RE')))

Submission status: Runtime Error

Solution code:
import sys
from collections import defaultdict
from typing import Callable


def main():
    readline: Callable[[], str] = sys.stdin.readline

    memory: defaultdict = defaultdict(int)

    n: int = int(readline().rstrip())
    for _ in range(n):
        s: str = readline().rstrip()
        memory[s] += 1

    for judge in ("AC", "WA", "TLE", "RE");
        print(f"{judge} x {memory[judge]}")

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
l = []
for i in range(int(input()):
   l.append(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in l:
    if i == "AC":
        ac+=1
    if i == "TLE":
        tle+=1
    if i == "WA":
        wa+=1
    if i == "RE":
        re+=1
print("AC X "+str(ac))
print("WA X "+str(wa))
print("TLE X "+str(tle))
print("RE X "+str(re))

Submission status: Runtime Error

Solution code:
n = input()
lol=[]
for _ in range(n):
    lol.append(input())
print('AC X ',lol.count('AC'))
print('WA X ',lol.count('WA'))
print('TLE X ',lol.count('TLE'))
print('RE X ',lol.count('RE'))

Submission status: Runtime Error

Solution code:

def main():
    N = int(input())
    cases = dict()
    for _ in range(N):
        s = input()
        cases[s] = cases.get(s, 0) + 1
    
    results = ["AC", "WA", "TLE", "RE"]

    for r in results:
        print(f"{r} x {cases[r]}")
    

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
n=int(input())
I={"ac":0,"wa":0,"tle":0,"re":0}
for i in n:
  I[input()]+=1
print("AC x {}".format(I["ac"]))
print("WA x {}".format(I["wa"]))
print("TLE x {}".format(I["tle"]))
print("RE x {}".format(I["re"]))

Submission status: Runtime Error

Solution code:
ac=0
wa=0
tle=0
re=0
n=int(input())
for _ in range(n):
  x=input()
  if x=='AC':
    ac+=1
  elif x=='WA':
    wa+=1
  elif x=='TLE':
    tle+=1
  elif x=='RE':
    RE+=1
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)