TnT/CodeNet4Repair huggingface dataset:
Problem:
Snuke has a grid consisting of three squares numbered 1, 2 and 3. In each square, either `0` or `1` is written. The number written in Square i is s_i.  Snuke will place a marble on each square that says `1`. Find the number of squares on which Snuke will place a marble.

Incorrect submission (verdict: Wrong Answer):
sample=input()
one_count=0
s=0
for i in sample:
  if sample[s] == "1":
    one_count+=1
    s+=1
  else:
    s+=1  
    
print("1が",one_count,"個含まれています")


Fixed, accepted submission:
sample=input()
one_count=0
s=0
for i in sample:
  if sample[s] == "1":
    one_count+=1
    s+=1
  else:
    s+=1  
    
print(one_count)
Problem:
We ask you to select some number of positive integers, and calculate the sum of them.  It is allowed to select as many integers as you like, and as large integers as you wish. You have to follow these, however: each selected integer needs to be a multiple of A, and you need to select at least one integer.  Your objective is to make the sum congruent to C modulo B. Determine whether this is possible.  If the objective is achievable, print `YES`. Otherwise, print `NO`.

Incorrect submission (verdict: Wrong Answer):
a, b, c = map(int, input().split())
if c%a==0:
    print("YES")
else:
    print("NO")

Fixed, accepted submission:
import sys
a, b, c = map(int, input().split())
for i in range(b):
    if (i*a)%b==c:
        print("YES")
        sys.exit()
print("NO")
Problem:
It is November 18 now in Japan. By the way, 11 and 18 are adjacent Lucas numbers.  You are given an integer N. Find the N-th Lucas number.  Here, the i-th Lucas number L_i is defined as follows:    * L_0=2   * L_1=1   * L_i=L_{i-1}+L_{i-2} (i≥2)

Incorrect submission (verdict: Wrong Answer):
num = list(map(int, input().split()))
a = [1,2]
for i in range(86):
 temp = a[i] + a[i+1]
 a.append(temp)

ans = int(num[0])
print(a[ans])

Fixed, accepted submission:
num = list(map(int, input().split()))
a = [2,1]
for i in range(86):
 temp = a[i] + a[i+1]
 a.append(temp)

ans = int(num[0])
print(a[ans])
Problem:
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.  See the Output section for the output format.

Incorrect submission (verdict: Wrong Answer):
N=int(input())

ac=0
wa=0
tle=0
re=0

for i in range(N):
  S=input()
  if S=='AC':
    ac+=1
  if S=='WA':
    wa+=1
  if S=='TLE':
    tle+=1
  if S=='RE':
    re+=1
  
#print(ac,wa,tle,re)
print('AC ×',ac)
print('WA ×',wa)
print('TLE ×',tle)
print('RE ×',re)

Fixed, accepted submission:
N=int(input())
ac=0
wa=0
tle=0
re=0
for i in range(N):
  S=input()
  if S=='AC':
    ac+=1
  if S=='WA':
    wa+=1
  if S=='TLE':
    tle+=1
  if S=='RE':
    re+=1


print('AC x {}\nWA x {}\nTLE x {}\nRE x {}'.format(ac,wa,tle,re))
Problem:
Write a program which performs a sequence of commands to a given string $str$. The command is one of:    * print a b: print from the a-th character to the b-th character of $str$   * reverse a b: reverse from the a-th character to the b-th character of $str$   * replace a b p: replace from the a-th character to the b-th character of $str$ with p  Note that the indices of $str$ start with 0.

Incorrect submission (verdict: Wrong Answer):
s = input()
for i in range(int(input())):
    cmd = input().split()
    a,b = map(int,[cmd[1],cmd[2]])
    if cmd[0] == 'reverse':
        s = s[:b] + s[a:b+1][::-1]+ s[b+1:]
    elif cmd[0] == 'replace':
        s = s[:b] + cmd[3] + s[b+1:]
    else:
        print(s[a:b+1])

Fixed, accepted submission:
s = input()
n = int(input())
for i in range(n):
    cmd = input().split()
    a,b = map(int,[cmd[1],cmd[2]])
    if cmd[0] == 'print':print(s[a:b+1])
    elif cmd[0] == 'reverse':s = s[:a] + s[a:b+1][::-1] + s[b+1:]
    elif cmd[0] == 'replace':s = s[:a] + cmd[3] + s[b+1:]
