Buggy python submission (verdict: Runtime Error):
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*(x+1)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Runtime Error):
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*(x+1)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[i+f] else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Time Limit Exceeded):
import queue
x=int(input())
avail=list(range(100,106))
q=queue.Queue()
for i in avail:
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and i+f not in avail):
            avail.append(i+f)
            q.put(i+f)
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Time Limit Exceeded):
import queue
x=int(input())
avail=list(range(100,106))
q=queue.Queue()
for i in avail:
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and i+f not in avail):
            avail.append(i+f)
            q.put(i+f)
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Time Limit Exceeded):
import queue
x=int(input())
avail=list(range(100,106))+[0]*x
q=queue.Queue()
for i in avail:
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and i+f not in avail):
            avail.append(i+f)
            q.put(i+f)
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Time Limit Exceeded):
import queue
x=int(input())
avail=list(range(100,106))
q=queue.Queue()
ok=[False]*max(x+1,106)
for i in avail:
    q.put(i)
    ok[i]=True
while not q.empty():
    f=q.get()
    for i in avail:
        if(i+f<=x and not ok[i+f]):
            avail.append(i+f)
            q.put(i+f)
            ok[i+f]=True
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Runtime Error):
import queue
x=int(input())
avail=list(range(100,106))
q=queue.Queue()
ok=[False]*(x+1)
for i in avail:
    q.put(i)
    ok[i]=True
while not q.empty():
    f=q.get()
    for i in avail:
        if(i+f<=x and not ok[i+f]):
            avail.append(i+f)
            q.put(i+f)
            ok[i+f]=True
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)

Buggy python submission (verdict: Time Limit Exceeded):
import queue
x=int(input())
q=queue.Queue()
avail=list(range(100,106))
for i in avail:
    q.put(i)
while not q.empty():
    f=q.get()
    for i in avail:
        if(i+f<=x and i+f not in avail):
            avail.append(i+f)
            q.put(i+f)
print(1 if x in avail else 0)

Fixed submission:
import queue
x=int(input())
avail=list(range(100,106))
ok=[False]*max(x+1,106)
q=queue.Queue()
for i in avail:
    ok[i]=True
    q.put(i)
while not q.empty():
    f=q.get()
    for i in range(100,106):
        if(i+f<=x and not ok[i+f]):
            ok[i+f]=True
            q.put(i+f)
print(1 if ok[x] else 0)