Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
H, W = map(int, input().split())
S = [input() for i in range(H)]
distW = [[0 for j in range(W)] for i in range(H)]
distH = [[0 for j in range(W)] for i in range(H)]

for i in range(H):
    j = 0
    while j < W:
        if S[i][j]==".":
            dj = 1
            for nj in range(1, W+1):
                if j+nj == W or S[i][j+nj] == "#":
                    for nnj in range(nj):
                        dj = nj
                        distW[i][j+nnj] = nj
                    break
            j += dj
        elif S[i][j]=="#":
            distW[i][j] = 0
            j+=1

for j in range(W):
    i = 0
    while i < H:
        if S[i][j]==".":
            di = 1
            for ni in range(1, H+1):
                if i+ni == H or S[i+ni][j] == "#":
                    di = ni
                    for nni in range(ni):
                        distH[i+nni][j] = ni
                    break
            i += di
        elif S[i][j]=="#":
            distH[i][j] = 0
            i+=1

ans = 0
for i in range(H):
    for j in range(W):
        ans = max(ans, distW[i][j]+distH[i][j]-1)

print(ans)

Fixed submission:
H, W = map(int, input().split())
S = [input() for i in range(H)]
distW = [[0 for j in range(W)] for i in range(H)]
distH = [[0 for j in range(W)] for i in range(H)]

for i in range(H):
    j = 0
    while j < W:
        if S[i][j]==".":
            dj = 1
            for nj in range(1, W+1):
                if j+nj == W or S[i][j+nj] == "#":
                    for nnj in range(nj):
                        dj = nj
                        distW[i][j+nnj] = nj
                    break
            j += dj
        elif S[i][j]=="#":
            distW[i][j] = 0
            j+=1

for j in range(W):
    i = 0
    while i < H:
        if S[i][j]==".":
            di = 1
            for ni in range(1, H+1):
                if i+ni == H or S[i+ni][j] == "#":
                    di = ni
                    for nni in range(ni):
                        distH[i+nni][j] = ni
                    break
            i += di
        elif S[i][j]=="#":
            distH[i][j] = 0
            i+=1

ans = 0
for i in range(H):
    for j in range(W):
        ans = max(ans, distW[i][j]+distH[i][j]-1)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