Problem:
In the beginning, Takahashi has A cookies, and Aoki has B cookies. They will perform the following operation alternately, starting from Takahashi:    * If the number of cookies in his hand is odd, eat one of those cookies; if the number is even, do nothing. Then, give one-half of the cookies in his hand to the other person.  Find the numbers of cookies Takahashi and Aoki respectively have after performing K operations in total.

Incorrect submission (verdict: Wrong Answer):
a,b,k = (int(x) for x in input().split())

cnt = 0

while cnt < k:
    if a % 2 !=0:
        a -= 1
    a = a/2
    b += a
    cnt += 1

    if b % 2 !=0:
        b -= 1
    b = b/2
    a += b
    cnt += 1

a = int(a)
b = int(b)
print(a,b,k)


Fixed, accepted submission:
A,B,K = (int(x) for x in input().split())

while K != 0:
    if A % 2 !=0:
        A -= 1
    A = A/2
    B += A
    K -= 1

    if K ==0:
        break
    if B % 2 !=0:
        B -= 1
    B = B/2
    A += B
    K -= 1

A = int(A)
B = int(B)
print(A,B)
Problem:
A balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.  Takahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.  Print `Left` if the balance scale tips to the left; print `Balanced` if it balances; print `Right` if it tips to the right.

Incorrect submission (verdict: Wrong Answer):
A, B, C, D = map(int, input().split())
print("Left" if A+B==C+D else "Balanced" if A+B==C+D else "Right")

Fixed, accepted submission:
A, B, C, D = map(int, input().split())
print("Left" if A+B>C+D else "Balanced" if A+B==C+D else "Right")
Problem:
Print all the integers that satisfies the following in ascending order:    * Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.

Incorrect submission (verdict: Wrong Answer):

a,b,k = map(int, input().split())
arr = []
arr.append(a)
arr.append(b)

for i in range(1,k):
    arr.append(a+i)
    arr.append(b-1)

arr = sorted(arr)
print(arr)




Fixed, accepted submission:

a,b,k = map(int, input().split())
for i in range(a, min(a+k,b+1)):
    print(i)
for i in range(max(a+k,b-k+1), b+1):
    print(i)
Problem:
Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.  The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)  Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?

Incorrect submission (verdict: Wrong Answer):
import sys

def main():
    x = int(input())
    i = 100
    n = 1
    cnt = 0
    
    while True:
        n += 0.01
        cnt += 1
        print(i*n)
        if(i*n>x-1):
            print(cnt)            
            break
            sys.exit()

    
if __name__ == "__main__":
    main()


Fixed, accepted submission:
import math
import sys

def main():
    x = int(input())
    ai = 100
    y=1
    n = 0
    
    for i in range(x):
        ai = math.floor(ai*1.01)
        n += 1
        if(ai>x-1):
            print(n)            
            break
            sys.exit()
    
if __name__ == "__main__":
    main()
Problem:
There is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.  You and Lunlun the dachshund alternately perform the following operation (starting from you):    * Choose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.  The one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?

Incorrect submission (verdict: Wrong Answer):
print("fsiercsotn d"[(sum([int(input())for i in range(int(input()))])-1)%2::2])

Fixed, accepted submission:
print("sfeicrosntd"[sum([int(input())%2 for i in range(int(input()))])>0::2])
Problem:
We have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.  At first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:    * Choose a (connected) rope with a total length of at least L, then untie one of its knots.  Is it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.

Incorrect submission (verdict: Wrong Answer):
n,l = map(int,input().split())
a = list(map(int,input().split()))

for i in range(n-1):
    if a[i]+a[i+1] >= l:
        print("Possible")
        for j in range(1,i+1):
            print(j)
        for k in range(i,n-1):
            print(k+1)
        exit()
print("Impossible")  

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

for i in range(n-1):
    if a[i]+a[i+1] >= l:
        print("Possible")
        for j in range(1,i+1):
            print(j)
        for k in range(n-1,i,-1):
            print(k)
        exit()
print("Impossible")
Problem:
N persons are standing in a row. The height of the i-th person from the front is A_i.  We want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:  Condition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.  Find the minimum total height of the stools needed to meet this goal.

Incorrect submission (verdict: Wrong Answer):

n=int(input())
l=list(map(int,input().split()))

x = 0
for a in range(n-1):
    if l[a]>l[a+1] :
        x=l[a] - l[a+1] + x
        l[a+1]=l[a]
    print("l[a],x,l[a+1]=", l[a], x, l[a+1])
print(x)


Fixed, accepted submission:

