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

Fixed submission:
r,D,x2000 = map(int, input().split())
def algae(x2000):
    #for i in range(10):
        ans = r * x2000 - D
        #new_ans = algae(r, D, ans)
        
        return ans
      
next_value = algae(x2000)
for i in range(10):
    print(next_value)
    next_value = algae(next_value)

Buggy submission (verdict: Runtime Error):
r,D,x2000 = map(int, input().split())
next_value = algae(x2000)
for i in range(10):
    #next_value = algae(x2000)
    print(next_value)
    next_value = algae(next_value)
Problem p03075 (python)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())

if abs(e -a ) <= k:
    print("Yay!")
else:
    print(":(")

Buggy submission (verdict: Runtime Error):
#include<iostream>
#include<string>
#include<map>
#include<algorithm>
#include<vector>

using namespace std;

int main(){
    int a, b, c, d, e;
    int k;
    scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e);
    scanf("%d", &k);

    string ans;
    int L = e - a ;
    if (L > k) ans  = "Yay!";
    else ans = ":("

    printf("%d\n", ans)
}
Problem p02596 (python)

Fixed submission:
from sys import stdin
K = int(stdin.readline().rstrip())
def main(K):
  a=0
  for i in range(1,K+1):
    a = ((10%K) * a + 7)%K
    if a == 0:
      return i
  return -1
print(main(K))

Buggy submission (verdict: Runtime Error):
from sys import stdin

K = int(stdin.readline().rstrip())
if K % 2 = 0:
  print(-1)
a_n = 7
i = 1
while True:
  if a_n < K:
    print(-1)
    break
  if a_n % K == 0:
    print(i)
    break
  else:
    i += 1
    a_n = a_n * 10 + 7
Problem p02598 (python)

Fixed submission:
from sys import stdin
from math import floor,ceil

N, K = map(int, input().rstrip().split())
A = [int(x) for x in stdin.readline().rstrip().split()]

def is_max_len_less_than_input(x,K,A):
  count = 0
  if x==0:
    return False
  for ln in A:
    count += ceil(ln/x)-1
    if count > K:
      return False
  return True

def binary_search(begin,end,K,A):
  while abs(end-begin)>1:
    mid = (begin+end)//2
    if is_max_len_less_than_input(mid,K,A):
      end = mid
    else:
      begin = mid
  return end

print(binary_search(0,max(A),K,A))

Buggy submission (verdict: Runtime Error):
from sys import stdin

N, K = map(int, input().rstrip().split())
A = [int(x) for x in stdin.readline().rstrip().split()]

def is_max_len_less_than_input(x,K,A):
  count = 0
  for ln in A:
    count += int(ln/x)
    if count > K:
      return False
  return True

def binary_search(begin,end,K,A):
  while abs(end-begin)>1:
    mid = int((begin+end)/2)
    if is_max_len_less_than_input(mid,K,A):
      end = mid
    else:
      begin = mid
  return mid

print(binary_search(−1,max(A),K,A)+1)
# 最小値は1 => 0除算を回避

Buggy submission (verdict: Runtime Error):
from sys import stdin

N, K = map(int, input().rstrip().split())
A = [int(x) for x in stdin.readline().rstrip().split()]

def is_max_len_less_than_input(x,K,A):
  count = 0
  for ln in A:
    count += int(ln/x)
    if count > K:
      return False
  return True

def binary_search(begin,end,K,A):
  while abs(end-begin)>1:
    mid = int((begin+end)/2+1)
    if is_max_len_less_than_input(mid,K,A):
      end = mid
    else:
      begin = mid
  return mid

print(binary_search(1,max(A),K,A))
# 最小値は1 => 0除算を回避

Buggy submission (verdict: Runtime Error):
from sys import stdin

N, K = map(int, input().rstrip().split())
A = [int(x) for x in stdin.readline().rstrip().split()]

def is_max_len_less_than_input(x,K,A):
  count = 0
  for ln in A:
    count += int(ln/x)
    if count > K:
      return False
  return True

def binary_search(begin,end,K,A):
  while abs(end-begin)>1:
    mid = int((begin+end)/2)
    if is_max_len_less_than_input(mid,K,A):
      end = mid
    else:
      begin = mid
  return mid

