input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import bisect
import itertools
import sys
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
def most_simRL(ds, x):
index = bisect.bisect_left(ds, x)
if index == 0:
ret... | import bisect
import itertools
import sys
A, B, Q = list(map(int, input().split()))
s = [int(eval(input())) for _ in range(A)]
t = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
def most_simRL(ds, x):
index = bisect.bisect_left(ds, x)
if index == 0:
ret... | p03112 |
from bisect import bisect_left
from itertools import product
a, b, q = [int(i) for i in input().split()]
s_list = [int(eval(input())) for _ in range(a)]
t_list = [int(eval(input())) for _ in range(b)]
n_list = [a, b]
s_t_list = [s_list, t_list]
for _ in range(q):
x = int(eval(input()))
temp_s... | from bisect import bisect_left
a, b, q = [int(i) for i in input().split()]
s_list = [int(eval(input())) for _ in range(a)]
t_list = [int(eval(input())) for _ in range(b)]
for _ in range(q):
x = int(eval(input()))
temp_s_t_list = [10 ** 11] * 4
si = bisect_left(s_list, x)
if si < a:... | p03112 |
import bisect
A, B, Q = list(map(int, input().split()))
INF = float('inf')
s = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
t = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
for q in range(Q):
x = int(eval(input()))
b,d = bisect.bisect_right(s,x), bisect.bisect_right(t,x)
res ... | from bisect import bisect_right
A, B, Q = list(map(int, input().split()))
INF = float('inf')
S = [-INF] + list(int(eval(input())) for _ in range(A)) + [INF]
T = [-INF] + list(int(eval(input())) for _ in range(B)) + [INF]
for _ in range(Q):
x = int(eval(input()))
i = bisect_right(S,x)
j = bisect_righ... | p03112 |
import bisect
A, B, Q = [int(_) for _ in input().split()]
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
i_sl = bisect.bisect_left(S, x)
i_tl = bisect.bisect_left(T, x)
D_sr = D_sl = D_tl = D_tr = float('in... | import bisect
INF = float('inf')
A, B, Q = [int(_) for _ in input().split()]
S = [-INF] + [int(eval(input())) for _ in range(A)] + [INF]
T = [-INF] + [int(eval(input())) for _ in range(B)] + [INF]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
i_sl = bisect.bisect_left(S, x)
i_tl = bisect.bisect... | p03112 |
a,b,q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(0,a)]
t = [int(eval(input())) for i in range(0,b)]
x = [int(eval(input())) for i in range(0,q)]
s.sort()
t.sort()
def bifind(r,z):
y = len(r)//2
halftime = 2
if z < r[0]:
return [r[0],r[0]]
elif z > r[-1... | a,b,q = list(map(int,input().split()))
s = [int(eval(input())) for i in range(0,a)]
t = [int(eval(input())) for i in range(0,b)]
x = [int(eval(input())) for i in range(0,q)]
s.sort()
t.sort()
def bifind(r,z):
low = 0
high = len(r)-1
y = (low + high)//2
if z < r[0]:
return [r[0],r[... | p03112 |
A,B,Q=list(map(int, input().split()))
S=[int(eval(input())) for _ in range(A)]
T=[int(eval(input())) for _ in range(B)]
X=[int(eval(input())) for _ in range(Q)]
import bisect
def solve(x):
sr=bisect.bisect_right(S,x)
tr=bisect.bisect_right(T,x)
sl=sr-1
tl=tr-1
ret=10**12
if sl>=0 an... | import sys
input = sys.stdin.readline
A,B,Q=list(map(int, input().split()))
S=[int(eval(input())) for _ in range(A)]
T=[int(eval(input())) for _ in range(B)]
X=[int(eval(input())) for _ in range(Q)]
import bisect
def solve(x):
sr=bisect.bisect_right(S,x)
tr=bisect.bisect_right(T,x)
sl=sr-1
... | p03112 |
import sys
def main():
input = sys.stdin.readline
A,B,Q=list(map(int, input().split()))
S=[int(eval(input())) for _ in range(A)]
T=[int(eval(input())) for _ in range(B)]
X=[int(eval(input())) for _ in range(Q)]
from bisect import bisect_left
INF=10**11
S=[-INF] + S + [INF]
... | from bisect import bisect_left
import sys
def main():
input = sys.stdin.readline
A, B, Q = list(map(int, input().split()))
S = [int(eval(input())) for _ in range(A)]
T = [int(eval(input())) for _ in range(B)]
X = [int(eval(input())) for _ in range(Q)]
INF = 10 ** 11
S = [-INF] + S +... | p03112 |
from bisect import bisect_left
a,b,q,*stx = list(map(int,open(0).read().split()))
s = [-1e10] + stx[:a] + [2*1e10]
t = [-1e10] + stx[a:-q] + [2*1e10]
x = stx[-q:]
for i in x:
pos_s = bisect_left(s,i)
pos_t = bisect_left(t,i)
sl = s[pos_s-1]; sr = s[pos_s]
tl = t[pos_t-1]; tr = t[pos_t]
ans... | from bisect import bisect
def main():
a,b,q,*stx = list(map(int,open(0).read().split()))
s = [-1e10] + stx[:a] + [2*1e10]
t = [-1e10] + stx[a:a+b] + [2*1e10]
x = stx[a+b:a+b+q]
for i in x:
pos_s = bisect(s,i)
pos_t = bisect(t,i)
sl = s[pos_s-1]; sr = s[pos_s]
... | p03112 |
import bisect
a,b,q=list(map(int,input().split()))
s = []
t = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for _ in range(q):
x = int(eval(input()))
ans = [0,0,0]
if x in s:
sl = 0
sr = 0
else:
i = bisect.bisect_left(... | import bisect
a,b,q=list(map(int,input().split()))
s = []
t = []
for i in range(a):
s.append(int(eval(input())))
for i in range(b):
t.append(int(eval(input())))
for _ in range(q):
x = int(eval(input()))
ans = [0,0,0]
i = bisect.bisect_left(s,x)
if i == 0:
sl = 100000000000
else... | p03112 |
from itertools import product
from bisect import bisect_left, bisect_right
def main():
A, B, Q = map(int, input().split())
ss = [int(input()) for _ in range(A)]
ts = [int(input()) for _ in range(B)]
xs = [int(input()) for _ in range(Q)]
# gen = TLE(A, B, Q, ss, ts, xs)
gen = f(A, B... | from itertools import product
from bisect import bisect_left, bisect_right
def main():
A, B, Q = map(int, input().split())
ss = [int(input()) for _ in range(A)]
ts = [int(input()) for _ in range(B)]
xs = [int(input()) for _ in range(Q)]
# gen = TLE(A, B, Q, ss, ts, xs)
# gen = f(A,... | p03112 |
import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = ... | import sys
import re
import math
import collections
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal
import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = ... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
ss = sorted([int(eval(input())) for _ in range(a)])
ts = sorted([int(eval(input())) for _ in range(b)])
xs = [int(eval(input())) for _ in range(q)]
for x in xs:
sindex = bisect.bisect(ss, x)
if sindex == 0:
sl = float('inf')
sr... | import bisect
a, b, q = list(map(int, input().split()))
ss = sorted([int(eval(input())) for _ in range(a)] + [float('inf'), -float('inf')])
ts = sorted([int(eval(input())) for _ in range(b)] + [float('inf'), -float('inf')])
xs = [int(eval(input())) for _ in range(q)]
for x in xs:
sindex = bisect.bisect(ss... | p03112 |
from bisect import bisect
num_a,num_b,num_q = list(map(int, input().split(' ')))
lsa = [int(eval(input())) for _ in range(num_a)]
lsb = [int(eval(input())) for _ in range(num_b)]
lsa.sort()
lsb.sort()
# print(lsa)
# print(lsb)
lsq = [int(eval(input())) for _ in range(num_q)]
for ques in lsq:
lower_b... | from bisect import bisect
LONG_MIN = -9223372036854775808
LONG_MAX = 9223372036854775807
num_a,num_b,num_q = list(map(int, input().split(' ')))
lsa = [int(eval(input())) for _ in range(num_a)] + [LONG_MIN, LONG_MAX]
lsb = [int(eval(input())) for _ in range(num_b)] + [LONG_MIN, LONG_MAX]
lsa.sort()
lsb.sort()
... | p03112 |
A,B,Q=list(map(int,input().split()))
s=[]
t=[]
for i in range(A):
s.append(int(eval(input())))
for i in range(B):
t.append(int(eval(input())))
for i in range(Q):
x=int(eval(input()))
s1=s[:]
s1.append(x)
s1.sort()
j=s1.index(x)
if j==0:
kouhoA=[s[j]]
elif j==A:
kouhoA=[s[j-1]]
... | import bisect
A,B,Q=list(map(int,input().split()))
s=[]
t=[]
for i in range(A):
s.append(int(eval(input())))
for i in range(B):
t.append(int(eval(input())))
for i in range(Q):
x=int(eval(input()))
j=bisect.bisect_left(s,x)
if j==0:
kouhoA=[s[j]]
elif j==A:
kouhoA=[s[j-1]]
else:
... | p03112 |
a,b,q=list(map(int,input().split()))
s=[int(eval(input())) for i in range(a)]
t=[int(eval(input())) for i in range(b)]
x=[int(eval(input())) for i in range(q)]
import bisect
inf=10**11
def tansak(lis,lis2,dis):
ind=bisect.bisect_left(lis,dis)
ind2=bisect.bisect_left(lis2,dis)
return ind,ind2
... | import sys
import math
def input():
return sys.stdin.readline()[:-1]
a,b,q=list(map(int,input().split()))
s=[int(eval(input())) for i in range(a)]
t=[int(eval(input())) for i in range(b)]
x=[int(eval(input())) for i in range(q)]
import bisect
inf=10**11
def tansak(lis,lis2,dis):
ind=bisect.bisect... | p03112 |
import bisect
from sys import stdin
readline=stdin.readline
a,b,q=list(map(int,input().split()))
s=sorted([int(readline()) for i in range(a)])
t=sorted([int(readline()) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(readline())
w=bisect.bisect_left(s,x)
for j in range(2):
... | import bisect
from sys import stdin
readline=stdin.readline
a,b,q=list(map(int,input().rstrip().split()))
s=sorted([int(readline().rstrip()) for i in range(a)])
t=sorted([int(readline().rstrip()) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(readline().rstrip())
w=bisect.bisect_left... | p03112 |
import bisect
import sys
def input_function():
return sys.stdin.readline().rstrip()
input=input_function
a,b,q=list(map(int,input().split()))
s=sorted([int(eval(input())) for i in range(a)])
t=sorted([int(eval(input())) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(eval(input()))
... | import bisect
import sys
input=lambda : sys.stdin.readline().rstrip()
a,b,q=list(map(int,input().split()))
s=sorted([int(eval(input())) for i in range(a)])
t=sorted([int(eval(input())) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(eval(input()))
w=bisect.bisect_left(s,x)
for j ... | p03112 |
import bisect
import sys
input=lambda : sys.stdin.readline().rstrip()
a,b,q=list(map(int,input().split()))
s=sorted([int(eval(input())) for i in range(a)])
t=sorted([int(eval(input())) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(eval(input()))
w=bisect.bisect_left(s,x)
for j ... | import bisect
import sys
input=lambda : sys.stdin.readline().rstrip()
a,b,q=list(map(int,input().split()))
s=sorted([int(eval(input())) for i in range(a)])
t=sorted([int(eval(input())) for i in range(b)])
for i in range(q):
ans=999999999999
x=int(eval(input()))
w=bisect.bisect_left(s,x)
for j ... | p03112 |
from bisect import bisect
A,B,Q=list(map(int, input().split()))
s=[int(eval(input())) for _ in range(A)] + [99**99]
t=[int(eval(input())) for _ in range(B)] + [99**99]
for _ in range(Q):
x = int(eval(input()))
ans = []
ps = bisect(s, x)
pt = bisect(t, x)
for vs in (s[ps], s[ps-1]):
for vt in (t[pt], t[... | from bisect import bisect
A,B,Q=list(map(int, input().split()))
s=[int(eval(input())) for _ in range(A)] + [10**11]
t=[int(eval(input())) for _ in range(B)] + [10**11]
for _ in range(Q):
x = int(eval(input()))
ans = []
ps = bisect(s, x)
pt = bisect(t, x)
for vs in (s[ps], s[ps-1]):
for vt in (t[pt], t[... | p03112 |
x=[]
for i,j in enumerate(map(int,input().split())):
c=[]
for l in range(j):
t=int(eval(input()))
x.append((i,l,t))
c.append([t])
x.sort(key=lambda x:x[2])
l=[-10**20]*2
for y in x:
if y[0] != 2:
l[y[0]]=y[2]
else:
c[y[1]]+=l[:]
l=[10**20]*2
for y ... | import sys
input = sys.stdin.readline
A, B, Q = list(map(int, input().split()))
inf = 10**18
S = [-inf]
for _ in range(A):
S.append(int(eval(input())))
S.append(inf)
T = [-inf]
for _ in range(B):
T.append(int(eval(input())))
T.append(inf)
def f_s(x, l):
mn, mx = -1, len(l)
idx = mx//2
... | p03112 |
import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
A, B, Q = list(map(int, readline().split()))
stx = list(map(int, read().split()))
s = stx[:A]; t = stx[A:-Q]; x = stx[-Q:]
s = [-10 ** 10] + s + [10 ** 11]
t = [-10 ** 10] + t + [10 *... | import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
A, B, Q = list(map(int, readline().split()))
stx = list(map(int, read().split()))
s = stx[:A]; t = stx[A:-Q]; x = stx[-Q:]
s = [-10 ** 10] + s + [10 ** 1... | p03112 |
import bisect
a,b,q = list(map(int,input().split()))
s = [-10**11]+[int(eval(input())) for _ in range(a)]+[10**11]
t = [-10**11]+[int(eval(input())) for _ in range(b)]+[10**11]
for i in range(q):
ans = 10**11
x = int(eval(input()))
l = bisect.bisect(s,x)
m = bisect.bisect(t,x)
arr = [[s[l-1],s[l]],[t... | import bisect
a,b,q = list(map(int,input().split()))
s = [-10**11]+[int(eval(input())) for _ in range(a)]+[10**11]
t = [-10**11]+[int(eval(input())) for _ in range(b)]+[10**11]
for i in range(q):
ans = 10**11
x = int(eval(input()))
l = bisect.bisect(s,x)
m = bisect.bisect(t,x)
arr = [[s[l-1],s[l]],[t... | p03112 |
import bisect
from itertools import product
I = lambda n: [int(eval(input())) for _ in range(n)]
def f(S, x):
p = bisect.bisect_left(S, x)
return [S[p-1], S[p]]
g = lambda x, s, t: abs(x-s)+abs(s-t)
INF = 10**11
a, b, q = list(map(int, input().split()))
S, T, X = [-INF]+I(a)+[INF], [-INF]+I(b)+[INF], I... | from bisect import bisect_left
from itertools import product
I = lambda n: [int(eval(input())) for _ in range(n)]
def f(S, x):
p = bisect_left(S, x)
return [S[p-1], S[p]]
g = lambda x, s, t: abs(x-s)+abs(s-t)
INF = 10**11
a, b, q = list(map(int, input().split()))
S, T, X = [-INF]+I(a)+[INF], [-INF]+I(b... | p03112 |
import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, Q = list(map(int, readline().split()))
S = [int(readline()) for _ in range(A)]
T = [i... | import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, Q = list(map(int, readline().split()))
S = [-INF] + [int(readline()) for _ in range(A)] + ... | p03112 |
import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, Q = list(map(int, readline().split()))
S = [-INF] + [int(readline()) for _ in range(A)] + ... | import sys
from bisect import bisect_left
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B, Q = list(map(int, readline().split()))
S = [-INF]
S.extend(int(readline()) for _ in r... | p03112 |
a,b,q=list(map(int,input().split()))
S,T=[],[]
for i in range(a):
S.append(int(eval(input())))
for i in range(b):
T.append(int(eval(input())))
def f(list,n):
if n<list[0]:
return [-float("inf"),list[0]]
elif list[-1]<n:
return [list[-1],float("inf")]
else:
flag,count=0,0
l=len(lis... | import bisect
a,b,q=list(map(int,input().split()))
S,T=[],[]
for i in range(a):
S.append(int(eval(input())))
for i in range(b):
T.append(int(eval(input())))
def f(list,n):
if n<list[0]:
return [-float("inf"),list[0]]
elif list[-1]<n:
return [list[-1],float("inf")]
else:
i=bisect.bisec... | p03112 |
import bisect
a, b, q = list(map(int, input().split()))
inf = float('inf')
S = [- inf] + [int(eval(input())) for i in range(a)] + [inf]
T = [- inf] + [int(eval(input())) for i in range(b)] + [inf]
for i in range(q):
x = int(eval(input()))
s_idx = bisect.bisect_left(S, x)
s1, s2 = S[s_idx - 1], S[s... | import bisect
a, b, q = list(map(int, input().split()))
inf = float('inf')
S = [- inf] + [int(eval(input())) for i in range(a)] + [inf]
T = [- inf] + [int(eval(input())) for i in range(b)] + [inf]
for i in range(q):
x = int(eval(input()))
s_idx = bisect.bisect_left(S, x)
s1, s2 = S[s_idx - 1], S[s... | p03112 |
from bisect import bisect_left
A,B,Q = list(map(int,input().split()))
inf = float('inf')
S = [-inf] + [int(eval(input())) for i in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for i in range(B)] + [inf]
X = [int(eval(input())) for i in range(Q)]
for x in X:
si = bisect_left(S,x); ti = bisect_left(T,x)
... | import sys
input = sys.stdin.readline
from bisect import bisect
inf = float('inf')
A,B,Q = list(map(int,input().split()))
S = [-inf] + [int(eval(input())) for _ in range(A)] + [inf]
T = [-inf] + [int(eval(input())) for _ in range(B)] + [inf]
X = [int(eval(input())) for _ in range(Q)]
for x in X:
an... | p03112 |
import sys
import bisect
input = sys.stdin.readline
A, B, Q = map(int, input().split())
tera = [int(input()) for _ in range(A)]
sha = [int(input()) for _ in range(B)]
query = [int(input()) for _ in range(Q)]
res = []
for x in query:
tl = bisect.bisect_left(tera, x)
tr = bisect.bisect_right(tera, x... | import sys
import bisect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
bl = bisect.bisect_left
A, B, Q = list(map(int, input().split()))
inf = 10**18
S = [-inf]+[int(eval(input())) for _ in range(A)]+[inf]
T = [-inf]+[int(eval(input())) for _ in range(B)]+[inf]
def path(x):
sl = S... | p03112 |
def dfs(p, c, s):
if c==n:
return not s
if p==-1:
return 0
if memo[s][p][c] != -1:
return memo[s][p][c]
ret = 0
for i in range(min(p, s), -1, -1):
ret += dfs(i-1, c+1, s-i)
memo[s][p][c] = ret
return ret
while 1:
n, s = list(map(int, input()... | while 1:
n, s = list(map(int, input().split()))
if n==0:
exit(0)
dp = [[0]*(s+1) for _ in range(n+1)]
dp[0][0] = 1
for i in range(min(s+1, 101)):
si1 = s-i+1
for k in range(n, 0, -1):
dp_k = dp[k]; dp_k1 = dp[k-1]
for j in range(si1):
... | p00097 |
"""
now...今注目する値
used...使った数字の数
sum...それまでの合計
dp[now][used][sum]...nowまででused個の数字を使って合計sumの場合の数
dp[now][used][sum] = dp[now - 1][used - 1][sum - now] + dp[now - 1][used][sum] (used >= 1 and sum >= now)
dp[now - 1][used][sum] (used == 0 or sum < now)
"""... | """
now...今注目する値
used...使った数字の数
sum...それまでの合計
dp[now][used][sum]...nowまででused個の数字を使って合計sumの場合の数
dp[now][used][sum] = dp[now - 1][used - 1][sum - now] + dp[now - 1][used][sum] (used >= 1 and sum >= now)
dp[now - 1][used][sum] (used == 0 or sum < now)
... | p00097 |
"""
now...今注目する値
used...使った数字の数
sum...それまでの合計
dp[now][used][sum]...nowまででused個の数字を使って合計sumの場合の数
dp[now][used][sum] = dp[now - 1][used - 1][sum - now] + dp[now - 1][used][sum] (used >= 1 and sum >= now)
dp[now - 1][used][sum] (used == 0 or sum < now)
... | dp = [[0 for _ in range(1001)] for _ in range(10)]
dp[1][0] = dp[0][0] = 1
for now in range(1, 101):
for used in range(9, 0, -1):
dpu = dp[used]
dpu_1 = dp[used - 1]
for s in range(now, 1001):
dpu[s] = dpu_1[s - now] + dpu[s]
while True:
n, s = list(map(int, input().split()))
if no... | p00097 |
m=1001
A=list(range(9))
d=[[0]*m for i in A]
for i in range(101):
for j in A[::-1]:
if j==0: d[j][i]=1
else:
for k in range(m):
if k+i<m: d[j][k+i]+=d[j-1][k]
while 1:
n,s=list(map(int,input().split()))
if n==s==0: break
print(d[n-1][s]) | m=1001
A=list(range(9))
d=[[0]*m for i in A]
for i in range(101):
for j in A[::-1]:
if j==0: d[j][i]=1
else:
for k in range(m-i): d[j][k+i]+=d[j-1][k]
while 1:
n,s=list(map(int,input().split()))
if n==s==0: break
print(d[n-1][s]) | p00097 |
m=1001
A=list(range(10))
d=[[0]*m for i in A]
d[0][0]=1
for i in range(101):
for j in A[1:][::-1]:
for k in range(m-i): d[j][k+i]+=d[j-1][k]
while 1:
n,s=list(map(int,input().split()))
if n==s==0: break
print(d[n][s]) | m=1001
A=list(range(9))
d=[[0]*m for i in A]
for i in range(101):
for j in A[1:][::-1]:
for k in range(m-i): d[j][k+i]+=d[j-1][k]
d[0][i]=1
while 1:
n,s=list(map(int,input().split()))
if n==s==0: break
print(d[n-1][s]) | p00097 |
while 1:
try:
N,M = list(map(int,input().split()))
dp = [[0]*(M+1) for i in range(3)]
for _ in range(N):
name = input()
C,V,D,L = list(map(int,input().split()))
VDL = [V,D,L]
for i in range(3):
try: dp[i][C] = max(dp[i][C],VDL[i])
except: pass
for j in range(M):
if dp[i][... | while 1:
try:
N,M = list(map(int,input().split()))
dp = [[0]*(M+1) for i in range(3)]
for _ in range(N):
name = input()
C,V,D,L = list(map(int,input().split()))
VDL = [V,D,L]
for i in range(3):
try: dp[i][C] = max(dp[i][C],VDL[i])
except: break
for j in range(M):
if dp[i]... | p01336 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
N=int(eval(input()))
edge={i:[] for i in range(1,N+1)}
for i in range(0,N-1):
a,b=list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
K=int(eval(input()))
dic={}
for i in range(K):
v,p=list(map(int,input(... | import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
N=int(eval(input()))
edge={i:[] for i in range(1,N+1)}
for i in range(0,N-1):
a,b=list(map(int,input().split()))
edge[a].append(b)
edge[b].append(a)
K=int(eval(input()))
dic={}
for i in range(K):
v,p=list(map(int,input(... | p03949 |
import math
def main():
X = int(eval(input()))
ans = False
for i in range(X+1):
mx = 105 * i
mn = 100 * i
if mn <= X <= mx:
ans = True
if ans:
print((1))
else:
print((0))
if __name__ == "__main__":
main() | import math
def main():
X = int(eval(input()))
# ans = False
c = X // 100
mx = 105 * c
mn = 100 * c
if mn <= X <= mx:
print((1))
else:
print((0))
if __name__ == "__main__":
main() | p02843 |
x = int(eval(input()))
max_a = (x // 100) + 1
max_b = (x // 101) + 1
max_c = (x // 102) + 1
max_d = (x // 103) + 1
max_e = (x // 104) + 1
for a in range(max_a):
for b in range(max_b):
for c in range(max_c):
for d in range(max_d):
for e in range(max_e):
for_f = x - (a * 100 +... | x = int(eval(input()))
c = int(x / 100)
# print(c)
for i in range(c * 100, c * 105 + 1):
if i == x:
print((1))
exit(0)
print((0))
| p02843 |
#!/usr/bin/env python3
import sys
def solve(X: int):
dp = [[False]*(X+1) for _ in range(7)]
price = [100,101,102,103,104,105]
for i in range(7):
dp[i][0] = True
## i番目まででjを払えるか
for i in range(6):
for j in range(X+1):
if j >= price[i]:
fo... | #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [[-1]*(X+1) for _ in range(7)]
price = [100,101,102,103,104,105]
m = [10**5]*6
for i in range(7):
dp[i][0] = 10**5
## i番目まででjを払えるか
for i in range(6):
for j in range(X+1):
if dp[i][j]>=0:
... | p02843 |
#!/usr/bin/env python3
import sys
def solve(X: int):
dp = [[-1]*(X+1) for _ in range(7)]
price = [100,101,102,103,104,105]
m = [10**5]*6
for i in range(7):
dp[i][0] = 10**5
## i番目まででjを払えるか
for i in range(6):
for j in range(X+1):
if dp[i][j]>=0:
... | #!/usr/bin/env python3
import sys
def solve(X: int):
dp = [False for _ in range(X+1)]
dp[0] = True
prices = [100,101,102,103,104,105]
for i in range(1,X+1):
for price in prices:
if i >= price:
if dp[i-price]:
dp[i] = dp[i-price]
... | p02843 |
#!/usr/bin/env python3
import sys
def solve(X: int):
dp = [False for _ in range(X+1)]
dp[0] = True
prices = [100,101,102,103,104,105]
for i in range(1,X+1):
for price in prices:
if i >= price:
if dp[i-price]:
dp[i] = dp[i-price]
... | #!/usr/bin/env python3
import sys
def solve(X: int):
for i in range(1000):
if i*100 <= X <= i*105:
print((1))
return
print((0))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
... | p02843 |
import sys
input = sys.stdin.readline
from collections import *
X = int(eval(input()))
dp = [False]*(X+1)
dp[0] = True
for i in range(X+1):
for j in range(100, 106):
if i-j>=0:
dp[i] |= dp[i-j]
if dp[X]:
print((1))
else:
print((0)) | X = int(eval(input()))
dp = [False]*(X+1)
dp[0] = True
for i in range(X+1):
for j in range(100, 106):
if i+j<=X:
dp[i+j] |= dp[i]
if dp[X]:
print((1))
else:
print((0)) | p02843 |
X = int(eval(input()))
dp = [-1] * (X + 1)
a = [100, 101, 102, 103, 104, 105]
m = [1000000] * 6
dp[0] = 0
for i in range(6):
for j in range(X + 1):
if dp[j] >= 0:
dp[j] = m[i]
elif j < a[i] or dp[j - a[i]] <= 0:
dp[j] = -1
else:
dp[j] = dp[j ... |
X = int(eval(input()))
n = X % 100
m = X // 100
cnt = 0
for a in reversed(list(range(1, 6))):
while n - a >= 0:
n -= a
cnt += 1
if cnt <= m:
print((1))
else:
print((0))
| p02843 |
n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if n in list(range(100 * i, 105 * i + 1)):
ans = 1
print(ans)
| x = int(eval(input()))
flag = False
for c in range(1,x+1):
if c * 100 <= x and x <= c * 105:
flag = True
break
print((1 if flag else 0))
| p02843 |
X = int(eval(input()))
X_MOD = X % 100
X_DIV = X // 100
def bfs():
from collections import deque
queue = deque([(0, 0)])
while queue:
sum_x, cnt_x = queue.popleft()
#print(sum_x, cnt_x)
if sum_x == X_MOD:
return 1
if sum_x > X_MOD:
co... | X = int(eval(input()))
X_MOD = X % 100
X_DIV = X // 100
import sys
sys.setrecursionlimit(2000)
def dfs(sum_x, cnt_x):
if cnt_x > X_DIV:
return False
if sum_x == X_MOD:
return True
return dfs(sum_x+1, cnt_x+1) or dfs(sum_x+1, cnt_x+2) or dfs(sum_x+3, cnt_x+1) or dfs(sum_x+... | p02843 |
X = int(eval(input()))
X_MOD = X % 100
X_DIV = X // 100
import sys
sys.setrecursionlimit(2000)
def dfs(sum_x, cnt_x):
if cnt_x > X_DIV:
return False
if sum_x == X_MOD:
return True
return dfs(sum_x+1, cnt_x+1) or dfs(sum_x+1, cnt_x+2) or dfs(sum_x+3, cnt_x+1) or dfs(sum_x+... | X = int(eval(input()))
X_MOD = X % 100
X_DIV = X // 100
import sys
sys.setrecursionlimit(2000)
def dfs(sum_x, cnt_x, num):
if cnt_x > X_DIV:
return False
if sum_x == X_MOD:
return True
if num == 1:
return dfs(sum_x+1, cnt_x+1, 1) or dfs(sum_x+1, cnt_x+2, 2) or dfs(sum_... | p02843 |
import sys
import itertools
input = sys.stdin.readline
X = int(eval(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)+1
pools = itertools.product(list(range(maxtimes)), repeat=6)
for comb in pools:
c = list(comb)
p... | import sys
import itertools
input = sys.stdin.readline
X = int(eval(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, int(X... | p02843 |
# C - 100 to 105
from collections import defaultdict
def main():
X = int(eval(input()))
items = tuple(range(100, 106))
dp = defaultdict(bool)
dp[0] = True
while max(dp.keys()) < X:
for possible_price in tuple(dp.keys()):
for item in items:
dp[possibl... | # C - 100 to 105
def main():
X = int(eval(input()))
check = lambda x: x * 100 <= X <= x * 105
is_possible = any(check(i) for i in range(X))
print((int(is_possible)))
if __name__ == "__main__":
main()
| p02843 |
x=int(eval(input()))
a=b=c=d=e=f=0
flag=False
for a in range(x//100+1):
for b in range(x//101+1):
for c in range(x//102+1):
for d in range(x//103+1):
for e in range(x//104+1):
for f in range(x//105+1):
if a*100+b*101+c*102+d*103+e*104+f*105==x:
flag=True... | x=int(eval(input()))
y=1 # y個購入すると題意をみたす時、1<=y<=x//100、実際に支払い可能な金額は100＊y〜105＊y
if x<100:
print((0))
else:
while y<=x//100+1:
if y*100<=x<=y*105:
print((1))
break
elif y>x//100:
print((0))
break
else:
y+=1
| p02843 |
# coding: utf-8
import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : retu... | # coding: utf-8
import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : retu... | p02843 |
n = int(eval(input()))
if(n%100==0):
print((1))
elif(n%101==0):
print((1))
elif(n%102==0):
print((1))
elif(n%103==0):
print((1))
elif(n%104==0):
print((1))
elif(n%105==0):
print((1))
else:
tmp=n//100
mod=n%100/5
if(mod<tmp):
print((1))
else:
p... | n = int(eval(input()))
tmp=n//100
mod=n%100/5
if(mod<=tmp):
print((1))
else:
print((0)) | p02843 |
x = int(eval(input()))
while(x>=0):
if x%100==0:
print("1")
break
elif x<100:
print("0")
break
elif x%100>=5:
x -= 105
continue
else:
x-=(x%100)+100
continue
| x = int(eval(input()))
if ((x%100)+4)//5 > x//100:
print((0))
else:
print((1))
| p02843 |
# 品物数を決めると合計金額は100*個数～105*個数の範囲となる
# xが範囲内にあれば買い方が存在する。なければしない。
x = int(eval(input()))
for i in range(1, 1000001):
if 100*i <= x <= 105*i:
print((1))
break
else:
print((0))
| X = int(eval(input()))
for i in range(1, 100001):
if 100*i <= X <= 105*i:
print((1))
exit(0)
print((0))
| p02843 |
#!/usr/bin/env python3
#三井住友信託銀行プログラミングコンテスト2019 C
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collec... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02843 |
x = int(eval(input()))
ans = 0
for a in range((x//100)+1):
for b in range((x//101)+1):
for c in range((x//102)+1):
for d in range((x//103)+1):
for e in range((x//104)+1):
for f in range((x//105)+1):
if (100*a) + (101*b) + (102*c) + (103*d) + (104*e) + (105*f)... | x = int(eval(input()))
ans = 0
flag = False
for a in range((x//100)+1):
for b in range((x//101)+1):
for c in range((x//102)+1):
for d in range((x//103)+1):
for e in range((x//104)+1):
for f in range((x//105)+1):
if (100*a) + (101*b) + (102*c) + (103*d) + (10... | p02843 |
X = int(eval(input()))
mod = X % 100
q = int(X //100)
sum = 0
ans = 0
for i in range (0,q+1):
for j in range (0,q+1-i):
for k in range (0,q+1-i-j):
for l in range (0,q+1-i-k-j):
for m in range (0,q+1-i-j-k-l):
sum = i+(2*j)+(3*k)+(4*l)+(5*m)
... | X = int(eval(input()))
mod = X % 100
q = int(X //100)
sum = 0
ans = 0
if q >= 20:
ans = 1
else:
for i in range (0,q+1):
for j in range (0,q+1-i):
for k in range (0,q+1-i-j):
for l in range (0,q+1-i-k-j):
for m in range (0,q+1-i-j-k-l):
... | p02843 |
X = int(eval(input()))
num = X // 100
res = 0
for a in range(num+1):
for b in range(num-a+1):
for c in range(num-(a+b)+1):
for d in range(num-(a+b+c)+1):
for e in range(num-(a+b+c+d)+1):
for f in range(num-(a+b+c+d+e)+1):
... | X = int(eval(input()))
if X >= 2000:
print((1))
else:
num = X // 100
res = 0
for a in range(num+1):
for b in range(num-a+1):
for c in range(num-(a+b)+1):
for d in range(num-(a+b+c)+1):
for e in range(num-(a+b+c+d)+1):
... | p02843 |
x = int(eval(input()))
dp = [False] * (x+1)
dp[0] = True
for i in range(1,x+1):
if i < 99:
continue
else:
if dp[i-100]:
dp[i] = True
elif dp[i-101]:
dp[i] = True
elif dp[i-102]:
dp[i] = True
elif dp[i-103]:
d... | a = int(eval(input()))
tmp01 = a/100
tmp02 = a/105
n = a//100
#print(tmp01,n,tmp02)
if tmp01 >= n >= tmp02:
print((1))
else:
print((0)) | p02843 |
n = int(eval(input()))
L = [i for i in range(100,2001,100)]
#print(L)
LL = []
for i in L:
n1 = int(str(i)[0])
n2 = int(str(i)[0]+str(i)[1])
len1 = len(str(i))
if len1 == 3:
LL.append((n1*100+5*n1+1,(n1+1)*100-1))
else:
LL.append((n2*100+5*(n2)+1,(n2+1)*100-1))
LL = [(1,99... | n = int(eval(input()))
print((1 if divmod(n,100)[1] <= divmod(n,100)[0]*5 else 0)) | p02843 |
import sys
payable = [False] * (10 ** 5 + 1)
payable[0] = True
for i in range(100,106):
payable[i] = True
for i in range(106, 10 ** 5 + 1):
payable[i] = any(payable[i-105:i-99])
def main():
x = int(sys.stdin.readline().rstrip())
print((payable[x] & 1))
if __name__ == '__main__':
m... | import sys
def main():
x = int(sys.stdin.readline().rstrip())
q, r = divmod(x, 100)
if 5 * q >= r:
ans = 1
else:
ans = 0
print(ans)
if __name__ == '__main__':
main() | p02843 |
import itertools
import math
x = int(eval(input()))
remain = x % 100
quotient = math.floor(x/100)
items = [100, 101, 102, 103, 104, 105]
n = 6
for moneys in itertools.product(items, repeat=quotient):
if sum(moneys) == x:
print((1))
exit()
print((0))
| import itertools
import math
x = int(eval(input()))
remain = x % 100
quotient = math.floor(x/100)
items = [100, 101, 102, 103, 104, 105]
n = 6
for moneys in itertools.combinations_with_replacement(items, quotient):
if sum(moneys) == x:
print((1))
exit()
print((0))
| p02843 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
X = int(eval(input()))
l = []
for i in range(1001):
l.extend(list(range(i*100, 105*i+1)))
if X in l:
print((1))
else:
print((0))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
X = int(eval(input()))
for i in range(100000):
if 100 * i <= X <= 100 * i + 5 * i:
print((1))
exit()
print((0))
| p02843 |
import itertools
x = int(eval(input()))
max_c = int(x/100)
p_L = [i for i in range(100,106)]
a = list(itertools.combinations_with_replacement(p_L, max_c))
for val in a:
if sum(val) == x:
print((1))
exit()
print((0))
| import sys
sys.setrecursionlimit(200000)
x = int(eval(input()))
p_L = [i for i in range(100,106)]
def dfs(ans,next):
global p_L
global x
global stop_memo
ans += p_L[next]
if ans > x:
return
elif ans == x:
print((1))
exit()
for val in ... | p02843 |
from collections import deque
def solve(X):
if X >= 2000:
return 1
prices = list(range(100, 106))
Q = deque([(0, 0)])
while Q:
i, pNow = Q.popleft()
if i == 6:
if pNow == X:
return 1
else:
price = prices[i]
... | X = int(eval(input()))
dp = [False] * (X+1)
dp[0] = True
for i in range(1, X+1):
dp[i] = any(dp[i-(X+1)-105:i-(X+1)-99])
print((int(dp[X])))
| p02843 |
import itertools
def modelAnswer(X:int):
lis = [i for i in range(100,106)]
C = X//100
for p in itertools.combinations_with_replacement(lis,C):
if(sum(p)==X):
return 1
return 0
def main():
X = int(eval(input()))
print((modelAnswer(X)))
if __name__ == '__main__':
main() | def solve(X:int) -> int:
if(X < 100):return 0
first = int(str(X)[-1])
seccond = int(str(X)[-2])
ans = 0
if(first >= 6):
ans += first + 200
elif(first > 0):
ans += first + 100
ans += (seccond * 2) * 105
return 1 if(ans <= X) else 0
def main():
X = int(e... | p02843 |
def main():
n = 6
A = (100, 101, 102, 103, 104, 105)
M = [10**6]*6
K = int(eval(input()))
dp = [[-1]*(K+1) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
for j in range(K+1):
if dp[i][j] >= 0:
dp[i+1][j] = M[i]
elif j < A[i] or... | def main():
N = int(input())
for i in range(1, N+1):
if 100*i <= N <= 105*i:
return print(1)
print(0)
if __name__ == '__main__':
main()
| p02843 |
def main():
N = int(input())
for i in range(1, N+1):
if 100*i <= N <= 105*i:
return print(1)
print(0)
if __name__ == '__main__':
main()
| def main():
N = int(input())
i = N//100
if 100*i <= N <= 105*i:
return print(1)
else:
return print(0)
if __name__ == '__main__':
main()
| p02843 |
X = int(eval(input()))
A = X // 100
for i_100 in range(A + 1):
for i_101 in range(A + 1 - i_100):
for i_102 in range(A + 1 - i_100 - i_101):
for i_103 in range(A + 1 - i_100 - i_101 - i_102):
for i_104 in range(A + 1 - i_100 - i_101 - i_102 - i_103):
... | X = int(eval(input()))
A100 = 0
A105 = 0
for i in range(1001):
A100 += 100
A105 += 105
if A100 <= X <= A105:
print("1")
exit()
print("0")
| p02843 |
import sys
N=int(eval(input()))
if 100<=N<=105:
print((1))
sys.exit()
min_=N//105
max_= N//100 + 1
#print(min_,max_)
count=0
for m in range(min_,max_):
X = N - 100*m
for i in range(0,X+1):
for j in range(0,(X-i)//2 +1):
for k in range(0,(X-i-2*j)//3 +1):
... | import sys
N=int(eval(input()))
if 100<=N<=105:
print((1))
sys.exit()
min_=N//105
max_= N//100 + 1
#print(min_,max_)
count=0
for m in range(min_,max_):
X = N - 100*m
for i in range(0,X+1):
for j in range(0,(X-i)//2 +1):
for k in range(0,(X-i-2*j)//3 +1):
... | p02843 |
x = int(eval(input()))
n = x // 100
x %= 100
for i in range(n):
if x - 5 >= 0:
x -= 5
elif x - 4 >= 0:
x -= 4
elif x - 3 >= 0:
x -= 3
elif x - 2 >= 0:
x -= 2
elif x - 1 >= 0:
x -= 1
else:
break
if x == 0:
print((1))
else:
... | x = int(eval(input()))
n = x // 100
x %= 100
if n * 5 >= x:
print((1))
else:
print((0)) | p02843 |
x = int(eval(input()))
n = x//100 + 1
for i in range(n):
for j in range(n):
for k in range(n):
for l in range(n):
for m in range(n):
c = 100*i + 101*j + 102*k + 103*l + 104*m
if x >= c:
t = x-c
... | x = int(eval(input()))
n = x//100
if 100*n <= x and x <= 105*n:
print((1))
else:
print((0)) | p02843 |
import queue
x=int(eval(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)) | import queue
x=int(eval(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 o... | p02843 |
x = int(eval(input()))
from collections import deque
q = deque([0])
prices = [100, 101, 102, 103, 104, 105]
while q:
cost = q.pop()
if cost > x:
continue
elif any([(x-cost)%p == 0 for p in prices]):
print((1))
break
for p in prices:
q.append(cost+p)
e... | x = int(eval(input()))
c = 1
while True:
if c*100 <= x <= c*105:
print((1))
break
if c*100 > x:
print((0))
break
c += 1 | p02843 |
import sys
X = int(eval(input()))
if 1 <= X and X < 100:
print("0")
sys.exit()
i = 0
dp = [0]*(X+1)
dp[0] = 1
for i in range(100, X+1):
for j in range(6):
if dp[i-(100+j)] == 0:
pass
else:
dp[i] = 1
print((dp[X])) | # import sys
X = int(eval(input()))
# if 1 <= X and X < 100:
# print("0")
# sys.exit()
i = 0
dp = [0]*(X+1)
dp[0] = 1
for i in range(100, X+1):
for j in range(6):
if dp[i-(100+j)] == 0:
pass
else:
dp[i] = 1
print((dp[X]))
| p02843 |
#!/usr/bin/env python3
def solve(x):
if x >= 2000:
return True
memo = [True] + [False]*x
def dp(k):
if k == 0:
return True
elif k < 0:
return False
elif memo[k]:
return True
for i in range(100,106):
if d... | #!/usr/bin/env python3
def solve(x):
if x >= 2000:
return True
memo = [True] + [False]*x
def dp(k):
if k == 0:
return True
for i in range(100,106):
if k-i >= 0 and memo[k-i]:
return True
return False
... | p02843 |
N = int(eval(input()))
import sys
sys.setrecursionlimit(10 ** 9)
def dfs(x):
ans = False
if x == 0:
return True
elif x < 0:
return False
else:
ans |= dfs(x - 100)
ans |= dfs(x - 101)
ans |= dfs(x - 102)
ans |= dfs(x - 103)
ans |= ... | N = int(eval(input()))
import sys
sys.setrecursionlimit(10 ** 9)
memo = [-1] * (N + 1)
def dfs(x):
if x >= 0 and memo[x] != -1:
return memo[x]
ans = False
if x == 0:
memo[x] = 1
return True
elif x < 0:
return False
else:
ans |= dfs(x - 100)... | p02843 |
X = int(eval(input()))
c = 0
for i in range(int(X/105)+1):
for j in range(int((X-105*i)/104)+1):
for k in range(int((X-105*i-104*j)/103) +1):
for l in range(int((X-105*i-104*j-103*k)/102) +1):
for m in range(int((X-105*i-104*j-103*k-102*l)/101)+1):
if (... | X= int(eval(input()))
val = X // 100
diff = X % 100
if diff <= 5*val:
print((1))
else:
print((0)) | p02843 |
x = int(eval(input()))
# 最大n個は買う必要がある
n = x // 100
# 最低m個買う必要がある
m = x // 105
ans = 0
# もし割り切れたら、OK
for i in range(100,106):
if x % i == 0:
ans = 1
break
import itertools
shinamono = [100,101,102,103,104,105] * (n)
for i in range(m,n+1):
if ans == 1:
break
a = itertools.combina... | x = int(eval(input()))
ans = 0
for i in range(1,100001):
if 100 * i <= x and 105 * i >= x:
ans = 1
break
print(ans)
| p02843 |
import itertools
X = int(eval(input()))
num = X//100
r = X % 100
li = [0, 1, 2, 3, 4, 5]
flag = False
for i in itertools.product(li, repeat=num):
if sum(i) == r:
flag = True
break
print(('1' if flag else '0')) | X = int(eval(input()))
flag = False
for i in range(1, X+1):
if 100*i <= X <= 105*i:
flag = True
break
print(('1' if flag else '0'))
| p02843 |
x=int(eval(input()))
for i in range(1,100000):
if 100*i<=x<=105*i:
print((1))
exit()
print((0)) | x=int(eval(input()))
print((1 if x<=x//100*105 else 0)) | p02843 |
import sys
x = int(eval(input()))
number = int(x/100)
xn = x-number*100
number = number+1
for i in range(0,number):
for j in range(0,number-i):
for k in range (0,number-i-j):
for l in range(0,number-i-j-k):
for m in range(0,number-i-j-k-l):
fo... | import sys
x = int(eval(input()))
number = int(x/100)
number = number+1
for i in range(0,number):
for j in range(0,number-i):
for k in range (0,number-i-j):
for l in range(0,number-i-j-k):
for m in range(0,number-i-j-k-l):
for n in range(0,numb... | p02843 |
from itertools import combinations
import sys
"""
10の６条
ijklm
"""
X = int(eval(input()))
P = [1, 2, 3, 4, 5]
if 1 <= X <= 99:
print("0")
sys.exit(0)
a = X % 100
b = X // 100
if a == 0:
print("1")
sys.exit(0)
for i in range(20):
for j in range(25):
for k in range(3... | X = int(eval(input()))
flag = False
for i in range(X + 1):
if 100 * i <= X <= 105 * i:
flag = True
if flag:
print((1))
else:
print((0)) | p02843 |
x = int(input())
def a(lst, target, with_replacement=False):
def _a(idx, l, r, t, w):
if t == sum(l):
r.append(l)
return r
elif t < sum(l): return
for u in range(idx, len(lst)):
_a(u if w else (u + 1), l + [lst[u]], r, t, w)
return r
... | x = int(input())
cnt = int(x/100)
print(1) if x-cnt*105<=0 else print(0)
| p02843 |
x=int(eval(input()))
ans=0
for i in range(x//105+1):
for j in range(x//104+1):
for k in range(x//103+1):
for l in range(x//102+1):
for m in range(x//101+1):
for n in range(x//100+1):
if i*105+j*104+k*103+l*102+m*101+n*100==x:
... | x=int(eval(input()))
num = x//100
div = x%100
ans=0
if 0<=div<=(num*5):
ans=1
print(ans) | p02843 |
# -*- coding: utf-8 -*-
X = int(eval(input()))
num = X // 100
reminder = X % 100
if reminder == 0:
print("1")
exit()
for i in range(num+1):
for j in range(num+1):
if i+j > num:
continue
for k in range(num+1):
if i+j+k > num:
continue... | # -*- coding: utf-8 -*-
X = int(eval(input()))
num = X // 100
if num*100 <= X and X<=num*105:
print("1")
else:
print("0")
| p02843 |
x = int(eval(input()))
y = x // 100
z = x % 100
t = 0
for i in range(101):
if t == 1 or i>y:
break
for j in range(101):
if t == 1 or i+j > y:
break
for k in range(101):
if t == 1 or i+j+k > y:
break
for l in range(101):... | x = int(eval(input()))
x_ = x%100
t = 0
a = 5
while x_ != 0:
t += x_//a
x_ -= (x_//a)*a
a -= 1
if x//100 >= t:
print((1))
else:
print((0)) | p02843 |
x = int(eval(input()))
dp = [False] * (x + 1)
dp[0] = True
for j in range(100, x + 1):
for t in range(100, 105 + 1):
if j - t >= 0:
dp[j] = dp[j] or dp[j - t]
print((1 if dp[x] else 0))
| def solve():
x = int(eval(input()))
min_ = x // 105
max_ = x // 100
for c in range(max_, max_ + 1):
if 100 * c <= x <= 105 * c:
return 1
return 0
print((solve()))
# 品物の個数 C が決まっていると、合計価格としてありうるものは 「100 × C 円以上 105 × C 円以下」 す
# べてになります。ですので、判定が簡単です。
# C = 1, 2... | p02843 |
X=int(eval(input()))
N=X//100
for a in range(N+1):
for b in range(N+1):
for c in range(N+1):
for d in range(N+1):
for e in range(N+1):
for f in range(N+1):
if 100*a+101*b+102*c+103*d+104*e+105*f==X:
print('1')
exit()
print('0') | X=int(eval(input()))
N=X%100
if N%5==0:
if N//5<=X//100:
print('1')
else:
print('0')
else:
if N//5+1<=X//100:
print('1')
else:
print('0') | p02843 |
import itertools as it
num = int(eval(input()))
item_number = num//100
res_list = []
candi_list = list(it.combinations_with_replacement([100, 101, 102, 103, 104, 105], item_number))
candi_ans_list = [sum(item) for item in candi_list]
if num in candi_ans_list:
print((1))
else:
print((0)) | import itertools as it
num = int(eval(input()))
item_number = num//100
if item_number>= 20:
item_number = 20
res_list = []
candi_list = list(it.combinations_with_replacement([100, 101, 102, 103, 104, 105], item_number))
candi_ans_list = [sum(item) for item in candi_list]
if num >= 2000:
print... | p02843 |
import itertools as it
num = int(eval(input()))
item_number = num//100
if item_number>= 20:
item_number = 20
res_list = []
candi_list = list(it.combinations_with_replacement([100, 101, 102, 103, 104, 105], item_number))
candi_ans_list = [sum(item) for item in candi_list]
if num >= 2000:
print... | import itertools as it
num = int(eval(input()))
item_number = num//100
temp_val = num%100
times = temp_val //15
temp_val = temp_val % 15
if temp_val <= 5:
temp_val = 1
elif temp_val <= 10:
temp_val = 2
else:
temp_val =3
need_item_number = 3*times + temp_val
# print(item_number)
# p... | p02843 |
X=int(eval(input()))
dp=[0]*(X+105)
dp[0]=1
for x in range(X):
if dp[x]==1:
for price in range(100,106):
dp[x+price]=1
print((dp[X])) | X=int(eval(input()))
div=X//100
mod=X%100
print((1 if 5*div>=mod else 0)) | p02843 |
X = int(eval(input()))
t = X%100
k = X//100
if k*5 >= t:
print((1))
else:
print((0))
| X = int(eval(input()))
t = X//100
if 0 <= X%100 <= t*5:
print((1))
else:
print((0))
| p02843 |
X = int(eval(input()))
A = [100,101,102,103,104,105]
dp = [[-1 for _ in range(X+1)] for _ in range(7)]
for i in range(1,7):
dp[i][0] = 10**6
for i in range(1,7):
for j in range(1,X+1):
if dp[i-1][j]>=0:
dp[i][j] = 10**6
elif j<A[i-1] or dp[i][j-A[i-1]]<=0:
dp[i]... | X = int(eval(input()))
x = X%100
cnt = 0
cnt += x//5
x = x%5
cnt += x//4
x = x%4
cnt += x//3
x = x%3
cnt += x//2
x = x%2
cnt += x
X = X-X%100
if X>=100*cnt:
print((1))
else:
print((0)) | p02843 |
import itertools
X=int(eval(input()))
l=[100,101,102,103,104,105]
for i in range(1,X//100+1):
for v in itertools.combinations_with_replacement(l,i):
if sum(v)==X:
print((1))
exit()
print((0)) | N=int(eval(input()))
n=N//100
if n>0:
m=N%100
if m/n<=5:
print((1))
else:
print((0))
else:
print((0)) | p02843 |
from itertools import combinations
n= int(eval(input()))
l = [100,101,102,103,104,105]
res = [comb for i in range(1,10**5) for comb in combinations(l, i) if sum(comb) == n]
if len(res) >= 1:
print((1))
else:
print((0)) | x = int(eval(input()))
n = x%100
q,r=divmod(n,5)
if r:
q+=1
if x//100 >= q:
print((1))
else:
print((0)) | p02843 |
x = int(eval(input()))
h = x//100
for a in range(0,h+1):
for b in range(0,h+1):
for c in range(0,h+1):
for d in range(0,h+1):
for e in range(0,h+1):
for f in range(0,h+1):
if 100*a+101*b+102*c+103*d+104*e+105*f==x:
... | x = int(eval(input()))
l = -(-x//105)
h = x//100
fix = l*100
for b in range(0,h+1):
for c in range(0,h+1):
for d in range(0,h+1):
for e in range(0,h+1):
for f in range(0,h+1):
if fix + 1*b+2*c+3*d+4*e+5*f==x:
print('1')
... | p02843 |
x = int(eval(input()))
l = -(-x//105)
h = x//100
fix = l*100
for b in range(0,h+1):
for c in range(0,h+1):
for d in range(0,h+1):
for e in range(0,h+1):
for f in range(0,h+1):
if fix + 1*b+2*c+3*d+4*e+5*f==x:
print('1')
... | x = int(eval(input()))
l = -(-x//105)
h = x//100
#fix = l*100
for i in range(l,h+1):
for b in range(0,i+1):
for c in range(0,i+1):
for d in range(0,i+1):
for e in range(0,i+1):
if x - (i*100 + 1*b+2*c+3*d+4*e+5*(i-b-c-d-e)) == 0:
... | p02843 |
X = int(eval(input()))
dp = [0]*(X+1)
dp[0] = 1
for i in range(X+1):
for j in [100, 101, 102, 103, 104, 105]:
if i-j>=0 and dp[i-j]:
dp[i] = 1
print((dp[X])) | X = int(eval(input()))
dp = [0]*(X+1)
dp[0] = 1
for i in range(100, X+1):
dp[i] = dp[i-100] or dp[i-101] or dp[i-102] or dp[i-103] or dp[i-104] or dp[i-105]
print((dp[X])) | p02843 |
x = int(eval(input()))
item_list = [100,101,102,103,104,105] * 1000
def part_sum(a,A):
#初期化
N = len(a)
dp = [[0 for i in range(A+1)] for j in range(N + 1)]
dp[0][0] = 1
#DP
for i in range(N):
for j in range(A+1):
if a[i] <= j :
dp[i + 1][j] = ... | x = int(eval(input()))
dp = [0]*(x + 106)
dp[0] = 1
for i in range(x):
if dp[i] == 1:
dp[i + 100] =1
dp[i + 101] =1
dp[i + 102] =1
dp[i + 103] =1
dp[i + 104] =1
dp[i + 105] =1
if dp[x] ==1:
print((1))
else :
print((0))
| p02843 |
X = int(eval(input()))
hasuu = X % 100
product_count = X // 100
# print(hasuu)
# print(product_count)
if product_count * 5 >= hasuu:
print("1")
else:
print("0")
| X = int(eval(input())) # 金額
product_amount = X // 100
hasuu = X % 100
# print(product_amount)
# print(hasuu)
if 5 * product_amount >= hasuu:
print((1))
else:
print((0))
| p02843 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.