Problem:


Score: 300 points

Problem Statement

AtCoder Mart sells 1000000 of each of the six items below:

Riceballs, priced at 100 yen (the currency of Japan) each

Sandwiches, priced at 101 yen each

Cookies, priced at 102 yen each

Cakes, priced at 103 yen each

Candies, priced at 104 yen each

Computers, priced at 105 yen each

Takahashi wants to buy some of them that cost exactly X yen in total.
Determine whether this is possible.

(Ignore consumption tax.)

Constraints

1 \leq X \leq 100000

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

If it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.

Sample Input 1

615

Sample Output 1

1

For example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.

Sample Input 2

217

Sample Output 2

0

No set of items costs 217 yen in total.



Sample input:
615


Sample output:
1

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(1, 1000001):
	if i*100 <= n:
		k = i*100
		c = i
		if k+i*101  <= n:
			k = k+i*101
			c = i
			if k + i*102 <= n:
				k = k + i*102
				c = i
				if i*103 <= n:
					k = k + i*103
					c = i
					if k + i*104 <= n:
						k = k + i*104
						c = i
						if k + i*105 <= n:
							k = k + i*105
							c = i
						else:
							c = i
							break
					else:
						c = i
						break
				else:
					c = i
					break
			else:
				c = i
				break
		else:
			c = i
			break
	else:
		break
try:
	if c > 0:
		print('1')
except:
	print('0')

Submission status: Wrong Answer

Solution code:
X = input()

simo2 = X[-2:]
ue = X[:-2]

if int(X) < 100:
    print('0')
    exit()

if int(simo2)//5 + 1 <= int(ue):
    print('1')
else:
    print('0')

Submission status: Wrong Answer

Solution code:
n  = int(input())
x = n // 100
result = 0
if n % 100 < 5 * x and x < 1000000:
  result = 1
print(result)

Submission status: Wrong Answer

Solution code:
import sys
x = int(input())
n = x // 100
if n > 99:
	print(1)
	sys.exit()
if 105* n < x:
	print(0)
	sys.exit()