print(binary_search(1,max(A),K,A))
Problem p02723 (python)

Fixed submission:
inputs = str(input())
lists = []
lists.append(inputs)
if inputs[2] == inputs[3] and inputs[4] == inputs[5]:
      print('Yes')
else:
      print('No')

Buggy submission (verdict: Runtime Error):
a=int(input())
b= a // 500
bc= a % 500
abc = bc // 5
happy= b * 1000 + abc * 5
print(happy)

Buggy submission (verdict: Runtime Error):
b=int(input())
if b>=500:
      overall=b*2
      print(overall)
elif b<=499 and b>0:
      print(b)
elif b<=0:
      print(0)
Problem p02550 (python)

Fixed submission:
n,x,m = map(int,input().split())

A = [x]
where = {x: 0}
a = x
for i in range(1, n):
    a = A[-1]**2 % m
    if a in where:
        break
    where[a] = i
    A.append(a)

perstart = where[a]
res = sum(A)
rem = n - len(A)
per = len(A) - perstart
res += rem//per*sum(A[perstart:perstart+per])
res += sum(A[perstart:perstart + (rem%per)])

print(res)

Buggy submission (verdict: Runtime Error):
n,x,m = map(int,input().split())

A = [x]
where = {x: 0}
for i in range(1, n):
    a = A[-1]**2 % m
    if a in where:
        break
    where[a] = i
    A.append(a)

perstart = where[a]
res = sum(A)
rem = n - len(A)
per = len(A) - perstart
res += rem//per*sum(A[perstart:perstart+per])
res += sum(A[perstart:perstart + (rem%per)])

print(res)
Problem p02792 (python)

Fixed submission:
def g(n):
    D = [[0]*10 for i in range(10)]
    for i in range(1,n+1):
        si = str(i)
        D[int(si[0])][int(si[-1])] += 1

    res = 0
    for i in range(10):
        for j in range(10):
            res += D[i][j]*D[j][i]
    return res
print(g(int(input())))

Buggy submission (verdict: Runtime Error):
def g(n):
    D = [[0]*10 for i in range(10)]
    for i in range(1,n+1):
        si = str(i)
        D[int(si[0])][int(si[-1])] += 1

    res = 0
    for i in range(10):
        for j in range(10):
            res += D[i][j]*D[j][i]
    return res
print(g(int(n)))
Problem p02570 (python)

Fixed submission:
d, t, s = input().split(" ")
 
if int(s) * int(t) < int(d):
  print('No')
else:
  print('Yes')

Buggy submission (verdict: Runtime Error):
n = input()
a_list = input().split(" ")

b = [int(a) for a in a_list]
max = 10**9 + 7

sum = 0
for i in range(0, len(b)-1):
  for j in range(i+1, len(b)):
    sum += b[i] * b[j]
    sum = sum % max
print(sum)

Buggy submission (verdict: Runtime Error):
import sys

d = sys.argv[1]
t = sys.argv[2]
s = sys.argv[3]

if s * t < d:
  return 'No'
else:
  return 'Yes'
Problem p02571 (python)

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

s_l = len(s)
t_l = len(t)

max_count = 0
for i in range(0, s_l - t_l + 1):
  count = 0
  for j in range(0, t_l):
    if s[i+j] == t[j]:
      count += 1
  if count > max_count:
    max_count = count

diff = t_l - max_count
print(diff)

Buggy submission (verdict: Runtime Error):
s, t = input().split("\n")

s_l = len(s)
t_l = len(t)

max_count = 0
for i in range(0, s_l - t_l):
  count = 0
  for j in range(0, t_l):
    if s[i+j] == t[j]:
      count += 1
  if count > max_count:
    max_count = count

diff = t_l - max_count
print(diff)
Problem p02572 (python)

Fixed submission:
n = input()
 
max = 10**9 + 7
 
a_list = [int(a) % max for a in input().split(" ")]
a_sum = sum(a_list)

total = 0
for i in range(0, len(a_list)-1):
    a_sum -= a_list[i]
    total += a_list[i] * a_sum
total = total % max
print(total)

Buggy submission (verdict: Runtime Error):
n = input()
 
max = 10**9 + 7
 
