Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03332 (python)

Fixed submission:
mod = 998244353

n,a,b,k = map(int,input().split())

fact = [1]
fact_inv = [1]
for i in range(n+4):
    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


res = 0

for i in range(n+1):
    if k - a*i < 0:
        continue
    
    if (k-a*i)%b != 0:
        continue

    j = (k-a*i)//b

    if j > n:
        continue

    res = (res + mod_comb_k(n,j,mod)*mod_comb_k(n,i,mod)%mod)%mod

print(res%mod)

Buggy submission (verdict: Runtime Error):

# your code goes here
n,a,b,k= map(int,input().split())

w = [1]
for i in range(0,n//2):
    w.append(w[-1]*(n-i)//(i+1))
if n %2 ==0:
    for i in range(0,n//2):
        w.append(w[(n-2)//2-i])
else:
    for i in range(0,n//2):
    	w.append(w[(n-3)//2-i])


c = 0
if k//a >= n:
    x = n
else:
    x = k //a

if k == 0:
    c = 1
else:
    for h in range(0,x+1):
        i = (k-a*h)/b

        if i == int(i) and n >= i:
            c += w[h]*w[int(i)]

print(c%998244353)

Buggy submission (verdict: Runtime Error):

import math
n,a,b,k= map(int,input().split())	
def w(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
#コンビネーション


c = 0
if k//a >= n:
    x = n
else:
    x = k //a
for h in range(0,x+1):
    i = (k-a*h)/b
    
    if 2*n >= h + int(i) and i == int(i):
        c = w(n,h)*w(n,int(i))+c
if c == 0:
    c = 1
print(c%998244353)
Problem p02623 (python)

Fixed submission:
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0

for i in range(1, N):
    A[i] = A[i - 1] + A[i]
    if A[i] > K:
        A = A[:i]
        break
A = [0] + A
A = A[::-1]

for i in range(1, M):
    B[i] = B[i - 1] + B[i]
    if B[i] > K:
        B = B[:i]
        break
B = [0] + B

A_length = len(A)
B_length = len(B)

j = 0
for i in range(A_length):

    while j < B_length:
        if A[i] + B[j] <= K:
            j += 1
        else:
            break
    j -= 1

    ans = max(ans, A_length - (i + 1) + j)
print(ans)

Buggy submission (verdict: Runtime Error):
N, M, K = map(int, input().split())
A = list(map(int, input().split())) + [10 ** 10]
B = list(map(int, input().split())) + [10 ** 10]

check = 0
i = 0
while (K >= (check + A[i])) & (i < N):
    check += A[i]
    i += 1

cnt = i

for ii in range(i):
    check2 = sum(A[:(i - ii)])
    j = 0
    while (K >= check2 + B[j]) & (j < M):
        check2 += B[j]
        cnt_j = j
        j += 1
    cnt = max(cnt, i - ii + cnt_j + 1)

print(cnt)
Problem p02627 (python)

Fixed submission:
s = input()
if 65<=ord(s)<=90:
  print("A")
else:
  print("a")

Buggy submission (verdict: Runtime Error):
s = input()
if 65<=ord(s)<=90:
  print(A)
else:
  print(a)
Problem p02711 (python)

Fixed submission:
S=input()
if "7" in S:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
def main():
    N=int(input())
    S=input()
    ans=0
    for i in range(N-2):
        for j in range(i+1,N-1):
            lis=["R","G","B"]
            if S[i]!=S[j]:
                lis=["R","G","B"]
                lis.remove(S[i])
                lis.remove(S[j])
                k=S[j+1:].count(lis[0])
                ans=ans+k
            if j+(j-i)<N and S[i]!=S[j]:
                if S[j+(j-i)]!=S[i] and S[j+(j-i)]!=S[j]:
                    ans-=1
    print(ans)

main()
Problem p02759 (python)

Fixed submission:
N=int(input())
if N%2==0:
  ans=N/2
else:
  ans=N//2+1
print(int(ans))

Buggy submission (verdict: Runtime Error):
N, M = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(M)]
dic = {}

# 一桁で0のときの対応
if sc == [] and N == 1:
    print(0)
    exit()
if sc == [[1, 0]] and N == 1:
    print(0)
    exit()

# 文字を組み立てます。
for k in sc:
    if k[0] in dic:
        if dic[k[0]] != k[1]:  # 重なったら即アウト
            print(-1)
            exit()
    else:
        dic[k[0]] = k[1]
ans = 0

if 1 in dic and dic[1] == 0:  # 一桁めが存在するかどうか判定している。
    print(-1)
    exit()
for k in dic:
    ans += 10**(N - k) * dic[k]
if ans < 10**(N - 1):
    ans += 10**(N - 1)
print(ans)
Problem p02771 (python)

Fixed submission:
A=input().split()
if (A[0]==A[1] and A[0]!=A[2]):
    print("Yes")
elif (A[0]==A[2] and A[0]!=A[1]):
    print("Yes")
elif (A[1]==A[2] and A[0]!=A[2]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
A=list(map(int,input().split()))
ans=[]
for i in range(N):
    for j in range(i+1,N):
        ans.append(A[i]*A[j])
print(sorted(ans)[K-1])
Problem p02777 (python)

Fixed submission:
S,T=input().split()
A,B=input().split()
U=input()
a=int(A)
b=int(B)
if U==S:
    print(a-1,b)
else:
    print(a,b-1)

Buggy submission (verdict: Runtime Error):
N=int(input())
A=input()
if len(set(A))-1==N:
    print("Yes")
else:
    print("No")
Problem p02847 (python)

Fixed submission:
S=input()
if S=="MON":
  print(6)
elif S=="TUE":
  print(5)
elif S=="WED":
  print(4)
elif S=="THU":
  print(3)
elif S=="FRI":
  print(2)
elif S=="SAT":
  print(1)
elif S=="SUN":
  print(7)

Buggy submission (verdict: Runtime Error):
S=input()
if S==MON:
  print(6)
elif S==TUE:
  print(5)
elif S==WED:
  print(4)
elif S==THU:
  print(3)
elif S==FRI:
  print(2)
elif S==SAT:
  print(1)
elif S==SUN:
  print(7)

Buggy submission (verdict: Runtime Error):
S=input()
elif S==MON:
  print(6)
elif S==TUE:
  print(5)
elif S==WED:
  print(4)
elif S==THU:
  print(3)
elif S==FRI:
  print(2)
elif S==SAT:
  print(1)
elif S==SUN:
  print(7)
Problem p02879 (python)

Fixed submission:
A,B=map(str,input().split())
if len(A)==1 and len(B)==1:
    print(int(A)*int(B))
else:
    print("-1")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input().split())
if len(A)==1 and len(B)==1:
  print(A*B)
else:
  print("-1")
Problem p03250 (python)

Fixed submission:
S=list(map(int,input().split()))
AS=sorted(S)
print(int(str(AS[2])+str(AS[1]))+int(AS[0]))

Buggy submission (verdict: Runtime Error):
S=list(input().split())
AS=sorted(S)
print(int((S[2]+S[1])+int(S[0]))
Problem p03315 (python)

Fixed submission:
S=input()
ans=0
for i in range(len(S)):
  if S[i]=="-":
    ans-=1
  else:
    ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
S=input()
ans=0
for i in range(len(S)):
  if S[i]=="-":
    ans-=1:
  else:
    ans+=1
print(ans)
Problem p03803 (python)

Fixed submission:
A,B=map(int,input().split())
a=14 if A==1 else A
b=14 if B==1 else B
if a>b:
  print("Alice")
elif b>a:
  print("Bob")
else:
  print("Draw")

Buggy submission (verdict: Runtime Error):
A,B=map(int,input(),split())
a=A%13
b=B%13
if A>B:
  print("Alice")
elif B>A:
  print("Bob")
else:
  print("Draw")
Problem p03834 (python)

Fixed submission:
S=input()
print(S.replace(","," "))

Buggy submission (verdict: Runtime Error):
X=list(map(int,input().split()))
#X軸に並行
if X[2]-X[0]==0:
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="U"
        D="D"
    print(U*(q+1)+R*2+D*(q+2)+L*2+U+L+U*q+R*2+D*q+L)
#Y軸に並行
if X[3]-X[1]==0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    print(R*(p+1)+U*2+L*(p+2)+D*2+R+D+R*p+U*2+L*p+D)
 
if X[2]-X[0]!=0 and X[3]-X[1]!=0
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="D"
        D="U"
    print(U*p+R*(q+1)+D*(p+1)+L*(q+1)+U+L+U*(p+1)+R*(q+1)+D*(p+1)+L*q)  
X=list(map(int,input().split()))
#X軸に並行
if X[2]-X[0]==0:
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="U"
        D="D"
    print(U*(q+1)+R*2+D*(q+2)+L*2+U+L+U*q+R*2+D*q+L)
#Y軸に並行
if X[3]-X[1]==0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    print(R*(p+1)+U*2+L*(p+2)+D*2+R+D+R*p+U*2+L*p+D)
if X[2]-X[0]!=0 and X[3]-X[1]!=0:
    if X[2]-X[0]>0:
        p=X[2]-X[0]
        R="R"
        L="L"
    else:
        p=X[0]-X[2]
        R="L"
        L="R"
    if X[3]-X[1]>0:
        q=X[3]-X[1]
        U="U"
        D="D"
    else:
        q=X[1]-X[3]
        U="D"
        D="U"
    print(U*p+R*(q+1)+D*(p+1)+L*(q+1)+U+L+U*(p+1)+R*(q+1)+D*(p+1)+L*q)
Problem p02712 (python)

Fixed submission:
N = int(input())

s = (1+N)*N // 2
s1 = 0
s2 = 0
s3 = 0
if N >= 3:
    s1 = ((3 + (N//3)*3) * (N//3)) // 2
if N >= 5:
    s2 = ((5 + (N//5)*5) * (N//5)) // 2
if N >= 15:
    s3 = ((15 + (N//15)*15) * (N//15)) // 2
print(s + s3 - s1 - s2)

Buggy submission (verdict: Runtime Error):
N = int(input())

s = (1+N)*N // 2
if N >= 3:
    s1 = ((3 + (N//3)*3) * (N//3)) // 2
if N >= 5:
    s2 = ((5 + (N//5)*5) * (N//5)) // 2
if N >= 15:
    s3 = ((15 + (N//15)*15) * (N//15)) // 2
print(s + s3 - s1 - s2)
Problem p02779 (python)

Fixed submission:
import collections
N = int(input())
A = list(map(int, input().split()))


table = collections.defaultdict(int)
for x in A:
    table[x] += 1
    if table[x] > 1:
        print("NO")
        exit(0)
print("YES")

Buggy submission (verdict: Runtime Error):
N = int(input())
A = set(list(map(Int, input().split())))
if len(A) == N:
    print("YES")
else:
    print("NO")
Problem p02862 (python)

Fixed submission:
X, Y = map(int, input().split())


def cmb(n, r, mod):
    if (r < 0 or r > n):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod


mod = 10**9+7
N = 10**6
g1 = [1, 1]  # 元テーブル
g2 = [1, 1]  # 逆元テーブル
inverse = [0, 1]  # 逆元テーブル計算用テーブル

if X == Y // 2 or Y == X//2:
    print(1)
    exit(0)

X, Y = max(X, Y), min(X, Y)

diff = X - Y
x = X - 2*diff

if x % 3 != 0:
    print(0)
    exit(0)
else:
    k = x // 3
    for i in range(2, N + 1):
        g1.append((g1[-1] * i) % mod)
        inverse.append((-inverse[mod % i] * (mod//i)) % mod)
        g2.append((g2[-1] * inverse[-1]) % mod)

    ans = cmb(2*k+diff, k, mod)
    print(ans)

Buggy submission (verdict: Runtime Error):
import math
X, Y = map(int, input().split())
mod = 10**9 + 7


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)


if X == Y // 2 or Y == X//2:
    print(1)
    exit(0)

X, Y = max(X, Y), min(X, Y)

diff = X - Y
x = X - 2*(X-Y)
y = Y - (X-Y)

if x % 3 != 0:
    print(0)
    exit(0)
else:
    k = x // 3

    ans = math.factorial(2*k + X-Y) % mod * \
        modinv(math.factorial(k)) * modinv(math.factorial(k+X-Y))

    print(ans % mod)

Buggy submission (verdict: Runtime Error):
import math
X, Y = map(int, input().split())
mod = 10**9 + 7


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)


if X == Y // 2 or Y == X//2:
    print(1)

X, Y = max(X, Y), min(X, Y)

diff = X - Y
x = X - 2*(X-Y)
y = Y - (X-Y)

if x % 3 != 0:
    print(0)
else:
    k = x // 3


ans = math.factorial(2*k + X-Y) % mod * \
    modinv(math.factorial(k)) * modinv(math.factorial(k+X-Y))

print(ans % mod)
Problem p02873 (python)

Fixed submission:
import collections
S = input()

s = list(S.split("><"))
ans = 0
for i in range(len(s)):
    table = collections.defaultdict(int)
    for y in s[i]:
        table[y] += 1

    if i == 0 and len(table) != 0:
        table["<"] -= 1
    if i == len(s)-1 and len(table) != 0:
        table[">"] -= 1
    table = list(table.values())
    if len(table) == 2:
        table.sort()
        ans += max((table[1]+1)*(table[1]+2) // 2, 0)
        ans += max((table[0]+1)*table[0] // 2, 0)

    elif len(table) == 1:
        ans += max((table[0]+1)*(table[0]+2) // 2, 0)
    else:
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
s=input()
n=len(s)
ans=[]
count=0
t= [0]*(n+1)
for i in range(n):
  if s[i]=="<":
    s[i+1]=s[i]+1
  else:
    s[i+1]=0
count=0
for i in range(n-1,-1,-1):
  if s[i]==">":
    s[i-1]=max(s[i]+1,s[i-1])
print(sum(ans))
Problem p02925 (python)

Fixed submission:
def main():
    import sys
    import time
    input = sys.stdin.buffer.readline
    start = time.time()
    N = int(input())
    A = [tuple(map(int, input().split())) for i in range(N)]

    id = [0]*N
    Lock = [-1]*N
    ans = 0
    min_id = 0
    M = (N*(N-1)) // 2

    while(min_id < N-1):
        now = time.time()
        if now - start > 1.9:
            ans = M
            break
        ans += 1
        if ans > M:
            break
        tmp = set()
        for i in range(N):
            if id[i] >= N-1:
                continue
            else:
                if Lock[i] >= 0:
                    continue
                else:
                    a = A[i][id[i]]
                    if Lock[a-1] == i and i not in tmp:
                        Lock[a-1] = -1
                        id[a-1] += 1
                        tmp.add(a-1)
                        id[i] += 1
                    else:
                        if i not in tmp:
                            Lock[i] = A[i][id[i]]-1
        min_id = min(id)
    if ans > M:
        print(-1)
    else:
        print(ans)


main()

Buggy submission (verdict: Runtime Error):
def main():
 	import sys
    input = sys.stdin.buffer.readline
    N = int(input())
    A = [list(map(int, input().split())) for i in range(N)]

    id = [0]*N
    Lock = [-1]*N
    ans = 0
    flag = [True]*N
    min_id = 0
    while(min_id < N-1):
        ans += 1
        if ans > (N*(N-1)) // 2:
            break
        tmp = set()
        for i in range(N):
            if id[i] >= N-1:
                continue
            else:
                if Lock[i] >= 0:
                    continue
                else:
                    if Lock[A[i][id[i]]-1] == i and i not in tmp:
                        Lock[A[i][id[i]]-1] = -1
                        id[A[i][id[i]]-1] += 1
                        tmp.add(A[i][id[i]]-1)
                        id[i] += 1
                    else:
                        if i not in tmp:
                            Lock[i] = A[i][id[i]]-1
        min_id = min(id)
    if ans > (N*(N-1)) // 2:
        print(-1)
    else:
        print(ans)
main()
Problem p02954 (python)

Fixed submission:
import copy
S = input()
Slen = len(S)

Sc=[0]*Slen
for i in range(Slen):
    if S[i:i+2] == 'RL':
        for j in range(i,-1,-1):
            if S[j]=='R':
                Sc[(i-j)%2 + i] += 1
            else:
                break
        for j in range(i+1,Slen):
            if S[j] == 'L':
                Sc[(j-i)%2 +i] += 1
            else:
                break    

print(" ".join(map(str,Sc)))

Buggy submission (verdict: Runtime Error):
s=input()
ans=[0]*len(s)
tmp=[]
for i in range(len(s)):
  tmp.append(s[i])
  if i < len(s)-1:
    if s[i:i+2]=="LR":
      tmp="".join(tmp)
      x = len(tmp)
      k = tmp.index("RL")
      if x%2==0:
        ans[i-x+k]=x//2
        ans[i-x+k+1]=x//2
      else:
        if max(k,x-(k+2))%2==0:
          ans[i-x+k+1]=x//2
          ans[i-x+k]=x//2 + 1
        else:
          ans[i-x+k]=x//2
          ans[i-x+k+1]=x//2 +1
print(" ".join(map(str,ans)))

Buggy submission (verdict: Runtime Error):
RRRLLRLLRRRLLLLL
Problem p03041 (python)

Fixed submission:
N,K=map(int,input().split())
S=input()
S=S[:K-1]+S[K-1].swapcase()+S[K:]
print(S)

Buggy submission (verdict: Runtime Error):
N,K=input().split()
S=input()
S[K-1].swapcase()
print(S)

Buggy submission (verdict: Runtime Error):
N,K=input().split()
S=input()
S[K].swapcase()
print(S)

Buggy submission (verdict: Runtime Error):
N,K=input().split()
S=input()
S[K+1].swapcase()
print(S)
Problem p03045 (python)

Fixed submission:
N,M=map(int,input().split())
xyz=[tuple(map(int,input().split())) for i in range(M)]
class unionFind:
    parent = []
    num=0
    def __init__(self, N):
        self.parent = [i for i in range(N)]
        self.num=N
    def root(self, x):
        if self.parent[x] == x:
            return(x)
        else:
            self.parent[x] = self.root(self.parent[x])
            return(self.parent[x])

    def same(self, x, y):
        x, y = x-1, y-1
        return(self.root(x) == self.root(y))

    def unite(self, x, y):
        x, y = x-1, y-1
        x = self.root(x)
        y = self.root(y)
        if x == y:
            return
        else:
            self.parent[x] = y
            self.num-=1
            return
G=unionFind(N)
for x,y,z in xyz:
  G.unite(x,y)
print(G.num)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split())
xyz=[tuple(map(int,input().split())) for i in range(M)]
class unionFind:
    parent = []

    def __init__(self, N):
        self.parent = [i for i in range(N)]

    def root(self, x):
        if self.parent[x] == x:
            return(x)
        else:
            self.parent[x] = self.root(self.parent[x])
            return(self.parent[x])

    def same(self, x, y):
        x, y = x-1, y-1
        return(self.root(x) == self.root(y))

    def unite(self, x, y):
        x, y = x-1, y-1
        x = self.root(x)
        y = self.root(y)
        if x == y:
            return
        else:
            self.parent[x] = y
            return
G=unionFind(N)
for x,y,z in xyz:
  G.unite(x,y)
ans=set()
for i in range(N):
  ans.add(G.root(i))
print(len(ans))
Problem p03135 (python)

Fixed submission:
T,X=map(int,input().split())
print(T/X)

Buggy submission (verdict: Runtime Error):
T,X=map(int,input.split())
print(T/X)
Problem p03137 (python)

Fixed submission:
N, M = map(int, input().split())
X = list(map(int, input().split()))

if N >= M:
    print(0)
else:
    X.sort()
    spot = [0]*M
    diff = [[0, 0]]*(M-1)
    for i in range(M-1):
        diff[i] = [X[i+1]-X[i], i]
    diff.sort(key=lambda x: x[0])
    if N == 1:
        print(X[-1]-X[0])

    else:
        ans = X[-1] - X[0]
        for i in range(N-1):
            tmp = diff.pop()
            ans -= tmp[0]
        print(ans)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split())
X=list(map(int,input().split()))

if N >= M:
  print(0)
else:
  X.sort()
  diff=[[0,0]]*(M-1)
  for i in range(M-1):
    diff[i]=[X[i+1]-X[i],i]
  diff.sort(key=lambda x:x[0])
  if N == 1:
    print(X[-1]-X[0])
    
  else:
    while N>0:
      if diff[-1][1]==0 or diff[-1][1]==M-2:
        N-=1
        diff.pop()
      elif N > 1:
        N-=2
        diff.pop()
      else:
        N-=1
  ans=0
  for x in diff:
    ans+=x[0]
print(ans)
Problem p03207 (python)

Fixed submission:
N = int(input())
p = [0] * N
for i in range(N):
  p[i]=int(input())
  
p = sorted(p,reverse=True)
ans = p.pop(0) / 2 +sum(p)
print(int(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
p = [0] * N
for i in range(N):
  p[i]=int(input())
  
p = sorted(p,reverse=True)
ans += p.pop(0) / 2 +sum(p)
print(ans)
Problem p03222 (python)

Fixed submission:
H, W, K = map(int, input().split())

WW = [0]*(W+1)
WW[0] = 1
WW[1] = 1
for i in range(2, W+1):
    WW[i] = WW[i-1] + WW[i-2]
DP = [[0]*W for i in range(H+1)]
DP[0][0] = 1
mod = 10**9+7
for i in range(1, H+1):
    for j in range(W):
        if j == 0:
            DP[i][j] = DP[i-1][j]*WW[W-1]
            if W > 1:
                DP[i][j] += DP[i-1][j+1]*WW[W-2]
        elif j == W-1:
            DP[i][j] = DP[i-1][j]*WW[W-1]
            if W > 1:
                DP[i][j] += DP[i-1][j-1]*WW[W-2]
        else:
            DP[i][j] = DP[i-1][j]*WW[j]*WW[W-1-j]+DP[i-1][j-1] * \
                WW[j-1]*WW[W-1-j]+DP[i-1][j+1]*WW[j]*WW[W-2-j]

        DP[i][j] %= mod
# print(DP, WW)
print(DP[-1][K-1])

Buggy submission (verdict: Runtime Error):
H, W, K = map(int, input().split())

WW = [0]*(W+1)
WW[0] = 1
WW[1] = 1
for i in range(2, W+1):
    WW[i] = WW[i-1] + WW[i-2]
DP = [[0]*W for i in range(H+1)]
DP[0][0] = 1
mod = 10**9+7
for i in range(1, H+1):
    for j in range(W):
        if j == 0:
            DP[i][j] = DP[i-1][j]*WW[W-1] + DP[i-1][j+1]*WW[W-2]
        elif j == W-1:
            DP[i][j] = DP[i-1][j]*WW[W-1] + DP[i-1][j-1]*WW[W-2]
        else:
            DP[i][j] = DP[i-1][j]*WW[j]*WW[W-1-j]+DP[i-1][j-1] * \
                WW[j-1]*WW[W-1-j]+DP[i-1][j+1]*WW[j]*WW[W-2-j]

        DP[i][j] %= mod
# print(DP, WW)
print(DP[-1][K-1])
Problem p03242 (python)

Fixed submission:
N=list(input())
for x in range(len(N)):
  if N[x]=="1":
    N[x]="9"
  else:
    N[x]="1"
print("".join(N))

Buggy submission (verdict: Runtime Error):
N=input()
for x in range(len(N)):
  if N[x]=="1":
    N[x]="9"
  elif N[x]=="9":
    N[x]="1"
print(N)
Problem p03265 (python)

Fixed submission:
x1,y1,x2,y2=map(int,input().split())
dx=x1-x2
dy=y1-y2

x3=x2+dy
y3=y2-dx

x4=x1+dy
y4=y1-dx
ans=[x3,y3,x4,y4]
print(" ".join(list(map(str,ans))))

Buggy submission (verdict: Runtime Error):
x1,y1,x2,y2=map(int,input().split())
dx=x1-x2
dy=y1-y2

x3=x2+dy
y3=y2-dx

x4=x1+dy
y4=y1-dx
ans=[x3,y3,x4,y4]
print("".join(list(map(str,ans)))
Problem p03295 (python)

Fixed submission:
import bisect
N, M = map(int, input().split())


ab = [tuple(map(int, input().split())) for i in range(M)]
ab = [tuple([ab[i][0], ab[i][1], i]) for i in range(M)]

ans = 1
tmp = 0

a = sorted(ab, key=lambda x: x[0])
b = sorted(ab, key=lambda x: x[1])

checked = set()

for i in range(M):
    if b[tmp][1] <= a[i][0]:
        ans += 1
        while(b[tmp][1] <= a[i][0] or b[tmp][2] in checked):
            tmp += 1
    checked.add(a[i][2])


print(ans)

Buggy submission (verdict: Runtime Error):
N,M=map(int,input().split())
ab=[tuple(map(int,input().split())) for i in range(M)]

ab.sort()
l=1,r=N
ans=1
for a,b in ab:
  l=max(a,l)
  r=min(b,r)
  if l>=r:
    ans+=1
    l=a
    r=b
print(ans)
Problem p03317 (python)

Fixed submission:
N,K=map(int,input().split())
import math
A=list(map(int,input().split()))
ans=1
ans+=math.ceil((N-K)/(K-1))
print(ans)

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split())
import math
A=int(input().split())
ans=1
ans+=math.ceil(N-K)/(K-1)
print(ans)
Problem p03426 (python)

Fixed submission:
H,W,D=map(int,input().split())
import collections
import bisect
table=collections.defaultdict(list)
table2=collections.defaultdict(list)
dp=collections.defaultdict(list)
field=[list(map(int,input().split())) for i in range(H)]
for i in range(H):
  for j in range(W):
    table[field[i][j]%D].append((field[i][j],i,j))
    table2[field[i][j]%D].append(field[i][j])
for x in table:
  table[x].sort(key=lambda x:x[0])
  dp[x]=[0]*len(table[x])
  for i in range(1,len(table[x])):
    dp[x][i]=dp[x][i-1]+abs(table[x][i][1]-table[x][i-1][1])+abs(table[x][i][2]-table[x][i-1][2])
  table2[x].sort()
Q=int(input())
LR=[list(map(int,input().split())) for i in range(Q)]
for i in range(Q):
  ans=0
  x,y = LR[i]
  
  id = bisect.bisect_left(table2[x%D],x)
  id2=bisect.bisect_left(table2[x%D],y)
  print(dp[x%D][id2]-dp[x%D][id])

Buggy submission (verdict: Runtime Error):
H,W,D=map(int,input().split())
import collections
table=collections.defaultdict(tuple)

field=[list(map(int,input().split())) for i in range(W)]
for i in range(H):
  for j in range(W):
    table[field[i][j]]=(i,j)
Q=int(input())
LR=[list(map(int,input().split())) for i in range(Q)]

for i in range(Q):
  ans=0
  x = table[LR[i][0]]
  value=LR[i][0]
  now=list(x)
  while(value != LR[i][1]):
    value+=D
    next=table[value]
    ans+=abs(next[0]-now[0])+abs(next[1]-now[1])
    now[0],now[1]=next[0],next[1]
    
  print(ans)
Problem p03617 (python)

Fixed submission:
from itertools import permutations
Q, H, S, D = map(int, input().split())
N = int(input())*4

ans = 0
s = [(Q, 1), (H, 2), (S, 4), (D, 8)]

ans = float("inf")
for x in permutations(s):
    tmp = 0
    n = N
    for a, b in x:
        tmp += (n // b)*a
        n %= b
    ans = min(ans, tmp)
print(ans)

Buggy submission (verdict: Runtime Error):
price=list[map(int,input().split())]
k=[0.25,0.5,1.0,2.0]

N=int(input())

from itertools import permutations
ans=float("Inf")
for x in permutations([0,1,2,3]):
  tmp=0
  n=N
  for y in x:
    tmp+= (n//k[y])*price[y]
    n=n%k[y]
  ans=min(tmp,ans)
  
print(ans)