problem_id
stringclasses
100 values
submission_id
stringlengths
10
10
status
stringclasses
2 values
code
stringlengths
6
806
p02613
s588660386
Accepted
lists = [input() for i in range(int(input()))] dct = {'AC':0, 'WA':0, 'TLE':0, 'RE':0} for lst in lists: if lst in dct: dct[lst] += 1 for k, v in dct.items(): print(k,'x',v)
p02613
s624858228
Accepted
N = int(input()) S = [] for _ in range(N): S.append(input()) print('AC x', S.count('AC')) print('WA x', S.count('WA')) print('TLE x', S.count('TLE')) print('RE x', S.count('RE'))
p02613
s165236843
Accepted
# -*- coding: utf-8 -*- """ Created on Sun Jul 5 21:05:16 2020 @author: asaka """ N = int(input()) ans = [0]*4 for n in range(N): h = input() if h == "AC": ans[0] += 1 elif h == "WA": ans[1] += 1 elif h == "TLE": ans[2] += 1 elif h == "RE": ans[3] += 1 print("AC x ", ans[0]) print("WA x ", ans[1]) print("TLE x ", ans[2]) print("RE x ", ans[3])
p02613
s010876941
Accepted
dic = {'AC':0, 'WA':0, 'TLE':0, 'RE':0} N = int(input()) for i in range(N): dic[input()] += 1 for i in dic: print(i, 'x', dic[i])
p02613
s876638133
Accepted
N = int(input()) A = 0 W = 0 T = 0 R = 0 for i in range(N): word = input() if ("AC" == word): A += 1 elif ("WA" == word): W += 1 elif ("TLE" == word): T += 1 else: R += 1 print("AC x " + str(A)) print("WA x " + str(W)) print("TLE x " + str(T)) print("RE x " + str(R))
p02613
s190544813
Accepted
n = int(input()) array = [] for i in range(n): array.append(input()) ac = 0 wa =0 tle = 0 re = 0 for s in array: if s=='AC': ac += 1 elif s=='WA': wa += 1 elif s=='TLE': tle += 1 elif s=='RE': re += 1 print('AC x '+str(ac)) print('WA x '+str(wa)) print('TLE x '+str(tle)) print('RE x '+str(re))
p02613
s524982314
Accepted
N = int(input()) S = [input() for i in range(N)] c0 = 0 c1 = 0 c2 = 0 c3 = 0 for i in range(N): if S[i] == 'AC': c0 += 1 elif S[i] == 'WA': c1 += 1 elif S[i] == 'TLE': c2 += 1 elif S[i] == 'RE': c3 += 1 print('AC x %d' %c0) print('WA x %d' %c1) print('TLE x %d' %c2) print('RE x %d' %c3)
p02613
s564958298
Accepted
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 print('AC x '+ str(ac)) print("WA x "+ str(wa)) print("TLE x "+ str(tle)) print("RE x "+ str(re))
p02613
s143566376
Accepted
n=int(input()) c0,c1,c2,c3=0,0,0,0 for i in range (n): s=input() if(s=='AC'): c0=c0+1 if (s=='WA'): c1+=1 if(s=='TLE'): c2+=1 if(s=='RE'): c3+=1 print("AC x ",c0) print("\nWA x ",c1) print("\nTLE x ",c2) print("\nRE x ",c3)
p02613
s430249367
Accepted
n=int(input()) ac=0 wa=0 tle=0 re=0 for i in range(n): a=input() if a=='AC': ac+=1 elif a=='WA': wa+=1 elif a=='TLE': tle+=1 else: re+=1 print('AC x '+str(ac)) print('WA x '+str(wa)) print('TLE x '+str(tle)) print('RE x '+str(re))
p02613
s237388579
Accepted
def JudgeStatusSummary(): num = int(input()) list_result = [] for n in range(num): result = str(input()) list_result.append(result) print('AC x ', list_result.count('AC')) print('WA x ', list_result.count('WA')) print('TLE x ', list_result.count('TLE')) print('RE x ', list_result.count('RE')) if __name__ == '__main__': JudgeStatusSummary()
p02613
s182838229
Accepted
import sys input = sys.stdin.readline N = int(input()) S_list = [input() for _ in range(N)] AC_c = 0 WA_c = 0 TLE_c = 0 RE_c = 0 for S in S_list: if S == "AC\n": AC_c += 1 elif S == "WA\n": WA_c += 1 elif S == "TLE\n": TLE_c += 1 else: RE_c += 1 print("AC x " + str(AC_c)) print("WA x " + str(WA_c)) print("TLE x " + str(TLE_c)) print("RE x " + str(RE_c))
p02613
s216454325
Accepted
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 else: RE += 1 print("AC x",AC) print("WA x",WA) print("TLE x",TLE) print("RE x",RE)
p02613
s633855983
Accepted
N = int(input()) ac, re, wa, tle = 0,0,0,0 for i in range(N): line = input() if line == "AC": ac += 1 elif line == "TLE": tle += 1 elif line == "WA": wa += 1 elif line == "RE": re += 1 print("AC x " + str(ac)) print("WA x " + str(wa)) print("TLE x " + str(tle)) print("RE x " + str(re))
p02613
s022794259
Accepted
len = int(input()) dict = {} for i in range(len): result = input() if result in dict: dict[result] += 1 else: dict[result] = 1 keys = ['AC', 'WA', 'TLE', 'RE'] for k in keys: cnt = 0 if k in dict: cnt = dict[k] print("{0} x {1}".format(k, cnt))
p02613
s044126941
Accepted
import sys import numpy as np A = int(input()) AC = 0 WA = 0 TLE = 0 RE = 0 for i in range(A): 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)
p02613
s212338633
Accepted
N = int(input()) strng = [input() for i in range(N)] counts = [0]*4 for i in range(N): if strng[i] == 'AC': counts[0] += 1 elif strng[i] == 'WA': counts[1] += 1 elif strng[i] == 'TLE': counts[2] += 1 elif strng[i] == 'RE': counts[3] += 1 print('AC x ' + str(counts[0])) print('WA x ' + str(counts[1])) print('TLE x ' + str(counts[2])) print('RE x ' + str(counts[3]))
p02613
s358243344
Accepted
n = int(input()) a = [0] * 4 for loop in range(n): s = input() if s == 'AC': a[0] += 1 if s == 'WA': a[1] += 1 if s == 'TLE': a[2] += 1 if s == 'RE': a[3] += 1 s = ['AC', 'WA', 'TLE', 'RE'] for i in range(4): print(s[i], 'x', a[i])
p02613
s784855861
Accepted
n = int(input()) ans = [0]*4 for i in range(n): s = input() if s=='AC': ans[0]+=1 elif s=='WA': ans[1]+=1 elif s=='TLE': ans[2]+=1 else: ans[3]+=1 print('AC x {0}'.format(ans[0])) print('WA x {0}'.format(ans[1])) print('TLE x {0}'.format(ans[2])) print('RE x {0}'.format(ans[3]))
p02613
s406043898
Accepted
n = int(input()) ac_cnt = 0 wa_cnt = 0 tle_cnt = 0 re_cnt = 0 for i in range(n): s = input() if s == 'AC': ac_cnt += 1 elif s == 'WA': wa_cnt += 1 elif s == 'TLE': tle_cnt += 1 elif s == 'RE': re_cnt += 1 print('AC x ' + str(ac_cnt)) print('WA x ' + str(wa_cnt)) print('TLE x ' + str(tle_cnt)) print('RE x ' + str(re_cnt))
p02613
s909513663
Accepted
test = int(input()) ac = 0 wa = 0 tle = 0 re = 0 for i in range(test): n = input() if n == "AC": ac += 1 if n == "WA": wa += 1 if n == "TLE": tle += 1 if n == "RE": re += 1 print(f"AC x {ac}") print(f"WA x {wa}") print(f"TLE x {tle}") print(f"RE x {re}")
p02613
s605137982
Accepted
n = int(input()) ac,wa,tle,re=0,0,0,0 for i in range(n): s = input() if(s=="AC"): ac+=1 elif(s=="WA"): wa+=1 elif(s=="TLE"): tle+=1 else: re+=1 print("AC x",ac) print("WA x",wa) print("TLE x",tle) print("RE x",re)
p02613
s780302512
Accepted
q= int(input()) ac,wa,tle,re = 0,0,0,0 for _ in range(q): q = input() if q == "AC": ac+=1 elif q == "WA": wa+=1 elif q == "TLE": tle+=1 else : re+=1 print("AC x",ac) print("WA x",wa) print("TLE x",tle) print("RE x",re)
p02613
s112856364
Accepted
def main(): N = int(input()) di = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0} for _ in range(N): di[input()] += 1 for k, v in di.items(): print(f"{k} x {v}") if __name__ == "__main__": main()
p02613
s785593029
Accepted
n = int(input()) ans = [0,0,0,0] for _ in range(n): s = input() if s == 'AC': ans[0] += 1 elif s == 'WA': ans[1] += 1 elif s == 'TLE': ans[2] += 1 else: ans[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]))
p02613
s009101958
Accepted
n = int(input()) ac = 0 wa = 0 tle = 0 re = 0 for i in range(n): tmp = input() if tmp == 'AC': ac +=1 elif tmp == 'WA': wa +=1 elif tmp == 'TLE': tle +=1 else: re +=1 print('AC x ' + str(ac)) print('WA x ' + str(wa)) print('TLE x ' + str(tle)) print('RE x ' + str(re))
p02613
s924626133
Accepted
def judge_status_summary(): N = int(input()) res = {"AC":0,"WA":0,"TLE":0,"RE":0} for i in range(N): res[input()] += 1 for k in res: print("{} x {}".format(k,res[k])) judge_status_summary()
p02613
s628514329
Accepted
c=open(0).read().count for s in'AC','WA','TLE','RE':print(s,'x',c(s))
p02613
s811506582
Accepted
N = int(input()) s = [input() for i in range(N)] for v in ['AC', 'WA', 'TLE', 'RE']: print('{} x {}'.format(v, s.count(v)))
p02613
s248053215
Accepted
N = int(input()) l = [] for i in range(N): l.append(input()) AC = l.count('AC') WA = l.count('WA') TLE = l.count('TLE') RE = l.count('RE') print("AC x {}".format(AC)) print("WA x {}".format(WA)) print("TLE x {}".format(TLE)) print("RE x {}".format(RE))
p02613
s807830643
Accepted
n = int(input()) s = [input() for _ in range(n)] 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 " + str(ac)) print("WA x " + str(wa)) print("TLE x " + str(tle)) print("RE x " + str(re))
p02613
s155362346
Accepted
n = int(input()) d = { 'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0 } for i in range(n): d[input()] += 1 print('{} x {}'.format('AC', d['AC'])) print('{} x {}'.format('WA', d['WA'])) print('{} x {}'.format('TLE', d['TLE'])) print('{} x {}'.format('RE', d['RE']))
p02613
s578758014
Accepted
n = int(input()) counts = {'AC': 0, 'TLE': 0, 'WA': 0, 'RE': 0} for i in range(n): s = input() counts[s] += 1 print("AC x "+str(counts['AC'])) print("WA x "+str(counts['WA'])) print("TLE x "+str(counts['TLE'])) print("RE x "+str(counts['RE']))
p02613
s394490196
Accepted
f = {"AC":0, "WA":0, "TLE":0,"RE":0} for i in range(int(input())): s = input() f[s]+=1 for i in f: print(i,"x", f[i])
p02613
s316583542
Accepted
import sys from collections import Counter import math counts = Counter(line.strip() for line in sys.stdin) for key in ["AC", "WA", "TLE", "RE"]: if key not in counts: print("{} x 0".format(key)) else: print("{} x {}".format(key, counts[key]))
p02613
s856827705
Accepted
import sys input=sys.stdin.readline n=int(input()) ac,wa,tle,re=0,0,0,0 for _ in range(n): s=input().rstrip() if s=='AC': ac+=1 elif s=='WA': wa+=1 elif s=='TLE': tle+=1 else: re+=1 print('AC x %d' % ac) print('WA x %d' % wa) print('TLE x %d' % tle) print('RE x %d' % re)
p02613
s993477307
Accepted
from collections import Counter n = int(input()) c = Counter(input() for _ in range(n)) print("AC x", c["AC"]) print("WA x", c["WA"]) print("TLE x", c["TLE"]) print("RE x", c["RE"])
p02613
s155925068
Accepted
n = int(input()) s = [input() for _ in range(n)] #print(s) 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')))
p02613
s090097684
Accepted
N = int(input()) AC = 0 WA = 0 TLE = 0 RE = 0 for i in range(N): temp = input() if temp == "AC": AC = AC + 1 if temp == "WA": WA = WA + 1 if temp == "TLE": TLE = TLE + 1 if temp == "RE": RE = RE + 1 print("AC x " + str(AC)) print("WA x " + str(WA)) print("TLE x " + str(TLE)) print("RE x " + str(RE))
p02613
s770299496
Accepted
N = int(input()) S = [input() for _ in range(N)] D = {} D['AC'] = 0 D['WA'] = 0 D['TLE'] = 0 D['RE'] = 0 for k in range(N): D[S[k]] += 1 print('AC x',D['AC']) print('WA x',D['WA']) print('TLE x',D['TLE']) print('RE x',D['RE'])
p02613
s585848886
Accepted
N= int(input()) flaga=0 flagw=0 flagt=0 flagr=0 for _ in range(N): K = str(input()) if(K=='AC'): flaga+=1 if(K=='WA'): flagw+=1 if(K=='TLE'): flagt+=1 if(K=='RE'): flagr+=1 print("AC x "+str(flaga)) print("WA x "+str(flagw)) print("TLE x "+str(flagt)) print("RE x "+str(flagr))
p02613
s423630852
Accepted
# -*- coding: utf-8 -*- """ Created on Sat Aug 15 17:00:46 2020 @author: saito """ # %% import phase # %% define phase # %% input phase N = int(input()) S = [0]*N for i in range(N): S[i] = input() # %% process phase C = [0]*4 rslt = ['AC', 'WA', 'TLE', 'RE'] for i in range(4): C[i] = S.count(rslt[i]) # %%output phase for i in range(4): print(rslt[i]+' '+'x'+' '+str(C[i]))
p02613
s832534321
Accepted
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 else: re += 1 print('AC x '+str(ac)) print('WA x '+str(wa)) print('TLE x '+str(tle)) print('RE x '+str(re))
p02613
s030068836
Accepted
n=int(input()) lis=['AC', 'WA', 'TLE', 'RE'] ans=[0,0,0,0] for _ in range(n): s=input() ans[lis.index(s)]+=1 for i in range(4): print(lis[i]+' x '+str(ans[i]))
p02613
s827372829
Accepted
n = int(input()) l = {'AC':0, 'WA':0, 'TLE':0, 'RE':0} for _ in range(n):l[input()] += 1 for k in l.keys():print(k+' x '+str(l[k]))
p02613
s052124155
Accepted
import sys import math from collections import deque sys.setrecursionlimit(1000000) MOD = 10 ** 9 + 7 input = lambda: sys.stdin.readline().strip() NI = lambda: int(input()) NMI = lambda: map(int, input().split()) NLI = lambda: list(NMI()) SI = lambda: input() def make_grid(h, w, num): return [[int(num)] * w for _ in range(h)] def main(): N = NI() D = {"AC": 0, "WA": 0, "TLE": 0, "RE": 0} for i in range(N): D[SI()] += 1 for x, y in D.items(): print("{0} x {1}".format(x, y)) if __name__ == "__main__": main()
p02613
s191922704
Accepted
n=int(input()) l=[0,0,0,0] for _ in range(n): s=input() if(s=='AC'): l[0]+=1 elif(s=='WA'): l[1]+=1 elif(s=='TLE'): l[2]+=1 elif(s=='RE'): l[3]+=1 print("AC x",l[0]) print("WA x",l[1]) print("TLE x",l[2]) print("RE x",l[3])
p02613
s591128047
Accepted
N = int(input()) results = ['AC', 'WA', 'TLE', "RE"] d = {'AC':0, 'WA':0, 'TLE':0, 'RE':0} for _ in range(N): r = input() d[r] += 1 for i in range(4): print(results[i] + ' x ' + str(d[results[i]]))
p02613
s588050526
Accepted
n = int(input()) d = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0} for _ in range(n): s = str(input()) d[s] += 1 print('AC x {}\nWA x {}\nTLE x {}\nRE x {}\n'.format(d['AC'], d['WA'], d['TLE'], d['RE']))
p02613
s216997945
Accepted
N=int(input()) list=[] ac=0 wa=0 re=0 tlc=0 for i in range(N): list.append(input()) for i in range(N): if list[i]=="AC": ac+=1 elif list[i]=="WA": wa+=1 elif list[i]=="RE": re+=1 else: tlc+=1 print("AC x "+str(ac)) print("WA x "+str(wa)) print("TLE x "+str(tlc)) print("RE x "+str(re))
p02613
s168206953
Accepted
N = int(input()) dic = {"AC":0,"WA":0,"TLE":0,"RE":0} for i in range(N): s = input() dic[s] += 1 for k, v in dic.items(): print(k+" x "+str(v))
p02613
s098879482
Accepted
from collections import Counter n = int(input()) s = [input() for _ in range(n)] cnt = Counter(s) for s in ["AC","WA","TLE","RE"]: print("{} x {}".format(s,cnt[s]))
p02613
s724229042
Accepted
from collections import Counter import sys from collections import defaultdict readline = sys.stdin.buffer.readline sys.setrecursionlimit(10**8) def geta(fn=lambda s: s.decode()): return map(fn, readline().split()) def gete(fn=lambda s: s.decode()): return fn(readline().rstrip()) def main(): n = gete(int) s = [] for _ in range(n): s.append(gete()) c = Counter(s) for v in ['AC', 'WA', 'TLE', 'RE']: print(v, "x", c[v]) if __name__ == "__main__": main()
p02613
s944807816
Accepted
from collections import * # def solve(): # for _ in range(int(input())): # solve() n = int(input()) l = [] for i in range(n): l.append(input()) print("AC x",l.count("AC")) print("WA x",l.count("WA")) print("TLE x",l.count("TLE")) print("RE x",l.count("RE"))
p02613
s796977375
Accepted
n = int(input()) t = {"AC":0, "WA":1, "TLE":2, "RE":3} u = ["AC", "WA", "TLE", "RE"] ans = [0]*4 for _ in range(n): ans[t[input()]] += 1 for i in range(4): print(u[i], "x", ans[i])
p02613
s274602358
Accepted
#!python3 # input N = int(input()) S = [input() for _ in range(N)] def main(): l = ["AC", "WA", "TLE", "RE"] d = {x: 0 for x in l} for s in S: d[s] += 1 for x in l: ans = "{} x {}".format(x, d[x]) print(ans) if __name__ == "__main__": main()
p02613
s058231311
Accepted
n = int(input()) c0 = 0 c1 = 0 c2 = 0 c3 = 0 for _ in range(n): word = input() if word=='AC': c0 +=1 elif word == 'WA': c1 +=1 elif word == 'TLE': c2 +=1 else: c3 +=1 print('AC x '+str(c0)) print('WA x '+str(c1)) print('TLE x '+str(c2)) print('RE x '+str(c3))
p02613
s632060803
Accepted
n = int(input()) s = [""]*n for i in range(n): s[i] = input() ac,wa,tle,re = 0,0,0,0 for i in range(n): if s[i] == "AC": ac += 1 elif s[i] == "WA": wa += 1 elif s[i] == "TLE": tle += 1 else: re += 1 print("AC x %d\nWA x %d\nTLE x %d\nRE x %d" % (ac,wa,tle,re))
p02613
s620704027
Accepted
from collections import defaultdict N = int(input()) dic = defaultdict(int) for i in range(N): S = input() dic[S] = dic[S] + 1 print("AC x", dic["AC"]) print("WA x", dic["WA"]) print("TLE x", dic["TLE"]) print("RE x", dic["RE"])
p02613
s497389165
Accepted
from collections import * n = int(input()) a = [] for i in range(n): a.append(input()) c = Counter(a) for i in ['AC', 'WA', 'TLE', 'RE']: if(i not in c): c[i] = 0 print(i,'x',c[i])
p02613
s392057996
Accepted
n = int(input()) s = [input() for i in range(n)] ans = ['AC', 'WA', 'TLE', 'RE'] for i in ans: print(i, 'x', s.count(i))
p02613
s930937627
Accepted
import numpy as np 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("AC x {0}".format(AC)) print("WA x {0}".format(WA)) print("TLE x {0}".format(TLE)) print("RE x {0}".format(RE))
p02613
s216928711
Accepted
from collections import Counter N = int(input()) li = [] for _ in range(N): li.append(input()) a = Counter(li) # print(a) print("AC x " + str(a["AC"])) print("WA x " + str(a["WA"])) print("TLE x " + str(a["TLE"])) print("RE x " + str(a["RE"]))
p02613
s366608924
Accepted
N = 0 S = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0} try: N = int(input()) for i in range(N): result = input() for k in S: if k == result: S[k] += 1 except: pass for k in S: print('%s x %d' % (k, S[k]))
p02613
s177877072
Accepted
n=int(input()) s=list(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"))
p02613
s308800109
Accepted
N=int(input()) d=dict() for tt in range(N): s=input() if s not in d: d[s]=1 else: d[s]+=1 for st in ["AC","WA","TLE","RE"]: if st not in d: print(st," x ",0) else: print(st," x ",d[st])
p02613
s442969531
Accepted
def main(): import sys input = sys.stdin.readline JUDGE = 'AC', 'WA', 'TLE', 'RE' ctr = dict() for case in JUDGE: ctr[case] = 0 N = int(input()) for _ in range(N): s = input().rstrip() ctr[s] += 1 for case in JUDGE: print(case, 'x', ctr[case]) if __name__ == '__main__': main()
p02613
s556906776
Accepted
N = int(input()) result = [input() for i in range(N)] def f(s, result): return '%s x %d'%(s, result.count(s)) print(f('AC', result)) print(f('WA', result)) print(f('TLE', result)) print(f('RE', result))
p02613
s122575600
Accepted
N = int(input()) S=[] for n in range(N): S.append(input()) AC ='AC x ' WA ='WA x ' TLE ='TLE x ' RE ='RE x ' print(AC + str(S.count("AC"))) print(WA + str(S.count("WA"))) print(TLE + str(S.count("TLE"))) print(RE + str(S.count("RE")))
p02613
s625117568
Accepted
n = int(input()) d = dict() for _ in range(n): k = input() if d.get(k): d[k] += 1 else: d[k] = 1 for kk in ['AC', 'WA', 'TLE', 'RE']: if d.get(kk): print(kk + ' x ' + str(d.get(kk))) else: print(kk + ' x 0')
p02613
s428890448
Accepted
N = int(input()) judge = [] for i in range(N): judge.append(input()) counter = [0, 0, 0, 0] for i in range(N): if judge[i] == "AC": counter[0] += 1 if judge[i] == "WA": counter[1] += 1 if judge[i] == "TLE": counter[2] += 1 if judge[i] == "RE": counter[3] += 1 print("AC x " + str(counter[0])) print("WA x " + str(counter[1])) print("TLE x " + str(counter[2])) print("RE x " + str(counter[3]))
p02613
s435805531
Accepted
#abc173b n=int(input()) s=[] for i in range(n): s.append(input()) print('AC x',s.count('AC')) print('WA x',s.count('WA')) print('TLE x',s.count('TLE')) print('RE x',s.count('RE'))
p02613
s739363025
Accepted
N = int(input()) ac, wa, tle, re = 0, 0, 0, 0 for i in range(N): result = input() if result == 'AC': ac += 1 elif result == 'WA': wa += 1 elif result == 'TLE': tle += 1 else: re += 1 print('AC x %d\nWA x %d\nTLE x %d\nRE x %d' % (ac, wa, tle, re))
p02613
s656376268
Accepted
N = int(input()) S_list = [input() for _ in range(N)] res_list = ['AC', 'WA', 'TLE', 'RE'] for res in res_list: print(res + ' x ' + str(S_list.count(res)))
p02613
s274669861
Accepted
n=int(input()) count1=0 count2=0 count3=0 count4=0 for i in range(n): s=input() if s=='AC': count1+=1 elif s=='WA': count2+=1 elif s=='TLE': count3+=1 else: count4+=1 print('AC x '+str(count1)) print('WA x '+str(count2)) print('TLE x '+str(count3)) print('RE x '+str(count4))
p02613
s861687928
Accepted
n = int(input()) li = [input() for i in range(n)] print("AC x " + str(li.count("AC"))) print("WA x " + str(li.count("WA"))) print("TLE x " + str(li.count("TLE"))) print("RE x " + str(li.count("RE")))
p02613
s492897728
Accepted
n = int(input()) c0 = 0 c1 = 0 c2 = 0 c3 = 0 for i in range(n): c = input() if c == 'AC': c0 += 1 elif c == 'WA': c1 += 1 elif c == 'TLE': c2 += 1 else: c3 += 1 print(f'AC x {c0}') print(f'WA x {c1}') print(f'TLE x {c2}') print(f'RE x {c3}')
p02613
s737423897
Accepted
N = int(input()) sc = {"AC":0, "WA":0, "TLE":0, "RE":0} for i in range(N): S = input() sc[S] += 1 # print("AC", " x ", sc["AC"]) print("WA", " x ", sc["WA"]) print("TLE", " x ", sc["TLE"]) print("RE", " x ", sc["RE"])
p02613
s109399958
Accepted
N = int(input()) S = [input() for i in range(N)] c0, c1, c2, c3 = 0, 0, 0, 0 for i in S: if i == 'AC': c0 += 1 if i == 'WA': c1 += 1 if i == 'TLE': c2 += 1 if i == 'RE': c3 += 1 print('AC','x',c0) print('WA','x',c1) print('TLE','x',c2) print('RE','x',c3)
p02613
s026556126
Accepted
import sys from collections import defaultdict def solve(): input = sys.stdin.readline N = int(input()) C = defaultdict(int) for _ in range(N): s = input().strip("\n") C[s] += 1 P = ["AC", "WA", "TLE", "RE"] for p in P: print(p + " x " + str(C[p])) return 0 if __name__ == "__main__": solve()
p02613
s952267038
Accepted
import collections N=int(input()) S=[str(input()) for _ in range(N)] C=collections.Counter(S) print('AC x ' + str(C['AC'])) print('WA x ' + str(C['WA'])) print('TLE x ' + str(C['TLE'])) print('RE x ' + str(C['RE']))
p02613
s673697373
Accepted
n = int(input()) ac = 0 wa = 0 tle = 0 re = 0 for i in range(n): tmp = input() if tmp == "AC": ac += 1 elif tmp == "WA": wa += 1 elif tmp == "TLE": tle += 1 else: re += 1 print("AC x " + str(ac)) print("WA x " + str(wa)) print("TLE x " + str(tle)) print("RE x " + str(re))
p02613
s765557753
Accepted
N=int(input()) ca=0 cw=0 ct=0 cr=0 for _ in range(N): a=input() if a=='AC': ca+=1 elif a=='WA': cw+=1 elif a=='TLE': ct+=1 elif a=='RE': cr+=1 print('AC x',ca) print('WA x',cw) print('TLE x',ct) print('RE x',cr)
p02613
s287925726
Accepted
N = int(input()) x = [] for _ in range(N): s = input() x.append(s) print('AC'+ ' '+ 'x'+ ' '+str(x.count('AC'))) print('WA'+ ' '+ 'x'+ ' '+str(x.count('WA'))) print('TLE'+ ' '+ 'x'+ ' '+str(x.count('TLE'))) print('RE'+ ' '+ 'x'+ ' '+str(x.count('RE')))
p02613
s244801465
Accepted
num = int(input()) ac = 0 wa = 0 tle = 0 re = 0 for i in range(num): k = input() if k == "AC": ac += 1 elif k == "WA": wa += 1 elif k == "TLE": tle += 1 elif k == "RE": re += 1 print("AC x " + str(ac)) print("WA x " + str(wa)) print("TLE x " + str(tle)) print("RE x " + str(re))
p02613
s341201063
Accepted
n = int(input()) ac = 0 wa = 0 tle = 0 re = 0 for i in range(n): w = input() if(w == 'AC'): ac += 1 elif(w == 'WA'): wa += 1 elif(w == 'TLE'): tle += 1 elif(w == 'RE'): re += 1 print('AC x '+str(ac)) print('WA x '+str(wa)) print('TLE x '+str(tle)) print('RE x '+str(re))
p02613
s658233922
Accepted
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"))
p02613
s567502549
Accepted
n=int(input()) A=0 W=0 T=0 R=0 for i in range(n): a=input() if a=='AC': A+=1 if a=='WA': W+=1 if a=='TLE': T+=1 if a=='RE': R+=1 print('AC x '+str(A)) print('WA x '+str(W)) print('TLE x '+str(T)) print('RE x '+str(R))
p02613
s008194399
Accepted
N = int(input()) s = [input() for i in range(N)] a = s.count("AC") b = s.count("WA") c = s.count("TLE") d = s.count("RE") print("AC x {}".format(a)) print("WA x {}".format(b)) print("TLE x {}".format(c)) print("RE x {}".format(d))
p02613
s167415388
Accepted
N = int(input()) S = [] for i in range(N): S.append(str(input())) print('AC x %d' % S.count('AC')) print('WA x %d' % S.count('WA')) print('TLE x %d' % S.count('TLE')) print('RE x %d' % S.count('RE'))
p02613
s005797990
Accepted
Si = [] N = input() for i in range(int(N)): Si.append(input()) C0 = Si.count('AC') C1 = Si.count('WA') C2 = Si.count('TLE') C3 = Si.count('RE') print('AC x', int(C0)) print('WA x', int(C1)) print('TLE x', int(C2)) print('RE x', int(C3))
p02613
s514071225
Accepted
n=int(input()) d=dict() a=["AC","WA","TLE","RE"] for x in a: d[x]=0 for _ in range(n): d[input()]+=1 for x in a: print(x + " x " + str(d[x]))
p02613
s199009652
Accepted
N=input(); N=int(N); S=[]; ans=[0,0,0,0]; for i in range(N): s=input(); if s=="AC": ans[0]=ans[0]+1; if s=="WA": ans[1]=ans[1]+1; if s=="TLE": ans[2]=ans[2]+1; if s=="RE": ans[3]=ans[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]));
p02613
s204921394
Accepted
N,*S,=open(0).read().split() N=int(N) C0=S.count('AC') C1=S.count('WA') C2=S.count('TLE') C3=S.count('RE') print('AC x '+str(C0)) print('WA x '+str(C1)) print('TLE x '+str(C2)) print('RE x '+str(C3))
p02613
s303604543
Accepted
N = int(input()) str_list = [] str_list = [str(input()) for i in range(N)] print('AC x ' + str(str_list.count(('AC')))) print('WA x ' + str(str_list.count(('WA')))) print('TLE x ' + str(str_list.count(('TLE')))) print('RE x ' + str(str_list.count(('RE'))))
p02613
s986478316
Accepted
N = int(input()) data = [input() for x in range(N)] keys_list = ['AC','WA','TLE','RE'] check_list = {'AC':0,'WA':0,'TLE':0,'RE':0} for x in data: check_list[x] = check_list[x] + 1 for x in keys_list: print('{} x {}'.format(x,check_list[x]))
p02613
s931530964
Accepted
n=int(input()) ac=0 wa=0 tle=0 re=0 for i 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 '+str(ac)) print('WA x '+str(wa)) print('TLE x '+str(tle)) print('RE x '+str(re))
p02613
s756634684
Accepted
n=int(input()) a=[] for i in range(n): a.append(input()) print("AC x",a.count("AC")) print("WA x",a.count("WA")) print("TLE x",a.count("TLE")) print("RE x",a.count("RE"))
p02613
s636205731
Accepted
#abc173 n = int(input()) ln ={'AC': 0,'WA': 0,'TLE': 0,'RE': 0} #ln[0] = AC, 1= WA, 2 =TLE, 3 =RE for i in range(n): s = input() ln[s] += 1 for i,j in ln.items(): print(i +' x ' + str(j))
p02613
s777372250
Accepted
n = int(input()) s = [input() for i in range(n)] from collections import Counter b = Counter(s) print('AC x '+str(b['AC'])) print('WA x '+str(b['WA'])) print('TLE x '+str(b['TLE'])) print('RE x '+str(b['RE']))