n=int(input())
l=list(map(int,input().split()))

x = 0
for a in range(n-1):
    if l[a]>l[a+1] :
        x=l[a] - l[a+1] + x
        l[a+1]=l[a]
    #print("l[a],x,l[a+1]=", l[a], x, l[a+1])
print(x)
Problem:
Sitting in a station waiting room, Joisino is gazing at her train ticket.  The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).  In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds.  The given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.

Incorrect submission (verdict: Wrong Answer):

if __name__=="__main__":
    n = input()
    s = list(n)
    a = int(s[0])
    b = int(s[1])
    c = int(s[2])
    d = int(s[3])

    if a-b-c>=7:
        print(s[0]+"-"+s[1]+"-"+s[2]+"-"+s[3]+"=7")
    elif a-b+c>=7:
        print(s[0] + "-" + s[1] + "+" + s[2] + "-" + s[3] + "=7")
    elif a-b+c<7:
        print(s[0] + "-" + s[1] + "+" + s[2] + "+" + s[3] + "=7")
    elif a-b-c<7:
        print(s[0] + "-" + s[1] + "-" + s[2] + "+" + s[3] + "=7")
    elif a+b-c>=7:
        print(s[0]+"+"+s[1]+"-"+s[2]+"-"+s[3]+"=7")
    elif a+b+c>=7:
        print(s[0] + "+" + s[1] + "+" + s[2] + "-" + s[3] + "=7")
    elif a+b+c<7:
        print(s[0] + "+" + s[1] + "+" + s[2] + "+" + s[3] + "=7")
    elif a+b-c<7:
        print(s[0] + "+" + s[1] + "-" + s[2] + "+" + s[3] + "=7")

Fixed, accepted submission:
if __name__=="__main__":
    n = input()
    s = list(n)
    a = int(s[0])
    b = int(s[1])
    c = int(s[2])
    d = int(s[3])

    if a+b+c+d==7:
        print(s[0]+"+"+s[1]+"+"+s[2]+"+"+s[3]+"=7")
    elif a-b-c-d==7:
        print(s[0] + "-" + s[1] + "-" + s[2] + "-" + s[3] + "=7")
    elif a-b+c+d==7:
        print(s[0] + "-" + s[1] + "+" + s[2] + "+" + s[3] + "=7")
    elif a-b-c+d==7:
        print(s[0] + "-" + s[1] + "-" + s[2] + "+" + s[3] + "=7")
    elif a+b-c-d==7:
        print(s[0]+"+"+s[1]+"-"+s[2]+"-"+s[3]+"=7")
    elif a+b+c-d==7:
        print(s[0] + "+" + s[1] + "+" + s[2] + "-" + s[3] + "=7")
    elif a+b-c+d==7:
        print(s[0] + "+" + s[1] + "-" + s[2] + "+" + s[3] + "=7")
    elif a-b+c-d==7:
        print(s[0] + "-" + s[1] + "+" + s[2] + "-" + s[3] + "=7")
Problem:
Today is August 24, one of the five Product Days in a year.  A date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):    * d_1 \geq 2   * d_{10} \geq 2   * d_1 \times d_{10} = m  Takahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.  In Takahashi Calendar, how many Product Days does a year have?

Incorrect submission (verdict: Wrong Answer):
M, D =  map(int, input().split())
count = 0
for d in range(D - 1):
    d += 2
    d1 = int(d/10)
    d2 = d - d1 * 10
    if d1 * d2 <= M and d1 > 1 and d2 > 1:
        print(d1, d2)
        count += 1
print(count)

Fixed, accepted submission:
M, D =  map(int, input().split())
count = 0
for d in range(D - 1):
    d += 2
    d1 = int(d/10)
    d2 = d - d1 * 10
    if d1 * d2 <= M and d1 > 1 and d2 > 1:
        count += 1
print(count)
Problem:
We call a 4-digit integer with three or more consecutive same digits, such as 1118, **good**.  You are given a 4-digit integer N. Answer the question: Is N **good**?

Incorrect submission (verdict: Wrong Answer):
n = input()
n_list = []
for i in n:
    n_list.append(i)
print(n_list)
if n_list[1]==n_list[2]==n_list[0]:
    print("Yes")
elif n_list[2]==n_list[3]==n_list[1]:
    print("Yes")
elif n_list[0]==n_list[1]==n_list[2]==n_list[3]:
    print("Yes")
else:
    print("No")


Fixed, accepted submission:
n = input()
n_list = []
for i in n:
    n_list.append(i)
