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 |
|---|---|---|---|---|---|---|---|
p02802 | N, M = map(int, input().split())
p = []
s = []
for _ in range(M):
tp,ts = map(str,input().split())
p.append(int(tp))
s.append(ts)
cnt = [0] * (N+1)
flg = [0] * (N+1)
cnt_AC = 0
cnt_WA = 0
for i in range(M):
cp = p[i]
if flg[cp] == 1:
continue
else:
if s[i] == 'AC':
cnt_AC += 1
cnt_WA += cnt[cp]
flg[... | N, M = map(int, input().split())
p = []
s = []
for _ in range(M):
tp,ts = map(str,input().split())
p.append(int(tp))
s.append(ts)
cnt = [0] * (N+1)
flg = [0] * (N+1)
cnt_AC = 0
cnt_WA = 0
for i in range(M):
cp = p[i]
if flg[cp] == 1:
continue
else:
if s[i] == 'AC':
cnt_AC += 1
cnt_WA += cnt[cp]
flg[... | [
"call.arguments.change",
"io.output.change"
] | 606,910 | 606,911 | u314050667 | python |
p02802 | n, m = map(int, input().split())
a_list = []
b_list = ["f"] * (10**5+1)
count_ac = 0
count_wa = 0
for i in range(m):
a,b = map(str, input().split())
a_list.append((int(a),b))
for i in range(m):
if a_list[i][1] == "WA" and b_list[a_list[i][0]] == "f":
count_wa += 1
if a_list[i][1] == "AC":
... | n, m = map(int, input().split())
a_list = []
b_list = ["f"] * (10**5+1)
count_ac = 0
count_wa = 0
for i in range(m):
a,b = map(str, input().split())
a_list.append((int(a),b))
for i in range(m):
if a_list[i][1] == "WA" and b_list[a_list[i][0]] == "f":
count_wa += 1
if a_list[i][1] == "AC":
... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 606,920 | 606,921 | u700805562 | python |
p02802 | n, m = map(int, input().split())
d = [[] for i in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
d[p].append(s)
ac_cnt, w_cnt = 0, 0
for l in d:
if len(l) != 0:
w_cnt += l.index("AC")
if "AC" in l:
ac_cnt += 1
print(ac_cnt, w_cnt)
| n, m = map(int, input().split())
d = [[] for i in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
d[p].append(s)
ac_cnt, w_cnt = 0, 0
for l in d:
if len(l) != 0 and "AC" in l:
w_cnt += l.index("AC")
if "AC" in l:
ac_cnt += 1
print(ac_cnt, w_cnt)
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 606,926 | 606,927 | u777283665 | python |
p02802 | [N,M] = list(map(int,input().split()))
P = []
S = []
for i in range(M):
[ptmp,stmp] = list(input().split())
P.append(ptmp)
S.append(stmp)
ans1 = [0]*N
ans2 = [0]*N
for i in range(M):
prob = int(P[i])
resu = S[i]
if resu=="AC":
ans1[prob-1]=1
elif resu=="WA" and ans1[prob-1]!=1:
... | [N,M] = list(map(int,input().split()))
P = []
S = []
for i in range(M):
[ptmp,stmp] = list(input().split())
P.append(ptmp)
S.append(stmp)
ans1 = [0]*N
ans2 = [0]*N
for i in range(M):
prob = int(P[i])
resu = S[i]
if resu=="AC":
ans1[prob-1]=1
elif resu=="WA" and ans1[prob-1]!=1:
... | [
"call.add"
] | 606,956 | 606,957 | u208713671 | python |
p02802 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 606,964 | 606,965 | u423585790 | python |
p02802 | n,m=map(int,input().split())
s=[0]*n
t=[0]*n
for i in range(m):
a,b=map(str,input().split())
a,
a=int(a)-1
if not s[a]:
if b=="WA":
t[a]+=1
else:
s[a]=1
print(sum(s),sum(t[i] for i in range(n)if s[a])) | n,m=map(int,input().split())
s=[0]*n
t=[0]*n
for i in range(m):
a,b=map(str,input().split())
a,
a=int(a)-1
if not s[a]:
if b=="WA":
t[a]+=1
else:
s[a]=1
print(sum(s),sum(t[i] for i in range(n)if s[i])) | [
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 606,992 | 606,993 | u619819312 | python |
p02802 | n, m = map(int, input().split())
ps_lis = []
for i in range(m):
p, s = input().split()
ps_lis.append([int(p), s])
ac_lis = [0] * (n + 1)
pe_lis = [0] * (n + 1)
for p, s in ps_lis:
if s == 'WA' and ac_lis[p] == 0:
pe_lis[p] += 1
elif s == 'AC':
ac_lis[p] = 1
for i, ac in enumerate(ac_lis)... | n, m = map(int, input().split())
ps_lis = []
for i in range(m):
p, s = input().split()
ps_lis.append([int(p), s])
ac_lis = [0] * (n + 1)
pe_lis = [0] * (n + 1)
for p, s in ps_lis:
if s == 'WA' and ac_lis[p] == 0:
pe_lis[p] += 1
elif s == 'AC':
ac_lis[p] = 1
for i, ac in enumerate(ac_lis)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 607,000 | 607,001 | u598812605 | python |
p02802 | n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n) if ac[i]==1)) | n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n+1) if ac[i]==1)) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 607,031 | 607,032 | u941438707 | python |
p02802 | n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(m) if ac[i]==1)) | n,m=map(int,input().split())
ac=[0]*(n+1)
wa=[0]*(n+1)
for _ in range(m):
i,j=input().split()
i=int(i)
if j=="AC":
ac[i]=1
elif ac[i]==0 and j=="WA":
wa[i]+=1
print(sum(ac),sum(wa[i] for i in range(n+1) if ac[i]==1)) | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,033 | 607,032 | u941438707 | python |
p02802 | n, m = map(int, input().split(' '))
pena = [0 for i in range(n)]
acc = [0 for i in range(n)]
for i in range(m):
pp, ss = input().split(' ')
p = int(pp) - 1
if acc[p] == 0:
if ss == 'WA':
pena[p] += 1
else:
acc[p] = 1
for i in range(m):
pena[i] = pena[i] * acc[... | n, m = map(int, input().split(' '))
pena = [0 for i in range(n)]
acc = [0 for i in range(n)]
for i in range(m):
pp, ss = input().split(' ')
p = int(pp) - 1
if acc[p] == 0:
if ss == 'WA':
pena[p] += 1
else:
acc[p] = 1
for i in range(n):
pena[i] = pena[i] * acc[... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,066 | 607,067 | u789840108 | python |
p02802 | N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(M):
if not AC[p]:
WA[i]=0
print(sum(AC), sum(WA)) | N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[i]:
WA[i]=0
print(sum(AC), sum(WA)) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,082 | 607,083 | u419877586 | python |
p02802 | N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[p]:
WA[i]=0
print(sum(AC), sum(WA)) | N, M=map(int, input().split())
lst=[input().split() for _ in range(M)]
AC=[False for _ in range(N)]
WA=[0 for _ in range(N)]
for p, S in lst:
p=int(p)-1
if S=="AC":
AC[p]=True
if S=="WA" and not AC[p]:
WA[p]+=1
for i in range(N):
if not AC[i]:
WA[i]=0
print(sum(AC), sum(WA)) | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,084 | 607,083 | u419877586 | python |
p02802 | N, M = map(int, input().split())
p = [0]*M
k = [""] * M
for i in range(M):
p[i], k[i] = input().split()
p[i] = int(p[i])
ans = [0]*N
pen = [0]*N
accept = 0
pena = 0
for i in range(M):
if k[i] == "WA" and ans[p[i]] == 0:
pen[p[i]] += 1
elif k[i] == "AC" and ans[p[i]] == 0:
pena +=... | N, M = map(int, input().split())
p = [0] * M
k = [""] * M
for i in range(M):
p[i], k[i] = input().split()
p[i] = int(p[i])-1
ans = [0]*N
pen = [0]*N
accept = 0
pena = 0
for i in range(M):
if k[i] == "WA" and ans[p[i]] == 0:
pen[p[i]] += 1
elif k[i] == "AC" and ans[p[i]] == 0:
pen... | [
"assignment.change"
] | 607,089 | 607,090 | u578462133 | python |
p02802 | # coding: utf-8
import re
import math
#import numpy as np
#main
n,m=map(int,input().split())
MAP={}
PS=[]
for a in range(m):
s,t=input().split()
if(not s in MAP):MAP[s]=[]
MAP[s].append(t)
ac=0
wa=0
for a,b in MAP.items():
if(not "AC" in MAP[a]):continue
for c in b:
if(c=="WA"):
... | # coding: utf-8
import re
import math
#import numpy as np
#main
n,m=map(int,input().split())
MAP={}
PS=[]
for a in range(m):
s,t=input().split()
if(not s in MAP):MAP[s]=[]
MAP[s].append(t)
ac=0
wa=0
for a,b in MAP.items():
if(not "AC" in MAP[a]):continue
for c in b:
if(c=="WA"):
... | [
"identifier.change"
] | 607,091 | 607,092 | u902151549 | python |
p02802 | # -*- coding: utf-8 -*-
# abc151/abc151_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for... | # -*- coding: utf-8 -*-
# abc151/abc151_c
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for... | [
"assignment.change"
] | 607,100 | 607,101 | u106311097 | python |
p02802 | N,M = map(int,input().split())
score = [[False,0] for _ in [0]*N]
for _ in range(M):
p,S = input().split()
p = int(p)-1
S = S=="AC"
if S:
score[p][0] = True
else:
if not score[p][0]:
score[p][1] += 1
AC = sum(s[0] for s in score)
WA = sum(s[1] for s in score)
print(AC,WA) | N,M = map(int,input().split())
score = [[False,0] for _ in [0]*N]
for _ in range(M):
p,S = input().split()
p = int(p)-1
S = S=="AC"
if S:
score[p][0] = True
else:
if not score[p][0]:
score[p][1] += 1
AC = sum(s[0] for s in score)
WA = sum(s[1] for s in score if s[0])
prin... | [] | 607,104 | 607,105 | u391731808 | python |
p02802 | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
A = [list(input().split()) for i in range(m)]
for i in range(m):
A[i][0] = int(A[i][0])
P = [0] * n
AC = [0] * n
for i in range(m):
if A[i][1] == "WA":
if AC[A[i][0]] == 0:
P[A[i][0]] += 1
else:
AC[A[i][0]] =... | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
A = [list(input().split()) for i in range(m)]
for i in range(m):
A[i][0] = int(A[i][0])-1
P = [0] * n
AC = [0] * n
for i in range(m):
if A[i][1] == "WA":
if AC[A[i][0]] == 0:
P[A[i][0]] += 1
else:
AC[A[i][0]]... | [
"assignment.change"
] | 607,108 | 607,109 | u325227960 | python |
p02802 | n, m = map(int, input().split())
ac = [0 for _ in range(n)]
pen = [0 for _ in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'WA':
if ac[p] == 0:
pen[p] += 1
else:
ac[p] = 1
for p in range(m):
if ac[p] == 0:
pen[p] = 0
print(str(sum(ac)) + ' ' + str(sum(pen))) | n, m = map(int, input().split())
ac = [0 for _ in range(n)]
pen = [0 for _ in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == 'WA':
if ac[p] == 0:
pen[p] += 1
else:
ac[p] = 1
for p in range(n):
if ac[p] == 0:
pen[p] = 0
print(str(sum(ac)) + ' ' + str(sum(pen))) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,112 | 607,113 | u253952966 | python |
p02803 | from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(... | from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(... | [
"expression.operation.binary.remove"
] | 607,118 | 607,119 | u417365712 | python |
p02803 | from copy import deepcopy
from collections import deque
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(function(grid[0][0]))
... | from copy import deepcopy
from collections import deque
from itertools import product
import numpy as np
inputs = open(0).readlines()
class Grid():
def __init__(self, grid, w=0, h=0, function=lambda x: x):
self.w = w = w if w else len(grid[0])
self.h = h = h if h else len(grid)
dtype = type(... | [] | 607,120 | 607,121 | u417365712 | python |
p02802 | N, M = map(int, input().split())
wrongnumber = [0] * N
ACset = set()
for i in range(M):
p, S = input().split()
if S == "AC":
ACset.add(int(p)-1)
else:
if (int(p) - 1) not in ACset:
wrongnumber[int(p) - 1] += 1
WAnumber = 0
ACnumber = len(ACset)
for j in ACset:
WAnumber += wro... | N, M = map(int, input().split())
wrongnumber = [0] * N
ACset = set()
for i in range(M):
p, S = input().split()
if S == "AC":
ACset.add(int(p)-1)
else:
if (int(p) - 1) not in ACset:
wrongnumber[int(p) - 1] += 1
WAnumber = 0
ACnumber = len(ACset)
for j in ACset:
WAnumber += wro... | [
"expression.operation.binary.remove"
] | 607,127 | 607,128 | u065079240 | python |
p02802 | import numpy as np
N, M = map(int, input().split())
succ = [0] * N
fail = [0] * N
for i in range(M):
p, S = input().split()
p = int(p) - 1
if S == 'AC':
succ[p] = 1
else:
if succ[p] == 0:
fail[p] += 1
succ = np.array(succ)
fail = np.array(fail)
print(succ.sum(), fail.su... | import numpy as np
N, M = map(int, input().split())
succ = [0] * N
fail = [0] * N
for i in range(M):
p, S = input().split()
p = int(p) - 1
if S == 'AC':
succ[p] = 1
else:
if succ[p] == 0:
fail[p] += 1
succ = np.array(succ)
fail = np.array(fail) * succ
print(succ.sum(), ... | [
"assignment.change"
] | 607,129 | 607,130 | u555498801 | python |
p02802 | N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
p, s = input().split()
p = int(p)
if s == "AC":
if not isAC[p]:
isAC[p] = True
ac += 1
p += penalties[p]
else:
penalties[p] += 1
print(ac, penalty) | N, M = map(int, input().split())
isAC = [False] * (N+1)
penalties = [0] * (N+1)
ac, penalty = (0, 0)
for _ in range(M):
p, s = input().split()
p = int(p)
if s == "AC":
if not isAC[p]:
isAC[p] = True
ac += 1
penalty += penalties[p]
else:
penalties[p] += 1
print(ac, penalty) | [
"identifier.change"
] | 607,141 | 607,142 | u978178314 | python |
p02803 | from collections import deque
import numpy as np
H,W = map(int,input().split())
Maze=[list(input()) for i in range(H)]
for hi in range(0,H):
for wi in range(0,W):
if Maze[hi][wi]=="#":
continue
maze1=[[0]*W for _ in range(H)]
stack=deque([[hi,wi]])
while stack:
... | from collections import deque
import numpy as np
H,W = map(int,input().split())
Maze=[list(input()) for i in range(H)]
ans=0
for hi in range(0,H):
for wi in range(0,W):
if Maze[hi][wi]=="#":
continue
maze1=[[0]*W for _ in range(H)]
stack=deque([[hi,wi]])
while stack:
... | [
"assignment.add"
] | 607,168 | 607,169 | u887152994 | python |
p02803 | #関数を持ってくる
from collections import deque
#入力(座標をリストで扱いやすいように-1する)
r,c = map(int,input().split())
c_list = [list(input()) for nesya in range(r)]
for hoge in c_list:
hoge.insert(0,'#')
hoge.append('#')
c_list.insert(0,['#']*(c+2))
c_list.append(['#']*(c+2))
ans = 0
for i in range(r+2):
for j in range(c+2):
#de... | #関数を持ってくる
from collections import deque
#入力(座標をリストで扱いやすいように-1する)
r,c = map(int,input().split())
c_list = [list(input()) for nesya in range(r)]
for hoge in c_list:
hoge.insert(0,'#')
hoge.append('#')
c_list.insert(0,['#']*(c+2))
c_list.append(['#']*(c+2))
ans = 0
for j in range(r+2):
for i in range(c+2):
#de... | [
"identifier.change"
] | 607,240 | 607,241 | u227085629 | python |
p02803 | from collections import deque
h, w = map(int, input().split())
maze = [input() for i in range(h)]
ans = 0
INF = 20 * 20 + 1
for j in range(h):
for i in range(w):
if maze[j][i] == ".":
cnt = [[INF] * w for _ in range(h)]
cnt[j][i] = 0
q = deque([(j,i)])
whi... | from collections import deque
h, w = map(int, input().split())
maze = [input() for i in range(h)]
ans = 0
INF = 20 * 20 + 1
for j in range(h):
for i in range(w):
if maze[j][i] == ".":
cnt = [[INF] * w for _ in range(h)]
cnt[j][i] = 0
q = deque([(j,i)])
whi... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 607,246 | 607,247 | u324197506 | python |
p02803 | from collections import deque
h, w = map(int, input().split())
s = [list(str(input())) for _ in range(h)]
print(s)
def bfs(h, w, s, s_h, s_w):
if s[s_h][s_w] == '#':
return 0
d_max = 0
pas = [[-1 for _ in range(w)] for _ in range(h)]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[... | from collections import deque
h, w = map(int, input().split())
s = [list(str(input())) for _ in range(h)]
def bfs(h, w, s, s_h, s_w):
if s[s_h][s_w] == '#':
return 0
d_max = 0
pas = [[-1 for _ in range(w)] for _ in range(h)]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[s_h][s_w]... | [
"call.remove"
] | 607,266 | 607,267 | u222668979 | python |
p02803 | def abc151d_maze_master():
h, w = map(int, input().split())
s = []
max_val = 0
for i in range(h):
s.append(input())
for hi in range(h):
for wi in range(w):
if s[hi][wi] == '#': continue
flg = [[-1] * w for _ in range(h)]
flg[hi][wi] = 0
... | import heapq
def abc151d_maze_master():
h, w = map(int, input().split())
s = []
max_val = 0
for i in range(h):
s.append(input())
for hi in range(h):
for wi in range(w):
if s[hi][wi] == '#': continue
flg = [[-1] * w for _ in range(h)]
flg[hi][wi] ... | [] | 607,299 | 607,300 | u252405453 | python |
p02803 | #!/usr/bin/env python
# coding: utf-8
# In[11]:
from collections import deque
# In[23]:
H,W = map(int, input().split())
S = []
for _ in range(H):
S.append(input())
# In[24]:
def bfs(sx,sy):
dx = [1,0,-1,0]
dy = [0,1,0,-1]
d = [[-1]*W for _ in range(H)]
q = deque([])
q.append([sx,sy])
... | #!/usr/bin/env python
# coding: utf-8
# In[1]:
from collections import deque
# In[2]:
H,W = map(int, input().split())
S = []
for _ in range(H):
S.append(input())
# In[3]:
def bfs(sx,sy):
dx = [1,0,-1,0]
dy = [0,1,0,-1]
d = [[-1]*W for _ in range(H)]
q = deque([])
q.append([sx,sy])
... | [
"assignment.add"
] | 607,312 | 607,313 | u085717502 | python |
p02803 | from collections import deque
h,w = map(int,input().split())
s_input = [list(input()) for i in range(h)]
mx = [0,0,1,-1]
my = [1,-1,0,0]
ans = 0
for i in range(h):
for j in range(w):
if s_input[i][j]=='#':
continue
queue = deque()
queue.append([j,i])
visited = [[-1]*w ... | from collections import deque
h,w = map(int,input().split())
s_input = [list(input()) for i in range(h)]
mx = [0,0,1,-1]
my = [1,-1,0,0]
ans = 0
for i in range(h):
for j in range(w):
if s_input[i][j]=='#':
continue
queue = deque()
queue.append([j,i])
visited = [[-1]*w ... | [] | 607,352 | 607,353 | u535171899 | python |
p02803 | H,W = map(int,input().split())
S = [input() for i in range(H)]
dxy = [(0,1),(1,0),(0,-1),(-1,0)]
from collections import deque
ans = 0
for y in range(H):
for x in range(W):
if S[y][x] == '#': continue
dist = [[0]*W for i in range(H)]
visited = [[0]*W for i in range(H)]
visited[y][x]... | H,W = map(int,input().split())
S = [input() for i in range(H)]
dxy = [(0,1),(1,0),(0,-1),(-1,0)]
from collections import deque
ans = 0
for y in range(H):
for x in range(W):
if S[y][x] == '#': continue
dist = [[0]*W for i in range(H)]
visited = [[0]*W for i in range(H)]
visited[y][x]... | [
"call.add",
"call.arguments.change"
] | 607,369 | 607,370 | u037430802 | python |
p02803 | from collections import deque
H, W = map(int, input().split())
S = [list(input().rstrip('\n') ) for _ in range(H)]
moves = [[-1,0], [1,0], [0,-1], [0,1]]
min_val = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
continue
todo = deque([[i,j]])
shortest = ... | from collections import deque
H, W = map(int, input().split())
S = [list(input().rstrip('\n') ) for _ in range(H)]
moves = [[-1,0], [1,0], [0,-1], [0,1]]
min_val = 0
for i in range(H):
for j in range(W):
if S[i][j] == "#":
continue
todo = deque([[i,j]])
shortest = [... | [
"call.remove"
] | 607,389 | 607,390 | u207097826 | python |
p02803 | H, W = map(int, input().split())
S = [input() for _ in range(H)]
dx = [1, -1, 0, 0]
dy = [0, 0, 1, -1]
def longest_BFS(h, w):
ret = -1
if S[h][w] == '#':
return -1
table = [[-1 for i in range(W)] for j in range(H)]
table[h][w]
next_step = [[h, w]]
while next_step:
ret += 1
... | H, W = map(int, input().split())
S = [input() for _ in range(H)]
dx = [1, -1, 0, 0]
dy = [0, 0, 1, -1]
def longest_BFS(h, w):
ret = -1
if S[h][w] == '#':
return -1
table = [[-1 for i in range(W)] for j in range(H)]
table[h][w] = 0
next_step = [[h, w]]
while next_step:
ret += 1
... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 607,406 | 607,405 | u667084803 | python |
p02803 | from collections import deque
def maze(h, w, sh, sw, list1):
if list1[sh][sw]=="#":
return 0
flag = True
for i in range(h):
for j in range(w):
if list1[i][j]=="#":
flag=False
if flag:
return 10000000000
que = deque()
que.append([sh, sw, 0... | from collections import deque
def maze(h, w, sh, sw, list1):
if list1[sh][sw]=="#":
return 0
flag = True
for i in range(h):
for j in range(w):
if list1[i][j]=="#":
flag=False
if flag:
return h+w-2
que = deque()
que.append([sh, sw, 0])
... | [
"identifier.replace.add",
"literal.replace.remove",
"function.return_value.change"
] | 607,407 | 607,408 | u207137484 | python |
p02803 | h,w = map(int,input().split())
from copy import deepcopy
from collections import deque
a = [input().split() for l in range(h)]
c = [[None for i in range(w)]for j in range(h)]
for i in range(h):
for j in range(w):
if a[i][j] == '.':
c[i][j] = -1
ans = 0
g = deque()
for l in range(h):
for k in... | h,w = map(int,input().split())
from copy import deepcopy
from collections import deque
a = [list(input()) for l in range(h)]
c = [[None for i in range(w)]for j in range(h)]
for i in range(h):
for j in range(w):
if a[i][j] == '.':
c[i][j] = -1
ans = 0
g = deque()
for l in range(h):
for k in r... | [
"call.add",
"call.remove"
] | 607,409 | 607,410 | u342563578 | python |
p02803 | from collections import defaultdict,deque
H, W = map(int,input().split())
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,input())))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tuple(s)] = 0
while stac... | from collections import defaultdict,deque
H, W = map(int,input().split())
MAP = []
for _ in range(H):
MAP.append(tuple(map(str,input())))
move = [[0,1],[0,-1],[1,0],[-1,0]]
MAX = 0
def bfs(s):
global MAX
stack = deque([])
stack.append(tuple(s))
depth =dict()
depth[tuple(s)] = 0
while stac... | [
"call.add",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 607,411 | 607,412 | u619144316 | python |
p02803 | from collections import deque
inf = float('inf')
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]
# bfs
for si in range(h):
for sj in range(w):
if s[si][sj] == '#':
continue
dist = [[inf for j in range(w)] for i in range(h)]
... | from collections import deque
inf = float('inf')
di = [1, 0, -1, 0]
dj = [0, 1, 0, -1]
h, w = map(int, input().split())
s = [list(input()) for _ in range(h)]
ans = 0
# bfs
for si in range(h):
for sj in range(w):
if s[si][sj] == '#':
continue
dist = [[inf for j in range(w)] for i i... | [
"assignment.add",
"assignment.remove"
] | 607,413 | 607,414 | u697101155 | python |
p02803 | import queue
H,W = map(int,input().split())
maze = list()
q = queue.Queue()
for i in range(H):
maze.append( [x for x in input()])
print(maze)
maxim = 1
for i in range(H):
for j in range(W):
if maze[i][j] == "." :
maze_score = [[0]*W for k in range(H)]
maze_score[i][j] = 1
... | import queue
H,W = map(int,input().split())
maze = list()
q = queue.Queue()
for i in range(H):
maze.append( [x for x in input()])
maxim = 1
for i in range(H):
for j in range(W):
if maze[i][j] == "." :
maze_score = [[0]*W for k in range(H)]
maze_score[i][j] = 1
q.put([... | [
"call.remove"
] | 607,417 | 607,418 | u652445326 | python |
p02803 | from collections import deque
def bfs(start, maze, H, W):
max_step = 0
used = [[False for _ in range(W)] for _ in range(H)]
start_x, start_y = start
used[start_x][start_y] = True
stack = deque([[start, 0]])
while stack:
(i, j), step = stack.popleft()
if maze[i][j] == '#':
... | from collections import deque
def bfs(start, maze, H, W):
max_step = 0
used = [[False for _ in range(W)] for _ in range(H)]
start_x, start_y = start
used[start_x][start_y] = True
stack = deque([[start, 0]])
while stack:
(i, j), step = stack.popleft()
if maze[i][j] == '#':
... | [
"control_flow.break.remove"
] | 607,439 | 607,440 | u669819350 | python |
p02803 | import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
grid = [sr() for _ in range(H)]
def bfs(sy, sx):
d = [[float('inf')] * W for _ in range(H)]
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]
que = dequ... | import sys
from collections import deque
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W = lr()
grid = [sr() for _ in range(H)]
def bfs(sy, sx):
d = [[float('inf')] * W for _ in range(H)]
dy = [0, 1, 0, -1]
dx = [1, 0, -1, 0]
que = dequ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 607,470 | 607,471 | u600402037 | python |
p02803 | from collections import deque
H,W = map(int,input().split())
S = [list(input()) for _ in range(H)]
def bfs(startx,starty):
d = [[-1]*W for _ in range(H)]
q = deque([[startx,starty]])
d[startx][starty] = 0
cnt = 0
while(q):
x,y = q.popleft()
for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
... | from collections import deque
H,W = map(int,input().split())
S = [list(input()) for _ in range(H)]
def bfs(startx,starty):
d = [[-1]*W for _ in range(H)]
q = deque([[startx,starty]])
d[startx][starty] = 0
cnt = 0
while(q):
x,y = q.popleft()
for i,j in ([1,0],[-1,0],[0,1],[0,-1]):
... | [
"call.remove"
] | 607,488 | 607,489 | u557282438 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que... | from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]==".":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"assignment.value.change",
"identifier.change"
] | 607,493 | 607,494 | u573754721 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float('inf')
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!='#':
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
... | from collections import deque
h,w=map(int,input().split())
S=[input()for _ in range(h)]
inf=float('inf')
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!='#':
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
... | [
"assignment.value.change",
"identifier.change"
] | 607,495 | 607,496 | u573754721 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que... | from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]!="#":
dp=[[inf for _ in range(w)]for _ in range(h)]
dp[i][j]=0
que=deque([(i,j)])
while que:
si,sj=que... | [
"assignment.value.change",
"identifier.change"
] | 607,493 | 607,497 | u573754721 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]=="#":
continue
else:
DP=[[inf for _ in range(w)]for _ in range(h)]
DP[i][j]=0
que=deque([(i,j)])
wh... | from collections import deque
h,w=map(int,input().split())
S=[input() for _ in range(h)]
inf=float("inf")
ans=0
for i in range(h):
for j in range(w):
if S[i][j]=="#":
continue
else:
DP=[[inf for _ in range(w)]for _ in range(h)]
DP[i][j]=0
que=deque([(i,j)])
wh... | [] | 607,498 | 607,499 | u573754721 | python |
p02803 | h,w = map(int,input().split())
maze = [input() for _ in range(h)]
from collections import deque
D = [(0,1),(1,0),(-1,0),(0,-1)]
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j]=='#':
continue
queue = deque([(i,j,0)])
checked = [[0 for _ in range(w)] for _ in range(h)]
checked[i][j] =... | h,w = map(int,input().split())
maze = [input() for _ in range(h)]
from collections import deque
D = [(0,1),(1,0),(-1,0),(0,-1)]
ans = 0
for i in range(h):
for j in range(w):
if maze[i][j]=='#':
continue
queue = deque([(i,j,0)])
checked = [[0 for _ in range(w)] for _ in range(h)]
checked[i][j] =... | [
"call.remove",
"call.arguments.change"
] | 607,504 | 607,505 | u103902792 | python |
p02803 | H, W = map(int, input().split())
S = [input().split() for _ in range(H)]
from collections import deque
def bfs(sy, sx):
q = deque([[sy, sx]])
visited = [[-1]*W for _ in range(H)]
visited[sy][sx] = 0
while q:
y, x = q.popleft()
for i, j in ([1, 0], [-1, 0], [0, 1], [0, -1]):
... | H, W = map(int, input().split())
S = [input() for _ in range(H)]
from collections import deque
def bfs(sy, sx):
q = deque([[sy, sx]])
visited = [[-1]*W for _ in range(H)]
visited[sy][sx] = 0
while q:
y, x = q.popleft()
for i, j in ([1, 0], [-1, 0], [0, 1], [0, -1]):
new_y, ... | [] | 607,530 | 607,531 | u375477204 | python |
p02803 | #D
from collections import deque
h,w=map(int,input().split())
s=[]
for i in range(h):
s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
if s[i][j]=="#":
return 0
max_step=0
que=deque()
que.append([i,j])#1現在地
dist=[[-1 for _ in range(w)] for _ in range (h)]
... | #D
from collections import deque
h,w=map(int,input().split())
s=[]
for i in range(h):
s.append(list(input()))
dx=[1,0,-1,0]#東南西北
dy=[0,-1,0,1]
ans=0
def search(i,j):
if s[i][j]=="#":
return 0
max_step=0
que=deque()
que.append([i,j])#1現在地
dist=[[-1 for _ in range(w)] for _ in range (h)]
... | [
"call.remove"
] | 607,554 | 607,555 | u490489966 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
G=[["#"]*(w+2) for i in range(h+2)]
for i in range(1,h+1):
G[i]=["#"]+list(input())+["#"]
ans=0
for sx in range(1,h+1):
for sy in range(1,w+1):
if G[sx][sy]==".":
B=[[0]*(w+2) for i in range(h+2)]
for i in range(h+2):
for j in range(... | from collections import deque
h,w=map(int,input().split())
G=[["#"]*(w+2) for i in range(h+2)]
for i in range(1,h+1):
G[i]=["#"]+list(input())+["#"]
ans=0
for sx in range(1,h+1):
for sy in range(1,w+1):
if G[sx][sy]==".":
B=[[0]*(w+2) for i in range(h+2)]
for i in range(h+2):
for j in range(... | [
"call.remove"
] | 607,578 | 607,579 | u968846084 | python |
p02803 | import sys
import math
from math import sqrt
from collections import deque
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
h,w=map(int,input().split())
miti=[]
for i in range(h):
miti.append(input())
def bfs(x,y):
for i,j in [[x+1,y],[x,y+1],[x-1,y],[x,y-1]]:
if i<0 or ... | import sys
import math
from math import sqrt
from collections import deque
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
h,w=map(int,input().split())
miti=[]
for i in range(h):
miti.append(input())
def bfs(x,y):
for i,j in [[x+1,y],[x,y+1],[x-1,y],[x,y-1]]:
if i<0 or ... | [
"call.remove"
] | 607,583 | 607,584 | u023229441 | python |
p02803 | import sys
import math
from collections import deque
import copy
H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0
for _ in range(H):
temp = deque(input())
temp.appendleft("#")
temp.append("#")
maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]... | import sys
import math
from collections import deque
import copy
H, W = map(int, input().split())
maps2 = deque([deque(["#" for _ in range(W + 2)])])
MAX = 0
for _ in range(H):
temp = deque(input())
temp.appendleft("#")
temp.append("#")
maps2.append(temp)
maps2.append(deque(["#" for _ in range(W + 2)]... | [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 607,601 | 607,602 | u385244248 | python |
p02803 | import queue
dx = (1, 0, -1, 0)
dy = (0, 1, 0, -1)
h, w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
ans = 0
#startを順に探索
for y in range(h):
for x in range(w):
i = 0
move = [[-1] * w for _ in range(h)]
print(x, y)
#壁はスキップ
if(maze[y][x] == '#'):... | import queue
dx = (1, 0, -1, 0)
dy = (0, 1, 0, -1)
h, w = map(int, input().split())
maze = [list(input()) for _ in range(h)]
ans = 0
#startを順に探索
for y in range(h):
for x in range(w):
i = 0
move = [[-1] * w for _ in range(h)]
#壁はスキップ
if(maze[y][x] == '#'):
continu... | [
"call.remove"
] | 607,654 | 607,655 | u024383312 | python |
p02803 | from collections import deque
w,h = list(map(int,input().split(" ")))
path = [input() for _ in range(w)]
def bfs(sw,sh):
res = 0
dw = [-1,1,0,0]
dh = [0,0,1,-1]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[sw][sh] = 0
queue = deque()
queue.append((sw,sh))
while len(queue) != 0... | from collections import deque
w,h = list(map(int,input().split(" ")))
path = [input() for _ in range(w)]
def bfs(sw,sh):
res = 0
dw = [-1,1,0,0]
dh = [0,0,1,-1]
dist = [[-1 for _ in range(h)] for _ in range(w)]
dist[sw][sh] = 0
queue = deque()
queue.append((sw,sh))
while len(queue) != 0... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,689 | 607,690 | u979126665 | python |
p02803 | import queue
dx=[1,0,-1,0]
dy=[0,1,0,-1]
H,W=map(int,input().split())
S=[]
for h in range(H):
S.append(input())
def bfs(s):
dist = [[-1]*H for _ in range(W)]
h,w = s
dist[h][w]=0
que = queue.Queue()
que.put(s)
while not(que.empty()):
h,w = que.get()
for d in range(4):
nh = h + dx[d]
... | import queue
dx=[1,0,-1,0]
dy=[0,1,0,-1]
H,W=map(int,input().split())
S=[]
for h in range(H):
S.append(input())
def bfs(s):
dist = [[-1]*W for _ in range(H)]
h,w = s
dist[h][w]=0
que = queue.Queue()
que.put(s)
while not(que.empty()):
h,w = que.get()
for d in range(4):
nh = h + dx[d]
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 607,693 | 607,694 | u118642796 | python |
p02803 | H,W=map(int,input().split())
s=[input() for _ in range(H)]
G=[["#"]*(W+2) for _ in range(H+2)]
for i in range(H):
for j in range(W):
G[i+1][j+1]=s[i][j]
def search(y,x):
q=[(y,x)]
d=[[-1]*(W+2) for _ in range(H+2)]
d[y][x]=0
while q:
y1,x1=q.pop()
for y2,x2 in ((y1+1,x1),(... | H,W=map(int,input().split())
s=[input() for _ in range(H)]
G=[["#"]*(W+2) for _ in range(H+2)]
for i in range(H):
for j in range(W):
G[i+1][j+1]=s[i][j]
def search(y,x):
q=[(y,x)]
d=[[-1]*(W+2) for _ in range(H+2)]
d[y][x]=0
while q:
y1,x1=q.pop(0)
for y2,x2 in ((y1+1,x1),... | [
"call.arguments.change"
] | 607,740 | 607,741 | u684305751 | python |
p02803 | import sys
input = sys.stdin.readline
from collections import deque
H, W = map(int, input().split())
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start):
INF = -1
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]] = 0
while stack:
... | import sys
input = sys.stdin.readline
from collections import deque
H, W = map(int, input().split())
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start):
INF = -1
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]] = 0
while stack:
... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"call.add"
] | 607,749 | 607,750 | u102275718 | python |
p02803 | h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[h - 1][w - 1] = True
queue = [(i, j, 0... | h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[i][j] = True
queue = [(i, j, 0)]
... | [
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 607,792 | 607,793 | u598812605 | python |
p02803 | h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[h][w] = True
queue = [(i, j, 0)]
... | h, w = map(int, input().split())
grid = []
for _ in range(h):
grid.append(list(input()))
res = 0
for i in range(h):
for j in range(w):
if grid[i][j] != '.':
continue
visited = [[False for _ in range(w)] for _ in range(h)]
visited[i][j] = True
queue = [(i, j, 0)]
... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 607,794 | 607,793 | u598812605 | python |
p02803 | import queue
h,w = map(int,input().split())
maze = []
for i in range(h):
mazeRow = list(input())
maze.append(mazeRow)
maxRootCnt = 0
#スタート→ゴール全探索（ま？）
for roop_h in range(h):
for roop_w in range(w):
if maze[roop_h][roop_w] == '#':
continue
isSearched = [[0] * w for i in range(h)]
isLevel = [[0] * w f... | import queue
h,w = map(int,input().split())
maze = []
for i in range(h):
mazeRow = list(input())
maze.append(mazeRow)
maxRootCnt = 0
#スタート→ゴール全探索（ま？）
for roop_h in range(h):
for roop_w in range(w):
if maze[roop_h][roop_w] == '#':
continue
isSearched = [[0] * w for i in range(h)]
isLevel = [[0] * w fo... | [
"control_flow.branch.if.condition.change"
] | 607,809 | 607,810 | u807084817 | python |
p02803 | h,w=map(int,input().split())
M=[]
for i in range(h):
s=input()
H=[]
for j in range(w):
H.append(0) if s[j]=="." else H.append(1)
M.append(H)
def make2D(x,y):
aM=[]
for i in range(h):
aH=[]
for j in range(w):
aH.append(0) if M[i][j]==0 else aH.append(-1)
... | h,w=map(int,input().split())
M=[]
for i in range(h):
s=input()
H=[]
for j in range(w):
H.append(0) if s[j]=="." else H.append(1)
M.append(H)
def make2D(x,y):
aM=[]
for i in range(h):
aH=[]
for j in range(w):
aH.append(0) if M[i][j]==0 else aH.append(-1)
... | [
"call.remove"
] | 607,825 | 607,826 | u774539708 | python |
p02803 | from collections import deque
from itertools import chain
H, W = map(int, input().split())
M = [list(input()) for _ in range(H)]
inf = float('inf')
def flatten(list_of_lists):
return chain.from_iterable(list_of_lists)
def bfs(start, end):
distance = [[inf for i in range(W)] for j in range(H)]
queue = d... | from collections import deque
from itertools import chain
H, W = map(int, input().split())
M = [list(input()) for _ in range(H)]
inf = float('inf')
def flatten(list_of_lists):
return chain.from_iterable(list_of_lists)
def bfs(start, end):
distance = [[inf for i in range(W)] for j in range(H)]
queue = d... | [
"call.arguments.change",
"identifier.change"
] | 607,827 | 607,828 | u663767599 | python |
p02803 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
H, W = inputIntList()
S = [[s for s in input()] for _ in range(H)]
ans = 0
for si in range(H):
for ... | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
from collections import deque
import math
def inputIntList():
return [int(s) for s in input().split()]
def inputInt():
return int(input())
def main():
H, W = inputIntList()
S = [[s for s in input()] for _ in range(H)]
ans = 0
for si in range(H):
for ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 607,848 | 607,849 | u343128979 | python |
p02803 | import sys
input = sys.stdin.readline
def dfs(B,si,sj, H, W):
R = [-1]*(H*W)
R[si*W+sj] = 0
d = deque([si*W+sj])
while d:
p = d.popleft()
x = p//W
y = p%W
t = R[x*W+y]
if x > 0:
if B[(x-1)*W+y] == 0:
if R[(x-1)*W+y] == -1:
... | import sys
input = sys.stdin.readline
from collections import deque
def dfs(B,si,sj, H, W):
R = [-1]*(H*W)
R[si*W+sj] = 0
d = deque([si*W+sj])
while d:
p = d.popleft()
x = p//W
y = p%W
t = R[x*W+y]
if x > 0:
if B[(x-1)*W+y] == 0:
if R[... | [] | 607,899 | 607,900 | u201234972 | python |
p02803 | from queue import Queue
import itertools
def solve():
H, W = map(int, input().split())
S = []
for i in range(H):
tmp = list(input())
S.append(tmp)
dw = (1,0,-1,0)
dh = (0,1,0,-1)
comb = itertools.combinations(tuple(range(20)), 2)
mx = -1
for c in comb:
... | from queue import Queue
import itertools
def solve():
H, W = map(int, input().split())
S = []
for i in range(H):
tmp = list(input())
S.append(tmp)
dw = (1,0,-1,0)
dh = (0,1,0,-1)
comb = itertools.permutations(tuple(range(20)), 2)
mx = 0
for c in comb:
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.unary.remove",
"expression.operation.unary.add"
] | 607,903 | 607,902 | u647999897 | python |
p02803 | import queue
h, w = map(int, input().split(" "))
s = list()
for l in range(0, h):
line = input(">")
s.append(line)
dx = {(1, 0), (-1, 0), (0, 1), (0, -1)}
def search(start_h, start_w):
if s[start_h][start_w] == "#":
return -1
cost = [[10000000 for i in range(0, w)] for j in range(0, h)]
... | import queue
h, w = map(int, input().split(" "))
s = list()
for l in range(0, h):
line = input()
s.append(line)
dx = {(1, 0), (-1, 0), (0, 1), (0, -1)}
def search(start_h, start_w):
if s[start_h][start_w] == "#":
return -1
cost = [[10000000 for i in range(0, w)] for j in range(0, h)]
... | [] | 607,951 | 607,952 | u411965808 | python |
p02803 | from collections import deque
h,w=map(int,input().split())
maze=[list("#"*(w+2))]+[list("#"+input()+"#") for i in range(h)]+[list("#"*(w+2))]
INF=10800 #>50*50
visited=[[-INF]*(w+2) for i in range(h+2)]
ss=[]
for i in range(1,h+1):
for j in range(1,w+1):
if maze[i][j]==".":
ss.append((i,j))
def bfs(m... | from collections import deque
h,w=map(int,input().split())
maze=[list("#"*(w+2))]+[list("#"+input()+"#") for i in range(h)]+[list("#"*(w+2))]
INF=10800 #>50*50
visited=[[-INF]*(w+2) for i in range(h+2)]
ss=[]
for i in range(1,h+1):
for j in range(1,w+1):
if maze[i][j]==".":
ss.append((i,j))
def bfs(m... | [
"call.remove"
] | 607,974 | 607,975 | u130900604 | python |
p02803 | #幅優先探索
from queue import Queue
ans = 0
h,w = map(int, input().split())
maps = [input() for _ in range(h)]
for i in range(1):
for j in range(1,2):
if maps[i][j] == '.':
visited = [[-1]*w for _ in range(h)]
q = Queue()
q.put([i,j])
visited[i][j] = 0
... | #幅優先探索
from queue import Queue
ans = 0
h,w = map(int, input().split())
maps = [input() for _ in range(h)]
for i in range(h):
for j in range(w):
if maps[i][j] == '.':
visited = [[-1]*w for _ in range(h)]
q = Queue()
q.put([i,j])
visited[i][j] = 0
... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.loop.range.bounds.lower.change"
] | 607,978 | 607,979 | u350836088 | python |
p02804 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, -1, -1):
inv[j] = inv[j + 1]... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 608,104 | 608,105 | u453055089 | python |
p02804 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
if n == 1:
print(0)
exit()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, ... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10**9 + 7
a.sort()
if n == 1:
print(0)
exit()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
def COMinit():
for j in range(1, n + 1):
fac[j] = fac[j - 1] * j % mod
inv[n] = pow(fac[n], mod - 2, mod)
for j in range(n - 1, ... | [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 608,106 | 608,107 | u453055089 | python |
p02804 | # modular inverse for positive a and b and nCk mod MOD depending on modinv
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does ... | # modular inverse for positive a and b and nCk mod MOD depending on modinv
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.add"
] | 608,114 | 608,115 | u242757684 | python |
p02804 | MAX = 600000
MOD = 10 ** 9 + 7
fac = [0] * MAX
ifac = [0] * MAX
fac[0] = 1
for i in range(1,MAX):
fac[i] = (fac[i-1] * i) % MOD
ifac[MAX-1] = pow(fac[MAX-1],MOD-2,MOD)
for i in reversed(range(1,MAX)):
ifac[i-1] = (ifac[i] * i) % MOD
def combinations(n, k):
if k < 0 or n < k:
return 0
else:
... | MAX = 600000
MOD = 10 ** 9 + 7
fac = [0] * MAX
ifac = [0] * MAX
fac[0] = 1
for i in range(1,MAX):
fac[i] = (fac[i-1] * i) % MOD
ifac[MAX-1] = pow(fac[MAX-1],MOD-2,MOD)
for i in reversed(range(1,MAX)):
ifac[i-1] = (ifac[i] * i) % MOD
def combinations(n, k):
if k < 0 or n < k:
return 0
else:
... | [
"expression.operation.binary.remove",
"call.add",
"call.arguments.change"
] | 608,121 | 608,122 | u361381049 | python |
p02798 | # coding: utf-8
import sys
from itertools import permutations,combinations
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 全探索
INF = 10 ** 5
answer = INF
N = ir()
if N == 1:
print(0); exit()
A = lr()
B = lr()
for pattern ... | # coding: utf-8
import sys
from itertools import permutations,combinations
sys.setrecursionlimit(10 ** 7)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 全探索
INF = 10 ** 5
answer = INF
N = ir()
if N == 1:
print(0); exit()
A = lr()
B = lr()
for pattern ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 608,145 | 608,146 | u600402037 | python |
p02798 | import sys
input = sys.stdin.readline
class BIT:
def __init__(self, size):
self.bit = [0] * (size + 1)
self.size = size
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
i ... | import sys
input = sys.stdin.readline
class BIT:
def __init__(self, size):
self.bit = [0] * (size + 1)
self.size = size
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.bit[i]
i -= i & -i
return s
def add(self, i, x):
i ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 608,155 | 608,156 | u144913062 | python |
p02804 | n,k=map(int,input().split())
A=list(map(int,input().split()))
mod=10**9+7
if k==1:
print(sum(A)%mod)
else:
X=[]
A.sort()
x=sum(A[k-1:])
y=sum(A[:n-k+1])
for i in range(k,n+1):
X.append(x-y)
x-=A[i-1]
y-=A[n-i]
ans=0
cmb=1
for i in range(k-2,n-1):
ans+... | n,k=map(int,input().split())
A=list(map(int,input().split()))
mod=10**9+7
if k==1:
print(0)
else:
X=[]
A.sort()
x=sum(A[k-1:])
y=sum(A[:n-k+1])
for i in range(k,n+1):
X.append(x-y)
x-=A[i-1]
y-=A[n-i]
ans=0
cmb=1
for i in range(k-2,n-1):
ans+=cmb*X[i-... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.binary.remove"
] | 608,211 | 608,212 | u210827208 | python |
p02804 | MOD=10**9+7
N,K=map(int,input().split())
alist=list(map(int,input().split()))
alist.sort()
#print(alist)
inv_table = [0]+[1]
for i in range(2,K+3):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
min_s,max_s=0,0
old_comb,new_comb=0,1
for i in range(K,N+1):
#print(K,i,new_comb-old_comb)
min_s+=(new_comb-old_com... | MOD=10**9+7
N,K=map(int,input().split())
alist=list(map(int,input().split()))
alist.sort()
#print(alist)
inv_table = [0]+[1]
for i in range(2,N+1):
inv_table.append(-(MOD//i)*inv_table[MOD%i]%MOD)
min_s,max_s=0,0
old_comb,new_comb=0,1
for i in range(K,N+1):
#print(K,i,new_comb-old_comb)
min_s+=(new_comb-old_com... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"literal.number.integer.change"
] | 608,236 | 608,237 | u203843959 | python |
p02804 | import sys
readline = sys.stdin.readline
MOD = pow(10,9)+7
def combinations(n,k):
global fac, finv
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD
def main():
global fac, finv
N, K = map(int, readline().split())
A = list(ma... | import sys
readline = sys.stdin.readline
MOD = pow(10,9)+7
def combinations(n,k):
global fac, finv
if n < k:
return 0
if n < 0 or k < 0:
return 0
return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD
def main():
global fac, finv
N, K = map(int, readline().split())
A = list(ma... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 608,238 | 608,239 | u125545880 | python |
p02804 | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = lr()
A.sort()
MOD = 10 ** 9 + 7
if K == 1:
print(0)
exit()
def cmb(n, k):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] % MOD * ifac[n-k... | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K = lr()
A = lr()
A.sort()
MOD = 10 ** 9 + 7
if K == 1:
print(0)
exit()
def cmb(n, k):
# nCkを計算する
k = min(k, n-k)
return fac[n] * ifac[k] % MOD * ifac[n-k... | [
"expression.operator.change"
] | 608,275 | 608,276 | u600402037 | python |
p02804 | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1... | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 608,308 | 608,309 | u779455925 | python |
p02804 | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1... | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
N,K=map(int,input().split())
#A=[list(reversed(list(map(int,input().split())))) for i in range(N)]
A=list(map(int,input().split()))
A.sort()
mod=10**9+7
fac=[1,1]
for i in range(2,N+1... | [
"call.add",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 608,310 | 608,309 | u779455925 | python |
p02804 | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | [
"call.arguments.change",
"call.arguments.add"
] | 608,344 | 608,345 | u612975321 | python |
p02804 | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | [
"call.arguments.change",
"call.arguments.add"
] | 608,346 | 608,347 | u612975321 | python |
p02804 | N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1... | N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1... | [
"identifier.change"
] | 608,381 | 608,382 | u844646164 | python |
p02804 | N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1... | N, K = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
B = A[:][::-1]
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
Mod = 10**9+7
def COMinit():
#N_C_kのN
for i in range(2, 10**5+10):
fac.append(fac[-1]*i%Mod)
inv.append((-inv[Mod%i] * (Mod//i)) % Mod)
finv.append(finv[-1] * inv[-1... | [
"call.arguments.change",
"identifier.change"
] | 608,383 | 608,382 | u844646164 | python |
p02804 | N, K = map(int, input().split())
A = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % p
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], p - 2, p) * pow(fac[k], ... | p = 1000000007
N, K = map(int, input().split())
A = list(map(int, input().split()))
fac = [0] * (N + 1)
fac[0] = 1
for i in range(N):
fac[i + 1] = fac[i] * (i + 1) % p
def mcomb(n, k):
if n == 0 and k == 0:
return 1
if n < k or k < 0:
return 0
return fac[n] * pow(fac[n - k], p - 2, p... | [
"identifier.change"
] | 608,388 | 608,389 | u347640436 | python |
p02804 | #
import sys
input=sys.stdin.readline
MOD=10**9+7
fact=[1]*(10**5+1)
for i in range(1,10**5+1):
fact[i]=(fact[i-1]*i)%MOD
def comb(n,r):
nhri=pow(fact[n-r],MOD-2,MOD)
ri=pow(fact[r],MOD-2,MOD)
return fact[n]//(nhri*ri)
def main():
N,K=map(int,input().split())
A=list(map(int,input().spli... | #
import sys
input=sys.stdin.readline
MOD=10**9+7
fact=[1]*(10**5+1)
for i in range(1,10**5+1):
fact[i]=(fact[i-1]*i)%MOD
def comb(n,r):
nhri=pow(fact[n-r],MOD-2,MOD)
ri=pow(fact[r],MOD-2,MOD)
return fact[n]*nhri*ri
def main():
N,K=map(int,input().split())
A=list(map(int,input().split()... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 608,396 | 608,397 | u847923740 | python |
p02804 | import sys
sys.setrecursionlimit(2147483647)
n,k=map(int,input().split())
#n個の中からk個選んだ時の最大と最小
a=list(map(int,input().split()))
"""
seta=set([])
dic={}
for v in a:
if v in seta:
dic[v]+=1
else:
dic[v]=1
seta.add(v)
a=list(seta)
"""
a.sort()
def cmb(n, r, p):
if (r < 0) or (n < r... | import sys
sys.setrecursionlimit(2147483647)
n,k=map(int,input().split())
#n個の中からk個選んだ時の最大と最小
a=list(map(int,input().split()))
"""
seta=set([])
dic={}
for v in a:
if v in seta:
dic[v]+=1
else:
dic[v]=1
seta.add(v)
a=list(seta)
"""
a.sort()
def cmb(n, r, p):
if (r < 0) or (n < r... | [
"expression.operation.binary.add"
] | 608,400 | 608,401 | u588794534 | python |
p02804 | def COMinit(N, mod):
fac = [0] * N
finv = [0] * N
inv = [0] * N
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
... | def COMinit(N, mod):
fac = [0] * N
finv = [0] * N
inv = [0] * N
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, N):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
... | [
"call.arguments.change",
"call.arguments.add"
] | 608,404 | 608,405 | u647999897 | python |
p02804 | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 608,420 | 608,421 | u685983477 | python |
p02804 | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(f, MOD - 2, MOD)
# n!^-1 - 1!^-1 の計算
invs = [1] * (n + 1)
invs[n] = inv
for m in range(n, 1, -1):
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 608,422 | 608,421 | u685983477 | python |
p02804 | N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort()
mod = 10 ** 9 + 7
def make_tables(n, mod = 10 ** 9 + 7):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.append((mod... | N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A.sort()
mod = 10 ** 9 + 7
def make_tables(n, mod = 10 ** 9 + 7):
fac = [1, 1] # 階乗テーブル
finv = [1, 1] #逆元の階乗テーブル
inv = [0, 1] #逆元テーブル
for i in range(2, n + 1):
fac.append((fac[-1] * i) % mod)
inv.append((mod... | [
"call.arguments.change",
"call.arguments.add"
] | 608,458 | 608,459 | u609061751 | python |
p02804 | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
m=0
M=0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n]... | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
m=0
M=0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 6 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n]... | [
"call.arguments.change",
"call.arguments.add"
] | 608,460 | 608,461 | u527261492 | python |
p02804 | n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
nums.sort()
mod = 10 ** 9 + 7
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# xの逆元を求め... | n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
nums.sort()
mod = 10 ** 9 + 7
# x ** a をmodで割った余りを、O(log(a))時間で求める。
def power(x, a):
if a == 0:
return 1
elif a == 1:
return x
elif a % 2 == 0:
return power(x, a//2) **2 % mod
else:
return power(x, a//2) **2 * x % mod
# xの逆元を求め... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.remove"
] | 608,487 | 608,486 | u162612857 | python |
p02804 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | [
"expression.operation.binary.add"
] | 608,508 | 608,509 | u375616706 | python |
p02804 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 608,510 | 608,509 | u375616706 | python |
p02804 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | [
"expression.operation.binary.remove"
] | 608,511 | 608,512 | u375616706 | python |
p02804 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for i... | [
"expression.operator.change",
"expression.operation.binary.remove",
"expression.operation.unary.add",
"call.arguments.change"
] | 608,513 | 608,514 | u375616706 | python |
p02804 | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
MOD = 10**9 + 7
if k == 1:
print(0)
exit()
mod = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10 ** 5):
new_fact = fact[-1] * (i + 1) % mod
fact.append(new_fact)
fact_inv.append(pow(new_fact, mod - 2, mod)... | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
MOD = 10**9 + 7
if k == 1:
print(0)
exit()
mod = 10 ** 9 + 7
fact = [1]
fact_inv = [1]
for i in range(10 ** 5):
new_fact = fact[-1] * (i + 1) % mod
fact.append(new_fact)
fact_inv.append(pow(new_fact, mod - 2, mod)... | [] | 608,538 | 608,539 | u768896740 | python |
p02804 | mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n]*fact_inv[k]%mod*fact_inv[n-k]%mod
N,K = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted... | mod = 10**9+7
fact = [1]
fact_inv = [1]
for i in range(10**5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n]*fact_inv[k]%mod*fact_inv[n-k]%mod
N,K = map(int,input().split())
arr = list(map(int,input().split()))
arr = sorted... | [
"call.arguments.change",
"call.arguments.add"
] | 608,542 | 608,543 | u268181283 | python |
p02804 | import math
n,k = list(map(int, input().split(" ")))
nums = list(map(int, input().split(" ")))
nums.sort()
mod = 10**9 + 7
f = [1]
for i in range(1,10**5+1):
f.append(f[-1] * i)
def nCr(n,r):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
minSum = 0
maxSum = 0
for i in range(n-k+1):
... | import math
n,k = list(map(int, input().split(" ")))
nums = list(map(int, input().split(" ")))
nums.sort()
mod = 10**9 + 7
f = [1]
for i in range(1,10**5+1):
f.append(f[-1] * i % mod)
def nCr(n,r):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
minSum = 0
maxSum = 0
for i in range(n-k... | [
"expression.operation.binary.add"
] | 608,553 | 608,554 | u979126665 | python |
p02804 | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1, k):
base = (bas... | n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
a.sort(reverse = True)
N = n+2
P = mod
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
base = 1
for item in range(n-k+1, n):
base = (base * item) % mod
for i in range(1, k):
base = (bas... | [
"call.arguments.change"
] | 608,561 | 608,562 | u711539583 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.