a_list = [int(a) % max for a in input().split(" ")]

total = 0
for i in range(0, len(a_list)-1):
    print(a_list[i], a_list[i+1:])
    total += a_list[i] * sum(a_list[i+1:])
total = total % max
print(total)

Buggy submission (verdict: Runtime Error):
n = input()
 
max = 10**9 + 7
 
a_list = [int(a) % max for a in input().split(" ")]

print(sum(a_list))
total = 0
for i in range(0, len(a_list)-1):
    print(a_list[i], a_list[i+1:])
    total += a_list[i] * sum(a_list[i+1:])
total = total % max
print(total)

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

max = 10**9 + 7

a_list = [int(a) % max for a in input().split(" ")]

sum = 0
for i in range(0, len(a_list)-1):
    sum += a_list[i] * sum(a_list[i+1:])
sum = sum % max
print(sum)

Buggy submission (verdict: Runtime Error):
n = input()
a_list = input().split(" ")

b = [int(a) for a in a_list]
max = 10**9 + 7

sum = 0
for i in range(0, len(b)-2):
  for j in range(i+1, len(b)-1):
    sum += b[i] * b[j]
    while sum => max:
      sum -= max
print(sum)
Problem p02595 (python)

Fixed submission:
n, d = map(int, input().split())
ans = 0
for i in range(n):
    x, y = map(int, input().split())
    if x ** 2 + y ** 2 <= d ** 2:
        ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
n, d = map(int, input().split())
ans = 0
for i in range(n):
    x, y = map(int, input().split())
    if x ** 2 + y ** 2 <= d ** 2
print(ans)
Problem p02623 (python)

Fixed submission:
#172C
#Tsundoku

N,M,K=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

a,b=[0],[0]

for i in range(N):
    a.append(a[i]+A[i])
for j in range(M):
    b.append(b[j]+B[j])

ans=0
j=M

for i in range(N+1):
    if a[i]>K:
        break
    while a[i]+b[j]>K:
        j-=1
    ans=max(ans,i+j)
print(ans)

Buggy submission (verdict: Runtime Error):
#172C

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

if K>=sum(A)+sum(B):
    print(N+M)
    exit()
elif K<min(A[0],B[0]):
    print(0)
    exit()
else:
    for i in range(N):
        sum_a=sum(A[:i+1])
        a=A
        b=B
        m=0
        while K>sum_a+b[0] and len(b)>=1:
            sum_a+=b[0]
            b.pop(0)
            m+=1
        if i+1+m>ans:
            ans=i+1+m
print(ans)
Problem p02629 (python)

Fixed submission:
#171C
##One Quadrillion and One Dalmatians

n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z')+1)]
ans=''
while n>0:
    n-=1
    ans=alpha[n%26]+ans
    n//=26
print(ans)

Buggy submission (verdict: Runtime Error):
n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z'))]
ans=''
while n>0:
    n-=1
    ans=alpha[n%26]+ans
    n//=26
print(ans)

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# coding: utf-8

# In[ ]:


#171C
##One Quadrillion and One Dalmatians

n=int(input())
alpha=[chr(i) for i in range(ord('a'),ord('z'))]
ans=''
while n>0:
    n-=1
    ans=alpha[n%26]+ans
    n//=26
print(ans)
Problem p02659 (python)