if n_list[1]==n_list[2]==n_list[0]:
    print("Yes")
elif n_list[2]==n_list[3]==n_list[1]:
    print("Yes")
elif n_list[0]==n_list[1]==n_list[2]==n_list[3]:
    print("Yes")
else:
    print("No")
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
print(n%1000)

Fixed, accepted submission:
n = int(input())
if n%1000 == 0:
    print(n%1000)
else:
    print(1000-n%1000)
Problem:
It is September 9 in Japan now.  You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?

Incorrect submission (verdict: Wrong Answer):
c = input()
if c in "9":
  print("Yes")
else:
  print("No")

Fixed, accepted submission:
c = input()
if "9" in c:
  print("Yes")
else:
  print("No")
Problem:
An _X -layered kagami mochi_ (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.  Lunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?

Incorrect submission (verdict: Wrong Answer):
allrunrun = int(input())
moti = [int(i) for i in input().split()]

tyouhuku = set(moti)

print(len(tyouhuku))

Fixed, accepted submission:
allrunrun = int(input())
moti = [int(input()) for i in range(allrunrun)]
tyouhuku = set(moti)
print(len(tyouhuku))
Problem:
We have N pieces of ropes, numbered 1 through N. The length of piece i is a_i.  At first, for each i (1≤i≤N-1), piece i and piece i+1 are tied at the ends, forming one long rope with N-1 knots. Snuke will try to untie all of the knots by performing the following operation repeatedly:    * Choose a (connected) rope with a total length of at least L, then untie one of its knots.  Is it possible to untie all of the N-1 knots by properly applying this operation? If the answer is positive, find one possible order to untie the knots.

Incorrect submission (verdict: Wrong Answer):
N,L = list(map(int,input().split()))
a = list(map(int,input().split()))
a.append(0)
b = []
res = "Impossible"

for i in range(N):
    if L <= (a[i]+a[i+1]):
        count = i
        res = "Possible"
        break

if res =="Possible":
    for j in range(count):
        b.append(a[j])
    for k in range(count,N)[::-1]:
        b.append(a[k])
    
    print(res)
    for l in range(len(b)):
        print(b[l])
else:
    print(res)



Fixed, accepted submission:
N,L = list(map(int,input().split()))
a = list(map(int,input().split()))
a.append(0)
b = []
res = "Impossible"

for i in range(N):
    if L <= (a[i]+a[i+1]):
        count = i
        res = "Possible"
        break

if res =="Possible":
    for j in range(count):
        b.append(j+1)
    for k in range(count+1,N)[::-1]:
        b.append(k)
    
    print(res)
    for l in range(len(b)):
        print(b[l])
else:
    print(res)
Problem:
On a two-dimensional plane, there are N red points and N blue points. The coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).  A red point and a blue point can form a _friendly pair_ when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.  At most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
red = [list(map(int, input().split())) for i in range(n)]
blue = [list(map(int, input().split())) for i in range(n)]
red.sort()
blue.sort()
ans = 0
for i in range(n):
    if red[i][0] > blue[0][0] and red[i][1] > blue[0][1]:
        ans += 1
        del blue[0]
print(ans)

Fixed, accepted submission:
n = int(input())
red = [list(map(int, input().split())) for i in range(n)]
blue = [list(map(int, input().split())) for i in range(n)]
red = sorted(red, key = lambda x: x[1])
blue.sort()
ans = 0
for i in range(n):
    a = 0
    for j in range(len(red)):
        if blue[i][0] > red[j][0] and blue[i][1] > red[j][1]:
            a = j
    if blue[i][0] > red[a][0] and blue[i][1] > red[a][1]:
        ans += 1
        del red[a]
print(ans)
Problem:
AtCoDeer the deer is going on a trip in a two-dimensional plane. In his plan, he will depart from point (0, 0) at time 0, then for each i between 1 and N (inclusive), he will visit point (x_i,y_i) at time t_i.  If AtCoDeer is at point (x, y) at time t, he can be at one of the following points at time t+1: (x+1,y), (x-1,y), (x,y+1) and (x,y-1). Note that **he cannot stay at his place**. Determine whether he can carry out his plan.

Incorrect submission (verdict: Wrong Answer):
n = int(input())

points = []
for i in range(n):
    points.append([i for i in map(int, input().split())])

