input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
cnt = 0
for i in range(1, n + 1):
cnt2 = 0
for j in range(1, i + 1):
if i % j == 0 and i % 2 != 0:
cnt2 += 1
if cnt2 == 8:
cnt += 1
print(cnt)
| n = int(eval(input()))
cnt_t = 0
for i in range(1, n + 1, 2):
cnt = 0
t = i
for j in range(1, t + 1):
if t % j == 0:
cnt += 1
if cnt == 8:
cnt_t += 1
print(cnt_t)
| p03281 |
from bisect import bisect_right
print((bisect_right([105,135,165,189,195],int(eval(input()))))) | n=int(eval(input()))
L=[105,135,165,189,195]
print((len(list([x for x in L if x<=n])))) | p03281 |
#python3
from math import floor, sqrt
def f(x):
p = set()
for i in range(1, floor(sqrt(x))+1):
if x%i == 0:
p.add(i)
p.add(x//i)
return len(p)
def main():
n = int(eval(input()))
cnt = 0
for i in range(1, n+1):
if i%2 != 0:
if f(... | #python3
def div(x):
a = []
i = 1
while i*i<x:
if x%i == 0:
a.append(x//i)
a.append(i)
i+=1
n = len(a)
return n
def main():
n = int(eval(input()))
c = 0
for i in range(1, n+1):
if (i%2 != 0) and (div(i) == 8):
... | p03281 |
n = int(eval(input()))
cnt = 0
ans = 0
ans = 0
for i in range(1, n+1,2):
cnt = 0
for j in range(1, n+1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
| N = int(eval(input()))
def make_divisor(n):
divisors = []
for i in range(1, int(n**.5) + 1):
if n%i == 0:
divisors.append(i)
if i != n//i:
divisors.append(n//i)
divisors.sort()
return divisors
cnt = 0
for i in range(1, N+1):
if len(make_d... | p03281 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
count = 0
for i in range(1, N + 1):
a = []
all_odd = 0
for j in range(1, i + 1):
if i % j == 0:
a.append(j)
for k in a:
if k % 2 == 0:
all_odd += 1
if all_odd == 0 and len(a) == 8:
count +... | # -*- coding: utf-8 -*-
N = int(eval(input()))
count = 0
for i in range(1, N + 1):
a = []
if i % 2 == 0:
continue
for j in range(1, i + 1):
if i % j == 0:
a.append(j)
if len(a) == 8:
count += 1
print(count)
| p03281 |
n=int(eval(input()))
odd_list=list(range(1,n+1,2))
#print(odd_list)
cnt=0
for i in odd_list:
ind=0
temp=0
while True:
if ind>=len(odd_list):break
if i<odd_list[ind]:break
if i%odd_list[ind]==0:temp+=1
ind+=1
if temp==8:
cnt+=1
#print(odd_list)
print... | n=int(eval(input()))
ans=0
for i in range(1,n+1,2):
num=int(i**0.5)
cnt=0
for j in range(1,num+1):
if i%j==0:
cnt+=2
if cnt==8:
ans+=1
print(ans) | p03281 |
N = int(eval(input()))
result = 0
for i in range(1, N+1):
count = 0
for j in range(1, i+1):
if i % j == 0:
count += 1
if i%2 == 1 and count == 8:
result += 1
print(result) | N = int(eval(input()))
result = 0
for i in range(1, N+1):
if i%2 == 0:
continue
count = 0
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8:
result += 1
print(result) | p03281 |
N = int(eval(input()))
L = []
for i in range(1,N+1) :
if i % 2 != 0 :
l = 0
for j in range(1,201) :
if i % j == 0 :
l += 1
L.append(l)
print((L.count(8)))
| N = int(eval(input()))
L = []
for j in range(1,201) :
counter = 0
if j % 2 != 0 :
for i in range(1,N+1) :
if j % i == 0 :
counter += 1
if counter == 8 :
L.append(j)
p = 0
for i in L :
if i <= N :
p += 1
else :
bre... | p03281 |
N = int(eval(input()))
ans = 0
for n in range(1, N+1, 2):
count = 0
for i in range(1, n+1):
if n % i == 0:
count += 1
if count == 8:
ans += 1
print(ans) | N = int(eval(input()))
def div_count(i):
count = 0
for div in range(1, i+1):
if i % div == 0:
count += 1
return count
ans = 0
for i in range(1, N+1, 2):
if div_count(i) == 8:
ans += 1
print(ans) | p03281 |
import collections
n = int(eval(input()))
def eratosthenes(n):
sieve = [True for _ in range(n + 1)]
sieve[0] = False
sieve[1] = False
def _update(p):
if sieve[p]:
for i in range(p * 2, n + 1, p):
sieve[i] = False
_update(2)
p = 3
whil... | n = int(eval(input()))
res = 0
for k in range(1, n + 1, 2):
count = 0
for i in range(1, k + 1):
if k % i == 0:
count += 1
if count == 8:
res += 1
print(res) | p03281 |
s=[]
for i in range(201)[105::2]:
d=1;k=i
for h in range(2,i+1):
if i%h==0:
cnt=0
while i%h==0:
cnt+=1
i//=h
d*=(cnt+1)
if d==8:
s.append(k)
ans=0;n=int(eval(input()))
for f in s:
if n>=f:ans+=1
print(ans) | s=[105, 135, 165, 189, 195]
ans=0;n=int(eval(input()))
for f in s:
if n>=f:ans+=1
print(ans) | p03281 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
count = 0
if i % 2 == 0:
continue
for j in range(1, i + 1):
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n + 1, 2):
count = 0
for j in range(1, i + 1):
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans)
| p03281 |
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n=n0()
ans=0
for k in range(105,n+1,2):
c=0
for i in range(1,int(k**0.5)+1):
if... | def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n=n0()
ans=0
for k in range(105,n+1,2):
c=0
for i in range(1,k+1):
if k%i==0:
... | p03281 |
n=int(eval(input()))
ans=0
def yakusu(n):
cnt=0
for i in range(1,int(n**0.5)+1):
if n%i==0:
cnt+=1
if i**2!=n:
cnt+=1
return cnt
for i in range(1,n+1,2):
if yakusu(i)==8:
ans+=1
print(ans) | n=int(eval(input()))
ans=0
def make_divisors(n):
divisors=[]
for i in range(1,int(n**0.5)+1):
if n%i == 0:
divisors.append(i)
if i != n//i:
divisors.append(n//i)
return len(divisors)
for i in range(1,n+1,2):
if make_divisors(i)== 8... | p03281 |
N = int(eval(input()))
res = 0
for n in range(1, N+1, 2):
cnt = 0
for i in range(1, n+1):
if n % i == 0:
cnt += 1
if cnt == 8:
res += 1
print(res) | n = int(eval(input()))
ans = 0
for i in range(1,n+1,2):
con =0
for j in range(1,i+1):
if i % j == 0:
con += 1
if con == 8:
ans += 1
print(ans) | p03281 |
N = int(eval(input())) + 1
nums_count = 0
for i in range(1, N):
if i % 2 == 0:
continue
count = 1
for j in range(1, int(i / 2)): # 8なら1,2,4,8で、1~4までやれば良い。最後に自分をたす あれ、もしかしてN/3?
if i % j == 0:
count += 1
if count == 8:
nums_count += 1
print(nums_count)
| N = int(eval(input())) + 1
nums_count = 0
for i in range(1, N):
if i % 2 == 0:
continue
count = 1
for j in range(1, int(i / 3) + 1): # 8なら1,2,4,8で、1~4までやれば良い。最後に自分をたす あれ、もしかしてN/3?
if i % j == 0:
count += 1
if count == 8:
nums_count += 1
print(nums_count)... | p03281 |
n=int(eval(input()))
ans=0
for i in range(1,n+1):
count=0
for j in range(1,i+1):
if i%j==0:
count+=1
if i%2==1 and count==8:
ans+=1
print(ans) | n=int(eval(input()))
def make_divisors(n):
divisors=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
divisors.append(i)
if i!=n//i:
divisors.append(n//i)
divisors.sort()
return divisors
ans=0
for i in range(1,n+1):
if i%2==1 and len(make_divisors(i))==8:
ans+=1
print(... | p03281 |
n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
count = 0
for j in range(1, n + 1):
if i % 2 == 0:
break
if i % j == 0:
count += 1
if count == 8:
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1, n + 1):
if i % 2 == 1:
cnt = 0
for j in range(1, i + 1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | p03281 |
def div(n):
d=0
for i in range(1, n+1):
if n%i==0:
d+=1
return d
n=int(eval(input()))
ans=0
for i in range(1, n+1, 2):
if div(i)==8:
ans+=1
print(ans)
| N = int(eval(input()))
ans = 0
for x in range(1, N + 1, 2):
d = 0
for y in range(1, int(x ** 0.5 + 0.5) + 1):
if x % y == 0:
d += 1
if y * y != x:
d += 1
if d == 8:
ans += 1
print(ans)
| p03281 |
n = int(eval(input()))
ans = 0
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, n+1):
if(i % j == 0):
cnt += 1
if(cnt == 8):
ans += 1
print(ans) | N = int(eval(input()))
def sum_up(num):
cnt_n = 0
for i in range(105, num+1, 2):
tmp = 0
for j in range(1, i+1):
if(i%j == 0):
tmp += 1
if(tmp > 8):
break
if(tmp == 8):
cnt_n += 1
return cnt_n
... | p03281 |
while 1:
try:
h=[eval(input()) for i in [1]*5]
l=set(h)
if 1 in l and 2 in l:w=1
elif 1 in l and 3 in l:w=3
else:w=2
if len(l)!=2:
for i in h:print(3)
else:
for i in h:print(1 if i==w else 2)
except:break | while 1:
try:
h=[eval(input()) for i in [1]*5]
if 1 in h and 2 in h:w=1
elif 1 in h:w=3
else:w=2
if len(set( h))!=2:
for i in h:print(3)
else:
for i in h:print(1 if i==w else 2)
except:break | p00205 |
n,t=list(map(int,input().split()))
mncst=1001
for i in range(n):
a,b=list(map(int,input().split()))
if b<=t:
if a<mncst:
mncst=a
if mncst==1001:
mncst='TLE'
print(mncst) | firstLine = list(map(int, input().split()))
costs = []
for i in range(firstLine[0]):
line = list(map(int, input().split()))
if line[1]> firstLine[1]:
continue
else:
costs.append(line[0])
if len(costs)>0:
print((sorted(costs)[0]))
else:
print("TLE") | p03239 |
# ABC112B - Time Limit Exceeded
n, t = list(map(int, input().rstrip().split()))
data = [list(map(int, input().rstrip().split())) for _ in range(n)]
match = []
for i in range(n):
if data[i][1] <= t:
match.append(data[i][0])
if match == []:
print("TLE")
else:
print((min(match))) | # ABC112B - Time Limit Exceeded
import sys
input = sys.stdin.readline
def main():
n, t = tuple(map(int, input().rstrip().split()))
data = tuple(tuple(map(int, input().rstrip().split())) for _ in range(n))
match = {i[0] for i in data if i[1] <= t}
if match == set():
print("TLE")
el... | p03239 |
def a():
n=list(map(int, input().split()))
c=list()
t = list()
for i in range(n[0]):
s = list(map(int, input().split()))
c.append(s[0])
t.append(s[1])
z=list()
z[len(z):]=t[:len(t)]
z.sort()
if z[0]>n[1]:
print("TLE")
return 0
l=0... | def MRX():
N,T = input().split()
N,T= int(N),int(T)
travel = {}
for i in range(N):
c , t = input().split()
travel[int(c)] = int(t)
for j in sorted(travel):
if travel[j] <= T:
return j
return "TLE"
print((MRX())) | p03239 |
N,T = list(map(int,input().split()))
ans = [1001,0]
status = 0
for i in range(N):
c,t = list(map(int,input().split()))
if t <= T and c < ans[0]:
ans[0] = c
ans[1] = t
status = 1
else:
pass
if status == 0:
print("TLE")
else:
print((ans[0]))
|
N,T = list(map(int,input().split()))
C = 1001
for i in range(N):
c,t = list(map(int,input().split()))
if t > T:
pass
else:
if c < C:
C = c
if C == 1001:
print("TLE")
else:
print(C)
| p03239 |
N,Time = list(map(int,input().split()))
C = []
T = []
for i in range(N):
c,t = list(map(int,input().split()))
if t <= Time:
C.append(c)
T.append(t)
if len(C) == 0:
print("TLE")
else:
print((min(C)))
| N,T = list(map(int,input().split()))
ans = 1e9
for i in range(N):
c,t = list(map(int,input().split()))
if t <= T:
ans = min(ans,c)
if ans == 1e9:
print("TLE")
else:
print(ans) | p03239 |
N,T = list(map(int,input().split()))
root = []
ans = 10**4
for i in range(N):
c,t = list(map(int,input().split()))
root.append([c,t])
for i in range(N):
if root[i][1] > T:
continue
else:
ans = min(ans,root[i][0])
if ans == 10**4:
print("TLE")
else:
print(ans) | N, T = list(map(int, input().split()))
ans = 10 ** 4
root = [list(map(int, input().split())) for _ in range(N)]
for i in range(N):
if root[i][1] > T:
continue
else:
ans = min(ans, root[i][0])
print(("TLE" if ans == 10 ** 4 else ans))
| p03239 |
N,T = (int(i) for i in input().split())
cs = []
for i in range(N):
c,t = (int(i) for i in input().split())
if t <= T:
cs.append(c)
if len(cs) == 0:
print("TLE")
else:
print((min(cs))) | N,T = (int(i) for i in input().split())
cost = 10000
for i in range(N):
c,t = (int(k) for k in input().split())
if t <= T and c < cost:
cost = c
if cost == 10000:
print("TLE")
else:
print(cost) | p03239 |
N, T = list(map(int, input().split()))
ans = 1001
for i in range(N):
tmp = list(map(int, input().split()))
if tmp[1] <= T:
ans = min(ans, tmp[0])
print((ans if ans != 1001 else "TLE"))
| N, T = list(map(int, input().split()))
ans = 1001
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(c, ans)
if ans == 1001:
print('TLE')
else:
print(ans)
| p03239 |
n,t=list(map(int,input().split()));c=[]
for i in range(n):
a,b=list(map(int,input().split()))
if b<=t:
c.append(a)
if c==[]:print("TLE")
else:c.sort();print((c[0])) | n,t=list(map(int,input().split()))
ans=10**9
for i in range(n):
c,tt=list(map(int,input().split()))
if tt<=t:ans=min(ans,c)
if ans==10**9:print("TLE")
else:print(ans) | p03239 |
import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in list(inspect.currentframe().f_back.f_locals.items())
}
print(... | p03239 |
route_num, limit = list(map(int, input().split(' ')))
costs = []
spends = []
for i in range(route_num):
cost, spend = list(map(int, input().split(' ')))
costs.append(cost)
spends.append(spend)
min_cost = 2000
for cost, spend in zip(costs, spends):
if spend <= limit and cost < min_cost:
... | route_num, limit = list(map(int, input().split(' ')))
costs = []
spends = []
for i in range(route_num):
cost, spend = list(map(int, input().split(' ')))
costs.append(cost)
spends.append(spend)
max_cost = 2000
for cost, spend in zip(costs, spends):
if spend <= limit and cost < max_cost:
... | p03239 |
n,T = list(map(int,input().split()))
ct = []
mn = 1001
for i in range(n):
c,t = list(map(int,input().split()))
if T >= t:
if mn > c:
mn = c
print(("TLE" if mn==1001 else mn)) | n,T = list(map(int,input().split()))
mn = 10**6
for i in range(n):
c,t = list(map(int,input().split()))
if T >= t:
if mn > c:
mn = c
print(('TLE' if mn==10**6 else mn)) | p03239 |
n,t = list(map(int,input().split()))
ct = [list(map(int,input().split())) for i in range(n)]
T = []
for h in range(n):
T.append(ct[h][1])
if min(T) > t:
print("TLE")
exit()
else:
for j in range(n):
if ct[j][1] <= t:
c = ct[j][0]
k = j
break
for i in range(k+1,n):
... | n,T = list(map(int,input().split()))
tmp = 114514
for i in range(n):
c,t = list(map(int,input().split()))
if t <= T:
tmp = min(tmp,c)
if tmp == (114514):
print("TLE")
else:
print(tmp) | p03239 |
N, T = list(map(int, input().split()))
path_list = [list(map(int, input().split())) for _ in range(N)]
min_cost = 1001
for path in path_list:
if T >= path[1] and path[0] < min_cost:
min_cost = path[0]
print((min_cost if min_cost < 1001 else 'TLE')) | n, t = list(map(int, input().split()))
ct = list([x for x in [list(map(int, input().split())) for i in range(n)] if x[1] <= t])
print(("TLE" if len(ct) == 0 else min(ct)[0]))
| p03239 |
a, b = list(map(int,input().split()))
list1=[]
list2=[]
for i in range (a):
x,y=list(map (int,input().split()))
list1.append(x)
list2.append(y)
mini= 0x3f3f3f3f
for i in range (a) :
if list1[i] < mini and list2[i] <= b :
mini=list1[i]
if (mini!= 0x3f3f3f3f):
print(mini)
els... | N,T= [int(x) for x in input().split()]
c=0
t=0
z=0
x=0
mini=0
lcost=[]
ltime=[]
cost=[]
time=[]
for i in range(N):
c,t=[int(x) for x in input().split()]
cost.append(c)
time.append(t)
for i in time:
z+=1
if i <= T:
ltime.append(i)
lcost.append(cost[z-1])
if ltime=... | p03239 |
n, t = list(map(int,input().split()))
ts = []
for i in range(n):
c = list(map(int,input().split()))
if c[1] <= t:
ts.append(c[0])
if ts == []:
print('TLE')
else:
print((min(ts))) | n, t = list(map(int, input().split()))
stack = []
for i in range(n):
c, ts = list(map(int, input().split()))
if ts <= t:
stack.append(c)
print((min(stack) if stack != [] else 'TLE')) | p03239 |
n, T = [int(i) for i in input().split()]
mn = 10000
for i in range(n):
c,t = [int(i) for i in input().split()]
if t <= T:
mn = min(mn, c)
print(("TLE" if mn == 10000 else mn))
| n, T = list(map(int, input().split()))
ans = float("inf")
for _ in range(n):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(ans, c)
if ans == float("inf"):
ans = "TLE"
print(ans)
| p03239 |
N, T = list(map(int, input().split()))
ans = float("inf")
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(c, ans)
if ans == float("inf"):
print("TLE")
else:
print(ans) | N, T = list(map(int, input().split()))
ans = 1005
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(c, ans)
if ans < 1005:
print(ans)
else:
print("TLE") | p03239 |
n,t = list(map(int,input().split()))
c = []
for i in range(n):
c1,t1 = list(map(int,input().split()))
if t1 <= t:
c.insert(i,c1)
if len(c) == 0:
print("TLE")
else:
c.sort(key=int)
print((c[0])) | n,t = list(map(int,input().split()))
c = []
for _ in range(n):
c1,t1 = list(map(int,input().split()))
if t1 <= t:
c.append(c1)
if len(c) == 0:
print("TLE")
else:
c.sort(key=int)
print((c[0])) | p03239 |
N, T = list(map(int, input().split()))
CT = [tuple(map(int, input().split())) for _ in range(N)]
minimum = min(CT, key=lambda ct:[ct[0], 1001][not(ct[1] <= T)])
print(([minimum[0], "TLE"][not(minimum[1] <= T)]))
| N, T = list(map(int, input().split()))
CT = [tuple(map(int, input().split())) for _ in range(N)]
*CTf, = [ct for ct in CT if ct[1] <= T]
if not CTf:
print("TLE")
exit()
minimum = min(CTf, key=lambda ct:ct[0])
print((minimum[0]))
| p03239 |
N, T = list(map(int, input().split()))
L = [list(map(int, input().split())) for k in range(N)]
ans = 10000
for l in L:
if l[1] <= T:
ans = min(ans,l[0])
print((ans if ans != 10000 else "TLE")) | N, T = list(map(int,input().split()))
ans = float("inf")
for k in range(N):
c, t = list(map(int,input().split()))
if t <= T:
ans = min(ans, c)
print((ans if ans <= 1000 else "TLE"))
| p03239 |
N,T=list(map(int,input().split()))
C=[list(map(int, input().split())) for _ in range(N)]
e=[]
for i in C:
if T>=i[1]:
e.extend([i[0]])
print(('TLE' if len(e)==0 else min(e))) | N,T=list(map(int,input().split()))
C=[list(map(int, input().split())) for _ in range(N)]
e=10000
for i in C:
if T>=i[1] and e>i[0]:
e=i[0]
print(('TLE' if e==10000 else e)) | p03239 |
N, T = list(map(int, input().split()))
c = [0]*N
t = [0]*N
for i in range(N):
c[i], t[i] = list(map(int, input().split()))
min_cost = 1001
for i in range(N):
if t[i]<=T:
min_cost = min(c[i],min_cost)
if min_cost == 1001:
print("TLE")
else:
print(min_cost) | N,T = list(map(int, input().split()))
c = [0]*N
t = [0]*N
cost = 1001
for i in range(N):
c[i], t[i] = list(map(int,input().split()))
if t[i]<=T:
cost = min(cost,c[i])
if cost == 1001:
print("TLE")
else:
print(cost) | p03239 |
n,t,*l=list(map(int,open(0).read().split()))
c=3e9
for i,j in zip(l[::2],l[1::2]):
if j<=t:
c=min(c,i)
print((c*(c<3e9)or"TLE")) | N,T,*L=list(map(int,open(0).read().split()))
print((min([1111]+[c for c,t in zip(*[iter(L)]*2)if t<=T])%1111or"TLE")) | p03239 |
import itertools
import math
import fractions
import functools
import copy
N, T = list(map(int, input().split()))
c= []
t = []
for i in range(N):
ci, ti = list(map(int, input().split()))
c.append(ci)
t.append(ti)
cost = 10**10
for i in range(N):
if t[i] <= T:
cost = min(cos... | def main():
# n = int(input())
n, t = list(map(int, input().split()))
# a = list(map(int, input().split()))
# s = input()
ct = []
for _ in range(n):
ct.append(list(map(int, input().split())))
mini = 10**10
for i in range(n):
if ct[i][1] <= t and ct[i][0] < min... | p03239 |
import math
N, T = list(map(int, input().split()))
c_list = []
for i in range(N):
c1, t1=[int(i) for i in input().split()]
if t1 <= T:
c_list.append(c1)
if not c_list:
print('TLE')
else:
print((min(c_list)))
| n, T = list(map(int, input().split()))
ans = 1003
for _ in range(n):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(ans, c)
print(('TLE' if ans == 1003 else ans))
| p03239 |
N, T = list(map(int, input().split()))
ans = float('inf')
for i in range(N):
c, t = list(map(int, input().split()))
if t <= T:
if c <= ans:
ans = c
if ans == float('inf'):
print('TLE')
else:
print(ans) | N, T = list(map(int, input().split()))
ans = float('inf')
for i in range(N):
c, t = list(map(int, input().split()))
if t <= T:
ans = min(ans, c)
if ans == float('inf'):
print('TLE')
else:
print(ans) | p03239 |
N, T = list(map(int, input().split()))
C = []
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= T:
C.append(c)
if C == []:
print("TLE")
else:
print((min(C)))
| N, T = list(map(int, input().split()))
ct = [list(map(int, input().split())) for _ in range(N)]
cti = [i for i in ct if i[1] <= T]
if len(cti) == 0:
print("TLE")
else:
print((min(cti)[0]))
| p03239 |
N, T = list(map(int, input().split()))
ct = []
for i in range(N):
ct.append([int(i) for i in input().split()])
ct.sort(key=lambda x: x[0])
ans = 1001
for i in range(N):
if ct[i][1] <= T:
ans = ct[i][0]
break
print(("TLE" if ans == 1001 else ans))
| N, T = list(map(int, input().split()))
ct = [[int(j) for j in input().split()] for i in range(N)]
ct.sort(key=lambda x: x[0])
ans = 1001
for i in range(N):
if ct[i][1] <= T:
ans = ct[i][0]
break
print(("TLE" if ans == 1001 else ans))
| p03239 |
n,t=list(map(int,input().split()))
xList=[]
for i in range(n):
x,y=list(map(int,input().split()))
if y<=t:
xList.append(x)
if len(xList)==0:
print('TLE')
exit()
minn=xList[0]
for i in xList:
if i<minn:
minn=i
print (minn)
| N,T=input().split()
aaaaaaaaaaaaaaaaaaaaaa=0
b=0
for i in range(int(N)):
c,t=input().split()
if int(t)<=int(T):
if b==0:
aaaaaaaaaaaaaaaaaaaaaa=c
b+=1
if int(c)<int (aaaaaaaaaaaaaaaaaaaaaa):
aaaaaaaaaaaaaaaaaaaaaa=c
i+=1
if aaaaaaaaaaaa... | p03239 |
N,T = (input().split())
N = int(N)
T = int(T)
roads = []
for i in range(N) :
c , t = input().split()
t = int(t)
if t in range (1, T + 1):
roads.append((int(c) ,t))
if len(roads) == 0 :
print ("TLE")
else:
roads.sort()
print((roads[0][0])) | N, T=list(map(int, input().split()))
'''aux=[input().split() for _ in range(N)]
aux.sort()'''
c, aux=[], []
for i in range(N):
x, y=list(map(int, input().split()))
if(y<=T):
aux=[[int(x), int(y)]]
c.extend(aux)
if (len(c)==0):
print("TLE")
else:
aux=min(c)
print((aux[0])) | p03239 |
n, T = list(map(int, input().split()))
ct = [list(map(int, input().split())) for _ in range(n)]
ans = []
for i in ct:
if i[1] <= T:
ans.append(i[0])
if len(ans) == 0:
print('TLE')
else:
print((min(ans))) | n, T = list(map(int, input().split()))
ct = [list(map(int, input().split())) for _ in range(n)]
li = []
for i in ct:
if i[1] <= T:
li.append(i[0])
if len(li) != 0:
print((min(sorted(li))))
else:
print('TLE') | p03239 |
def ans():
N, T = list(map(int,input().split()))
cost = 1e9
for _ in range(N):
c, t = list(map(int,input().split()))
if(t <= T):
if(cost > c):
cost = c
if(cost == 1e9):
print("TLE")
else:
print(cost)
ans() | N, T = list(map(int,input().split()))
ans = 1e9
for i in range(N):
c, t = list(map(int,input().split()))
if(t <= T):
ans = min(ans, c)
if(ans == 1e9):
ans = "TLE"
print(ans) | p03239 |
n,t = list(map(int,input().split()))
minc = 10000
for i in range(n):
ci,ti = list(map(int,input().split()))
if ti<=t:
minc = min(minc,ci)
if minc == 10000:
print("TLE")
else:
print(minc) | ans = 10000
n,t = list(map(int,input().split()))
for i in range(n):
ci,ti = list(map(int,input().split()))
if ti <= t:
ans = min(ans,ci)
if ans == 10000:
ans = "TLE"
print(ans) | p03239 |
N, T = list(map(int, input().split()))
c = []
t = []
for _ in range(N):
_c, _t = list(map(int, input().split()))
if _t <= T:
c.append(_c)
t.append(_t)
if len(c) == 0:
print('TLE')
else:
print((min(c)))
| N, T = list(map(int, input().split()))
min_c = 1001
for _ in range(N):
_c, _t = list(map(int, input().split()))
if _t <= T:
min_c = min(min_c, _c)
if min_c == 1001:
print('TLE')
else:
print(min_c)
| p03239 |
# https://beta.atcoder.jp/contests/abc112/tasks/abc112_b
def solve():
cost = 1001
N, time = list(map(int, input().split()))
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= time:
if c <= cost:
cost = c
if cost == 1001:
pr... | def solve():
cost = 1001
N, time = list(map(int, input().split()))
for _ in range(N):
c, t = list(map(int, input().split()))
if t <= time and c <= cost:
cost = c
print(('TLE' if cost is 1001 else cost))
if __name__ == '__main__':
solve()
| p03239 |
n,t=input().split()
n,t=int(n),int(t)
c=1001
for i in range(n):
ck,tk=input().split()
if int(tk)<=t and int(ck)<c:
c=int(ck)
if c==1001:
print("TLE")
else:
print(c)
| n,t=list(map(int,input().split()))
ct=[list(map(int,input().split())) for i in range(n)]
c=10000000000000000
for i in range(n):
if ct[i][1]<=t:
c=min(c,ct[i][0])
print((c if c!=10000000000000000 else "TLE")) | p03239 |
def main():
N , M, K = list(map(int, input().split()))
A_list = list(map(int, input().split()))
B_list = list(map(int, input().split()))
al = [0]
bl = [0]
for i in range(N) :
al.append(al[i] + A_list[i])
for i in range(M) :
bl.append(bl[i] + B_list[i])
#prin... | def main():
N , M, K = list(map(int, input().split()))
A_list = list(map(int, input().split()))
B_list = list(map(int, input().split()))
al = [0]
bl = [0]
for i in range(N) :
al.append(al[i] + A_list[i])
for i in range(M) :
bl.append(bl[i] + B_list[i])
#prin... | p02623 |
A, B, time = input().split(" ")
a = input().split(" ")
Desk_A = a[:int(A)]
b = input().split(" ")
Desk_B = b[:int(B)]
count = 0
time_f = 0
FLAG = True
FLAG2 = True
i = 0
while time_f < int(time):
if i < len(Desk_A) and time_f + int(Desk_A[i]) <= int(time):
time_f = time_f + int(Desk_A[i])
... | N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
a=[0]
b=[0]
for i in range(N):
a.append(a[i]+A[i])
for i in range(M):
b.append(b[i]+B[i])
#print(a)
#print(b)
ans=0
j=M
for i in range(N+1):
if a[i]>K:
break
while b[j]... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
current=0
for i in range(n):
current+=a[i]
asum.append(current)
current=0
pointer=0
for i in range(m):
current+=b[i]
bsum.append(current)
for i in range(n+1):
if asum[i]>k:
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
asum=[0]
bsum=[0]
current=0
for i in range(n):
current+=a[i]
asum.append(current)
current=0
for i in range(m):
current+=b[i]
bsum.append(current)
pointer=0
for i in range(n+1):
if asum[i]>k:
... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
for j in range(m):
bsum+=b[j]
if asum+bsum<=k:
ans=max(ans,(j+1))
for i in range(n):
asum+=a[i]
bsum=0
if asum+bsum<=k:
ans=max(ans,(i+1))
for j in range(m):
bsum+=b[j]
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
pointer=0
while pointer<m and bsum+b[pointer]<=k:
bsum+=b[pointer]
pointer+=1
ans=pointer
for i in range(n):
asum+=a[i]
while asum+bsum>k and pointer>=0:
pointer-=1
bsum-=b[p... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
for j in range(m):
bsum+=b[j]
if asum+bsum<=k:
ans=max(ans,(j+1))
for i in range(n):
asum+=a[i]
bsum=0
if asum+bsum<=k:
ans=max(ans,(i+1))
for j in range(m):
bsum+=b[j]
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
pointer=0
while pointer<m and bsum+b[pointer]<=k:
bsum+=b[pointer]
pointer+=1
ans=pointer
for i in range(n):
asum+=a[i]
while asum+bsum>k and pointer>=0:
pointer-=1
bsum-=b[p... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
for j in range(m):
bsum+=b[j]
if asum+bsum<=k:
ans=max(ans,(j+1))
for i in range(n):
asum+=a[i]
bsum=0
if asum+bsum<=k:
ans=max(ans,(i+1))
for j in range(m):
bsum+=b[j]
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
pointer=0
while pointer<m and bsum+b[pointer]<=k:
bsum+=b[pointer]
pointer+=1
ans=pointer
for i in range(n):
asum+=a[i]
while asum+bsum>k and pointer>=0:
pointer-=1
bsum-=b[p... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
for j in range(m):
bsum+=b[j]
if asum+bsum<=k:
ans=max(ans,(j+1))
for i in range(n):
asum+=a[i]
bsum=0
if asum+bsum<=k:
ans=max(ans,(i+1))
for j in range(m):
bsum+=b[j]
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
asum=0
bsum=0
pointer=0
while pointer<m and bsum+b[pointer]<=k:
bsum+=b[pointer]
pointer+=1
ans=pointer
for i in range(n):
asum+=a[i]
while asum+bsum>k and pointer>=0:
pointer-=1
bsum-=b[p... | p02623 |
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0] * (n + 1)
b = [0] * (m + 1)
for i in range(1, n + 1):
a[i] = A[i - 1] + a[i - 1]
for j in range(1, m + 1):
b[j] = B[j - 1] + b[j - 1]
ans = 0
for i in range(n + 1):
... | n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0] * (n + 1)
b = [0] * (m + 1)
for i in range(1, n + 1):
a[i] = A[i - 1] + a[i - 1]
for j in range(1, m + 1):
b[j] = B[j - 1] + b[j - 1]
ans = 0
num_b = m
for i in range(... | p02623 |
import sys
sys.setrecursionlimit(10**9)
def main():
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.insert(0, 0)
b.insert(0, 0)
a_sum = [0]*(n+1)
a_sum[0] = a[0]
for i in range(1, n+1):
a_sum[i] ... | import sys
sys.setrecursionlimit(10**9)
def main():
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.insert(0, 0)
b.insert(0, 0)
a_sum = [0]*(n+1)
a_sum[0] = a[0]
for i in range(1, n+1):
a_sum[i] ... | p02623 |
from bisect import bisect_right
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
x = [0] * (N + 1)
for i in range(N):
x[i + 1] = x[i] + A[i]
y = [0] * (M + 1)
for i in range(M):
y[i + 1] = y[i] + B[i]
ans = 0
for i in range(... |
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
x = [0] * (N + 1)
y = [0] * (M + 1)
for i in range(N):
x[i + 1] = x[i] + A[i]
for i in range(M):
y[i + 1] = y[i] + B[i]
j = M
ans = 0
for i in range(N + 1):
if x[i] > K:
... | p02623 |
N,M,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
AA = [0]
BB = [0]
r = 0
for i in A:
r += i
AA.append(r)
r = 0
for i in B:
r += i
BB.append(r)
ans = 0
for i,v in enumerate(AA):
for j,w in enumerate(BB):
x = i+j... | N,M,K = list(map(int,input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
AA = [0]
BB = [0]
r = 0
for i in A:
r += i
AA.append(r)
r = 0
for i in B:
r += i
BB.append(r)
ans = 0
a = N
b = 0
while AA[a]+BB[b] > K:
a -= 1
ans = a+b
while a >=... | p02623 |
# coding: utf-8
from bisect import bisect_left
def leq_search(xs, x, s, t):
# x以下で最大のindex
if t-s <= 5:
res = 0
for i in range(s, t):
if xs[i] <= x:
res = i
return res
return max(leq_search(xs, x, s, (s+t)//2), leq_search(xs, x, (s+t)//2,... | # coding: utf-8
from bisect import bisect_left
def leq_search(xs, x, s, t):
# x以下で最大のindex
if t-s <= 5:
res = 0
for i in range(s, t):
if xs[i] <= x:
res = i
return res
i = (s+t)//2
if xs[i] <= x:
return leq_search(xs, x, i, ... | p02623 |
### 解答
#入力はじめ
N,M,K=list(map(int,input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
#入力終わり
#累積和とる
A_wa = [0]
for i in range(N) :
A_wa.append(A_wa[i]+A[i])
B_wa = [0]
for i in range(M) :
B_wa.append(B_wa[i]+B[i])
#累積和計算おわり
ans = 0
for i in r... | ### 解答
#入力はじめ
N,M,K=list(map(int,input().split()))
A=list(map(int, input().split()))
B=list(map(int, input().split()))
#入力終わり
#累積和とる
A_wa = [0]
for i in range(N) :
A_wa.append(A_wa[i]+A[i])
B_wa = [0]
for i in range(M) :
B_wa.append(B_wa[i]+B[i])
#累積和計算おわり
ans = 0
end = N #二... | p02623 |
# C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = tuple(accumulate([0] + AB[:N])), tuple(accumulate(AB[N:]))
res = 0
for i, a_time in enumerate(cum_A):
if a_time > K:
... | # C - Tsundoku
from bisect import bisect
from itertools import accumulate
def main():
N, M, K, *AB = list(map(int, open(0).read().split()))
cum_A, cum_B = accumulate(AB[:N], initial=0), tuple(accumulate(AB[N:]))
candidates = [0]
for i, a in enumerate(cum_A):
if a > K:
br... | p02623 |
n,m,k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a,b = [0], [0]
for i in range(n):
a.append(a[i]+A[i])
for j in range(m):
b.append(b[j]+B[j])
ans, j = 0, m
for i in range(n+1):
if a[i] > k:
break
while a[i] + b[... | import itertools
n,m,k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
acc_A = [0]+list(itertools.accumulate(A))
acc_B = [0]+list(itertools.accumulate(B))
ans, j = 0, m
for i in range(n+1):
if acc_A[i] > k:
break
while acc_A[i... | p02623 |
from bisect import bisect_right
n, m, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
A = [0]
B = [0]
for i in range(n):
A.append(A[-1] + a[i])
for j in range(m):
B.append(B[-1] + b[j])
ans = 0
for i in range(n + 1):
time = ... | from bisect import bisect_right
n, m, k = list(map(int, input().split()))
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
A = [0]
B = [0]
for i in range(n):
A.append(A[-1] + a[i])
for j in range(m):
B.append(B[-1] + b[j])
ans = 0
j = m
for i in range(n + 1):
... | p02623 |
# def helper(i, j, a, b, k, dp):
# n = len(a)
# m = len(b)
# if dp[i][j][k-1] != -1:
# return dp[i][j][k-1]
# # if i == n:
# # dp[i][j][k-1] = 0
# # s = 0
# # for jj in range(j, m):
# # if b[jj] + s > k:
# # return dp[i][j][k-1]
# # dp[i][j][k-1] += 1
# # s += b[jj]
# # return ... | n, m, k = list(map(int, input().split(" ")))
a = list(map(int, input().split(" ")))
b = list(map(int, input().split(" ")))
sa = [0]
for i in range(n):
if (sa[-1] + a[i]) > k:
break
sa.append(sa[-1] + a[i])
sb = [0]
for i in range(m):
if (sb[-1] + b[i]) > k:
break
sb.append(sb[-1] + b[i])
r = 0
... | p02623 |
def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
bs = M
ans = 0
for i in range(N + 1):
asum = sum(A[:i])
if asum > K:
break
for j in range(bs, -1, -1):
if sum(... | def main():
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
bs = M
ans = 0
for i in range(N ... | p02623 |
n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
readable = 0
for rx in range(1,n+m+1):
if readable == rx: break
for ra in range(0,rx+1):
rb = rx - ra
rt = 0
if ra <= len(a) and rb <= len(b):
if ra>0 :
for i in range... | n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = [0] * (n+1)
sb = [0] * (m+1)
for i in range(n):
sa[i+1] = sa[i] + a[i]
for i in range(m):
sb[i+1] = sb[i] + b[i]
rx = 0
rb = m
for ra in range(0,n+1):
while (sb[rb] + sa[ra]) > k and r... | p02623 |
import sys
input = sys.stdin.readline
n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = [0] * (n+1)
sb = [0] * (m+1)
for i in range(n):
sa[i+1] = sa[i] + a[i]
for i in range(m):
sb[i+1] = sb[i] + b[i]
rx = 0
rb = m
for ra in range(0,n... | import sys
input = sys.stdin.readline
def main():
n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = [0] * (n+1)
sb = [0] * (m+1)
for i in range(n):
sa[i+1] = sa[i] + a[i]
for i in range(m):
sb[i+1] = sb[i] + b[i]
rx... | p02623 |
A,B, K=list(map(int,input().split()))
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
res = 0
a=0
b=0
inter = 0
n = max(A, B)
for i in range(n):
if len(List_A)==0 and len(List_B)==0:
break
elif len(List_A)==0 and len(List_B)!=0:
inter+=List_B.pop(0)
if K < ... | A,B,K=list(map(int,input().split()))
List_A = list(map(int, input().split()))
List_B = list(map(int, input().split()))
SumListA=[]
SumListA.append(0)
SumListB=[]
SumListB.append(0)
res =0
a=0
for i in range(A):
SumListA.append(SumListA[i]+List_A[i])
for i in range(B):
SumListB.append(SumListB[i]+List_B[... | p02623 |
n,m,k = list(map(int,input().split()))
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for _ in range(n):
acum1.append(acum1[-1] + arr1[_])
acum2 = [0]
for _ in range(m):
acum2.append(acum2[-1] + arr2[_])
ans = 0
j = m
for i in range(n+1):
if acum1[i... | n,m,k = list(map(int,input().split()))
arr1 = list(map(int,input().split()))
arr2 = list(map(int,input().split()))
acum1 = [0]
for i in range(n):
acum1.append( acum1[-1] + arr1[i])
acum2 = [0]
for i in range(m):
acum2.append(acum2[-1] + arr2[i])
ans = 0
j = m
for i in range(n+1):
if acum1[... | p02623 |
import itertools as it, bisect as bs
f=lambda:list(map(int,input().split()))
g=lambda:[0]+[*it.accumulate(f())]
n,m,k=f()
A,B=g(),g()
a,j=0,m
for i in range(n+1):
t=bs.bisect(B,k-A[i])
if t: a=max(a,i+t-1)
print(a) | from itertools import *
f=lambda:list(map(int,input().split()))
g=lambda:[0]+[*accumulate(f())]
n,m,k=f()
A,B=g(),g()
c,j=0,m
for i,a in enumerate(A):
while j and a+B[j]>k: j-=1
if a+B[j]<=k: c=max(c,i+j)
print(c) | p02623 |
N,M,K = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
A = [0]
B = [0]
for i in range(N):
A.append(A[i]+a[i])
for i in range(M):
B.append(B[i]+b[i])
ans = 0
for i in range(0,N+1):
p = M
if A[i] > K:
break
while B[p] ... | N,M,K = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
A = [0]
B = [0]
for i in range(N):
A.append(A[i]+a[i])
for i in range(M):
B.append(B[i]+b[i])
ans = 0
p = M
for i in range(0,N+1):
if A[i] > K:
break
while B[p] > K ... | p02623 |
import sys
sys.setrecursionlimit(500000)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
class X:
def __init__(self, K, A, B, N, M):
self.A = A
self.B = B
self.K = K
self.N = N
self.M = M
... | import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_sum = A.copy()
B_sum = B.copy()
for i in range(1, N):
A_sum[i] = A_sum[i - 1] + A[i]
A_sum = [0] + A_sum
for i in range(1, M):
B_sum[i] = B_sum[i - 1] + B[i]
... | p02623 |
# C - Tsundoku
import sys
sys.setrecursionlimit(10**9)
N, M, K = list(map(int, input().split()))
A = list(int(a) for a in input().split())
B = list(int(b) for b in input().split())
la = 0
t = 0
for i in range(N):
if A[i] + t <= K:
la += 1
t += A[i]
lb = 0
t = 0
for i in range(M):... | # C - Tsundoku
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Asum = [0]
for i in range(N):
Asum.append(Asum[i] + A[i])
Bsum = [0]
for j in range(M):
Bsum.append(Bsum[j] + B[j])
ans = 0
for i in range(N+1):
... | p02623 |
n, m, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
ms = list(map(int, input().split()))
nss = [0]
for i, v in enumerate(ns): nss.append(nss[i] + ns[i])
mss = [0]
for i, v in enumerate(ms): mss.append(mss[i] + ms[i])
mx = 0
for i in range(n + 1):
if nss[i] > k:
break... | n, m, k = list(map(int, input().split()))
ns = list(map(int, input().split()))
ms = list(map(int, input().split()))
nss = [0]
for i, v in enumerate(ns):
nss.append(nss[i] + ns[i])
mss = [0]
for i, v in enumerate(ms):
mss.append(mss[i] + ms[i])
mx = 0
j = m
for i in range(n + 1):
if nss[i] ... | p02623 |
import bisect
# 入力
n,m,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
# A,Bの累積和を取る
sumA = [0]*(n+1)
sumB = [0]*(m+1)
for i in range(n):
sumA[i+1] = sumA[i] + A[i]
for i in range(m):
sumB[i+1] = sumB[i] + B[i]
ans = 0
# 二分探索
for i,... | # 入力
n,m,k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
# A,Bの累積和を取る
sumA = [0]*(n+1)
sumB = [0]*(m+1)
for i in range(n):
sumA[i+1] = sumA[i] + A[i]
for i in range(m):
sumB[i+1] = sumB[i] + B[i]
ans = 0
# しゃくとり法
j = m
for i,a in enume... | p02623 |
def solve():
N, M, K = list(map(int,input().split()))
AA = list(map(int,input().split()))
BB = list(map(int,input().split()))
A_max = 0
AAs = [0]*N
AAs[0] = AA[0]
if K>=AAs[0]:
A_max = 1
for i in range(1,N):
AAs[i] = AAs[i-1] + AA[i]
if K>=AAs[i]:
A_max+=1
BBs = [0]*M
... | def solve():
N, M, K = list(map(int,input().split()))
AA = list(map(int,input().split()))
BB = list(map(int,input().split()))
A_max = 0
AAs = [0]*N
AAs[0] = AA[0]
if K>=AAs[0]:
A_max = 1
for i in range(1,N):
AAs[i] = AAs[i-1] + AA[i]
if K>=AAs[i]:
A_max+=1
BBs = [0]*M
... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt = 0
cost = 0
for i, x in enumerate(a):
cost += x
if cost > k:
cnt = i
cost -= x
break
else:
for j, y in enumerate(b):
cost += y
if cos... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
j = m - 1
cost = sum(b)
cnt = m
ans = 0
for i in range(n + 1):
if i != 0:
cost += a[i - 1]
cnt += 1
while cost > k and j >= 0:
cost -= b[j]
cnt -= 1
... | p02623 |
import itertools as it
def main():
n,m,k=list(map(int,input().split()))
Aa = list(map(int,input().split()))
Bb = list(map(int, input().split()))
a, b = [0],[0]
for i in range(n):
a.append(a[i] + Aa[i])
for i in range(m):
b.append(b[i] + Bb[i])
M = m
ans = 0
... | import itertools as it
def main():
n,m,k=list(map(int,input().split()))
a = [0]
a.extend(it.accumulate(list(map(int, input().split()))))
b = [0]
b.extend(it.accumulate(list(map(int, input().split()))))
ans = 0
M = m
for A in range(n+1):
aa = a[A]
Kaa = k-... | p02623 |
import bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return list(map(int, ssRaw()))
INF = 1 << 2... | import bisect
import sys
import math
from collections import deque
from heapq import heappush, heappop
def sRaw():
return input().rstrip("\r")
def iRaw():
return int(eval(input()))
def ssRaw():
return input().split()
def isRaw():
return list(map(int, ssRaw()))
INF = 1 << 2... | p02623 |
# Aそれぞれに対してBを二分探索→M(累積和構成) + NlogM
# Aを昇順、Bを降順に動かす→O(N+M)
import bisect
n, m, k = list(map(int, input().split()))
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
# 累積和を作る
b_cumsum = [0] * (m+1)
for i in range(m):
b_cumsum[i+1] = b_cumsum[i] + bb[i]
ans = 0
a_sum = 0
b_res... | # 二通りのやり方で解いてみよう。
# Aそれぞれに対してBを二分探索→M(累積和構成) + NlogM
# Aを昇順、Bを降順に動かす→O(N+M) このコードはこっち★
n, m, k = list(map(int, input().split()))
aa = list(map(int, input().split()))
bb = list(map(int, input().split()))
time_sum = sum(bb)
a_idx = 0
b_idx = m-1
ans = 0
# 最初はA無し、B全部からスタート
book_num = m
while True:
... | p02623 |
# ABC172 C
import sys
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_CumulativeSum = [0]
B_CumulativeSum = [0]
for i in range(n):
A_CumulativeSum.append(A[i] + A_CumulativeSum[i])
for i in range(m):
B_CumulativeSum.append(B[i] + B_... | # ABC172 C
import sys
n, m, k = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A_CumulativeSum = [0]
B_CumulativeSum = [0]
for i in range(n):
A_CumulativeSum.append(A[i] + A_CumulativeSum[i])
for i in range(m):
B_CumulativeSum.append(B[i] + B_... | p02623 |
n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_sum = [0]
for i in range(n):
a_sum.append(a[i] + a_sum[i])
b_sum = [0]
for i in range(m):
b_sum.append(b[i] + b_sum[i])
ans = 0
for i in range(n+1):
if a_sum[i] > k:
break
for... | n, m, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_sum = [0]
for i in range(n):
a_sum.append(a[i] + a_sum[i])
b_sum = [0]
for i in range(m):
b_sum.append(b[i] + b_sum[i])
ans = 0
j = m
for i in range(n+1):
if a_sum[i] > k:
bre... | p02623 |
N, M, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
max_cnt = 0
for i in range(N+1):
a = A[:i]
if sum(a) > K:
continue
for j in range(M+1):
b = B[:j]
if sum(b) > K:
continue
total = su... | from itertools import accumulate
N, M, K = list(map(int, input().split()))
A = list(accumulate(int(i) for i in input().split()))
B = list(accumulate(int(i) for i in input().split()))
a,b = [0],[0]
for ai in A:
a.append(ai)
for bj in B:
b.append(bj)
cnt = 0
best0 = M
for i in range(N+1):
ai ... | p02623 |
from itertools import accumulate
N, M, K = list(map(int, input().split()))
A = list(accumulate(int(i) for i in input().split()))
B = list(accumulate(int(i) for i in input().split()))
a,b = [0],[0]
for ai in A:
a.append(ai)
for bj in B:
b.append(bj)
cnt = 0
best0 = M
for i in range(N+1):
ai ... | from itertools import accumulate
N, M, K = list(map(int, input().split()))
a = [0] + list(accumulate(int(i) for i in input().split()))
b = [0] + list(accumulate(int(i) for i in input().split()))
cnt = 0
best0 = M
for i in range(N+1):
ai = a[i]
for j in range(best0, -1, -1):
bj = b[j]
... | p02623 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 7)
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
@lru_cache(None)
def dp(i, j, cur):
if cur > K:
return 0
elif i >= N:
if j < M and cur ... | N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
prefix_A = [0] * (N + 1)
for i, a in enumerate(A, 1):
prefix_A[i] = prefix_A[i - 1] + a
prefix_B = [0] * (M + 1)
for j, b in enumerate(B, 1):
prefix_B[j] = prefix_B[j - 1] + b
res = 0... | p02623 |
N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
A_sum=[0,A[0]]
B_sum=[0,B[0]]
for i in range(1,N):
A_sum.append(A_sum[i]+A[i])
for i in range(1,M):
B_sum.append(B_sum[i]+B[i])
b_read=0
ans=0
for i in range(N,-1,-1):
for j in range(b_read... | N,M,K=list(map(int,input().split()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
A_sum=[0,A[0]]
B_sum=[0,B[0]]
for i in range(1,N):
A_sum.append(A_sum[i]+A[i])
for i in range(1,M):
B_sum.append(B_sum[i]+B[i])
b_read=0
ans=0
for i in range(N,-1,-1):
for j in range(b_read... | p02623 |
import itertools
n, m, k = list(map(int, input().split()))
a_books = [int(i) for i in input().split()]
b_books = [int(i) for i in input().split()]
#print(a_books)
data = ['a'] * n + ['b'] * m
all_lists = set()
for list in itertools.permutations(data):
if list not in all_lists:
all_lists.add(list)
#p... | n, m, k = list(map(int, input().split()))
a_books = [int(i) for i in input().split()]
b_books = [int(i) for i in input().split()]
time = 0
count = 0
for i in range(n):
time += a_books[i]
if time > k:
time -= a_books[i]
i -= 1
break
count += 1
for j in range(m):
time += b_books[j]
i... | p02623 |
n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
suba=[0]
subb=[0]
for i in range(n):
suba.append(a[i]+suba[i])
for j in range(m):
subb.append(b[j]+subb[j])
ans=0
for i in range(n+1):
j=m
while True:
#print(i,j)
... | n,m,k=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
suba=[0]
subb=[0]
for i in range(n):
suba.append(a[i]+suba[i])
for j in range(m):
subb.append(b[j]+subb[j])
ans=0
j=m
for i in range(n+1):
#print(i,j)
if k<suba[i]:
brea... | p02623 |
import itertools
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
aa = [0] + list(itertools.accumulate(A))
bb = [0] + list(itertools.accumulate(B))
ans = 0
for i in reversed(list(range(N+1))):
tmp_K = K-aa[i]
if tmp_K... | import itertools
import bisect
N, M, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
aa = [0] + list(itertools.accumulate(A))
bb = [0] + list(itertools.accumulate(B))
ans = bisect.bisect_left(aa, K)-1
ans = max(ans, bisect.bisect_left(bb, K)-1)
... | p02623 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.