R, G, B, N = map(int, input().split())
ans = 0
for r in range(N//R+1):
    for g in range(N//G+1):
        if r*R+g*G>N:
            continue
        if (N-r*R-g*G)%B==0:
            ans += 1

print(ans)

Fixed submission:
R, G, B, N = map(int, input().split())
ans = 0
for r in range(N//R+1):
    for g in range(N//G+1):
        if r*R+g*G>N:
            continue
        if (N-r*R-g*G)%B==0:
            ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
V = list(map(int, input().split()))
C = list(map(int, input().split()))

maxV = 0
for i in range(2**N):
    bit = i
    X = Y = 0
    for j in range(N):
        mod = bit%2
        bit = bit//2
        if(mod==1):
            X += V[j]
            Y += C[j]
    maxV = max(maxV, X-Y)

print(maxV)


Fixed submission:
N = int(input())
V = list(map(int, input().split()))
C = list(map(int, input().split()))

X = [max(0, V[i]-C[i]) for i in range(N)]
print(sum(X))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
def gcd(a, b):
    P = max(a, b)
    Q = min(a, b)
    R = P%Q
    P = Q
    Q = R
    while R != 0:
        R = P%Q
        P = Q
        Q = R
    return P

candidate = [(gcd(A[0], A[1]), True), (A[0], False), (A[1], False)]
for i in range(2, N):
    nxt_cand = []
    for v, b in candidate:
        if(v == 1):
            continue
        if(b == True and gcd(v, A[i]) < v):
            nxt_cand.append((v, False))
        else:
            nxt_cand.append((gcd(v, A[i]), b))
    candidate = nxt_cand[::]

print(max(candidate)[0])


Fixed submission:
N = int(input())
A = list(map(int, input().split()))
def gcd(a, b):
    P = max(a, b)
    Q = min(a, b)
    R = P%Q
    P = Q
    Q = R
    while R != 0:
        R = P%Q
        P = Q
        Q = R
    return P

candidate = [(gcd(A[0], A[1]), True), (A[0], False), (A[1], False)]
for i in range(2, N):
    nxt_cand = []
    for v, b in candidate:
        if(v == 1):
            continue
        if(b == True and gcd(v, A[i]) < v):
            nxt_cand.append((v, False))
            nxt_cand.append((gcd(v, A[i]), True))
        else:
            nxt_cand.append((gcd(v, A[i]), b))
    if(len(nxt_cand)==0):
        nxt_cand = [(1, False)]
    candidate = nxt_cand[::]

print(max(candidate)[0])
Buggy python submission (verdict: Runtime Error):
L, N = map(int, input().split())
X = [0] + [int(input()) for i in range(N)]
ans = 0
queue = [(0, 0, X[1], L-X[-1], 1, -1, 0)]

while queue:
    q = queue.pop()
    pos, path, l_len, r_len, l, r, cnt = q
    if(l-N-1 == r):
        path += max(l_len, r_len)
        ans = max(ans, path)
        continue
    if(l_len >= r_len):
        queue.append((l, path+l_len, X[l+1] - X[l],  l_len + r_len, l + 1, r, cnt+1))
    if(l_len <= r_len):
        queue.append((r, path+r_len, l_len + r_len,  X[r] - X[r-1], l, r - 1, cnt+1))

print(ans)


Fixed submission:
A, B, C = map(int, input().split())

print(min(B+C, A+2*B+1))
Buggy python submission (verdict: Runtime Error):
n = int(input())

print(100-100//n)

Fixed submission:
S = input()
print(S if len(S) == 2 else S[::-1])
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
print(max(A)-min(A))


Fixed submission:
S = input()
T = input()

ans = False
for i in range(len(S)):
    R = S[i:] + S[:i]
    if T == R:
        ans = True
        break

print("Yes" if ans else "No")
Buggy python submission (verdict: Runtime Error):
a, b, k = map(int, input().split())
l = list(range(a, b+1))
for i in l:
    if(i<a+k or i>b-k):
        print(i)


Fixed submission:
a, b, k = map(int, input().split())
if((b-a)//2>=k):
    for i in range(k):
        print(a+i)
    for i in range(k):
        print(b-k+i+1)
else:
    for i in range(a, b+1):
        print(i)
Buggy python submission (verdict: Runtime Error):
print(["No","Yes"][int(input())+int(input())>int(input())])

Fixed submission:
a, b, c = map(int, input().split())
print(["No","Yes"][a+b>=c])
Buggy python submission (verdict: Runtime Error):
print(int(input()//3)

Fixed submission:
print(int(input())//3)
Buggy python submission (verdict: Runtime Error):
6
382253568 723152896 37802240 379425024 404894720 471526144

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
ans = 10**9
for i in range(N):
    j = 0
    R = A[i] % 2
    B = A[i] // 2
    while(R==0):
        j += 1
        R = B % 2
        B = B // 2
    ans = min(j, ans)
    
print(ans)
Buggy python submission (verdict: Runtime Error):
N, M, K = map(int, input().split())


def solve(N, M, K):
    for i in range(N+1):
        for j in range(M+1):
            blackNum = i*M + j*N - 2*i*j
            if K == blackNum:
                return "Yes"
    return "No"

print(solve(N, M, K))


Fixed submission:
S = input()
ans = "Yes" if S[0:4] == "YAKI" else "No"
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())

lcm = 0
gcd = 0

for i in range(n):
    t = int(input())
    if(i == 0):
        lcm, gcd = t, t
        continue
    lcm = t
    r = gcd % t
    while(r!=0):
        lcm = r
        r = t % r
    gcd *= t
    gcd //= lcm
print(gcd)


Fixed submission:
n = input()
print("Yes" if(n[0]==n[2]) else "No")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
path = [[0 for i in range(n)] for j in range(n)]

for i in range(n-1):
    a, b, c = map(int, input().split())
    path[min(a-1, b-1)][max(a-1, b-1)] = c


q, k = map(int, input().split())
distance = [None] * n
distance[k-1] = 0
queue = [k-1]
while(len(queue)):
    p = queue.pop()
    for i in range(n):
        if(path[min(i,p)][max(i,p)]!=0 and distance[i] == None):
            distance[i] = distance[p] + path[min(i,p)][max(i,p)]
            queue.append(i)

for i in range(q):
    x, y = map(int, input().split())
    print(distance[x-1]+distance[y-1])


Fixed submission:
n = int(input())
path = [[] for i in range(n)]

for i in range(n-1):
    a, b, c = map(int, input().split())
    path[a-1].append((b-1, c))
    path[b-1].append((a-1, c))


q, k = map(int, input().split())
distance = [None] * n
distance[k-1] = 0
queue = [k-1]
while(len(queue)):
    p = queue.pop()
    for i,c in path[p]:
        if(distance[i] == None):
            distance[i] = distance[p] + c
            queue.append(i)

for i in range(q):
    x, y = map(int, input().split())
    print(distance[x-1]+distance[y-1])
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    h, w = map(int, input().split())
    n = int(input())
    a = list(map(int, input().split()))

    c = [0] * (h*w)
    
    focus = 0
    for i in range(n):
        for j in range(a[i]):
            c[focus] = i+1
            focus += 1

    for i in range(h):
        for j in range(w):
            if(i%2 == 0):
                if(j + 1 != w):
                    print(c[i*w+j],end=" ")
                else:
                    print(c[i*w+j])
            else:
                if(j + 1 != w):
                    print(c[(i+1)*w-1-j],end=" ")
                else:
                    print(c[(i+1)*w-1-j])


Fixed submission:
if __name__ == '__main__':
    n, m = map(int, input().split())
    print((n-1)*(m-1))
Buggy python submission (verdict: Runtime Error):
if __name__ == '__main__':
    h, w = map(int, input().split())
    n = int(input())
    a = list(map(int, input().split()))

    c = [[0 for i in range(w)] for j in range(h)]
    vx = [1, -1, 0, 0]
    vy = [0, 0, 1, -1]
    color = 0

    def draw(x, y, num):
        sx, sy = x, y
        cnt = num
        queue = [(sx, sy)]
        while(len(queue)):
            if(not cnt):
                break
            cnt -= 1
            pos = queue.pop()
            c[pos[0]][pos[1]] = color + 1
            for i in range(4):
                if(pos[0]+vx[i]>=0 and pos[0]+vx[i]<h and
                   pos[1]+vy[i]>=0 and pos[1]+vy[i]<w and
                   c[pos[0]+vx[i]][pos[1]+vy[i]] == 0):
                    queue.append((pos[0]+vx[i], pos[1]+vy[i]))

    for i in range(h):
        for j in range(w):
            if(c[i][j] == 0):
                draw(i, j, a[color])
                color+=1

    print('\n'.join(' '.join([str(j) for j in i]) for i in c))


Fixed submission:
if __name__ == '__main__':
    h, w = map(int, input().split())
    n = int(input())
    a = list(map(int, input().split()))

    c = [0] * (h*w)
    
    focus = 0
    for i in range(n):
        for j in range(a[i]):
            c[focus] = i+1
            focus += 1

    for i in range(h):
        for j in range(w):
            if(i%2 == 0):
                if(j + 1 != w):
                    print(c[i*w+j],end=" ")
                else:
                    print(c[i*w+j])
            else:
                if(j + 1 != w):
                    print(c[(i+1)*w-1-j],end=" ")
                else:
                    print(c[(i+1)*w-1-j])
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) if(i) else 0 for i in range(n+1)]
distance = [None] * (n+1)

def dfs(p, d):
    if(p==2):
        return d
    if(distance[p]!=None):
        return -1
    ans = 100001
    distance[p] = d
    nextp = a[p]
    ans = min(ans, dfs(nextp, d + 1))
    return ans

print(dfs(1, 0))


Fixed submission:
n = int(input())
a = [int(input()) if(i) else 0 for i in range(n+1)]
distance = [None] * (n+1)
queue = [(1, 0)]
while(len(queue)):
    p, d = queue.pop()
    if(p==2):
        print(d)
        break
    if(distance[p]!=None or d==100001):
        print(-1)
        break
    distance[p] == d
    nextp = a[p]
    queue.append((nextp, d+1))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().spkit())
ans = "error" if(a + b >= 10) else a + b
print(ans)


Fixed submission:
a, b = map(int, input().split())
ans = "error" if(a + b >= 10) else a + b
print(ans)
Buggy python submission (verdict: Runtime Error):
from math import ceil
n, a, b = map(int, input().split())
h = [int(input()) for i in range(n)]

def enough(t):
    count = 0
    for hp in h:
        count += ceil(max(0, hp - b*t) / (a-b))
    if(count <= t):
        return True
    else:
        return False


high = ceil(max(h)/b)
low = 0
while(high - low > 1):
    mid = (high + low) // 2
    if(enough(mid)):
        high = mid
    else:
        low = mid
print(mid)


Fixed submission:
from math import ceil
n, a, b = map(int, input().split())
h = [int(input()) for i in range(n)]

def enough(t):
    count = 0
    for hp in h:
        count += ceil(max(0, hp - b*t) / (a-b))
    if(count <= t):
        return True
    else:
        return False


high = ceil(max(h)/b)
low = 0
while(high - low > 0):
    mid = (high + low) // 2
    if(enough(mid)):
        high = mid
    else:
        low = mid + 1
print(low)

Buggy python submission (verdict: Time Limit Exceeded):
from math import ceil
n, a, b = map(int, input().split())
h = [int(input()) for i in range(n)]

def enough(t):
    count = 0
    for hp in h:
        count += ceil(max(0, hp - b*t) / (a-b))
    if(count <= t):
        return True
    else:
        return False


high = ceil(max(h)/b)
low = 0
mid = ceil((high + low) / 2)
while(enough(mid)==enough(mid-1)):
    mid = (high + low) // 2
    if(enough(mid)):
        high = mid
    else:
        low = mid
print(mid)


Fixed submission:
from math import ceil
n, a, b = map(int, input().split())
h = [int(input()) for i in range(n)]

def enough(t):
    count = 0
    for hp in h:
        count += ceil(max(0, hp - b*t) / (a-b))
    if(count <= t):
        return True
    else:
        return False


high = ceil(max(h)/b)
low = 0
while(high - low > 0):
    mid = (high + low) // 2
    if(enough(mid)):
        high = mid
    else:
        low = mid + 1
print(low)
Buggy python submission (verdict: Runtime Error):
8 8
1 2
3 4
1 5
2 8
3 7
5 2
4 1
6 8

Fixed submission:
N, M = map(int, input().split())
adj_nums = [0 for i in range(N)]
for i in range(M):
    a, b = map(int, input().split())
    adj_nums[a-1] += 1
    adj_nums[b-1] += 1

for i in adj_nums:
    print(i)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
students = [list(map(int, input().split())) for i in range(N)]
checkpoints = [list(map(int, input().split())) for i in range(M)]

for s in students:
    min_distance = 2 * 10**8 + 1
    for i, c in enumerate(checkpoints):
        distance = abs(s[0] - c[0]) + abs(s[1]- c[1]) 
        if min_distance > distance:
            min_distance = distance
            point = i+1
    print(point)

Fixed submission:
N, M = map(int, input().split())
students = [list(map(int, input().split())) for i in range(N)]
checkpoints = [list(map(int, input().split())) for i in range(M)]

for s in students:
    min_distance = 4 * 10**8 + 1
    for i, c in enumerate(checkpoints):
        distance = abs(s[0] - c[0]) + abs(s[1] - c[1]) 
        if min_distance > distance:
            min_distance = distance
            point = i+1
    print(point)
Buggy python submission (verdict: Runtime Error):
def reduce (last, count, time):
    if last == 0:
        return time-1
    if last-time==0 or last-time > time:
        return reduce(last-time, count+1, time+1)
    else:
        return reduce(last, count, time+1)
        

if __name__ == '__main__':
    X = int(input())
    ret = reduce(X, 0, 1)
    print(ret)


Fixed submission:
N = int(input())

for t in range(10**5):
    if t*(t+1)/2 >= N:
        print(t)
        break
Buggy python submission (verdict: Runtime Error):
a, b, x = map(int, input().split())
print((b-a)//x+((a%x==0)or(b%x==0))

Fixed submission:
a, b, x = map(int, input().split())
print(b//x-(a-1)//x)
Buggy python submission (verdict: Runtime Error):
A1 = int(input())

A2 = int(input())

A3 = int(input())


s = A1 + A2 + A3

if s >= 22:

    print('bust')

else:

    print('win')


Fixed submission:
a1, a2, a3 = [int(x) for x in input().split()]

s = a1 + a2 + a3

if s >= 22:

    print('bust')

else:

    print('win')
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = str(input())
alp = 'abcdefghijklmnopqrstuvwxyz' * 2
ss = ''

for i in range(len(s)):

    ss += str(alp[alp.index(s[i])+n])

print(ss)


Fixed submission:
s = str(input())
  
if s == 'SAT':
  print('1')
  
elif s == 'FRI':
  print('2')
  
elif s == 'THU':
  print('3')
  
elif s == 'WED':
  print('4')

elif s == 'TUE':
  print('5')
  
elif s == 'MON':
  print('6')

else:
  print('7')

Buggy python submission (verdict: Runtime Error):
s = str(input('曜日を入力：'))
  
elif s == 'SAT':
  print('1')
  
elif s == 'FRI':
  print('2')
  
elif s == 'THU':
  print('3')
  
elif s == 'WED':
  print('4')

elif s == 'TUE':
  print('5')
  
elif s == 'MON':
  print('6')

else:
  print('7')

Fixed submission:
s = str(input())
  
if s == 'SAT':
  print('1')
  
elif s == 'FRI':
  print('2')
  
elif s == 'THU':
  print('3')
  
elif s == 'WED':
  print('4')

elif s == 'TUE':
  print('5')
  
elif s == 'MON':
  print('6')

else:
  print('7')
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = str(input())
alp = 'abcdefghijklmnopqrstuvwxyz' * 2
ss = ''

for i in range(len(s)):

    ss += str(alp[alp.index(s[i])+n])

print(ss)


Fixed submission:
n = int(input())
s = str(input())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'
ss = ''

for i in range(len(s)):

    ss += str(alp[alp.index(s[i])+n])

print(ss)

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = str(input())
alp = 'abcdefghijklmnopqrstuvwxyz' * 2
lst = []

for i in range(len(s)):

    lst.append(str(alp[alp.index(s[i])+n]))

print(''.join(lst))

Fixed submission:
n = int(input())
s = str(input())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'
ss = ''

for i in range(len(s)):

    ss += str(alp[alp.index(s[i])+n])

print(ss)

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = str(input())
alp = 'abcdefghijklmnopqrstuvwxyz' * 2
lst = []

for i in range(len(s)):

    lst.append(alp[alp.index(s[i])+n])

print(''.join(lst))

Fixed submission:
n = int(input())
s = str(input())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'
ss = ''

for i in range(len(s)):

    ss += str(alp[alp.index(s[i])+n])

print(ss)
Buggy python submission (verdict: Runtime Error):
n = int(input())

for i in range(9):

     if n%i == 0 and n//i < 10:
         print('Yes')
         break

else:
    print('No')

Fixed submission:
n = int(input())

for i in range(9):

     if n%(i+1) == 0 and n//(i+1) < 10:
         print('Yes')
         break

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

c = a - 2b

if c > 0:
  print(c)
  
else:
  print(0)

Fixed submission:
a, b = map(int, input().split())

c = a - 2 * b

print(c if c > 0 else 0)

Buggy python submission (verdict: Runtime Error):
a, b = map(int,input().split())

c = a - 2b

print(c if c > 0 else 0)

Fixed submission:
a, b = map(int, input().split())

c = a - 2 * b

print(c if c > 0 else 0)

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

c = a - 2b

print(c if c > 0 else 0)

Fixed submission:
a, b = map(int, input().split())

c = a - 2 * b

print(c if c > 0 else 0)
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n % 2 = 0:

    print(1 / 2)

else:

    print((n + 1) / 2n)

Fixed submission:
n = int(input())

if n % 2 == 0:

    print(1 / 2)

else:

    print((n + 1) / 2 / n)

Buggy python submission (verdict: Runtime Error):
n = int(input())

if n % 2 == 0:

    print(1 / 2)

else:

    print((n + 1) / 2n)

Fixed submission:
n = int(input())

if n % 2 == 0:

    print(1 / 2)

else:

    print((n + 1) / 2 / n)

Buggy python submission (verdict: Runtime Error):
n = int(input())

if n // 2 == 0:

    print(1 / 2)

else:

    print((n + 1) / 2n)

Fixed submission:
n = int(input())

if n % 2 == 0:

    print(1 / 2)

else:

    print((n + 1) / 2 / n)
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
h = list(int(input()).split())
tmp = 0

for i in range(n):

    if h[i] >= k:
        tmp += 1

print(tmp)

Fixed submission:
n, k = map(int, input().split())
h = list(map(int, input().split()))
tmp = 0

for i in range(n):

    if h[i] >= k:
        tmp += 1

print(tmp)
Buggy python submission (verdict: Runtime Error):
s = str(input())
odd = ['R', 'U', 'D]
even = ['L', 'U', 'D']
tmp = 0

for i in range(len(s)):

    if i%2!=0 and s[i] in odd:
       tmp += 1
    elif i%2==0 and s[i] in even:
        tmp += 1

print('Yes' if tmp==len(s) else 'No')

Fixed submission:
s = str(input())
odd = ['R', 'U', 'D']
even = ['L', 'U', 'D']
tmp = 0

for i in range(len(s)):
    if i%2==0 and s[i] in odd:
        tmp += 1
    elif i%2!=0 and s[i] in even:
        tmp += 1

print('Yes' if tmp==len(s) else 'No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
tmp = 0

for i in range(n-1):
    if a[i+1] == a[i]+1:
        tmp += c[a[i]-1]

print(sum(b)+tmp)

Fixed submission:
n = int(input())

print(n ** 3)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
tmp = 0

for i in range(n):
    if a[i+1] == a[i]+1:
        tmp += c[a[i]-1]

print(sum(b)+tmp)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

for i in range(n-1):
    if a[i+1] == a[i]+1:
        b.append(c[a[i]-1])

print(sum(b))
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if b==1:
    tmp = 0

else:
    tmp = 1

    while tmp*a-tmp+1 < b:
        tmp += 1

print(tmp)

Fixed submission:
s = str(input())
t = str(input())

if s[0] == t[0]:
    a = 1
else:
    a = 0

if s[1] == t[1]:
    b = 1
else:
    b = 0

if s[2] == t[2]:
    c = 1
else:
    c = 0

print(a + b + c)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if b==1:
    tmp = 0

else:
    tmp = 1

    while tmp*a-tmp+1 < b:
    tmp += 1

print(tmp)

Fixed submission:
a, b = map(int, input().split())

if b==1:
    tmp = 0

else:
    tmp = 1

    while tmp*a-tmp+1 < b:
        tmp += 1

print(tmp)
Buggy python submission (verdict: Runtime Error):
s = str(input())

if s[0] == s[1] and s[2] = s[3] and s[0] != s[2]:
    print('Yes')

elif s[0] == s[2] and s[1] == s[3] and s[0] != s[1]:
    print('Yes')

elif s[0] == s[3] and s[1] == s[2] and s[0] != s[1]:
    print('Yes')

else:
    print('No')

Fixed submission:
s = str(input())

if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
    print('Yes')

elif s[0] == s[2] and s[1] == s[3] and s[0] != s[1]:
    print('Yes')

elif s[0] == s[3] and s[1] == s[2] and s[0] != s[1]:
    print('Yes')

else:
    print('No')

Buggy python submission (verdict: Runtime Error):
s = str(input())

if s[0] == s[1] and s[2] = s[3] and s[0] =! s[2]:
    print('Yes')

elif s[0] == s[2] and s[1] == s[3] and s[0] =! s[1]:
    print('Yes')

elif s[0] == s[3] and s[1] == s[2] and s[0] =! s[1]:
    print('Yes')

else:
    print('No')

Fixed submission:
s = str(input())

if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
    print('Yes')

elif s[0] == s[2] and s[1] == s[3] and s[0] != s[1]:
    print('Yes')

elif s[0] == s[3] and s[1] == s[2] and s[0] != s[1]:
    print('Yes')

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

if a > 12:
    print(b)

eilf 5 < a < 13:
    print(b // 2)

else:
    print(0)

Fixed submission:
a, b = map(int, input().split())

if a > 12:
    print(b)

elif 5 < a < 13:
    print(b // 2)

else:
    print(0)