input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import pprint
n = int(eval(input()))
ls = input().split()
lst = [int(e) for e in ls]
#print(lst)
m = n //2
d = n % 2
#print(m,d)
def ns ( l1, l2 ):
res = 0
for i in range(len(l1)):
res += l1[i]*l2[i]
return res
def mklst(no):
ret = []
if no % 2 == 0:
m = no // 2
for i in range... | import pprint
n = int(eval(input()))
ls = input().split()
lst = [int(e) for e in ls]
m = n //2
d = n % 2
def sum_lst(plst):
no = len(plst)
ret = []
if no % 2 == 0:
m = no // 2
for i in range(m+1):
sum = 0
for j in range(m):
if j < i :
sum += plst[j*2]
... | p02716 |
# coding: utf-8
N=int(eval(input()))
A=list(map(int,input().split()))
INF=10**18
dp=[[-INF for i in range(N+1)] for i in range(N+1)]
dp[0][0]=0
dp[1][0]=0
dp[2][0]=0
dp[1][1]=A[0]
dp[2][1]=A[1]
for i in range(3,N+1):
for j in range((i//2),((i+1)//2)+1):
dp[i][j]=max(dp[i-2][j-1]+A[i-1],dp[... | # coding: utf-8
N=int(eval(input()))
A=list(map(int,input().split()))
INF=10**18
dp=[[-INF for i in range(2)] for j in range(N+1)]
dp[0][0]=0
dp[1][0]=0
dp[2][0]=0
dp[1][1]=A[0]
dp[2][1]=A[1]
for i in range(3,N+1):
dp[i][0]=max(dp[i-2][0]+A[i-1],dp[i-2][1])
if i%2==0:
dp[i][0]=max(dp[... | p02716 |
import sys, math
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
"""
dp[i][j] = (1からi番目の数のうちどの２個も連続しないようにj個選んだ時の和の最大)
と置くらしい。何故その発想になるんだ？？
最初は左右で分けて尺取りみたいなことをすれば行けると思ったが、左右の分け目を１つずらしたら
最適解がガラッと変わって困った ... | import sys, math
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A = [0] + list(map(int, input().split()))
"""
dp[i][j] = (1からi番目の数のうちどの２個も連続しないようにj個選んだ時の和の最大)
と置くらしい。何故その発想になるんだ？？
最初は左右で分けて尺取りみたいなことをすれば行けると思ったが、左右の分け目を１つずらしたら
最適解がガラッと変わって困った ... | p02716 |
import sys
sys.setrecursionlimit(10**6)
N = int(eval(input()))
A = [int(i) for i in input().split()]
def f(i,j):
a = 0
if not 2*j-1 <= i <= 2*j+1+(N-2*int(N/2)):
a = 0
elif i == 1 and j == 0:
a = 0
elif i == 1 and j == 1:
a = A[0]
elif i == 2 and j == 1:
a = max(A[0],A[1])
... | import math
N = int(eval(input()))
A = list(map(int, input().split()))
B = [{} for _ in range(N+1)]
for i in range(1,N+1):
if i == 1:
B[1][0] = 0
B[1][1] = A[0]
elif i == 2:
B[2][1] = max(A[0],A[1])
if N % 2 == 1:
B[2][0] = 0
else:
if N % 2 == 0:
for j in rang... | p02716 |
import sys
#import copy
#import numpy as np
#import itertools
#import collections
#from collections import deque
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
#r... | import sys
#import copy
#import numpy as np
#import itertools
#import collections
#from collections import deque
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import csr_matrix
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
#r... | p02716 |
def calc():
n=int(eval(input()))
arr=list(map(int,input().split()))
acum1=[0]
acum2=[0]
for i in range(n):
if i%2==0:
acum1.append(acum1[-1]+arr[i])
acum2.append(acum2[-1]+0)
else:
acum1.append(acum1[-1]+0)
acum2.append(acum2[-1]+arr[i])
if n%2==0:
ans=max(ac... | n=int(eval(input()))
arr=list(map(int,input().split()))
if n<=3:
print((max(arr)))
exit()
lim=n%2+2
dp=[[0]*lim for _ in range(n+1)]
for i in range(n):
dp[i+1][0]=dp[i-1][0]+arr[i]
dp[i+1][1]=max(dp[i-1][1]+arr[i],dp[i-2][0]+arr[i])
if lim==3:
dp[i+1][2]=max(dp[i-1][2]+arr[i],dp[i-2][1]+arr[i],... | p02716 |
import sys
input=sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
m=n//2
dp=[[-10**18]*n for _ in range(m)]
if n%2==0:
dp[0][0]=a[0]
dp[0][1]=a[1]
for i in range(1,m):
for j in range(2*i,2*(i+1)):
for k in range(2*(i-1),2*i):
if j-k>1:
... | import sys
input=sys.stdin.readline
n=int(eval(input()))
a=list(map(int,input().split()))
m=n//2
if n%2==0:
dp=[[-10**18]*2 for _ in range(m)]
dp[0][0]=a[0]
dp[0][1]=a[1]
for i in range(1,m):
for j in range(2*i,2*(i+1)):
for k in range(2*(i-1),2*i):
if j-k... | p02716 |
N = int(eval(input()))
A = list(map(int,input().split()))
s = [0]*N
for i in range(N):
s[i] = s[i-2]+A[i]
dp = [0]*N
dp[1] = max(A[0],A[1])
if N>=3:
dp[2] = max(A[0],A[1],A[2])
for n in range(3,N):
if n%2==1:
dp[n] = max(A[n]+dp[n-2],s[n-1])
else:
dp[n] = max(A[n]+dp[n-2],... | N = int(eval(input()))
A = list(map(int,input().split()))
s = [0]*N
for i in range(N):
s[i] = s[i-2]+A[i]
dp = [0]*N
for n in range(N):
if n%2==1:
dp[n] = max(A[n]+dp[n-2],s[n-1])
else:
dp[n] = max(A[n]+dp[n-2],dp[n-1])
print((dp[-1])) | p02716 |
n = int(eval(input()))
A = list(map(int,input().split()))
def zenbu(m, B):
dp = [-10**9]*m
if dp[m-1] > -10**9:
return dp[m-1]
elif m == 1:
dp[0] = B[0]
return dp[0]
elif m == 2:
dp[1] = max(B[0],B[1])
return dp[1]
elif m == 3:
dp[2] = m... | import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int,input().split()))
if N%2 == 0:
dp = [[0]*2 for _ in range(N)] #0index
dp[0][0] = A[0]
dp[1][1] = A[1]
for i in range(2,N):
dp[i][0] = dp[i-2][0]+A[i]
if i-3>=0:
dp[i][1] = max(dp[i-2][1],dp[i-3][0])+A[i]
... | p02716 |
# -*- coding: utf-8 -*-
"""
Spyder Editor
This is a temporary script file.
"""
#f = open("C:/Users/naoki/Desktop/Atcoder/input.txt")
N = int(eval(input()))
A = list(map(int, input().split()))
A.insert(0, 0)
select_num = N//2
Dp_f = [[-9999]*(N+1) for _ in range(N+1)]
Dp_s = [[-9999]*(N+1) for _ in ra... |
#f = open("C:/Users/naoki/Desktop/Atcoder/input.txt")
N = int(eval(input()))
A = list(map(int, input().split()))
A.insert(0, 0)
select_num = N//2
inf = -10e+100
Dp_f = [[inf] * (3) for _ in range(N+1)]
Dp_s = [[inf] * (3) for _ in range(N+1)]
# 3 次元はそれぞれStart~3つに該当
pre_margin = 0
for i in range(1,N+1)... | p02716 |
# unfinished
INF = 1 << 64
def find_max(a):
n = len(a)
odd_a = [a[i] for i in range(n) if i % 2 == 0]
even_a = [a[i] for i in range(n) if i % 2 == 1]
cum_odd_a = [0]
sum_odd_a = 0
for odd_a_elem in odd_a:
cum_odd_a.append(cum_odd_a[-1] + odd_a_elem)
sum_odd_a += o... | def find_max(a):
n = len(a)
if n <= 3:
return max(a)
dp = [[-(1 << 64)] * (2 + n % 2) for _ in range(n)]
for i in range(2 + n % 2):
dp[i][i] = a[i]
dp[i + 1][i] = a[i]
for i in range(2, n):
for j in range(2 + n % 2):
for extra_space in ra... | p02716 |
n=int(eval(input()))
a=list(map(int,input().split()))
if n<=3:print((max(a)));exit()
if n&1:
dp=[3*[-(10**20)]for _ in range(n)]
dp[0][0]=a[0]
for i in range(1,n):
if i%2==0:
dp[i][0]=dp[i-2][0]+a[i]
if i>=3:dp[i][2]=max(dp[i-2][2]+a[i],dp[i-3][1]+a[i])
else:dp[i][2]=a[i]
else... | n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n
for i in range(n):p[i]=l[i]+(p[i-2]if i>1else 0)
for i in range(1,n):
d[i]=p[i-1]if(i&1)else d[i-1]
d[i]=max(d[i],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | p02716 |
n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n
for i in range(n):p[i]=l[i]+(p[i-2]if i>1else 0)
for i in range(1,n):
d[i]=p[i-1]if(i&1)else d[i-1]
d[i]=max(d[i],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n;p[0]=l[0]
for i in range(1,n):p[i]=l[i]+(p[i-2]if i>1else 0);d[i]=max(p[i-1]if(i&1)else d[i-1],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | p02716 |
n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n;p[0]=l[0]
for i in range(1,n):p[i]=l[i]+(p[i-2]if i>1else 0);d[i]=max(p[i-1]if(i&1)else d[i-1],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n;p[0]=l[0]
for i in range(1,n):p[i]=l[i]+p[i-2];d[i]=max(p[i-1]if(i&1)else d[i-1],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | p02716 |
n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n;p[0]=l[0]
for i in range(1,n):p[i]=l[i]+p[i-2];d[i]=max(p[i-1]if(i&1)else d[i-1],l[i]+(d[i-2]if i>1else 0))
print((d[-1])) | n=int(eval(input()));l=list(map(int,input().split()));p=[0]*n;d=[0]*n;p[0]=l[0]
for i in range(1,n):p[i]=l[i]+p[i-2];d[i]=max(p[i-1]if(i&1)else d[i-1],l[i]+d[i-2])
print((d[-1])) | p02716 |
N = int(eval(input()))
A = list(map(int, input().split()))
# if N % 2 == 0: #偶数のとき
# B = [0] * (N // 2 + 1)
# W = [0] * (N // 2 + 1)
# for i in range(N // 2):
# B[i + 1] = B[i] + A[2 * i]
# for i in range(N // 2 - 1, -1, -1):
# W[i] = W[i + 1] + A[2 * i + 1]
# # print (B... | N = int(eval(input()))
A = list(map(int, input().split()))
if N % 2 == 0: #偶数のとき
B = [0] * (N // 2 + 1)
W = [0] * (N // 2 + 1)
for i in range(N // 2):
B[i + 1] = B[i] + A[2 * i]
for i in range(N // 2 - 1, -1, -1):
W[i] = W[i + 1] + A[2 * i + 1]
# print (B)
# print (... | p02716 |
C = -(10**9 + 7)
def main():
from collections import defaultdict
N = int(eval(input()))
K = N//2
A = [int(i) for i in input().split()]
dp = defaultdict(lambda: C)
for i in range(N+1):
dp[(i, 0)] = 0
if i != 0:
dp[(i, 1)] = max(dp[(i-1, 1)], A[i-1])
... | C = -(10**15 + 7)
def main():
from collections import defaultdict
N = int(eval(input()))
K = N//2
A = [int(i) for i in input().split()]
dp = defaultdict(lambda: C)
for i in range(N+1):
dp[i, 0] = 0
if i != 0:
dp[(i, 1)] = max(dp[i-1, 1], A[i-1])
for... | p02716 |
C = -(10**15 + 7)
def main():
from collections import defaultdict
N = int(eval(input()))
K = N//2
A = [int(i) for i in input().split()]
dp = defaultdict(lambda: C)
for i in range(N+1):
dp[i, 0] = 0
if i != 0:
dp[(i, 1)] = max(dp[i-1, 1], A[i-1])
for... | def main():
N = int(eval(input()))
A = [int(i) for i in input().split()]
if N % 2 == 0:
dp = [[0]*2 for _ in range(N//2 + 1)]
for i in range(N//2):
dp[i+1][0] = dp[i][0] + A[2*i]
dp[i+1][1] = max(dp[i][0], dp[i][1]) + A[2*i+1]
print((max(dp[-1])))
... | p02716 |
n = int(eval(input()))
A = list(map(int, input().split()))
pick_DP = [-float('INF')] * n
unpick_DP = [-float('INF')] * n
pick_DP[0] = 0
unpick_DP[0] = 0
for i, a in enumerate(A, 1):
mini = (i-1)//2 - 1
if mini <= 0:
mini = 1
maxi = (i+1)//2
temp = []
for num in range(mini, ... | n = int(eval(input()))
A = list(map(int, input().split()))
pick_DP = [-float('INF')] * (n//2 + 2)
unpick_DP = [-float('INF')] * (n//2 + 2)
pick_DP[0] = 0
unpick_DP[0] = 0
for i, a in enumerate(A, 1):
mini = (i-1)//2 - 1
if mini <= 0:
mini = 1
maxi = (i+1)//2
for num in range(max... | p02716 |
#!/usr/bin/env python3
# coding: utf-8
import collections
import math
def debug(arg):
if __debug__:
pass
else:
import sys
print(arg, file=sys.stderr)
N, *A = map(int, open(0).read().split())
a = dict(enumerate(A, 1))
# dp = collections.defaultdict(int)
dp = collections.def... | #!/usr/bin/env python3
# coding: utf-8
import collections
import math
def debug(arg):
if __debug__:
pass
else:
import sys
print(arg, file=sys.stderr)
def main():
pass
N, *A = map(int, open(0).read().split())
a = dict(enumerate(A, 1))
dp = collections.defau... | p02716 |
#!/usr/bin/env python3
# coding: utf-8
import collections
import math
def debug(arg):
if __debug__:
pass
else:
import sys
print(arg, file=sys.stderr)
def main():
pass
N, *A = map(int, open(0).read().split())
a = dict(enumerate(A, 1))
dp = collections.defau... | #!/usr/bin/env python3
# coding: utf-8
import collections
def debug(arg):
if __debug__:
pass
else:
import sys
print(arg, file=sys.stderr)
def main():
pass
N, *A = map(int, open(0).read().split())
a = dict(enumerate(A, 1))
dp = collections.defaultdict(lambda... | p02716 |
N = int(eval(input()))
A = list(map(int, input().split()))
INF = 10**18
dp0 = [-INF] * (N + 2)
dp1 = [-INF] * (N + 2)
dp2 = [-INF] * (N + 2)
dp0[0] = 0
dp0[1] = 0
dp1[0] = 0
dp1[1] = 0
for i, a in enumerate(A, start=2):
dp0[i] = dp0[i - 2] + a
dp1[i] = max(dp1[i - 2] + a, dp0[i - 1])
dp2[i]... | N = int(eval(input()))
A = list(map(int, input().split()))
INF = 10**18
dp0 = 0
dp1 = -INF
dp2 = -INF
for i, a in enumerate(A):
if i % 2 == 0:
dp1 = max(dp1, dp0)
dp0 += a
dp2 += a
else:
dp2 = max(dp2, dp1)
dp1 += a
if N % 2 == 1:
print((max(dp1, ... | p02716 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | p02716 |
from collections import defaultdict
N,*A = list(map(int, open(0).read().split()))
dp_not = defaultdict(lambda :-10**18)
dp_take = defaultdict(lambda :-10**18)
dp_not[(0,0)] = 0
for i,x in enumerate(A,1):
for j in ((i-1)//2,(i-1)//2+1):
dp_not[(i,j)] = max(dp_not[(i-1,j)],dp_take[(i-1,j)])
dp_take[(i,j... | from collections import defaultdict
N,*A = list(map(int, open(0).read().split()))
dp_not = defaultdict(lambda :-10**18)
dp_take = defaultdict(lambda :-10**18)
dp_not[(0,0)] = 0
for i,x in enumerate(A,1):
for j in range(N//2-(N-i+1)//2,(i+1)//2+1):
dp_not[(i,j)] = max(dp_not[(i-1,j)],dp_take[(i-1,j)])
... | p02716 |
N=int(eval(input()))
A=list(map(int,input().split()))
from collections import deque
q=deque([(-1,0,-2,0)])
ans=-10**18
for i,a in enumerate(A):
while q and q[0][0]<i:
j,n,r,x=q.popleft()
if r<-1:
if n==N//2-1:
ans=max(ans,x+a)
else:
... | N=int(eval(input()))
A=list(map(int,input().split()))
from collections import deque
q=deque([(-1,0,-2,0)])
ans=-10**18
for i,a in enumerate(A):
d={}
while q and q[0][0]<i:
j,n,r,x=q.popleft()
if r<-1:
if n==N//2-1:
ans=max(ans,x+a)
elif n not i... | p02716 |
import sys
n = int(eval(input()))
A = [int(_) for _ in input().split()]
# dp = [[0 for i in range((n//2)+1)] for j in range(n)]
if n == 1 or n == 2 or n == 3:
print((max(A)))
sys.exit()
dp = [[0, 0] for j in range(n)]
M = - float('inf')
for i in range(4):
M = max(M, A[i])
dp[i][0] = M... | import sys
n = int(eval(input()))
A = [int(_) for _ in input().split()]
if n == 1 or n == 2 or n == 3:
print((max(A)))
sys.exit()
dp = [[0, 0] for j in range(n)]
M = - float('inf')
for i in range(4):
M = max(M, A[i])
dp[i][0] = M
dp[2][1] = dp[0][0] + A[2]
dp[3][1] = max(dp[1][0] + A[3... | p02716 |
import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
a = list(map(int, input().split()))
d = {}
def func(b, m):
if m == 0:
return 0
if m == 1:
return b[0]
if m == 2:
return max(b[0], b[1])
if m in d:
return d[m]
if m % 2 == 0:
... | import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
a = list(map(int, input().split()))
a_cs = [0] * (n + 1)
a_cs[-2] = a[-1]
for i in reversed(list(range(n - 1))):
a_cs[i] = a[i] + a_cs[i + 2]
# print(a_cs)
def func(i):
if i == n:
return 0
if i == n - 1:
retu... | p02716 |
import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
a = list(map(int, input().split()))
a_cs = [0] * (n + 1)
a_cs[-2] = a[-1]
for i in reversed(list(range(n - 1))):
a_cs[i] = a[i] + a_cs[i + 2]
# print(a_cs)
def func(i):
if i == n:
return 0
if i == n - 1:
retu... | import sys
sys.setrecursionlimit(10**8)
n = int(eval(input()))
a = list(map(int, input().split()))
a_cs = [0] * (n + 1)
a_cs[-2] = a[-1]
for i in reversed(list(range(n - 1))):
a_cs[i] = a[i] + a_cs[i + 2]
# print(a_cs)
d = {}
def func(i):
if i == n:
return 0
if i == n - 1:
... | p02716 |
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in r... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02716 |
import sys
sys.setrecursionlimit(10 ** 9)
def solve(pick, idx):
if pick == 0: return 0
if idx >= n: return -float('inf')
if (pick, idx) in dp: return dp[pick, idx]
# if n-idx+2 < pick*2: return -float('inf')
total = max(A[idx] + solve(pick-1, idx+2), solve(pick, idx+1))
dp[(pick, i... | import sys
sys.setrecursionlimit(10 ** 9)
def solve(pick, idx):
if pick == 0: return 0
if idx >= n: return -float('inf')
if (pick, idx) in dp: return dp[pick, idx]
if n-idx+2 < pick*2: return -float('inf')
total = max(A[idx] + solve(pick-1, idx+2), solve(pick, idx+1))
dp[(pick, idx... | p02716 |
# coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
# 奇数の時と偶数の時、奇数の場合は真ん中を選ぶかどうか
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if ... | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
# 奇数の時と偶数の時、奇数の場合は真ん中を選ぶかどうか
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if ... | p02716 |
# coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
INF = 10 ** 17
def F(index, n):
if index >= N:
return -INF
if N - ind... | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if index >= N:
return -I... | p02716 |
from collections import deque, Counter
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
... | from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
INF = 10 ** 17
def main():
N = int(eva... | p02716 |
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
INF = 10 ** 17
def main():
N = int(eva... | from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
M = 10 ** 9 + 7
INF = 10 ** 17
def main():
N = int(eva... | p02716 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(eval(input()))
def S(): return eval(input())... | n = int(eval(input()))
A = list(map(int, input().split()))
INF = 10**18
dp_use = [-INF] * 5
dp_not_use = [-INF] * 5
dp_not_use[0] = 0
for a in A:
tmp_use = [-INF] * 5
tmp_not_use = [-INF] * 5
for current_dif in range(-3,2):
if current_dif-1 >= -3:
tmp_use[current_dif] = dp_... | p02716 |
n = int(eval(input()))
a = list(map(int, input().split()))
if n % 2 == 0:
ans, cnt = 0, 0
for i in range(n):
if i % 2 == 1:
ans += a[i]
cnt += a[i]
for i in range(n):
if i % 2 == 0:
cnt += a[i]
else:
cnt -= a[i]
... | n = int(eval(input()))
a = list(map(int, input().split()))
a.insert(0, 0)
dp = [[0] * (n + 1) for _ in range(3)]
for i in range(n % 2 + 2):
for j in range(1 + i, n + i, 2):
if i == 0:
if j == 1:
dp[i][j] = a[j]
else:
dp[i][j] = dp[i][j - 2] +... | p02716 |
n,*l=list(map(int,open(0).read().split()));p=[0]*n;d=p[:]
for i,l in enumerate(l):p[i]+=l+p[i-2];d[i]=max(l+d[i-2],[d,p][i&1][i-1])
print((d[-1])) | n,*l=list(map(int,open(0).read().split()));p=[0]*n;d=p[:]
for i,l in enumerate(l):p[i]=l+p[i-2];d[i]=max(l+d[i-2],[d,p][i&1][i-1])
print((d[-1])) | p02716 |
n,*l=list(map(int,open(0).read().split()))
p=0,0
d=p
i=0
for l in l:d+=max(l+d[-2],[d,p][i&1][-1]),;p+=l+p[-2],;i+=1
print((d[-1])) | n,*l=list(map(int,open(0).read().split()))
p=[0,0]
d=[0,0]
i=0
for l in l:d+=max(l+d[-2],[d,p][i&1][-1]),;p+=l+p[-2],;i+=1
print((d[-1])) | p02716 |
from sys import stdin
import sys
# sys.setrecursionlimit(10**8)
def nextLine(): return next(stdin)
def nextStrList(): return nextLine().split()
def nextIntList(): return [int(_) for _ in nextStrList()]
def main():
n=int(nextLine())
aList=nextIntList()
num=n//2
score=[[None for _ in range(num)] fo... | from sys import stdin
import sys
# sys.setrecursionlimit(10**8)
def nextLine(): return next(stdin)
def nextStrList(): return nextLine().split()
def nextIntList(): return [int(_) for _ in nextStrList()]
# def comp0(n, aList):
# num=n//2
# score=[[None for _ in range(num)] for i in range(n)]
#
# for i ... | p02716 |
import sys
N = int(eval(input()))
A = list(map(int,input().split()))
INF = 10**20
dp = [[[-INF]*2 for _ in range(2)] for _ in range(N+1)]
if N&1:
dp[0][1][0] = 0
for i in range(N):
if i&1:
dp[i+1][0][0] = max(dp[i][0][0], dp[i][0][1])
dp[i+1][1][0] = max(dp[i][1... | import sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int,input().split()))
dp = [0]*n
c = a[0]
dp[1] = max(a[0],a[1])
for i in range(2,n):
if i%2 == 0:
c += a[i]
dp[i] = max(dp[i-2]+a[i],dp[i-1])
else:
dp[i] = max(dp[i-2]+a[i],c)
print((dp[-1]))
... | p02716 |
from collections import defaultdict
n = int(eval(input()))
m = n//2
INF = 10**18
dp = [defaultdict(lambda: -INF)for _ in range(n+2)]
for i, a in enumerate(map(int, input().split()), 2):
for j in range(1, -(-i//2)+1):
if j-1 == 0:
dp[i-2][j-1] = 0
dp[i][j] = max(dp[i-1][j], dp[i-... | from collections import defaultdict
n = int(eval(input()))
m = n//2
INF = 10**18
dp = [defaultdict(lambda: -INF)for _ in range(n+2)]
for i, a in enumerate(map(int, input().split()), 2):
for j in range(max(1, i//2-1), -(-i//2)+1):
if j-1 == 0:
dp[i-2][j-1] = 0
dp[i][j] = max(dp[i... | p02716 |
n = int(eval(input()))
a = list(map(int,input().split()))
dp = [[0 for i in range(3)] for j in range(n+1)]
for i in range(1,n+1):
ai = a[i-1]
dp[i] = dp[i-1][:]
if i%2:
dp[i][0] += +ai
dp[i][1] = max(dp[i-1][0],dp[i-1][1])
if i%2 == 0:
dp[i][1] += ai
dp[i][2] = max(dp[i-1][1],dp[i-1][... | n = int(eval(input()))
a = list(map(int,input().split()))
dp = [0 for i in range(3)]
for i in range(1,n+1):
ai = a[i-1]
if i%2:
dp[1] = max(dp[0],dp[1])
dp[0] += ai
if i%2 == 0:
dp[2] = max(dp[1],dp[2])
dp[1] += ai
if i >= 3 and i%2:
dp[2] += ai
if n%2 == 0:
print((max(dp[0],... | p02716 |
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
A = list(map(int, input().split()))
def solve_even(a, n):
s = sum(a[::2])
ans = s
i = n - 2
while i >= 0:
s += a[i+1] - a[i]
ans = max(ans, s)
i -= 2
return ans
def solve_odd(a, n):
if n == 1:
return 0
ans... | N = int(eval(input()))
A = list(map(int, input().split()))
dp = [0] * (N + 1)
dp[2] = max(A[0], A[1])
s = A[0]
for i, a in enumerate(A, 1):
if i <= 2:
continue
if i%2: # 奇数
dp[i] = max(dp[i-1], a+dp[i-2])
s += a
else: # 偶数
dp[i] = max(a+dp[i-2], s)
print((dp[-1])) | p02716 |
import math
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [int(i) for i in input().split()]
memo = {}
def sub_max(n, m):
if((n, m) in memo):
return memo[(n, m)]
if(m == 1 and n >= 1):
memo[(n, m)] = max(A[-n:])
return memo[(n, m)]
if(m >... | import math
import sys
sys.setrecursionlimit(1000000)
N = int(eval(input()))
A = [int(i) for i in input().split()]
memo = {}
def sub_max(n, m):
if((n, m) in memo):
return memo[(n, m)]
if(m == 1 and n >= 1):
memo[(n, m)] = max(A[-n:])
return memo[(n, m)]
if(m >... | p02716 |
import bisect
import sys
import math
import itertools
sys.setrecursionlimit(10000)
INF = float('inf')
# input macro
def i():
return int(input())
def ii():
return list(map(int,input().split(" ")))
def s():
return input()
def ss():
return input().split(" ")
def slist():
return list... | import bisect
import sys
import math
import itertools
sys.setrecursionlimit(10000)
INF = float('inf')
# input macro
def i():
return int(input())
def ii():
return list(map(int,input().split(" ")))
def s():
return input()
def ss():
return input().split(" ")
def slist():
return list... | p04017 |
from bisect import bisect_left, bisect_right
import math
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
L = int(eval(input()))
ln = int(math.log(N, 2))
dpl = [[0] * N for _ in range(ln+1)]
dpr = [[0] * N for _ in range(l... | from bisect import bisect_left, bisect_right
import math
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
X = list(map(int, input().split()))
L = int(eval(input()))
ln = int(math.log(N, 2))
dpl = [[0] * N for _ in range(ln+1)]
dpr = [[0] * N for _ in range(l... | p04017 |
from bisect import bisect, bisect_left
n = int(eval(input()))
x = list(map(int, input().split()))
l = int(eval(input()))
def search_1(start):
return bisect(x, x[start] + l) - 1
route = [[] for _ in range(n)]
i = 0 # 親の位置
for i in range(n - 1):
if route[i] == []:
j = search_1(i) # カーソルの位置
num = ... | from bisect import bisect
n = int(eval(input()))
x = list(map(int, input().split()))
l = int(eval(input()))
q = int(eval(input()))
#r[i][j]: jから(2**i)日で行ける右端
r = [[i for i in range(n)] for _ in range(18)]
for j in range(n):
r[0][j] = bisect(x, x[j]+l) - 1
for i in range(1, 18):
for j in range(n):
r[i... | p04017 |
from bisect import bisect, bisect_left
import sys
n = int(eval(input()))
x = list(map(int, input().split()))
l = int(eval(input()))
def search_1(start):
return bisect(x, x[start] + l) - 1
route = [[] for _ in range(n)]
i = 0 # 親の位置
for i in range(n - 1):
if route[i] == []:
j = search_1(i) # カーソルの... | from bisect import bisect
import sys
n = int(eval(input()))
x = list(map(int, input().split()))
l = int(eval(input()))
q = int(eval(input()))
#r[i][j]: jから(2**i)日で行ける右端
r = [[i for i in range(n)] for _ in range(18)]
for j in range(n):
r[0][j] = bisect(x, x[j]+l) - 1
for i in range(1, 18):
for j in rang... | p04017 |
# seishin.py
N = int(input())
*X, = map(int, input().split())
L = int(input())
K = 318
D = {}
j = N-1
for i in range(N-1, -1, -1):
while j > 0 and X[j] - X[i] > L:
j -= 1
D[i, 0] = j
for k in range(K):
for i in range(N):
if (i, k) in D and (D[i, k], k) in D:
D[i... | # seishin.py
N = int(input())
*X, = map(int, input().split())
L = int(input())
K = 20
D = [[N]*(K+1) for i in range(N)]
j = N-1
for i in range(N-1, -1, -1):
while j > 0 and X[j] - X[i] > L:
j -= 1
D[i][0] = j
for k in range(K):
for i in range(N):
if D[i][k] != N:
... | p04017 |
# -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func)... | # -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func)... | p04017 |
# -*- coding: utf-8 -*-
from functools import lru_cache
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func)... | # -*- coding: utf-8 -*-
import sys
buff_readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
class Bisect:
def __init__(self, func):
self.__func = func
... | p04017 |
import sys,bisect
input=sys.stdin.readline
N=int(eval(input()))
x=list(map(int,input().split()))
L=int(eval(input()))
doubling=[[-1 for i in range(N)] for j in range(20)]
backdoubling=[[-1 for i in range(N)] for j in range(20)]
for i in range(N):
npos=x[i]+L
index=bisect.bisect_right(x,npos)
... | import sys,bisect
input=sys.stdin.readline
N=int(eval(input()))
x=list(map(int,input().split()))
L=int(eval(input()))
doubling=[[-1 for i in range(N)] for j in range(20)]
for i in range(N):
npos=x[i]+L
index=bisect.bisect_right(x,npos)
doubling[0][i]=index-1
for i in range(1,20):
fo... | p04017 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import bisect
n = int(readline())
x = list(map(int,readline().split()))
l = int(readline())
q = int(readline())
ab = list(map(int,read().split()))
dbl_l = [[] for _ in range(n)]
dbl_r = [[]... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import bisect
n = int(readline())
x = list(map(int,readline().split()))
l = int(readline())
q = int(readline())
ab = list(map(int,read().split()))
dbl = [[] for _ in range(n)]
j = 0
for i ... | p04017 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | p04017 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p04017 |
from bisect import*
r=range
n,*t=list(map(int,open(0).read().split()))
m=2**16
x=t[:n]
d=[[bisect(x,y+t[n])-1for y in x]]+[[0]*n for _ in r(m)]
for i in r(m):
for j in r(n):
d[i+1][j]=d[i][d[i][j]]
for a in zip(t[n+2::2],t[n+3::2]):
a,b=sorted(i-1for i in a)
c=1
for i in r(m,-1,-1):
if d[i]... | from math import*
from bisect import*
r=range
n,*t=list(map(int,open(0).read().split()))
m=int(log(n,2)+1)
x=t[:n]
d=[[bisect(x,y+t[n])-1for y in x]]+[[0]*n for _ in r(m)]
for i in r(m):
for j in r(n):
d[i+1][j]=d[i][d[i][j]]
for a in zip(t[n+2::2],t[n+3::2]):
a,b=sorted(i-1for i in a)
c=1
for ... | p04017 |
import sys
input = sys.stdin.readline
import bisect
n = int(eval(input()))
X = list(map(int, input().split()))
l = int(eval(input()))
U = 17
dp = [[0]*n for _ in range(U+1)]
for i, x in enumerate(X):
t = bisect.bisect_left(X, x+l)
dp[0][i] = bisect.bisect_right(X, x+l) - 1
for k in range(U):
for i i... | import sys
input = sys.stdin.readline
import bisect
n = int(eval(input()))
X = list(map(int, input().split()))
l = int(eval(input()))
U = 17
dp = [[0]*n for _ in range(U+1)]
for i, x in enumerate(X):
t = bisect.bisect_left(X, x+l)
dp[0][i] = bisect.bisect_right(X, x+l) - 1
for k in range(U):
for i i... | p04017 |
from collections import defaultdict
from bisect import bisect
inpl = lambda: list(map(int, input().split()))
N = int(input())
X = inpl()
L = int(input())
Q = int(input())
R = {}
for i in range(N):
R[(0, i)] = bisect(X, X[i]+L) - 1
for k in range(16):
for i in range(N):
R[(k+1, i)] = R[... | from bisect import bisect
inpl = lambda: list(map(int, input().split()))
N = int(input())
X = inpl()
L = int(input())
Q = int(input())
R = [[0]*(N) for k in range(17)]
for i in range(N):
R[0][i] = bisect(X, X[i]+L) - 1
for k in range(16):
for i in range(N):
R[k+1][i] = R[k][R[k][i]]
... | p04017 |
import heapq
N, L, T = list(map(int, input().split()))
X = [0 for i in range(N)]
ant = [[] for i in range(2)]
E = [0 for i in range(N)]
for i in range(N):
X[i], w = list(map(int, input().split()))
ant[w-1].append(i)
if w == 1:
end = X[i] + T
end = end % L
if w == 2:
e... | N, L, T = list(map(int, input().split()))
X = [0 for i in range(N)]
W = [0 for i in range(N)]
E = [0 for i in range(N)]
count = 0
for i in range(N):
X[i], W[i] = list(map(int, input().split()))
if W[i] == 1:
end = X[i] + T
end = end % L
if W[i] == 2:
end = X[i]-T
... | p03747 |
n, l, t = list(map(int, input().split()))
ants = [tuple(map(int, input().split())) for _ in range(n)]
place = []
clock = []
anticlock = []
for i, (x, w) in enumerate(ants):
if w == 1:
place.append((x + t) % l)
clock.append((i, x))
else:
place.append((x - t) % l)
anticl... | n, l, t = list(map(int, input().split()))
ants = [tuple(map(int, input().split())) for _ in range(n)]
def dist(x, y, sign_0):
if sign_0 == -1:
x, y = y, x
if x < y: return y - x
else: return y - x + l
place = []
for i, (x, w) in enumerate(ants):
sign = 1 if w == 1 else -1
place... | p03747 |
n,l,T = list(map(int,input().split()))
s = [0 for i in range(n)]
for i in range(n):
s[i] = list(map(int, input().split()))
def f(w):
if w == 1:
return 1
elif w == 2:
return -1
d=[0 for i in range(n)]
for i in range(n-1):
d[i] = s[i+1][0] - s[i][0]
d[n-1] = s[0][0] +... | from math import floor
n,l,t = list(map(int,input().split()))
ants = []
touch = 0
for i in range(n):
x, w = list(map(int,input().split()))
if w == 1:
touch += (x + t) // l
x1 = (x + t) % l
else:
touch += (x - t) // l
x1 = (x - t) % l
ants.append(x1)
touch =... | p03747 |
from collections import deque
n, l, t = list(map(int, input().split()))
ants = [list(map(int, input().split())) for i in range(n)]
# print(ants)
ants_t = []
count = 0
for ant in ants:
ant_t = ant
if ant[1] == 1:
c, ant_t[0] = divmod(t + ant[0], l)
# count += c
else:
c... | from collections import deque
n, l, t = list(map(int, input().split()))
ants = [list(map(int, input().split())) for i in range(n)]
ants_t = [0]*n
count = 0
for i in range(n):
ant = ants[i]
if ant[1] == 1:
c, ant_t = divmod(t + ant[0], l)
else:
c, ant_t = divmod(-t + ant[0], l)
... | p03747 |
#AGC 013 C - Ants on a Circle
N,L,T = list(map(int, input().split()))
X = [0]*N
W = [0]*N
for n in range(N):
X[n],W[n] = list(map(int, input().split()))
for t in range(T):
#print('now is ',t)
for n in range(N):
if n == N-1:
if X[N-1]%L == X[0] and W[N-1] == 1 and W[0] == 2:
... | N,L,T = list(map(int, input().split()))
X = [0]*N
W = [0]*N
for n in range(N):
X[n],W[n] = list(map(int, input().split()))
index = 0
#after T
for n in range(N):
X[n] += ((-1)**(W[n]+1))*T
index += X[n]//L
X[n] %= L
index %= N
X.sort()
X = X[index:] + X[:index] #No.1 wo hajimeni mottekuru.
... | p03747 |
N, L, T = list(map(int, input().split()))
L *= 2
T *= 2
X = [0] * N
W = [0] * N
for i in range(N):
X[i], W[i] = list(map(int, input().split()))
X[i] *= 2
if W[i] == 2:
W[i] = -1
# print(X, W)
for t in range(T):
for i in range(N):
X[i] = (X[i] + W[i]) % L
for i in ra... | N, L, T = list(map(int, input().split()))
s = 0
X = [0] * N
for i in range(N):
x, w = list(map(int, input().split()))
if w == 1:
x += T
else:
x -= T
# xが0点を通る回数を足す
s += x // L
X[i] = x % L
X.sort()
for i in range(N):
print((X[(i+s) % N]))
| p03747 |
N, L, T = [int(i) for i in input().split()]
ants = list([[x[0] * 2, x[1]] for x in [[int(i) for i in input().split()] for j in range(N)]])
for i in range(T * 2):
for j in range(N):
if ants[j][1] == 1:
if ants[j][0] == 2 * L - 1:
ants[j][0] = 0
else:
ants[j][0] += 1
if j == N - 1:
i... | N, L, T = list(map(int, input().split()))
X = []
W = []
for _ in range(N):
x, w = list(map(int, input().split()))
X.append(x)
if w == 2:
w = -1
W.append(w)
C = 0
for i in range(1, N):
if W[i] != W[0]:
C += T // (L / 2)
if W[0] == 1:
D = X[i] - X[0]... | p03747 |
M,D = list(map(int,input().split()))
ans = 0
for i in range(1, M+1):
for j in range(1, D+1):
if j < 22:
continue
else:
j = str(j)
d1 = int(j[0])
d2 = int(j[1])
if d1>=2 and d2>=2 and i == d1*d2:
ans += 1
print(ans) | M,D = list(map(int,input().split()))
ans = 0
for i in range(1, M+1):
for j in range(1, D+1):
if j//10 >=2 and j%10 >=2 and i == (j//10)*(j%10):
ans += 1
print(ans) | p02927 |
# jsc2019-qualA - Takahashi Calendar
# exhaustive search
def main():
M, D = tuple(map(int, input().split()))
ans = 0
for m in range(1, M + 1):
for d in range(1, D + 1):
if len(str(d)) != 1:
d1, d10 = int(str(d)[1]), int(str(d)[0])
if d1 >= 2 and d... | # jsc2019-qualA - Takahashi Calendar
def main():
M, D = tuple(map(int, input().split()))
ans = 0
for d in range(22, D + 1):
d1, d10 = d % 10, d // 10
ans += 1 if d1 >= 2 and d1 * d10 <= M else 0
print(ans)
if __name__ == "__main__":
main() | p02927 |
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_r... | m,d=list(map(int,input().split()))
ans=0
for month in range(1,m+1):
for day in range(1,d+1):
day=str(day)
if len(day)!=2:
continue
if int(day[0])*int(day[1])!=month:
continue
if int(day[0])<2 or int(day[1])<2:
continue
#print(mon... | p02927 |
M, D = list(map(int, input().split()))
count = 0
for m in range(1, M + 1):
for d in range(1, D + 1):
d1 = int(str(d).zfill(2)[1])
d10 = int(str(d).zfill(2)[0])
if d1 >= 2 and d10 >= 2 and d1 * d10 == m:
count += 1
print(count)
| M, D = list(map(int, input().split()))
count = 0
for m in range(1, M + 1):
for d in range(1, D + 1):
d10, d1 = divmod(d, 10)
if d1 >= 2 and d10 >= 2 and d1 * d10 == m:
count += 1
print(count)
| p02927 |
M,D = list(map(int, input().split()))
D = int(D)
ans = 0
for i in range(1,M+1):
for j in range(1,D+1):
j = str(j)
if len(j) == 2:
j1 = int(j[0])
j2 = int(j[1])
if j1 >= 2 and j2 >= 2 and j1 * j2 == i:
ans += 1
print(ans)
| M,D = list(map(int, input().split()))
ans = 0
for i in range(1,M+1):
for j in range(1,D+1):
j1 = j // 10
j2 = j % 10
if j1 >= 2 and j2 >= 2 and j1 * j2 == i:
ans += 1
print(ans) | p02927 |
M, D = list(map(int, input().split()))
ans = 0
for m in range(1, M+1):
for d in range(22, D+1):
d1 = d % 10
if d1 < 2: continue
d10 = d // 10
if d10 < 2: continue
if d1 * d10 == m:
ans += 1
print(ans)
| M, D = list(map(int, input().split()))
ans = 0
for d in range(22, D+1):
d1 = d % 10
if d1 < 2: continue
d10 = d // 10
if d10 < 2: continue
if d1 * d10 <= M:
ans += 1
print(ans) | p02927 |
tmp = [int(i) for i in input().split()]
M, D = tmp[0], tmp[1]
if D < 22 or M < 4:
print((0))
else:
days = [(str(i)[0], str(i)[1]) for i in range(22, D+1) if int(str(i)[0])>1 and int(str(i)[1])>1]
n = 0
for m in range(4, M+1):
for d in days:
if m == int(d[0])*int(d[1]):
... | tmp = [int(i) for i in input().split()]
M, D = tmp[0], tmp[1]
if D < 22 or M < 4:
print((0))
else:
days = [(str(i)[0], str(i)[1]) for i in range(22, D+1) if int(str(i)[0])>1 and int(str(i)[1])>1]
n = 0
print((sum([1 for m in range(4, M+1) for d in days if m == int(d[0])*int(d[1])]))) | p02927 |
M,D = list(map(int,input().split()))
cnt = 0
for i in range(22,D+1):
d = str(i)
if int(d[1])>=2 and int(d[1])*int(d[0])<=M:
cnt += 1
print(cnt) | M,D = list(map(int,input().split()))
cnt = 0
for m in range(4,M+1):
for d in range(1,D+1):
if d>=20:
d = str(d)
if int(d[1])>=2:
if m==int(d[0])*int(d[1]):
cnt += 1
print(cnt) | p02927 |
M, D = list(map(int, input().split()))
ans = 0
for i in range(1, M+1):
for j in range(1, D+1):
if len(str(j)) == 1:
continue
# 日付が二桁以上であることが確定
d1 = int(str(j)[0])
d2 = int(str(j)[1])
if d1 >= 2 and d2 >= 2:
if i == (d1*d2):
... | M, D = list(map(int, input().split()))
ans = 0
for i in range(1, M+1): # 月
for j in range(10, D+1): # 日付
d1 = int(str(j)[0])
d2 = int(str(j)[1])
if d1 > 1 and d2 > 1:
if i == (d1 * d2):
ans += 1
print(ans)
| p02927 |
M, D = list(map(int, input().split()))
ans = 0
for m in range(1, M+1):
for d in range(20, D + 1):
a, b = list(map(int, str(d)))
if b < 2:
continue
elif m == a*b:
ans += 1
print(ans)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
M, D = list(map(int, input().split()))
ans = 0
for d in range(20, D + 1):
for m in range(1, M+1):
a, b = d//10, d % 10
if m == a*b and b >= 2:
ans += 1
print(ans)
| p02927 |
M,D=list(map(int, input().split()))
seki=0
for m in range(1,M+1):
for d in range(1,D+1):
str_d = str(d)
if len(str_d)==2:
d10 = int(str_d[0])
d1 = int(str_d[1])
if d10 >= 2 and d1 >= 2 and d10*d1 == m:
seki+=1
print(seki) | M, D = list(map(int, input().split()))
seki = 0
for m in range(1, M + 1):
for d in range(1, D + 1):
d10, d1 = divmod(d, 10)
if d10 >= 2 and d1 >= 2 and d10 * d1 == m:
seki += 1
print(seki) | p02927 |
n = int(eval(input()))
d = [int(eval(input())) for i in range(n)]
pos = 0
ans = "yes"
for i in range(n):
if pos>=i*10:
pos = max(pos,i*10+d[i])
else:
ans = "no"
break
if pos >= (n-1)*10:
break
pos = 0
for i in range(n):
if pos>=i*10:
... | n = int(eval(input()))
a = [int(eval(input())) for i in range(n)]
ok = True
rg = list(range(n))
l = 0
for i,d in zip(rg,a):
if i*10 > l:
ok = False
break
if l >= (n-1)*10:
break
if i*10+d > l:
l = i*10+d
a.reverse()
l = 0
for i,d in zip(rg,a):
if i*10 ... | p00357 |
import collections
def solve():
R = int(eval(input()))
if R < 1200:
print("ABC")
elif R < 2800:
print("ARC")
else:
print("AGC")
if __name__ == "__main__":
solve()
| R = int(eval(input()))
if R < 1200:
print("ABC")
elif R < 2800:
print("ARC")
else:
print("AGC")
| p03288 |
a = int(eval(input()))
print(("ABC" if a<1200 else "ARC" if a<2800 else "AGC")) | C = ["ABC", "ARC" , "AGC"]
A = int(eval(input()))
print((C[(A>1199)+(A>2799)])) | p03288 |
r=int(eval(input()))
print(("ABC" if r<1200 else "ARC" if r<2800 else "AGC")) | print((["ABC","ARC","AGC"][(int(eval(input()))+400)//1600])) | p03288 |
r=int(eval(input()))
data1=1200
dara2=2800
name=('ABC', 'ARC', 'AGC')
if r<data1:
print((name[0]))
elif data1<=r<2800:
print((name[1]))
else:
print((name[2]))
| r=int(eval(input()))
data1=1200
data2=2800
name=('ABC', 'ARC', 'AGC')
if r<data1:
print((name[0]))
elif data1<=r<data2:
print((name[1]))
else:
print((name[2])) | p03288 |
r=int(eval(input()))
data1=1200
data2=2800
name=('ABC', 'ARC', 'AGC')
if r<data1:
print((name[0]))
elif data1<=r<data2:
print((name[1]))
else:
print((name[2])) | r=int(eval(input()))
data=(1200,2800)
name=('ABC', 'ARC', 'AGC')
if r<data[0]:
print((name[0]))
elif data[0]<=r<data[1]:
print((name[1]))
else:
print((name[2]))
| p03288 |
r=int(input())
data=(1200,2800)
name=('ABC', 'ARC', 'AGC')
[print(name[0]) for i in range(1) if r < 1200]
[print(name[1]) for i in range(1) if 1200 <= r < 2800 ]
[print(name[2]) for i in range(1) if 2800 <=r ]
| r=int(eval(input()))
data=(1200,2800)
name=('ABC', 'ARC', 'AGC')
z=[name[0] if r < 1200 else name[1] if 1200 <= r < 2800 else name[2] if 2800 <= r else i for i in range(1)]
print((z[0])) | p03288 |
R = int(eval(input()))
if R < 1200:
print("ABC")
elif R < 2800:
print("ARC")
else:
print("AGC") | R = int(eval(input()))
print(("ABC" if R <1200 else "ARC" if R < 2800 else "AGC")) | p03288 |
R = int(eval(input()))
if R < 1200:
print('ABC')
elif 1200 <= R < 2800:
print('ARC')
else:
print('AGC') | R = int(eval(input()))
print(('ABC' if R < 1200 else 'ARC' if 1200 <= R < 2800 else 'AGC'))
| p03288 |
R = int(eval(input()))
if R<1200:
print("ABC")
elif R<2800:
print("ARC")
else:
print("AGC") | print(("A"+"BRG"[(int(eval(input()))+400)//1600]+"C")) | p03288 |
import sys
ri = lambda: int(sys.stdin.readline())
a = ri()
if a < 1200:
print('ABC')
elif a < 2800:
print('ARC')
else:
print('AGC') | import sys
ri = lambda: int(sys.stdin.readline())
a = ri()
if a < 1200:
print('ABC')
else:
print(('ARC' if a < 2800 else 'AGC')) | p03288 |
print(("A"+"BRG"[(int(eval(input()))+400)//1600]+"C"))
| print(("A"+"BRG"[int(eval(input()))//50+8>>5]+"C")) | p03288 |
rating = int(eval(input()))
if rating < 1200:
print('ABC')
elif 1200 <= rating < 2800:
print('ARC')
elif rating >= 2800:
print('AGC')
| r = int(eval(input()))
if r < 1200:
print('ABC')
elif r < 2800:
print('ARC')
else:
print('AGC')
| p03288 |
# -*- coding: utf-8 -*-
R = int(eval(input()))
if R >=2800:
print("AGC")
elif R >= 1200 and 2800 > R:
print("ARC")
else:
print("ABC") | R = int(eval(input()))
if R < 1200:
ans = "ABC"
elif R <2800:
ans = "ARC"
else:
ans = "AGC"
print(ans) | p03288 |
n, s = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = None
for window in range(0, n):
sum_a = None
for i in range(n-window):
if sum_a == None:
sum_a = sum(a[i:window+1])
else:
sum_a += a[i+window] - a[i-1]
if sum_a >= s:
... | n, s = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = None
init_tmp = 0
for window in range(n):
init_tmp += a[window]
sum_a = init_tmp
for i in range(n-window):
if i != 0:
sum_a += a[i+window] - a[i-1]
if sum_a >= s:
ans = windo... | p02354 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
m = 10**19
idx = 0
for i in range(n):
d = t - h[i]*0.006
if abs(a-d) < m:
m = abs(a-d)
idx = i+1
print(idx)
| n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
m = 10**19
# 地点の番号(=1)
idx = 0
for i in range(n):
# 平均気温
d = t - h[i]*0.006
# A度に最も近い地点
if abs(a-d) < m:
m = abs(a-d)
idx = i+1
print(idx)
| p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
diff_list = [abs(t-h_i*0.006-a) for h_i in map(int, input().split())]
print((diff_list.index(min(diff_list))+1)) | n = int(eval(input()))
t,a = list(map(int, input().split()))
tmp_diff_list = [abs(t-i*0.006-a) for i in list(map(int, input().split()))]
print((tmp_diff_list.index(min(tmp_diff_list))+1)) | p03220 |
N = int(eval(input()))
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))
num = abs(A - T + H[0]*0.006)
ans = 1
for i in range(1,N):
if num > abs(A-T+H[i]*0.006):
num = abs(A-T+H[i]*0.006)
ans = i+1
print(ans) | N = int(eval(input()))
T,A = list(map(int,input().split()))
H = list(map(int,input().split()))
a_list = []
for i in range(N):
a_list.append(abs(A-(T-H[i]*0.006)))
print((a_list.index(min(a_list))+1)) | p03220 |
# 入力
N = int(eval(input()))
[T,A] = list(map(int, input().split()))
H = list(map(int, input().split()))
# 処理
ans_idx = -1 # 答えとなる地点のインデックス
ans_t = -1 # 答えとなる地点の気温
for i in range(N):
t = T - H[i]*0.006 # i番目の地点の気温
if ans_idx < 0 or abs(t-A) < abs(ans_t-A):
ans_idx = i
ans_t = t
# 答え
pri... | def calc_temp(i):
return T - 0.006*H[i]
N = int(eval(input()))
[T,A] = list(map(int,input().split()))
H = list(map(int,input().split()))
ans = 0
for i in range(N):
if abs(A-calc_temp(i)) < abs(A-calc_temp(ans)):
ans = i
print((ans+1))
| p03220 |
n = int(eval(input()))
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
ans = 1
min_dif = abs(t-h[0]*0.006-a)
for i in range(1,n):
dif = abs(t-h[i]*0.006-a)
if min_dif > dif: min_dif,ans = dif,i+1
print(ans) | n = int(eval(input()))
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
dif = 10**10
ans = 0
for i in range(n):
z = t-h[i]*0.006
if dif>abs(a-z):
dif = abs(a-z)
ans = i+1
print(ans) | p03220 |
import sys
n = int(eval(input()))
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
c = t - h[0] * 0.006
k = 1
for i in range(n):
if abs(a-c) > abs(a-(t - h[i] * 0.006)):
c = t - h[i] * 0.006
k = i + 1
print(k) | n = int(eval(input()))
t,a = list(map(int,input().split()))
h = list(map(int,input().split()))
mi = 1000000000
for i in range(n):
if mi > abs(a-(t-h[i]*0.006)):
mi = abs(a-(t-h[i]*0.006))
ans = i+1
print(ans)
| p03220 |
N = int(eval(input()))
T, A = list(map(int,input().split()))
H = list(map(int,input().split()))
for i in range(N):
H[i] = T - H[i]*0.006
h = 100000
a = 0
for i in range(N):
if abs(H[i]-A) < h:
h = abs(H[i]-A)
a = i+1
print(a) | N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
bestH = (T - A) / 0.006
d = float('inf')
ans = 0
for i in range(N):
if d > abs(H[i] - bestH):
d = abs(H[i] - bestH)
ans = i + 1
print(ans)
| p03220 |
n = int(eval(input()))
t, a = [int(x) for x in input().split()]
locations =[int(x) for x in input().split()]
print((min([(i+1,abs(a - (t - x * 6e-3))) for i, x in enumerate(locations)],key=(lambda j:j[1]))[0]))
|
n = int(eval(input()))
t, a = [int(x) for x in input().split()]
locations =[int(x) for x in input().split()]
# print(min([(i+1,abs(a - (t - x * 6e-3))) for i, x in enumerate(locations)],key=(lambda j:j[1]))[0])
diff = [abs(a - (t - x * 6e-3)) for x in locations]
print((diff.index(min(diff))+1))
| p03220 |
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
H = [abs(t-a-x * 6e-3) for x in h]
print((1 + H.index(min(H)))) | n = int(eval(input()))
t, a = list(map(int, input().split()))
lst = [ abs((t - i * 0.006)-a) for i in list(map(int, input().split()))]
print((lst.index(min(lst)) + 1))
| p03220 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.