can = True
for i in range(len(points)-1):
    move_n = points[i+1][0] - points[i][0]
    dist = abs(points[i+1][1] - points[i][1]) + abs(points[i+1][2] - points[i][2])
    if move_n < dist or dist % 2 != move_n % 2:
        can = False 
        break

if can:
    print('YES')
else:
    print('NO')

Fixed, accepted submission:
n = int(input())
points = []
points.append([0, 0, 0])
can = True
for i in range(n):
    points.append([i for i in map(int, input().split())])
    move_n = points[i+1][0] - points[i][0]
    dist = abs(points[i+1][1] - points[i][1]) + abs(points[i+1][2] - points[i][2])
    if move_n < dist or dist % 2 != move_n % 2:
        can = False 
        break
# print(points)
# can = True

#     move_n = points[i+1][0] - points[i][0]
#     dist = abs(points[i+1][1] - points[i][1]) + abs(points[i+1][2] - points[i][2])
#     if move_n < dist or dist % 2 != move_n % 2:
#         can = False 
#         break

if can:
    print('Yes')
else:
    print('No')
Problem:
There are a total of A + B cats and dogs. Among them, A are known to be cats, but the remaining B are not known to be either cats or dogs.  Determine if it is possible that there are exactly X cats among these A + B animals.

Incorrect submission (verdict: Wrong Answer):
a, b, x = map(int, input().split())

if a > x:
    print('NO')
elif a + b >= x:
    print('Yes')
elif a + b < x:
    print('No')

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

if a > x:
    print('NO')
elif a + b >= x:
    print('YES')
elif a + b < x:
    print('NO')
Problem:
You are given an integer sequence of length n, a_1, ..., a_n. Let us consider performing the following n operations on an empty sequence b.  The i-th operation is as follows:    1. Append a_i to the end of b.   2. Reverse the order of the elements in b.  Find the sequence b obtained after these n operations.

Incorrect submission (verdict: Wrong Answer):
n = int(input())
a = input().split()

if n % 2 == 0:
    b = a[::-2] + a[::2]
else:
    b = a[::-2] + a[1::2]

print(''.join(b))

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

if n % 2 == 0:
    b = a[::-2] + a[::2]
else:
    b = a[::-2] + a[1::2]

print(' '.join(b))
Problem:
Two students of AtCoder Kindergarten are fighting over candy packs.  There are three candy packs, each of which contains a, b, and c candies, respectively.  Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.  Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Incorrect submission (verdict: Wrong Answer):
a, b, c = map(int, input().split())

if a+b-c==0 or b+c-a==0 or c+a-c==0:
  print('Yes')
else:
  print('No')

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

if a+b-c==0 or b+c-a==0 or c+a-b==0:
  print('Yes')
else:
  print('No')
Problem:
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, you can implement, for example, loops.  Note that use of goto statement is highly discouraged, because it is difficult to trace the control flow of a program which includes goto.  Write a program which does precisely the same thing as the following program (this example is wrtten in C++). Let's try to write the program without goto statements.                 void call(int n){   int i = 1;  CHECK_NUM:   int x = i;   if ( x % 3 == 0 ){     cout << " " << i;     goto END_CHECK_NUM;   }  INCLUDE3:   if ( x % 10 == 3 ){     cout << " " << i;     goto END_CHECK_NUM;   }   x /= 10;   if ( x ) goto INCLUDE3;  END_CHECK_NUM:   if ( ++i <= n ) goto CHECK_NUM;    cout << endl; }

Incorrect submission (verdict: Wrong Answer):
n=int(input())
c=1
while c <=n:
  if c%3==0:
    print(c)
  elif c%10==3:
    print(c)
  c +=1


Fixed, accepted submission:
n=int(input())
d=[]
for i in range(1,n+1):
    if i%3==0 or "3" in str(i):
        d.append(i)
print(" ",end="")
print(*d)
Problem:
Takahashi has a deposit of 100 yen (the currency of Japan) in AtCoder Bank.  The bank pays an annual interest rate of 1 % compounded annually. (A fraction of less than one yen is discarded.)  Assuming that nothing other than the interest affects Takahashi's balance, in how many years does the balance reach X yen or above for the first time?

Incorrect submission (verdict: Wrong Answer):
X = int(input())
start = 100
i = 0
while True:
  i += 1
  start += start * 0.01
  start = int(start)
  if start > X:
    print(i)
    break

Fixed, accepted submission:
X = int(input())
start = 100
i = 0
while True:
  i += 1
  start += start * 0.01
  start = int(start)
  if start >= X:
    print(i)
    break