problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02613 | N=int(input())
C0=0
C1=0
C2=0
C3=0
for n in range(N):
S=input()
if S=="AC":
C0+=1
elif S=="WA":
C1+=1
elif S=="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)) | N=int(input())
C0=0
C1=0
C2=0
C3=0
for n in range(N):
S=input()
if S=="AC":
C0+=1
elif S=="WA":
C1+=1
elif S=="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)) | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,696 | 322,697 | u613920660 | python |
p02613 | N = int(input())
d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(N):
d[input()] += 1
print("AC x",d["AC"])
print("WA x 0",d["WA"] )
print("TLE x 0",d["TLE"])
print("RE x 0",d["RE"]) | N = int(input())
d = {"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(N):
d[input()] += 1
print("AC x",d["AC"])
print("WA x",d["WA"] )
print("TLE x",d["TLE"])
print("RE x",d["RE"]) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,700 | 322,701 | u103341055 | python |
p02613 | n = int(input())
ac, wa, tle, re = 0,0,0,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', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re) | n = int(input())
ac, wa, tle, re = 0,0,0,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', ac)
print('WA x', wa)
print('TLE x', tle)
print('RE x', re) | [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 322,708 | 322,709 | u564655959 | python |
p02613 | '''
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 impor... | '''
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 impor... | [
"literal.number.integer.change",
"assignment.value.change"
] | 322,716 | 322,717 | u295361373 | python |
p02613 | '''
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 impor... | '''
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 impor... | [
"literal.string.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 322,718 | 322,717 | u295361373 | python |
p02613 | n = int(input())
s = [0]*n
for i in range(n):
s[i] = input()
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)
| n = int(input())
s = [0]*n
for i in range(n):
s[i] = input()
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)
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 322,726 | 322,727 | u165436807 | python |
p02613 | 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 {}'.format(Ac))
print('WA x {}'.format(Wa))
print('TLE x {}'.format(Tle))
print('RE x {}'.format(Re)) | 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 s=='RE':
Re+=1
print('AC x {}'.format(Ac))
print('WA x {}'.format(Wa))
print('TLE x {}'.format(Tle))
print('RE x {}'.format(Re)) | [
"identifier.change",
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change"
] | 322,728 | 322,729 | u371409687 | python |
p02613 | n=int(input())
c=[0 for i in range(4)]
for i in range(n):
s=input()
if s=="AC":
c[0]+=1
if s=="WA":
c[1]+=1
if s=="TLE":
c[2]+=1
if s=="RE":
c[3]+=1
print("AC x ",c[0])
print("WA x ",c[1])
print("TLEW x ",c[2])
print("RE x ",c[3]) | n=int(input())
c=[0 for i in range(4)]
for i in range(n):
s=input()
if s=="AC":
c[0]+=1
if s=="WA":
c[1]+=1
if s=="TLE":
c[2]+=1
if s=="RE":
c[3]+=1
print("AC x ",c[0])
print("WA x ",c[1])
print("TLE x ",c[2])
print("RE x ",c[3]) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,751 | 322,752 | u404629709 | python |
p02613 | 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('RA x ',S.count('RA')) | 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')) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,755 | 322,756 | u842964692 | python |
p02613 | N=int(input())
box=[0]*4
for i in range(N):
S=str(input())
if S=="AC":
box[0]+=1
elif S=="WA":
box[1]+=1
elif S=="TLE":
box[2]+=1
else:
box[3]*=1
print("AC x ",box[0])
print("WA x ",box[1])
print("TLE x ",box[2])
print("RE x ",box[3])
| N=int(input())
box=[0]*4
for i in range(N):
S=str(input())
if S=="AC":
box[0]+=1
elif S=="WA":
box[1]+=1
elif S=="TLE":
box[2]+=1
else:
box[3]+=1
print("AC x ",box[0])
print("WA x ",box[1])
print("TLE x ",box[2])
print("RE x ",box[3])
| [
"expression.operator.change"
] | 322,757 | 322,758 | u181644161 | python |
p02613 | t=int(input())
f=[]
for i in range(t):
s=input()
f.append(s)
print("AC"+' '+'*'+' '+str((f.count("AC"))))
print("WA"+' '+'*'+' '+str((f.count("WA"))))
print("TLE"+' '+'*'+' '+str((f.count("TLE"))))
print("RE"+' '+'*'+' '+str((f.count("RE"))))
| t=int(input())
f=[]
for i in range(t):
s=input()
f.append(s)
print("AC"+' '+'x'+' '+str((f.count("AC"))))
print("WA"+' '+'x'+' '+str((f.count("WA"))))
print("TLE"+' '+'x'+' '+str((f.count("TLE"))))
print("RE"+' '+'x'+' '+str((f.count("RE"))))
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,763 | 322,764 | u262121009 | python |
p02613 | 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(... | 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 " + st... | [
"control_flow.branch.if.condition.change"
] | 322,765 | 322,766 | u296262239 | python |
p02613 | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
d[input()] += 1
for i in ['AC', 'WA', 'TLE', 'RE']:
print(i+' X '+str(d[i])) | from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(n):
d[input()] += 1
for i in ['AC', 'WA', 'TLE', 'RE']:
print(i+' x '+str(d[i])) | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,767 | 322,768 | u539953365 | python |
p02613 | ans = [0 for i in range (4)]
num = int(input())
for i in range (num):
inp = input()
if inp == 'AC':
ans[0] += 1
elif inp =='WA':
ans[1] +=1
elif inp == 'TLE':
ans[2] += 1
elif inp == 'RE':
ans[3] += 1
print(ans)
print ('AC x {}'.format(ans[0]))
print ('WA x {}'.fo... | ans = [0 for i in range (4)]
num = int(input())
for i in range (num):
inp = input()
if inp == 'AC':
ans[0] += 1
elif inp =='WA':
ans[1] +=1
elif inp == 'TLE':
ans[2] += 1
elif inp == 'RE':
ans[3] += 1
print ('AC x {}'.format(ans[0]))
print ('WA x {}'.format(ans[1]))
p... | [
"call.remove"
] | 322,771 | 322,772 | u665369939 | python |
p02613 | ans = [0 for i in range (4)]
num = int(input())
for i in range (num):
inp = input()
if inp == 'AC':
ans[0] += 1
elif inp =='WA':
ans[1] +=1
elif inp == 'TLE':
ans[2] += 1
elif inp == 'RE':
ans[3] += 3
print ('AC x {}'.format(ans[0]))
print ('WA x {}'.format(ans[1]))
p... | ans = [0 for i in range (4)]
num = int(input())
for i in range (num):
inp = input()
if inp == 'AC':
ans[0] += 1
elif inp =='WA':
ans[1] +=1
elif inp == 'TLE':
ans[2] += 1
elif inp == 'RE':
ans[3] += 1
print ('AC x {}'.format(ans[0]))
print ('WA x {}'.format(ans[1]))
p... | [
"literal.number.integer.change"
] | 322,773 | 322,772 | u665369939 | python |
p02613 | N=int(input())
a=[]
d=dict(AC=0, WA=0, TLE=0, RE=0)
for _ in range(N):
a=input()
d[a]+=1
for k, v in d.items():
ans=k+" × "+str(v)
print(ans) | N=int(input())
a=[]
d=dict(AC=0, WA=0, TLE=0, RE=0)
for _ in range(N):
a=input()
d[a]+=1
for k, v in d.items():
ans=k+" x "+str(v)
print(ans) | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 322,782 | 322,783 | u193927973 | python |
p02613 | 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... | 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... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,790 | 322,791 | u474136169 | python |
p02613 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... | [
"call.remove"
] | 322,809 | 322,810 | u161693347 | python |
p02613 | from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
#####################################
n=int(input())
D=[0]*4
for i in range(n):
s=input()
if s=="AC":
D[0]+=1
... | from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
#####################################
n=int(input())
D=[0]*4
for i in range(n):
s=input()
if s=="AC":
D[0]+=1
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 322,828 | 322,829 | u861075868 | python |
p02613 | N=int(input())
S=[input() for i in range(N)]
AC=0
WA=0
TLE=0
RE=0
for i in S:
if i =="WA":
WA+=1
elif i=="AC":
AC+=1
elif i=="TLE":
TLE+=1
else:
RE+=1
print("AC x "+str(AC))
print("WA x "+str(WA))
print("TLE x",TLE)
print("RE x",RE) | N=int(input())
S=[input() for i in range(N)]
AC=0
WA=0
TLE=0
RE=0
for i in S:
if i =="WA":
WA+=1
elif i=="AC":
AC+=1
elif i=="TLE":
TLE+=1
else:
RE+=1
print("AC x",str(AC))
print("WA x",str(WA))
print("TLE x",TLE)
print("RE x",RE) | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,843 | 322,844 | u671211357 | python |
p02613 | n = int(input())
s = []
for i in range(n):
s_ = input()
s.append(s_)
res = ['AC', 'WA', 'TLE', 'RE']
for i in res:
print(i,'×', s.count(i)) | n = int(input())
s = []
for i in range(n):
s_ = input()
s.append(s_)
res = ['AC', 'WA', 'TLE', 'RE']
for i in res:
print(i,'x', s.count(i))
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,861 | 322,862 | u583507988 | python |
p02613 | AC = 0
WA = 0
TLE = 0
RE = 0
N = int(input())
for _ in range(N):
S = input()
if S == 'AC':
AC += 1
elif S == 'WA':
WA += 1
elif S == 'TLE':
TLE += 1
else:
WA += 1
print('AC' + ' x ' + str(AC))
print('WA' + ' x ' + str(WA))
print('TLE' + ' x ' + str(TLE))
print('RE' ... | AC = 0
WA = 0
TLE = 0
RE = 0
N = int(input())
for _ 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 ' + str(AC))
print('WA' + ' x ' + str(WA))
print('TLE' + ' x ' + str(TLE))
print('RE' ... | [
"identifier.change"
] | 322,865 | 322,866 | u688587139 | python |
p02613 | d={'AC':0,'WA':0,'TLE':0,'RE':0}
n=int(input())
for i in range(0,n):
d[input()]+=1
for j in d:
print(j,"X",d[j]) | d={'AC':0,'WA':0,'TLE':0,'RE':0}
n=int(input())
for i in range(0,n):
d[input()]+=1
for j in d:
print(j,"x",d[j]) | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 322,871 | 322,872 | u412047585 | python |
p02613 | from collections import Counter
n = int(input())
s = [input() for i in range(n)]
c = Counter(s)
for k in ['AC', 'WA', 'TLE', 'RE']:
if k in c:
print('{k} x {}'.format(k, c[k]))
else:
print('{} x {}'.format(k, c[k])) | from collections import Counter
n = int(input())
s = [input() for i in range(n)]
c = Counter(s)
for k in ['AC', 'WA', 'TLE', 'RE']:
if k in c:
print('{} x {}'.format(k, c[k]))
else:
print('{} x {}'.format(k, c[k])) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,890 | 322,891 | u595952233 | python |
p02613 | N = int(input())
S = [input() for _ in range(N)]
ls = ["AC","WA","TLE","RE"]
for i in range(4):
print("{} × {}".format(ls[i],S.count(ls[i]))) | N = int(input())
S = [input() for _ in range(N)]
ls = ["AC","WA","TLE","RE"]
for i in range(4):
print("{} x {}".format(ls[i],S.count(ls[i]))) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,902 | 322,903 | u698868214 | python |
p02613 | n = int(input())
res = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
s = input()
res[s] += 1
for s in res:
print(s + " X " + str(res[s]))
| n = int(input())
res = {"AC":0, "WA":0, "TLE":0, "RE":0}
for i in range(n):
s = input()
res[s] += 1
for s in res:
print(s + " x " + str(res[s]))
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,910 | 322,911 | u417820548 | python |
p02613 | n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
s = str(input())
if s == 'AC':
ac += 1
if s == 'WA':
wa += 1
if s == 'TLE':
tle += 1
if s == 'RE':
re += 1
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',ac)
| n = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
s = str(input())
if s == 'AC':
ac += 1
if s == 'WA':
wa += 1
if s == 'TLE':
tle += 1
if s == 'RE':
re += 1
print('AC x',ac)
print('WA x',wa)
print('TLE x',tle)
print('RE x',re)
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 322,912 | 322,913 | u805852597 | python |
p02613 |
from collections import Counter
n = int(input())
l = [input() for _ in range(n)]
c = Counter(l)
for i in ['AC','WA','TLE','RE']:
print(f'{i} × {c[i]}')
| from collections import Counter
n = int(input())
l = [input() for _ in range(n)]
c = Counter(l)
for i in ['AC','WA','TLE','RE']:
print(f'{i} x {c[i]}')
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,930 | 322,931 | u183840468 | python |
p02613 | # import sys;input = lambda : sys.stdin.readline()
import collections
d=collections.defaultdict(lambda:0)
for _ in range(int(input())):
s=input()
d[s]+=1
print("AC X",d['AC'])
print("WA X",d['WA'])
print("TLE X",d["TLE"])
print("RE X",d['RE'])
| # import sys;input = lambda : sys.stdin.readline()
import collections
d=collections.defaultdict(lambda:0)
for _ in range(int(input())):
s=input()
d[s]+=1
print("AC x",d['AC'])
print("WA x",d['WA'])
print("TLE x",d["TLE"])
print("RE x",d['RE'])
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 322,932 | 322,933 | u514687406 | python |
p02613 | 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 tle=="TLE":
tle += 1
else:
re += 1
print("AC x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".forma... | 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
else:
re += 1
print("AC x {}".format(ac))
print("WA x {}".format(wa))
print("TLE x {}".format(tle))
print("RE x {}".format(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 322,948 | 322,949 | u867320886 | python |
p02613 | N = int(input())
jud = [0,0,0,0]
for i in range(N):
s = str(input())
if(s == "AC"):
jud[0]+=1
elif(s == "WA"):
jud[1] += 1
elif(s == "TLE"):
jud[2]+=1
else:
jud[3]+=1
print("AC x" +str(jud[0]))
print("WA x" +str(jud[1]))
print("TLE x" +str(jud[2]))
print("RE x" + str(jud[3]))
| N = int(input())
jud = [0,0,0,0]
for i in range(N):
s = str(input())
if(s == "AC"):
jud[0]+=1
elif(s == "WA"):
jud[1] += 1
elif(s == "TLE"):
jud[2]+=1
else:
jud[3]+=1
print("AC x " +str(jud[0]))
print("WA x " +str(jud[1]))
print("TLE x " +str(jud[2]))
print("RE x " + str(jud[3]))
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,954 | 322,955 | u655048024 | python |
p02613 | 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 *",ac)
print("WA *",wa)
print("TLE *",tle)
print("RE *",re) | 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)
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 322,969 | 322,970 | u288430479 | python |
p02613 | n = int(input())
s = []
for i in range(n):
s.append(int(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")) | 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")) | [
"call.arguments.change"
] | 322,973 | 322,974 | u072606168 | python |
p02613 | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
a=ii()
lol=["AC","WA","TLE","RE"]
d=defaultdict(int)
for _ in range(a):
p=inp... | import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
a=ii()
lol=["AC","WA","TLE","RE"]
d=defaultdict(int)
for _ in range(a):
p=inp... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 322,985 | 322,986 | u706984643 | python |
p02613 | n = int(input())
s = []
for i in range(n):
s.append(input())
ac = s.count('AC')
wa = s.count('WA')
tle = s.count('TLE')
re = s.count('RE')
print('AC x ' + str(ac))
print('WA × ' + str(wa))
print('TLE × ' + str(tle))
print('RE × ' + str(re)) | n = int(input())
s = []
for i in range(n):
s.append(input())
ac = s.count('AC')
wa = s.count('WA')
tle = s.count('TLE')
re = s.count('RE')
print('AC x ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE x ' + str(re))
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,987 | 322,988 | u697386253 | python |
p02613 | n=int(input())
l=[]
for i in range(n):
s=input()
l.append(s)
ac=l.count('AC')
wa=l.count('WA')
tle=l.count('TLE')
re=l.count('RE')
print('AC ' +'x' + str(ac))
print('WA ' +'x' + str(wa))
print('TLE ' +'x' + str(tle))
print('RE ' +'x' + str(re))
| n=int(input())
l=[]
for i in range(n):
s=input()
l.append(s)
ac=l.count('AC')
wa=l.count('WA')
tle=l.count('TLE')
re=l.count('RE')
print('AC ' +'x ' + str(ac))
print('WA ' +'x ' + str(wa))
print('TLE ' +'x ' + str(tle))
print('RE ' +'x ' + str(re)) | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,991 | 322,992 | u768256617 | python |
p02613 | import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s)
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("ATLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))
| import collections
n = int(input())
s = [input() for _ in range(n)]
s = collections.Counter(s)
print("AC x " + str(s["AC"]))
print("WA x " + str(s["WA"]))
print("TLE x " + str(s["TLE"]))
print("RE x " + str(s["RE"]))
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 322,993 | 322,994 | u165133750 | python |
p02613 | AC = 0
WA = 0
TLE = 0
RE = 0
N = int(input())
for i in N:
l = input()
if l == "AC":
AC += 1
elif l == "WA":
WA += 1
elif l == "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)) | AC = 0
WA = 0
TLE = 0
RE = 0
N = int(input())
for i in range(N):
l = input()
if l == "AC":
AC += 1
elif l == "WA":
WA += 1
elif l == "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)) | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 322,999 | 323,000 | u305349402 | python |
p02613 | import sys
import math
import heapq
from collections import defaultdict, deque
from decimal import *
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
ac=0;wa=0;tle=0;re=0
for _ in range(r()):
s=input()
if s=="AC":
ac+=1
... | import sys
import math
import heapq
from collections import defaultdict, deque
from decimal import *
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
ac=0;wa=0;tle=0;re=0
for _ in range(r()):
s=input()
if s=="AC":
ac+=1
... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 323,001 | 323,002 | u536230475 | python |
p02613 | t=int(input())
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(t):
s=input()
d[s]+=1
for i in d:
print(i + ': ' + str(d[i]))
| t=int(input())
d={'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(t):
s=input()
d[s]+=1
for i in d:
print(i + ' x ' + str(d[i]))
| [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 323,003 | 323,004 | u010379708 | python |
p02613 | #
import sys
input=sys.stdin.readline
def main():
N=int(input())
r=["AC","WA","TLE","RE"]
c=[0]*4
for i in range(N):
s=input().strip("\n")
c[r.index(s)]+=1
for i in range(4):
print(r[i],"×",c[i])
if __name__=="__main__":
main()
| #
import sys
input=sys.stdin.readline
def main():
N=int(input())
r=["AC","WA","TLE","RE"]
c=[0]*4
for i in range(N):
s=input().strip("\n")
c[r.index(s)]+=1
for i in range(4):
print(r[i],"x",c[i])
if __name__=="__main__":
main()
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 323,015 | 323,016 | u847923740 | python |
p02613 | n = int(input())
cnt = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
si = input()
cnt[si] += 1
print(f'AC x {cnt["AC"]}')
print(f'WA x {cnt["WA"]}')
print(f'TLT x {cnt["TLE"]}')
print(f'RE x {cnt["RE"]}')
| n = int(input())
cnt = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
for _ in range(n):
si = input()
cnt[si] += 1
print(f'AC x {cnt["AC"]}')
print(f'WA x {cnt["WA"]}')
print(f'TLE x {cnt["TLE"]}')
print(f'RE x {cnt["RE"]}')
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 323,017 | 323,018 | u533039576 | python |
p02613 | N = int(input())
a = 0
w = 0
t = 0
r = 0
for i in range(N):
S = input()
if S == "AC":
a += 1
elif S == "WA":
w += 1
elif S == "TLE":
t += 1
elif S == "RE":
r += 1
print("AC","x",a)
print("WA","x",w)
print("TLE","x",t)
print("RA","x",r) | N = int(input())
a = 0
w = 0
t = 0
r = 0
for i in range(N):
S = input()
if S == "AC":
a += 1
elif S == "WA":
w += 1
elif S == "TLE":
t += 1
elif S == "RE":
r += 1
print("AC","x",a)
print("WA","x",w)
print("TLE","x",t)
print("RE","x",r) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 323,019 | 323,020 | u556589653 | python |
p02613 | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something... | def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 323,021 | 323,022 | u043048943 | python |
p02613 | ar = [0, 0, 0, 0]
for _ in range(int(input())):
s = input()
ar[{"AC": 0, "WA": 1, "TLE": 2, "RE": 3}[s]] += 1
print("AC x", arr[0])
print("WA x", arr[1])
print("TLE x", arr[2])
print("RE x", arr[3]) | arr = [0, 0, 0, 0]
for _ in range(int(input())):
s = input()
arr[{"AC": 0, "WA": 1, "TLE": 2, "RE": 3}[s]] += 1
print("AC x", arr[0])
print("WA x", arr[1])
print("TLE x", arr[2])
print("RE x", arr[3]) | [
"assignment.variable.change",
"identifier.change"
] | 323,023 | 323,024 | u693974737 | python |
p02613 | n = int(input())
a, b, c, d = 0, 0, 0, 0
for i in range(n):
s = input()
if s == 'AC': a -= -1
if s == 'WA': b -= -1
if s == 'TLE': c -= -1
if s == 'RE': d -= -1
print('AC *', a)
print('WA *', b)
print('TLE *', c)
print('RE *', d) | n = int(input())
a, b, c, d = 0, 0, 0, 0
for i in range(n):
s = input()
if s == 'AC': a -= -1
if s == 'WA': b -= -1
if s == 'TLE': c -= -1
if s == 'RE': d -= -1
print('AC x', a)
print('WA x', b)
print('TLE x', c)
print('RE x', d) | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 323,035 | 323,036 | u912997017 | python |
p02613 | number = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(number):
now = input()
if now == "AC":
ac += 1
elif now == "WA":
wa += 1
elif tle == "TLE":
tle += 1
else:
re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE... | number = int(input())
ac = 0
wa = 0
tle = 0
re = 0
for i in range(number):
now = input()
if now == "AC":
ac += 1
elif now == "WA":
wa += 1
elif now == "TLE":
tle += 1
else:
re += 1
print("AC x " + str(ac))
print("WA x " + str(wa))
print("TLE x " + str(tle))
print("RE... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 323,039 | 323,040 | u215115622 | python |
p02613 | import sys
sys.setrecursionlimit(500005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
n = ni()
dic = defaultdict(int)
for i in range(n):
dic[ns()] += 1
for w in ("AC", "WA", "TLE", "RE"):
print(f"{w} x {dic[w]}")
| import sys
from collections import defaultdict
sys.setrecursionlimit(500005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
n = ni()
dic = defaultdict(int)
for i in range(n):
dic[ns()] += 1
for w in ("AC", "WA", "TLE", "RE"):
... | [] | 323,069 | 323,070 | u119714109 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[0]
cnt = 1
i = 1
while cnt < n-1:
cnt += 2
ans += a[i] * 2
i += 1
if cnt == n:
ans -= a[i]
print(ans)
| n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[0]
cnt = 1
i = 1
while cnt < n-1:
cnt += 2
ans += a[i] * 2
i += 1
if cnt == n:
ans -= a[i-1]
print(ans)
| [
"expression.operation.binary.add"
] | 323,670 | 323,671 | u836939578 | python |
p02615 | from sys import stdin
input = stdin.readline
N = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
res = a[0]
cnt = N - 2
cur = 1
while cnt:
if cnt == 1:
res += a[cur]
break
else:
res += a[cur] * 2
cnt -= 2
print(res) | from sys import stdin
input = stdin.readline
N = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
res = a[0]
cnt = N - 2
cur = 1
while cnt:
if cnt == 1:
res += a[cur]
break
else:
res += a[cur] * 2
cur += 1
cnt -= 2
print(res) | [] | 323,682 | 323,683 | u729972685 | python |
p02615 | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): r... | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): r... | [
"expression.operation.binary.add"
] | 323,709 | 323,710 | u364693468 | python |
p02615 | import math
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
comfortPoint = A[0]
for i in range(N)[1::]:
comfortPoint += A[math.ceil(i/2)]
print(comfortPoint)
| import math
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
comfortPoint = A[0]
for i in range(N-1)[1::]:
comfortPoint += A[math.ceil(i/2)]
print(comfortPoint)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 323,713 | 323,714 | u907865484 | python |
p02615 | N = int(input())
A = list(map(int, input().split())).sorted()
len_A = len(A)
ans = 0
for i in range(1, len_A-1):
ans += A[len_A-1-int(i/2)]
print(ans) | N = int(input())
A = list(map(int, input().split()))
A.sort()
len_A = len(A)
ans = 0
for i in range(1, len_A):
ans += A[len_A-1-int(i/2)]
print(ans) | [
"identifier.change",
"expression.operation.binary.remove"
] | 323,715 | 323,716 | u377834804 | python |
p02615 | N = int(input())
A = list(map(int, input().split())).sort()
len_A = len(A)
ans = 0
for i in range(1, len_A-1):
ans += A[len_A-1-int(i/2)]
print(ans) | N = int(input())
A = list(map(int, input().split()))
A.sort()
len_A = len(A)
ans = 0
for i in range(1, len_A):
ans += A[len_A-1-int(i/2)]
print(ans) | [
"expression.operation.binary.remove"
] | 323,717 | 323,716 | u377834804 | python |
p02615 | n = int(input())
A = list(map(int, input().split()))
if n == 2:
print(max(A))
else:
A.sort(reverse=True)
ans = A[0]
for a in A[1:n//2]:
ans += 2 * a
if n % 2 == 1:
ans += A[-2]
print(ans) | n = int(input())
A = list(map(int, input().split()))
if n == 2:
print(max(A))
else:
A.sort(reverse=True)
ans = A[0]
for a in A[1:n//2]:
ans += 2 * a
if n % 2 == 1:
ans += A[n//2]
print(ans) | [
"variable_access.subscript.index.change"
] | 323,726 | 323,727 | u170183831 | python |
p02615 | N = int(input())
As = sorted(map(int, input().split()), reverse=True)
score = As[0]
counter = 0
index = 2
for i in range(2, N):
score += As[index]
if counter == 0:
counter += 1
else:
counter -= 1
index += 1
print(score)
| N = int(input())
As = sorted(map(int, input().split()), reverse=True)
score = As[0]
counter = 0
index = 1
for i in range(2, N):
score += As[index]
if counter == 0:
counter += 1
else:
counter -= 1
index += 1
print(score)
| [
"literal.number.integer.change",
"assignment.value.change"
] | 323,728 | 323,729 | u617384447 | python |
p02615 | conf = 0
num_char = int(input())
char = list(map(int, input().split()))
char.sort(reverse=True)
count = 0
conf_int = 0
for i in range(num_char):
if count == 0:
count = 1
elif count == 1:
count = 2
conf = char[conf_int]
count_int = 0
conf_int = 1
else:
if count_int == 0 :
conf += char... | conf = 0
num_char = int(input())
char = list(map(int, input().split()))
char.sort(reverse=True)
count = 0
conf_int = 0
for i in range(num_char):
if count == 0:
count = 1
elif count == 1:
count = 2
conf = char[conf_int]
count_int = 0
conf_int = 1
else:
if count_int == 0 :
conf += char... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 323,730 | 323,731 | u617384447 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[-1]
for i in range(0, n-2):
ans += a[i // 2]
#print(ans)
print(ans)
| n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[0]
for i in range(2, n):
ans += a[i // 2]
#print(ans)
print(ans)
| [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.unary.remove",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.remove"
] | 323,734 | 323,735 | u358859892 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(1,n+1):
ans += a[n-i//2-1]
print(ans)
| n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(1, n):
ans += a[n - i//2 - 1]
print(ans)
| [
"expression.operation.binary.remove"
] | 323,746 | 323,747 | u395620499 | python |
p02615 | N = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
arrival = 1
ans = 0
while arrival < N:
score = a.popleft()
if arrival == 1:
ans += score
arrival += 1
else:
ans += score*min(2, N - arrival)
arrival += 2
print(ans) | N = int(input())
a = list(map(int, input().split()))
a.sort()
arrival = 1
ans = 0
while arrival < N:
score = a.pop()
if arrival == 1:
ans += score
arrival += 1
else:
ans += score*min(2, N - arrival)
arrival += 2
print(ans) | [
"assignment.value.change",
"identifier.change"
] | 323,752 | 323,753 | u391725895 | python |
p02615 | import math
import sys
import os
from operator import mul
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_ext = os.path.splitext(os.pa... | import math
import sys
import os
from operator import mul
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_ext = os.path.splitext(os.pa... | [
"expression.operator.change"
] | 323,762 | 323,763 | u602500004 | python |
p02615 | n = int(input())
f = list(map(int,input().split()))
f.sort(reverse = True)
ans = 0
if n%2 == 0:
for i in range(n//2):
ans += f[i] * 2
ans -= f[0]
else:
for i in range(n//2):
ans += f[i] * 2
ans += f[n//2+1]-f[0]
print(ans) | n = int(input())
f = list(map(int,input().split()))
f.sort(reverse = True)
ans = 0
if n%2 == 0:
for i in range(n//2):
ans += f[i] * 2
ans -= f[0]
else:
for i in range(n//2):
ans += f[i] * 2
ans += f[n//2]-f[0]
print(ans)
| [
"expression.operation.binary.remove"
] | 323,770 | 323,771 | u127157764 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
cnt = n-2
ans = a[0]
for i in a[1:]:
if cnt==0: break
elif cnt>2:
cnt -= 2
ans += (i*2)
else:
cnt -=1
ans += i
print(ans) | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
cnt = n-2
ans = a[0]
for i in a[1:]:
if cnt==0: break
elif cnt>=2:
cnt -= 2
ans += (i*2)
else:
cnt -=1
ans += i
print(ans) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 323,776 | 323,777 | u935642171 | python |
p02615 | n = int(input())
a = list(map(int,input().split()))
b = sorted(a,reverse = True)
ans = 0
for i in range(0,n):
if i == 0:
ans += 0
else:
ans += b[n-(i//2)-1]
print(ans) | n = int(input())
a = list(map(int,input().split()))
b = sorted(a)
ans = 0
for i in range(0,n):
if i == 0:
ans += 0
else:
ans += b[n-(i//2)-1]
print(ans) | [
"call.arguments.change"
] | 323,780 | 323,781 | u614917104 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = 0
if N % 2 == 1:
ans += A[0]
ans += A[N//2 + 1]
for i in range(1,N//2):
ans += A[i]*2
else:
ans += A[0]
for i in range(1,N//2):
ans += A[i]*2
print(ans) | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = 0
if N % 2 == 1:
ans += A[0]
ans += A[N//2]
for i in range(1,N//2):
ans += A[i]*2
else:
ans += A[0]
for i in range(1,N//2):
ans += A[i]*2
print(ans) | [
"expression.operation.binary.remove"
] | 323,805 | 323,806 | u414376763 | python |
p02615 | # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
A_list = list(map(int, sys.stdin.readline().split()))
A_list.sort(reverse=True)
arrived_idx = 1
comfort = A_list[0]
for i in range(2, len(A_list)):
if ( len(A_list) - 1 - arrived_idx ) >= 2:
co... | # -*- coding: utf-8 -*-
import sys
def main():
N = int( sys.stdin.readline() )
A_list = list(map(int, sys.stdin.readline().split()))
A_list.sort(reverse=True)
arrived_idx = 1
comfort = A_list[0]
for i in range(1, len(A_list)):
if ( len(A_list) - 1 - arrived_idx ) >= 2:
co... | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 323,814 | 323,815 | u530383736 | python |
p02615 | import bisect
import statistics
n = int(input())
a = list((int(x) for x in input().split()))
a.sort()
incl = []
score = 0
for i in range(len(a)):
ain = a.pop()
incl.append(ain)
if i==0: continue
if (len(incl)%2 == 1):
score += incl[ int(len(incl))/2 ]
else:
# smaller of middle two
... | import bisect
import statistics
n = int(input())
a = list((int(x) for x in input().split()))
a.sort()
incl = []
score = 0
for i in range(len(a)):
ain = a.pop()
incl.append(ain)
if i==0: continue
if (len(incl)%2 == 1):
score += incl[ int(len(incl)/2) ]
else:
# smaller of middle two
... | [
"call.arguments.change"
] | 323,839 | 323,840 | u231570044 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse = True)
L = len(P) // 2
if len(A) % 2 == 0:
#偶数の時
ans = sum(A[:L]) + sum(A[1:L])
else:
#奇数の時
ans = sum(A[:L]) + sum(A[1:L+1])
print(ans)
| N = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse = True)
L = len(A) // 2
if len(A) % 2 == 0:
#偶数の時
ans = sum(A[:L]) + sum(A[1:L])
else:
#奇数の時
ans = sum(A[:L]) + sum(A[1:L+1])
print(ans)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 323,856 | 323,857 | u015647294 | python |
p02615 | N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
cnt=2
ans=A[0]
i=1
while cnt<N:
ans+=A[i]
if cnt%2==0:
i+=1
cnt+=1
print(ans) | N=int(input())
A=list(map(int,input().split()))
A.sort(reverse=True)
cnt=2
ans=A[0]
i=1
while cnt<N:
ans+=A[i]
if (cnt+1)%2==0:
i+=1
cnt+=1
print(ans) | [
"control_flow.branch.if.condition.change"
] | 323,873 | 323,874 | u934740772 | python |
p02615 | import queue
ans = 0
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
q = queue.LifoQueue()
q.put(0)
for a in range(len(A)):
ans += q.get()
q.put(A[a])
if a != 0:
q.put(A[a])
print(ans)
| import queue
ans = 0
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
q = queue.Queue()
q.put(0)
for a in range(len(A)):
ans += q.get()
q.put(A[a])
if a != 0:
q.put(A[a])
print(ans)
| [
"assignment.value.change",
"identifier.change"
] | 323,875 | 323,876 | u799215419 | python |
p02615 | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0 + a[-1]
for i in range(n-2):
k = a[-(i+4)//2]
ans += k
prin... | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0 + a[-1]
for i in range(n-2):
k = a[-((i+4)//2)]
ans += k
pr... | [] | 323,877 | 323,878 | u648315264 | python |
p02615 | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = a[-1]
for i in range(n-2):
k = a[-(i+4)//2]
ans += k
print(an... | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
import itertools
from collections import Counter
def main():
n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0 + a[-1]
for i in range(n-2):
k = a[-((i+4)//2)]
ans += k
pr... | [
"assignment.change"
] | 323,879 | 323,878 | u648315264 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
aa = sorted(a, reverse=True)
# print(aa)
ans = 0
for i in range(n-1):
ans += a[(i + 1) // 2]
# print(ans)
print(ans)
| n = int(input())
a = list(map(int, input().split()))
aa = sorted(a, reverse=True)
# print(aa)
ans = 0
for i in range(n-1):
ans += aa[(i + 1) // 2]
# print(ans)
print(ans) | [
"identifier.change"
] | 323,907 | 323,908 | u429029348 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
if N%2 == 0:
for i in range(1,int(N/2)):
ans = ans + A[i]*2
if N%2 == 1:
for i in range(1,int((N-1)/2)):
ans = ans + A[i]*2
ans += A[int((N+1)/2)]
print(ans)
| N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
if N%2 == 0:
for i in range(1,int(N/2)):
ans = ans + A[i]*2
if N%2 == 1:
for i in range(1,int((N-1)/2)):
ans = ans + A[i]*2
ans += A[int((N-1)/2)]
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 323,909 | 323,910 | u310956674 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
if N%2 == 0:
for i in range(1,int(N/2)):
ans = ans + A[i]*2
if N%2 == 1:
for i in range(1,int((N-1)/2)):
ans = ans + A[i]*2
ans += A[(N+1)/2]
print(ans) | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
if N%2 == 0:
for i in range(1,int(N/2)):
ans = ans + A[i]*2
if N%2 == 1:
for i in range(1,int((N-1)/2)):
ans = ans + A[i]*2
ans += A[int((N-1)/2)]
print(ans)
| [
"call.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 323,911 | 323,910 | u310956674 | python |
p02615 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
As = list(mapint())
conf = 0
from heapq import heapify, heappop, heappush
As.sort(reverse=True)
m = As.pop(0)
s = As.pop(0)
conf += m
Q = []
heappush(Q, s)
heappush(... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
As = list(mapint())
conf = 0
from heapq import heapify, heappop, heappush
As.sort(reverse=True)
m = As.pop(0)
s = As.pop(0)
conf += m
Q = []
heappush(Q, -s)
heappush... | [
"expression.operation.unary.add",
"call.arguments.change",
"expression.operator.change"
] | 323,923 | 323,924 | u054514819 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
B = [A[0]]
for i in range(N):
B.append(A[1])
B.append(A[1])
ans = 0
for i in range(N-1):
ans += B[i]
print(ans) | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
B = [A[0]]
for i in range(N-1):
B.append(A[i+1])
B.append(A[i+1])
#print(B)
ans = 0
for i in range(N-1):
ans += B[i]
print(ans) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 323,925 | 323,926 | u197457087 | python |
p02615 | N = int(input())
nums = list(map(int, input().split()))
nums.sort(reverse=True)
score = nums[0] + sum(nums[1:N//2])
if N%2 != 0:
score += nums[N//2]
print(score) | N = int(input())
nums = list(map(int, input().split()))
nums.sort(reverse=True)
score = nums[0] + 2 * sum(nums[1:N//2])
if N%2 != 0:
score += nums[N//2]
print(score) | [
"assignment.change"
] | 323,942 | 323,943 | u626337957 | python |
p02615 | N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(n-1):
ans += a[(i+1)//2]
print(ans)
| N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(N-1):
ans += a[(i+1)//2]
print(ans)
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 323,948 | 323,949 | u400147727 | python |
p02615 | N = int(input())
a = sorted(list(map(int, input().split()), reverse=True))
ans = 0
for i in range(n-1):
ans += a[(i+1)//2]
print(ans)
| N = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(N-1):
ans += a[(i+1)//2]
print(ans)
| [
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 323,950 | 323,949 | u400147727 | python |
p02615 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
bunshi=... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
bunshi=... | [
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 323,951 | 323,952 | u319589470 | python |
p02615 | import heapq
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n=int(input())
A=input_array()
sortA=sorted(A,reverse=True) #降順にソート
ans=0
q=[]
heapq.heappush(q,-sortA[0])
for i in range(1,n):
tmp=heapq.heappop(q)
tmp*=-1
ans+=tmp
heapq.heappush(q,-sortA[i])
heapq.heappush(q,-... | import heapq
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n=int(input())
A=input_array()
sortA=sorted(A,reverse=True) #降順にソート
ans=0
q=[]
heapq.heappush(q,-sortA[0])
for i in range(1,n):
tmp=heapq.heappop(q)
tmp*=-1
ans+=tmp
heapq.heappush(q,-sortA[i])
heapq.heappush(q,-... | [
"call.remove"
] | 323,953 | 323,954 | u602773379 | python |
p02615 | import heapq
n = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = 0
q = []
heapq.heappush(q, A[0]*-1)
for i in range(1, n):
print(q)
tmp = heapq.heappop(q)
ans += tmp
heapq.heappush(q, A[i] * -1)
heapq.heappush(q, A[i] * -1)
print(ans*-1) | import heapq
n = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = 0
q = []
heapq.heappush(q, A[0]*-1)
for i in range(1, n):
tmp = heapq.heappop(q)
ans += tmp
heapq.heappush(q, A[i] * -1)
heapq.heappush(q, A[i] * -1)
print(ans*-1) | [
"call.remove"
] | 323,965 | 323,966 | u441175813 | python |
p02615 | n=int(input())
A=[]
A=list(map(int, input().split()))
# print(A)
mina = min( A )
maxa = max( A )
A.sort()
A.reverse()
sum = 0
for i in range(n):
sum +=A[(i+1)//2]
# print(A[(i+1)//2])
# print(mina)
# print(maxa)
# print(sum)
print(sum)
| n=int(input())
A=[]
A=list(map(int, input().split()))
# print(A)
mina = min( A )
maxa = max( A )
A.sort()
A.reverse()
sum = 0
for i in range(n-1):
sum +=A[(i+1)//2]
# print(A[(i+1)//2])
# print(mina)
# print(maxa)
# print(sum)
print(sum)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 323,977 | 323,978 | u707030679 | python |
p02615 | import math
N = int(input())
A = sorted(list(map(int, input().split())),reverse=True)
s = A[0]
print(A)
for i in range(1,N-1):
s += A[math.ceil(i/2)]
print(s) | import math
N = int(input())
A = sorted(list(map(int, input().split())),reverse=True)
s = A[0]
for i in range(1,N-1):
s += A[math.ceil(i/2)]
print(s) | [
"call.remove"
] | 323,981 | 323,982 | u365838886 | python |
p02615 | import math
N = int(input())
A = sorted(list(map(int, input().split())),reverse=True)
s = A[0]
for i in range(1,N):
s += A[math.ceil(i/2)]
print(s) | import math
N = int(input())
A = sorted(list(map(int, input().split())),reverse=True)
s = A[0]
for i in range(1,N-1):
s += A[math.ceil(i/2)]
print(s) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 323,983 | 323,982 | u365838886 | python |
p02615 | n=int(input())
a=list(map(int.input().split()))
a.sort(reverse=True)
ans=0
x=n
for i in range(1,n):
ans+=a[i//2]
print(ans) | n=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)
ans=0
x=n
for i in range(1,n):
ans+=a[i//2]
print(ans)
| [
"misc.typo",
"assignment.value.change",
"call.arguments.change"
] | 324,006 | 324,007 | u174291766 | python |
p02615 | n = int(input())
a = sorted(list(map(int, input().split())), reverse = True)
ans = 0
for i in range(1, n):
ans += a[i-1]
print(ans) | n = int(input())
a = sorted((list(map(int, input().split()))), reverse = True)
ans = 0
for i in range(1, n):
ans += a[i//2]
print(ans) | [
"call.arguments.change"
] | 324,031 | 324,032 | u955125992 | python |
p02615 | import numpy as np
N = int(input())
A = np.array([int(i) for i in input().split()])
A_sort = np.sort(A)
print(A_sort)
score = 0
score += A_sort[-1]
for i in range(0, (N-2)//2):
score += A_sort[-2-i] * 2
if (N-2) % 2 == 1:
score += A_sort[-3-i]
print(score)
| import numpy as np
N = int(input())
A = np.array([int(i) for i in input().split()])
A_sort = np.sort(A)
#print(A_sort)
score = 0
score += A_sort[-1]
for i in range(0, (N-2)//2):
score += A_sort[-2-i] * 2
if (N-2) % 2 == 1:
score += A_sort[-3-i]
print(score)
| [
"call.remove"
] | 324,047 | 324,048 | u292746386 | python |
p02615 | # -*- coding: utf-8 -*-
import math
# import copy
# 引数が一つだけのやつ
n = int(input())
# 引数が複数あるやつ（全部数字）
target_1 = [int(x) for x in input().split()]
# 引数が複数あるやつ（そうじゃないの）
# target = [int(x) for x in input().split()]
# number = int(input())
# 複数行を受け取って処理するやつ
# target = [list(input()) for i in range(H)]
# 関数
def count_sha... | # -*- coding: utf-8 -*-
import math
# import copy
# 引数が一つだけのやつ
n = int(input())
# 引数が複数あるやつ（全部数字）
target_1 = [int(x) for x in input().split()]
# 引数が複数あるやつ（そうじゃないの）
# target = [int(x) for x in input().split()]
# number = int(input())
# 複数行を受け取って処理するやつ
# target = [list(input()) for i in range(H)]
# 関数
def count_sha... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"identifier.change",
"call.arguments.change"
] | 324,057 | 324,058 | u995308690 | python |
p02615 | # -*- coding: utf-8 -*-
import math
# import copy
# 引数が一つだけのやつ
n = int(input())
# 引数が複数あるやつ（全部数字）
target_1 = [int(x) for x in input().split()]
# 引数が複数あるやつ（そうじゃないの）
# target = [int(x) for x in input().split()]
# number = int(input())
# 複数行を受け取って処理するやつ
# target = [list(input()) for i in range(H)]
# 関数
def count_sha... | # -*- coding: utf-8 -*-
import math
# import copy
# 引数が一つだけのやつ
n = int(input())
# 引数が複数あるやつ（全部数字）
target_1 = [int(x) for x in input().split()]
# 引数が複数あるやつ（そうじゃないの）
# target = [int(x) for x in input().split()]
# number = int(input())
# 複数行を受け取って処理するやつ
# target = [list(input()) for i in range(H)]
# 関数
def count_sha... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 324,059 | 324,058 | u995308690 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
idx = 1
cnt = 0
for i in range(2,N):
ans += A[idx]
cnt += 1
if cnt == 2:
idx += 1
c = 0
print(ans)
| N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
idx = 1
cnt = 0
for i in range(2,N):
ans += A[idx]
cnt += 1
if cnt == 2:
idx += 1
cnt = 0
print(ans)
| [
"assignment.variable.change",
"identifier.change"
] | 324,101 | 324,102 | u513434790 | python |
p02615 | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
idx = 1
cnt = 0
for i in range(2,N):
ans += A[idx]
cnt += 1
if cnt == 2:
idx += 1
print(ans)
| N = int(input())
A = list(map(int, input().split()))
A.sort(reverse = True)
ans = A[0]
idx = 1
cnt = 0
for i in range(2,N):
ans += A[idx]
cnt += 1
if cnt == 2:
idx += 1
cnt = 0
print(ans)
| [
"assignment.add"
] | 324,103 | 324,102 | u513434790 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a = sorted(a)[::-1]
ans = 2 * sum(a[1:n // 2]) + a[0]
if n % 2 == 1:
ans += a[n // 2 + 1]
print(ans) | n = int(input())
a = list(map(int, input().split()))
a = sorted(a)[::-1]
ans = 2 * sum(a[1:n // 2]) + a[0]
if n % 2 == 1:
ans += a[n // 2]
print(ans)
| [
"expression.operation.binary.remove"
] | 324,104 | 324,105 | u279266699 | python |
p02615 | n = int(input())
friend = list(map(int, input().split()))
friend.sort(reverse = True)
ans = friend[0]
i = 1
ind = 1
while i < n:
for j in range(2):
ans += friend[ind]
i += 1
if i == n: break
ind += 1
print(ans)
| n = int(input())
friend = list(map(int, input().split()))
friend.sort(reverse = True)
ans = friend[0]
i = 1
ind = 1
while i < n - 1:
for j in range(2):
ans += friend[ind]
i += 1
if i == n-1: break
ind += 1
print(ans) | [
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 324,142 | 324,143 | u659159398 | python |
p02615 |
N = int(input())
A = map(int, input().split())
A = sorted(A)
A = A[::-1]
sumkoko = A.pop(0)
sumkoko += sum(A[0:(N-1)//2]) * 2
if ((N-1)%2) == 1:
sumkoko += A[(N-1)//2]
print(sumkoko)
|
N = int(input())
A = map(int, input().split())
A = sorted(A)
A = A[::-1]
sumkoko = A.pop(0)
sumkoko += sum(A[0:(N-2)//2]) * 2
if ((N-2)%2) == 1:
sumkoko += A[(N-2)//2]
print(sumkoko)
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 324,165 | 324,166 | u520680626 | python |
p02615 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(in... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random,resource
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(in... | [
"expression.operation.binary.remove"
] | 324,169 | 324,170 | u637175065 | python |
p02615 | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
score = 0
score += A[0]
for i in range(1,int(N/2)):
score += A[i]*2
if N%2 == 1:
score += A[round(N/2)]
print(score)
| N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
score = 0
score += A[0]
for i in range(1,int(N/2)):
score += A[i]*2
if N%2 == 1:
score += A[int(N/2)]
print(score) | [
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change"
] | 324,183 | 324,184 | u555311916 | python |
p02615 | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[0]
cnt = 0
for i in range(2, n):
j = 1
if cnt < 2:
ans += a[i-j-cnt]
cnt += 1
if cnt == 2:
cnt = 0
j += 1
print(ans) | n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = a[0]
cnt = 0
j = 1
for i in range(2, n):
if cnt < 2:
ans += a[i-j-cnt]
cnt += 1
if cnt == 2:
cnt = 0
j += 1
print(ans) | [
"assignment.add",
"assignment.remove"
] | 324,201 | 324,202 | u823391732 | python |
p02615 | import heapq
N = int(input())
An = [int(e) for e in input().split()]
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
ref = sum([e for e in arr]) / len(arr)
for e in arr:
if e < ref:
left.append(e)
else:
right.append(e)
i... | import heapq
N = int(input())
An = [int(e) for e in input().split()]
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
ref = sum([e for e in arr]) / len(arr)
for e in arr:
if e < ref:
left.append(e)
else:
right.append(e)
i... | [
"expression.operation.unary.add",
"call.arguments.change",
"expression.operator.change"
] | 324,217 | 324,218 | u402601130 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.