for i in range(n//3):
	for j in range(n//3):
		for k in range(n//3):
			for l in range(n//3):
				for m in range(n//3):
					if n == i+2*j+3*k+4*l+5*m:
						print(1)
						sys.exit()
print(0)

Submission status: Wrong Answer

Solution code:
import sys
x=(input())
if int(x) < 100:
    print(0)
else:
    n=int(x[:-2])
    t=int(x[-2]+x[-1])
    if n > 10:
        n = 10
    ans = 0
    p = 0
    for i in range(0,n+1):#0
        for j in range(0,n+1):#1
            for k in range(0,n+1):#2
                for l in range(0,n+1):#3
                    for m in range(0,n+1):#4
                        for o in range(0,n+1):#5
                            ans = i*0+j*1+k*2+l*3+m*4+o*5
                            if ans == t:
                                print(1)
                                sys.exit()

    print(0)

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(1, 100001):
	if i*100 <= n:
		k = i*100
		c = i
		if k+i*101  <= n:
			k = k+i*101
			c = i
			if k + i*102 <= n:
				k = k + i*102
				c = i
				if i*103 <= n:
					k = k + i*103
					c = i
					if k + i*104 <= n:
						k = k + i*104
						c = i
						if k + i*105 <= n:
							k = k + i*105
							c = i
						else:
							c = i
							break
					else:
						c = i
						break
				else:
					c = i
					break
			else:
				c = i
				break
		else:
			c = i
			break
	else:
		break
try:
	if c > 0:
		print('1')
except:
	print('0')

Submission status: Wrong Answer

Solution code:
n = int(input())
left = n//100
n = n%100
packet = 5*(n//15)+n%15
if packet<=left:
	print(1)
else:
	print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
A = (X%100)//10 #下2桁目
B = X%10 #下一桁目
count = X//100 #回数
if B>5:
    C = 2
else:
    C = 1
if X>99 and count>= (A*2)+C:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
MOD = 10**9 + 7

x = INT()
up = x//100
down = x%100

count5 = down//5

if count5+1 <= up:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())

flag = 0
n = X // 100
left = X - 100*n


if left == 0:
    print(1)


else:   
    for i_2 in range(n):
        num = 0
        num += 5*i_2

        for i_3 in range(n):
            num += 4*i_3

            for i_4 in range(n):
                num += 3*i_4

                for i_5 in range(n):
                    num += 2*i_5

                    for i_6 in range(n):
                        num += 1*i_6

                        if num == left:
                            flag = 1
                            break


    print(1 if flag == 1 else 0)

Submission status: Wrong Answer

Solution code:
def main():
    X = int(input())

    X_div_100 = X // 100
    res_X_div_100 = X % 100

    count = 0

    while True:
        if res_X_div_100 >= 5:
            res_X_div_100 -= 5
            count += 1
        elif res_X_div_100 >= 4:
            res_X_div_100 -= 4
            count += 1
        elif res_X_div_100 >= 3:
            res_X_div_100 -= 3
            count += 1
        elif res_X_div_100 >= 2:
            res_X_div_100 -= 2
            count += 1
        elif res_X_div_100 >= 1:
            res_X_div_100 -= 1
            count += 1
        else:
            break

    if count < X_div_100:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x=int(input())
buy=[0]*10**6
buy[0]=1
def write(n):
  if buy[n-105] or buy[n-104] or buy[n-103] or buy[n-102] or buy[n-101] or buy[n-100]:
    buy[n]=1
for i in range(10**5):
  write(i)
print(buy[x])

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n // 100
b = n % 100

if b >= a * 5:
    print(0)
else:
    print(1)

Submission status: Wrong Answer

Solution code:
x = int(input())
x1 = x//100
x2 = x - x1*100
n = 0
#print(x1)
#print(x2)

n = x2//5

#print(n)
if n+x2-5*n < x1:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
amount = 10 ** 6
x = int(input())
cnt = 0
can_buy = 0

xx = x % 100
for i in range(xx + 1):
    for j in range(xx//2 + 1):
        for k in range(xx // 3 + 1):
            for l in range(xx // 4 + 1):
                for m in range(xx // 5 + 1):
                    if i + 2 * j + 3 * k + 4 * l + 5 * m == xx:
                        rest = x - 101 * i - 102 * j - 103 * k - 104 * l - 105 * m
                        cnt = i + j + k + l + m + rest // 100
                        if rest >= 100 and cnt <= amount:
                            can_buy = 1
                            break

print(can_buy)

Submission status: Wrong Answer

Solution code:
N = int(input())

coin_num = N // 100
X = N % 100

for i in range(coin_num):
  for j in range(coin_num):
    for k in range(coin_num):
      for l in range(coin_num):
        for m in range(coin_num):
          total = 1*i + 2*j + 3*k + 4*l + 5*m
          if total == X:
            print(1)
            exit()
            
print(0)

Submission status: Wrong Answer

Solution code:
n  = int(input())
x = n // 100
result = 0
if n % 100 < 5 * x :
  result = 1
print(result)

Submission status: Wrong Answer

Solution code:
def count(S, m, n): 
    table = [0 for k in range(n+1)] 
  
    table[0] = 1
    for i in range(0,m): 
        for j in range(S[i],n+1): 
            table[j] += table[j-S[i]] 
  
    return table[n] 
  
def main():
    X = int(input())
    S = [100, 101, 102, 103, 104, 105, 106] 
                 
    if count(S, 7, X):
        print(1)
    else:
        print(0)
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from fractions import gcd
# from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
import sys
from bisect import *
import itertools
import copy
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7


def main():
    x = int(input())
    c = x //100
    v = x % 100
    #print(c, v)
    if v <= c * 6 and v >= c:
        print(1)
    else:
        print(0)



    


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
x=(input())
if int(x) < 100:
    print(0)
else:
    n=int(x[:-2])
    t=int(x[-2]+x[-1])
    if n > 10:
        n = 10
    ans = 0
    p = 0
    for i in range(0,n+1):#0
        for j in range(1,n+1+1):#1
            for k in range(0,n+1):#2
                for l in range(0,n+1):#3
                    for m in range(0,n+1):#4
                        for o in range(0,n+1):#5
                            ans = i*0+j*1+k*2+l*3+m*4+o*5
                            if ans == t:
                                print(1)
                                sys.exit()

    print(0)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

X = int(input())

if X % 100 == 0:
    print(1)
    exit()

l = len(str(X))
if l > 3:
    X = X - 10**(l-1)


arr = list(range(101, 106)) + list(range(201, 211)) + list(range(301, 316)) + list(range(401, 421)) + list(range(501, 526)) + \
    list(range(601, 631)) + list(range(701, 736)) + \
    list(range(801, 841)) + list(range(801, 841)) + list(range(901, 946))


if X in arr:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())

x = X % 100
n = X // 100

if n > 0:
    while x >= 5 and n != 0:
        x = x - 5
        n = n - 1

    while x >= 4 and n != 0:
        x = x - 4
        n = n - 1

    while x >= 3 and n != 0:
        x = x - 5
        n = n - 1

    while x >= 2 and n != 0:
        x = x - 5
        n = n - 1

    while x >= 1 and n != 0:
        x = x - 5
        n = n - 1

    while x == 0 and n != 0:
        n = n - 1
    
    if n == 0 and x == 0:
        print("1")
    else:
        print("0")


else:
    print("0")

Submission status: Wrong Answer

Solution code:
import sys
import itertools

input = sys.stdin.readline
X = int(input())
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

maxtimes = int(X/100)+2
price = 0
for i1 in range(0, maxtimes):
    if i1*100 > X:
        break
    for i2 in range(0, maxtimes):
        if i1*100+i2*101 > X:
            break
        for i3 in range(0, maxtimes):
            if i1*100+i2*101+i3*102 > X:
                break
            for i4 in range(0, maxtimes):
                if i1*100+i2*101+i3*102+i4*103 > X:
                    break
                for i5 in range(0, maxtimes):
                    if i1*100+i2*101+i3*102+i4*104 > X:
                        break
                    for i6 in range(0, maxtimes):
                        price = i1*100+i2*101+i3*102+i4*103+i5*104+i6*105
                        #print(i1, i2, i3, i4, i5, i6)
                        if price == X:
                            print(1)
                            exit()
                        elif price > X:
                            break

print(0)

Submission status: Wrong Answer

Solution code:
from itertools import permutations
a=input().strip()
while(len(a)==0):
  a=input().strip()
a=int(a)
k=0
lis=list(range(100,106))
perm=permutations(lis)
for i in list(perm):
  for j in i:
    k+=j
    if(k==a):
      print(1)
      exit()
  k=0
print(0)

Submission status: Wrong Answer

Solution code:
x = int(input())
dic = {0: 100, 1:101, 2:102, 3:103, 4:104, 5:105}
n = x // 100
for i1 in range(n+1):
  for i2 in range(n+1-i1):
    for i3 in range(n+1-i1-i2):
      for i4 in range(n+1-i1-i2-i3):
        for i5 in range(n+1-i1-i2-i3-i4):
          for i6 in range(n+1-i1-i2-i3-i4-i5):
            if 100*i1+101*i2+102*i3+103*i4+104*i5+106*i6 == x:
              print(1)
              exit()
print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
X_MOD = X % 100
X_DIV = X // 100

def dfs(sum_x, cnt_x, num):
    if sum_x == X_MOD:
        return True
    if cnt_x == X_DIV:
        return False
    if num > 105:
        return False
    
    return dfs(sum_x+num, cnt_x+1, num) or dfs(sum_x+num+1, cnt_x+1, num+1)
    

ans = int(dfs(0,0,0))
print(ans)

Submission status: Wrong Answer

Solution code:
from itertools import combinations_with_replacement

X = int(input())

if X < 100:
    print(0)
    exit()

if X % 100 == 0:
    print(1)
    exit()

cnt = X // 100
zan = X % 100

for c in combinations_with_replacement([1,2,3,4,5], cnt):
    if sum(c) == zan:
        print(1)
        exit()
print(0)

Submission status: Wrong Answer

Solution code:
import sys
x = int(input())


number = int(x/100)
x = x-number*100
number = number+1

for i in range(0,number):
    for j in range(0,number):
        for k in  range (0,number):
            for l in range(0,number):
                for m in range(0,number):
                    for n in range(0,number):
                        if j*1+k*2+l*3+m*4+n*5==x:
                            print(1)
                            sys.exit()
print(0)

Submission status: Wrong Answer

Solution code:
import itertools
l = [0, 1,2,3,4,5,6,7]
X = int(input())

flag = False
d = X//100
if (X - 100*d) <= 7*d:
  for c  in itertools.combinations_with_replacement(l, d):
    if sum(c) == X - 100*d:
      print(1)
      flag = True
      break

if not flag:
  print(0)

Submission status: Wrong Answer

Solution code:
def count(S, m, n): 
    table = [0 for k in range(n+1)] 
  
    table[0] = 1
    for i in range(0,m): 
        for j in range(S[i],n+1): 
            table[j] += table[j-S[i]] 
  
    return table[n] 
  
def main():
    X = int(input())
    S = [101, 102, 103, 104, 105, 106] 
                 
    if count(S, 6, X):
        print(1)
    else:
        print(0)
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
l=[100,101,102,103,104,105]
m=[0,0,0,0,0,0]
x=int(input())
check=0
while x>=100:
    a=x%100
    v=a%5
    x-=l[v]
    if v==0 and a==0:
        m[0]+=x//100
        x=0
        break
    elif v==0:
        m[5]+=1
        x-=l[5]
    else:
        m[v]+=1
        x-=l[v]
if x==0 and max(m)<=1000000:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
X = int(input())

n = X // 101
a = 101 * n
b = 105 * n

if a <= X <= b:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
import math

x = int(input())

for i in range(1,1000):
  if 100 <= x // i <= 105:
    print('1')
    exit()
print('0')

Submission status: Wrong Answer

Solution code:
x=int(input())
a=x//100
b=x%100
ans=0
if b//5 < a:
    for i in range(a+1):
        for j in range(a+1-i):
            for k in range(a+1-i-j):
                for l in range(a+1-i-j-k):
                    for m in range(a+1-i-j-k-l):
                        if 5*i+4*j+3*k+2*l+m==b:
                            ans=1
                            break
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

if 1 <= x < 100 or x == 10000:
    print(0)
    exit(0)
if 10000 < x:
    t = str(x)
    x = int(t[-4:])

n = int(x/100)

if n*100 <= x < n*100+n*5:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
x=int(input())
buy=[0]*10**6
buy[0]=1
def write(n):
  if buy[n-105] or buy[n-104] or buy[n-103] or buy[n-102] or buy[n-101] or buy[n-100]:
    buy[n]=1
for i in range(5*10**4):
  write(i)
print(buy[x])

Submission status: Wrong Answer

Solution code:
def main():
    X = int(input())

    X_div_100 = X // 100
    res_X_div_100 = X % 100

    count = 0

    while True:
        if res_X_div_100 > 5:
            res_X_div_100 = res_X_div_100 - 5
            count += 1
        elif res_X_div_100 > 4:
            res_X_div_100 = res_X_div_100 - 4
            count += 1
        elif res_X_div_100 > 3:
            res_X_div_100 = res_X_div_100 - 3
            count += 1
        elif res_X_div_100 > 2:
            res_X_div_100 = res_X_div_100 - 2
            count += 1
        elif res_X_div_100 > 1:
            res_X_div_100 = res_X_div_100 - 1
            count += 1
        else:
            break

    if count < X_div_100:
        print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
X = int(input())

flag = 0
n = X // 100
left = X - 100*n


if left == 0:
    print(1)


else:   
    for i_2 in range(n):
        num = 0
        num += 1*i_2

        for i_3 in range(n):
            num += 2*i_3

            for i_4 in range(n):
                num += 3*i_4

                for i_5 in range(n):
                    num += 104*i_5

                    for i_6 in range(n):
                        num += 5*i_6

                        if num == left:
                            flag = 1
                            break


    print(1 if flag == 1 else 0)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n//100>=20:
  print(1)
else:
  x=n//100
  s=n-x*100
  if s>=x*5:
    print(0)
  else:
    print(1)

Submission status: Wrong Answer

Solution code:
n = int(input())
arr=[100,101,102,103,104,105,201,202,203,204,205,206,209,303,312,406,414,510,515,615]
if n in arr:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
a = 0
n = x//100
for i in range(n):
  a = x - n*100
if a <= 5*n:
  ans = 1
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
a = 0
i = 0
while a <= x:
  a += 100
  i += 1
y = x - 100*(a-1)
if y <= (i-1)*a:
  print("1")
else:
  print("0")

Submission status: Wrong Answer

Solution code:
def solve():
    X = int(input())
    
    if X < 100:
        return 0
    
    upper1 = X // 100
    for i in range(upper1 + 1):
        rest = X - 100 * i
        if rest == 0:
            return 1
        upper2 = rest // 101
        for j in range(upper2 + 1):
            rest -= 101 * j
            if rest == 0:
                return 1
            upper3 = rest // 102
            for k in range(upper3 + 1):
                rest -= 102 * k
                if rest == 0:
                    return 1
                upper4 = rest // 103
                for l in range(upper4 + 1):
                    rest -= 103 * l
                    if rest == 0:
                        return 1
                    upper5 = rest // 104
                    for m in range(upper5 + 1):
                        rest -= 104 * m
                        if rest == 0:
                            return 1
                        upper6 = rest // 105
                        for n in range(upper6 + 1):
                            rest -= 105 * n
                            if rest == 0:
                                return 1
    else:
        return 0

print(solve())

Submission status: Wrong Answer

Solution code:
X=int(input())

if X%102<=3*X//102:
    print(1)
elif 102-X%102<=2*(X//102+1):
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
x=int(input())
s=x//100
a=x%100
if a//5+(0 if a%5 else 1)<=s:print(1)
else:print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
print(1 if X % 105 == 0 or X % 100 == 0 or X // 105 + 1 == X // 100 else 0)

Submission status: Wrong Answer

Solution code:
X=int(input())
a=100
b=105
for n in range (0,21):
    if n*b<X<(n+1)*a:
        print("0")
    else:
        n+=1
else:
    print("1")

Submission status: Wrong Answer

Solution code:
import sys
X = int(input())
if X < 100:
    print("0")
else:
    for i in range(1, 10**3+10):
        if 0 <= X - 100*i <= 5*i:
            print("1")
            sys.exit()
print("0")

Submission status: Wrong Answer

Solution code:
def count(S, m, n ): 
    if (n == 0): 
        return 1
    if (n < 0): 
        return 0; 
    if (m <=0 and n >= 1): 
        return 0
    return count( S, m - 1, n ) + count( S, m, n-S[m-1] ); 
  
def main():
    X = int(input())
    S = [101, 102, 103, 104, 105, 106] 
                 
    if count(S, 6, X):
        print(1)
    else:
        print(0)
    
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n = int(input())
for i in range(1, 100001):
	if i*100 + i*101 + i*102 + i*103 + i*104 + i*105 == n:
		c = i
		break
	elif i*615 > n:
		break
try:
	if c > 0:
		print('1')
except:
	print('0')

Submission status: Wrong Answer

Solution code:
# your code goes here
x=int(input())
ans=list(str(x))
a=int(ans[len(ans)-2]+ans[len(ans)-1])
if 5*(x//100)>=a:
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
Xs = input()
X = int(Xs)
X_ = int(Xs[-2:])
if X < 100:
  print("0")
  exit()
if X_ == 0 or X_ == 1 or X_ == 2 or X_ == 3 or X_ == 4 or X_ == 5:
  print("1")
  exit()
count = 0
count += X_ // 5
X_ = X_ %  5
count += X_ //4
X_=X_%4
count += X_ //3
X_=X_%3
count += X_ //2
X_=X_%2
count += X_ //1
X_=X_%1
if X - (count * 100) >= 100 and str(X - (count * 100))[-2:] == "00":
  print("1")
else:
  print("0")
if em: sys.stdin = open('/dev/tty')

Submission status: Wrong Answer

Solution code:
import itertools
l = [1,2,3,4,5,6,7]
X = int(input())

flag = False
d = X//100
if (X - 100*d) <= 7*d and (X - 100*d) >= 1*d:
  for c  in itertools.combinations_with_replacement(l, d):
    if sum(c) == X - 100*d:
      print(1)
      flag = True
      break

if not flag:
  print(0)

Submission status: Wrong Answer

Solution code:
x=int(input())
if x//100>=20:print(1);exit()
s=x//100;a=x%100
if a//5+(0 if a%5 else 1)<=s:print(1)
else:print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
able = []
for i in range(100,105+1):
    able.append(i)
for i in range(200,210+1):
    able.append(i)
for i in range(300,315+1):
    able.append(i)
for i in range(400,420+1):
    able.append(i)
for i in range(500,525+1):
    able.append(i)
for i in range(600,630+1):
    able.append(i)
if X >= 630:
    print(1)
    exit()
elif X in able:
        print(1)
        exit()
print(0)

Submission status: Wrong Answer

Solution code:
import sys
X = int(input())
if X < 100:
    print(0)
else:
    for i in range(1, 10**3+10):
        if 0 <= X - 100*i <= 5*i:
            print(1)
            sys.exit()
print(0)

Submission status: Wrong Answer

Solution code:
import math

X = int(input())
max_ko = math.floor(X/100)
min_ko = math.floor(X/105)+1

for kosu in range(min_ko, max_ko+1):
    big_val = 100*kosu
    max_small_val = 5*kosu
    mokuhyou = X - big_val
    if(mokuhyou >= 0 and mokuhyou <= max_small_val):
        print(1)
        exit()
print(0)

Submission status: Wrong Answer

Solution code:
import sys

x = input()
X = int(x)

if X < 100:
	print(0)
	sys.exit()
elif X >= 100 and X <= 105:
	print(1)
	sys.exit()

x1 = int(x[:-2])
x2 = int(x[-2:])

c = int(x2 // 5) + 1

if x1 >= c:
	print(1)
else:
	print(0)

Submission status: Wrong Answer

Solution code:
X = input().rjust(6,"0")

k = 0
shimo2 = int(X[-2] + X[-1])

for i in range(20):
    if 5*(i+1)<shimo2:
        k = i+2
        continue
    else:
        break
if k <= int(X[0:4]):
    print("1")
else:
    print("0")

Submission status: Wrong Answer

Solution code:
from math import ceil
N = int(input())
if N == 0:
    print(1)
    exit()
elif N < 100:
    print(0)
    exit()
t, s = str(N)[:-2], str(N)[-2:]
# print(t, s)
if int(t) > ceil(int(s)/5):
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
items = range(100, 106)


def cal(x):
    if x == 0:
        print(1)
        exit()

    for i in items:
        if x >= i:
            cal(x-i)


cal(X%1000)
print(0)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
args = sys.argv
if len(args) == 2:
  from IPython import embed
  em = True
else:
  em = False
input = sys.stdin.readline
Xs = input()
X = int(Xs)
X_ = int(Xs[-2:])
if X < 100:
  print("0")
  exit()
if X_ == 0 or X_ == 1 or X_ == 2 or X_ == 3 or X_ == 4 or X_ == 5:
  print("1")
  exit()
count = 0
count += X_ // 5
X_ = X_ %  5
count += X_ //4
X_=X_%4
count += X_ //3
X_=X_%3
count += X_ //2
X_=X_%2
count += X_ //1
X_=X_%1
if str(X - (count * 100))[-2:] == "00":
  print("1")
else:
  print("0")
if em: sys.stdin = open('/dev/tty')

Submission status: Wrong Answer

Solution code:
n=int(input())
a=n//100
b=n%100
if(a*5>b):
  print(1)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
import collections
import itertools as it
import math
import numpy as np

# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()

X = int(input())
nshina = X // 100
kingaku = X - nshina * 100
# print(kingaku)

is_exist = False
for i0 in range(nshina):
    for i1 in range(nshina - i0):
        for i2 in range(nshina - i0 - i1):
            for i3 in range(nshina - i0 - i1 - i2):
                for i4 in range(nshina - i0 - i1 - i2 - i3):
                    # print(nshina, i0, i1, i2, i3, i4, (nshina - i4 - i3 - i2 - i1 - i0))
                    # print(i1 + i2 * 2 + i3 * 3 + i4 * 4 + (nshina-i4-i3-i2-i1-i0) * 5)
                    if i1 + i2 * 2 + i3 * 3 + i4 * 4 + (nshina-i4-i3-i2-i1-i0) * 5 == kingaku:
                        print(1)
                        exit()

print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
nolist=[]
for i in range(20):
    n = (i+1)*100
    m = n + (i+1)*5
    for l in range(n,m+1):
        nolist.append(l)
if X in nolist:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
price=[100,101,102,103,104,105]
done = [[-1] * (X + 1) for _ in range(7)]
def dp(i, j):
    if i == 6:
        res = 0
    elif done[i][j] >= 0:
        res=done[i][j]
    elif j < price[i]:
        res=dp(i + 1, j)
    else:
        res=max(dp(i+1,j),dp(i+1,j-price[i])+price[i])
    done[i][j]=res
    return res
if dp(0, X) == X:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
def main():
    X = int(input())
    item = (100, 101, 102, 103, 104, 105)
    n = len(item)
    for bit in range(1 << n):  # 2**n
        cur = 0
        for j in range(n):
            if (bit & (1 << j)):
                cur += item[j]
        if cur == X:
            return print(1)
    else:
        print(0)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
x = int(input())
if x < 100:
    print(0)
else:
    n = x // 100
    k = x % 100
    t = k // 5
    if t > n:
        print(0)
    else:
        print(1)

Submission status: Wrong Answer

Solution code:
n = int(input())
m = n%100

l = int(m/5)
k = int(n/100)

if l+1 <= k:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X=int(input())
value = [100,101,102,103,104,105]
m = 1000000
if X < 100:
    print(0)
else:
    dp = [-1]*100001
    dp[0] = 0
    for i in range(5):
        for j in range(X+1):
            if dp[j] >= 0:
                dp[j] = m
            elif j < value[i] or dp[j-value[i]] <=0:
                dp[j] = -1
            else:
                dp[j] = dp[j - value[i]] -1
    if dp[X] >=0:
        print(1)
    else:
        print(0)

Submission status: Wrong Answer

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = 1e9+7

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def main():
    x = int(input())
    if x<100:
        print(0)
    buy = x//100
    sur = x%100
    num = (sur+4)//5
    if num<=buy:
        print(1)
    else:
        print(0)
    return

if __name__=='__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 0
a = 0
for i in range(x//100):
  a = x - x//100*100
if a < 5*x//100:
  ans = 1
print(ans)

Submission status: Wrong Answer

Solution code:
# coding:utf-8
import math
X = int(input())
c = 0
x2 = X%100
for i in range(100000):
  x = 0
  if x2/5 > 1 :
    x = math.floor(x2/5)
    x2 -= 5*x
  elif x2 % 4 > 1 :
    x = math.floor(x2/4)
    x2 -= 4*x
  elif x2 % 3 > 1 :
    x = math.floor(x2/3)
    x2 -= 3*x
  elif x2 % 2 > 1 :
    x = math.floor(x2/2)
    x2 -= 2*x
  elif x2 % 1 > 1 :
    x = math.floor(x2/1)
    x2 -= 1*x
  c += x
  if x2 == 0:
    break

if X > c*100:
  print("1")
else :
  print("0")

Submission status: Wrong Answer

Solution code:
p = int(input())
n = p%100
m = p//100
flag = 0
while n!=0:
  if n>=5:
    n-=5
    flag+=1
  elif n>=4:
    n-=4
    flag+=1
  elif n>=3:
    n-=3
    flag+=1
  elif n>=2:
    n-=2
    flag+=1
  elif n>=1:
    n-=1
    flag+=1
if flag>=m:
  print(1)
else:
  print(0)

Submission status: Wrong Answer

Solution code:
def c_100_to_105():
    X = int(input())

    for item in (105, 104, 103, 102, 101):
        while X >= 0:
            X -= item
            if X % 100 == 0:
                return 1
        X += item
    return 0

print(c_100_to_105())

Submission status: Wrong Answer

Solution code:
from math import ceil
N = int(input())
if N < 100:
    print(0)
    exit()
t, s = str(N)[:-2], str(N)[-2:]
# print(t, s)
if int(t) > ceil(int(s)/5):
    print(1)
else:
    print(0)

Submission status: Wrong Answer

Solution code:
X = int(input())
able = []
for i in range(100,105+1):
    able.append(i)
for i in range(200,210+1):
    able.append(i)
for i in range(300,315+1):
    able.append(i)
for i in range(400,420+1):
    able.append(i)
for i in range(500,525+1):
    able.append(i)
for i in range(600,630+1):
    able.append(i)
if X >= 615:
    print(1)
    exit()
elif X in able:
        print(1)
        exit()
print(0)

Submission status: Wrong Answer

Solution code:
'''
　 ∧_,,∧    究極奥義「WAがACになーれ！！」
　（`・ω・)つ━☆・*。
　⊂　　 ノ 　　　・゜+.
　 し’´Ｊ　　*・ 
'''
import sys
input = sys.stdin.readline
x=int(input())
x%=100000
for a in range(11):
    for b in range(11):
        for c in range(11):
            for d in range(11):
                for e in range(11):
                    for f in range(11):
                        if 100*a+101*b+102*c+103*d+104*e+105*f==x:
                            print(1)
                            exit()
print(0)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = x // 100
n = x % 100

if a*5 <= n:
  print(0)
else:
  print(1)