Fixed submission:
a,b=map(int,input().replace('.','').split())
print(a*b//100)

Buggy submission (verdict: Runtime Error):
a,b=map(int,input().split())
print(a*b//100)
Problem p02682 (python)

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

if(A - K < 0):
    if(A + B - K < 0):
        print(2 * A - K + B)
    else:
        print(A)
else:
    print(K)

Buggy submission (verdict: Runtime Error):
A,B,C,K = map(int, input().split())

if(A - K < 0):
    if(A + B - K < 0):
        print(2 * A - K + B))
    else:
        print(A)
else:
    print(K)
Problem p02860 (python)

Fixed submission:
N = int(input())
S = input()
if(N % 2 == 1):
    print("No")
    exit()
m = N//2
for i in range(m):
    if(S[i] != S[i+m]):
        print("No")
        exit()
print("Yes")

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
if(N % 2 == 1):
    print("No")
    exit()
for i in range(N//2):
    if(S[i] != S[i+3]):
        print("No")
        exit()
print("Yes")
Problem p02577 (python)

Fixed submission:
def main():
    z = input()
    x = int(z)

    if x%9==0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    z = input()
    x = int(z)

    sum = 0
    while x > 0.5:
        y = int(x % 10)
        sum = int(sum + y)
        x = int(x / 10)

    if int(sum%9)==0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

def main():
    z = input()
    x = int(z)

    sum = 0
    while x > 0.9:
        y = int(x % 10)
        sum = int(sum + y)
        x = int(x / 10)

    if int(sum%9)==0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

def main():
    z = input()
    x = int(z)

    sum = 0
    while x > 0.9:
        y = int(x % 10)
        sum = sum + y
        x = int(x / 10)

    if sum%9==0:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()
Problem p02622 (python)

Fixed submission:
s=input()
t=input()
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
s,t=input().split()
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans+=1
print(ans)

Buggy submission (verdict: Runtime Error):
s,t=input().split()
ans=0
for i in range(len(s)):
  if s[i]!=t[i]:
    ans+=1
print(ans)
Problem p02659 (python)

Fixed submission:
import math
a,b=input().split()
b=b[0]+b[2:]
print(int(a)*int(b)//100)

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

Fixed submission:
A,B,C,K=map(int,input().split())
ans=0
sub=K
if A>K:
    ans+=1*K
    sub-=K
else:
    ans+=1*A
    sub-=A
if sub!=0:
    if B>sub:
        sub=0
    else:
        sub-=B
if sub!=0:
    ans-=sub
print(ans)

Buggy submission (verdict: Runtime Error):
!/usr/bin/env python3
import sys


def solve(A: int, B: int, C: int, K: int):
    ans=0
    sub=K
    if A>K:
        ans+=1*K
        sub-=K
    else:
        ans+=1*A
        sub-=A
    if sub!=0:
        if B>sub:
            sub=0
        else:
            sub-=B
    if sub!=0:
        ans-=sub
    print(ans)

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(A, B, C, K)

if __name__ == '__main__':
    main()
Problem p02707 (python)

Fixed submission:
import collections as c
n=int(input())
a=list(map(int,input().split()))
b=c.Counter(a)
for i in range(1,n+1):
    print(b[i])

Buggy submission (verdict: Runtime Error):
import collections as c
n=int(input())
a=list(map(int,input().split()))
b=c.Counter(a)
for i in range(1,N+1):
    print(b[i])
Problem p02725 (python)

Fixed submission:
k,n=map(int,input().split())
a=list(map(int,input().split()))
a.append(a[0]+k)
al=[a[i+1]-a[i] for i in range(n)]
print(k-max(al))

Buggy submission (verdict: Runtime Error):
k,n=map(int,input().split())
a=list(map(int,input().split())
a.append(a[0]+k)
al=[a[i+1]-a[i] for i in range(n)]
print(k-max(al))
Problem p02753 (python)

Fixed submission:
s=input()
print("Yes" if "A" in s and "B" in s else "No")

Buggy submission (verdict: Runtime Error):
print("Yes" if "A" in input() and "B" in input() else "No"

Buggy submission (verdict: Runtime Error):
print("YES" if "A" in input() and "B" in input() else "NO")
Problem p02819 (python)

Fixed submission:
x=int(input())
p=x**0.5
while any(x%i==0 for i in range(2,int(p)+1)):
  x+=1
else:
  print(x)

Buggy submission (verdict: Runtime Error):
x=int(input())
p=x**0.5
while any(X%i==0 for i in range(2,x//1+1)):
  x+=1
else:
  print(x)

Buggy submission (verdict: Runtime Error):
from sympy import nextprime
import math
x=int(input())
for k in range(2, int(math.sqrt(x)) + 1):
    if x % k == 0:
        print(nextprime(x))
        exit()
print(x)

Buggy submission (verdict: Runtime Error):
from sympy import nextprime
x=int(input())
import math
if x < 2:
    print(nextprime(x))
else:
    if x == 2:
        print(x)
    else:
        if x % 2 == 0:
            print(nextprime(x))
        else:
            m = math.floor(x / 2) + 1
            for p in range(3, m, 2):
                if x % p == 0:
                    print(nextprime(x))
            print(x)
Problem p02915 (python)

Fixed submission:
n=int(input())
print(pow(n,3))

Buggy submission (verdict: Runtime Error):
a=input()
b=a[0]
c=a[1]
d=a[2]
e=a[3]
print("SAME" if b==c==d==e else "DIFFERENT" )
Problem p02951 (python)

Fixed submission:
a,b,c=map(int,input().split())
print(max(c-(a-b),0))

Buggy submission (verdict: Runtime Error):
n=int(input())
h=list(map(int,input().split()))
h[0]=h[0]-1
for i in range(1,n):
    try:
        if h[i]-1>=h[i+1]:
            h[i]=h[i]-1
    except IndexError:
        pass
for i in range(n):
    try:
        if h[i]>h[i+1]:
                print("No")
                exit()
    except IndexError:
        pass
print("Yes")
Problem p03315 (python)

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

Buggy submission (verdict: Runtime Error):
s=int(input())
ans=0
for i in range(4):
  if s[i]=="+":
    ans+=1
  else:
    ans-=1
print(ans)
Problem p03834 (python)

Fixed submission:
a,b,c=input().split(",")
print(a,b,c)

Buggy submission (verdict: Runtime Error):
k,s=map(int,input().split())
ans=0
for x in range(k+1):
    for y in range(k+1):
        if 0<=s-x-y<=k:
            ans+=1
print(ans)
Problem p02577 (python)

Fixed submission:
from sys import stdin, stdout
t = int(stdin.readline())
if t % 9 == 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
num = input()
if num % 9 == 0:
  print("yes")
else:
  print("no")
Problem p03013 (python)

Fixed submission:
mod = 10**9 + 7
N, M = map(int, input().split())


a = [True] * (N+1)
for _ in range(M):
    a[int(input())] = False


dp = [0] * (N+1)
dp[0] = 1
for i in range(N+1):
    for j in range(1, 3):
        if (i+j) > N or a[i+j] == False:
            continue
        dp[i+j] += dp[i]
        dp[i+j] %= mod

print(dp[N])

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


a = [True] * (N)
for _ in range(M):
    a[int(input())-1] = False


mod = 10**9 + 7
dp = [0] * (N)
dp[0] = (1 if a[0] else 0)
dp[1] = (1 if a[1] else 0) + dp[0]
for i in range(2, N):
    if a[i]:
        dp[i] = (dp[i-1] + dp[i-2]) % mod

print(dp[N-1])
Problem p02689 (python)

Fixed submission:
N , M = map(int,input().split())
 
H = list(map(int,input().split()))
 
A = [0]*M
B = [0]*M
for i in range(M):
  A[i] ,B[i] = map(int,input().split())
 
 
S=[1]*N
 
 
for m in range(M):
  if H[A[m]-1] == H[B[m]-1]:
    S[A[m]-1] = 0
    S[B[m]-1] = 0
  elif H[A[m]-1] <= H[B[m]-1]:
    S[A[m]-1] = 0
  elif H[A[m]-1] >= H[B[m]-1]:
    S[B[m]-1] = 0
 
 
print(sum(S))

Buggy submission (verdict: Runtime Error):
N , M = map(int,input().split())
 
H = list(map(int,input().split()))
 
A = [0]*M
B = [0]*M
for i in range(M):
  A[i] ,B[i] = map(int,input().split())
 

S=[1]*N

 
for m in range(M)
  if H[A[m]-1] == H[B[m]-1]:
    S[A[m]-1] = 0
    S[B[m]-1] = 0
  elif H[A[m]-1] <= H[B[m]-1]:
    S[A[m]-1] = 0
  elif H[A[m]-1] >= H[B[m]-1]
    S[B[m]-1] = 0

 
print(sum(S))

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

H = list(map(int,input().split()))

A = [0]*M
B = [0]*M
for i in range(M):
  A[i] ,B[i] = map(int,input().split())


count = 0

for i in range(1,N+1):
  flag = 0
  for m in range(M):
    if i == A[m] and H[i-1]<= H[B[m]-1]:
      print('a'+A[i]+','+B[i])
      print(H[i-1]+','+H[B[m]-1])
      flag = 1
      continue
    elif i == B[m] and H[i-1]<=H[A[m]-1]:
      print('b'+A[i]+','+B[i])
      print(H[i-1]+','+H[B[m]-1])
      flag = 1
      continue
     
  if not flag:
    print(i)
    count += 1

print(count)
Problem p02819 (python)

Fixed submission:
X = int(input()) 

while(1):
  if X == 2:
    break
  for i in range(2,X):
    if X%i == 0:
      X += 1
      break
  if i == X-1:
      break

print(X)

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

while(1):
  for i in range(2,X):
    if X%i == 0:
      X += 1
      break
  if i == X-1:
      break

print(X)

Buggy submission (verdict: Runtime Error):
X = input()

while(1):
  for i in range(2,X):
    if X%i == 0:
      X += 1
      break
    if i == X-1:
      break

print(X)
Problem p02572 (python)

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

su = sum(a)
sus = 0

for i in a:
    su = su - i
    sus = sus + i * su

print(sus % (10**9 + 7))

Buggy submission (verdict: Runtime Error):
sus = 0

for i in a:
    su = su - i
    sus = sus + i * su

"""comb = len(a) * (len(a) - 1) / 2
comb = int(comb)

sum = 0
la = len(a)

for i in range(comb):
    #print(a)
    for j in range(1, la):
        #print(a[i])
        sum = sum + a[0] * a[i]
    a = a[1:]
    la = la - 1
    #print(a)"""

print(sus % (10**9 + 7))
Problem p02627 (python)

Fixed submission:
alpha = input()
if alpha.islower():
    print('a')
else:
    print('A')

Buggy submission (verdict: Runtime Error):
a = input()
　 print('A' if a.islower() else 'a')

Buggy submission (verdict: Runtime Error):
a = input()
2 print('A' if a.islower() else 'a')
Problem p02676 (python)

Fixed submission:
K = int(input())
S = input()
if len(S) > K:
    print(S[:K]+'...')
else:
    print(S)

Buggy submission (verdict: Runtime Error):
K = int(input())
S = input()
if len(S) > K:
    print(s[:k]+'...')
else:
    print(S)
Problem p02699 (python)

Fixed submission:
S,W = map(int,input().split())
if(S<=W):
    print('unsafe')
else:
    print('safe')

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = int(input())
D = int(input())
while (A>0 and C>0):
    C = C - B
    if C <= 0:
        break
    A = A - D
print("Yes" if C<=0 else "NO")
Problem p02771 (python)

Fixed submission:
A = map(int,input().split())
if len(set(A)) == 2:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
if a == b and a !=c:
    print("Yes")
elif a == c and a !=b:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
if a == b and a !=c:
    print("Yes")
elif a == c and a !=b:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
if a == b and a !=c:
    print("Yes")
elif a == c and a !=b:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
if a == b and a !=c:
    print("Yes")
elif a == c and a !=b:
    print("Yes")
else:
    print("No")
Problem p02546 (python)

Fixed submission:
s = input()
if s[len(s)-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Buggy submission (verdict: Runtime Error):
s = input()
if s[s.length-1] == 's':
    print(s+'es')
else:
    print(s+'s')
Problem p02847 (python)

Fixed submission:
S = input()

if S == "SUN":
    print(7)

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)

Buggy submission (verdict: Runtime Error):
S = input()

if S = "SUN":
    print(7)

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)
Problem p02570 (python)

Fixed submission:
input_data = list(map(int, input().strip().split()))
if (input_data[0] / input_data[2] <= input_data[1]):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
print("前提条件を入力して下さい")
D = int(input("高橋くんの家から待ち合わせ場所までの距離D[m]を入力して下さい"))
T = int(input("待ち合わせの時刻までの時間[min]を入力した下さい"))
S = int(input("高橋くんの移動する速さ[m/min]を入力して下さい"))
# input_data = [D, T, S]
# print(input_data)
if (D / S <= T):
    print("Yes")
else:
    print("No")
Problem p02594 (python)

Fixed submission:
a = int(input())
if(a >= 30):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
a = int(input())
if(a > = 30):
  print("Yes")
else:
  print("No")