input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
ans=0
for i in range(1,n):
ans+=i
print(ans) | n=int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n=int(eval(input()))
x=0
for i in range(n):
x=x+i
print(x) | n=int(eval(input()))
print((n*(n-1)//2)) | p02924 |
from decimal import Decimal
N = int(eval(input()))
print((Decimal(N * (N - 1) // 2))) | from decimal import Decimal
N = int(eval(input()))
print((int(Decimal(1/2) * Decimal(N) * Decimal(N - 1)))) | p02924 |
n = int(eval(input()))
a = [i + 1 for i in range(n)]
p = a[1:] + [a[0]]
print((sum([a[i] % p[i] for i in range(n)]))) | n = int(eval(input()))
print((n * (n - 1) // 2)) | p02924 |
N=int(eval(input()))
ans=0
for i in range(N):
ans+=i
print(ans)
| N=int(eval(input()))
ans=((N-1)*N)//2
print(ans)
| p02924 |
n = int(eval(input()))
if n % 2:
temp = int((1 + n-1) * ((n-1) / 2))
else:
temp = int((1 + n-1) * ((n-1) // 2) + -(-n // 2))
for i in range(1, n):
if n % (i+1) > i:
temp += n-i
print(temp) | n = int(eval(input()))
print((n * (n-1)//2)) | p02924 |
n = int(eval(input()))
count = 0
for i in range(n):
count += i
print(count) | n = int(eval(input()))
print((n * (n - 1) // 2)) | p02924 |
n_2 = int(eval(input()))
max_amaries = []
for j in range(1,n_2+1):
if j == n_2:
print((sum(max_amaries)))
max_amari = j % (j+1)
max_amaries.append(max_amari) | n_2 = int(eval(input()))
c = 0
for j in range(1,n_2+1):
c += j
print((c - n_2)) | p02924 |
from itertools import accumulate
n = int(eval(input()))
a = list(accumulate(list(range(n))))
print((a[-1])) | n = int(eval(input()))
print((n*(n-1)//2))
| p02924 |
n = int(eval(input()))
ans = 0
for i in range(n):
ans += i
print(ans) | n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
if N == 1:
print("0")
else:
nums = [i for i in range(1,N)]
print((sum(nums)))
| N = int(eval(input()))
if N == 1:
print("0")
else:
ans = 0
for i in range(N):
ans += i
print(ans)
| p02924 |
N = int(eval(input()))
if N == 1:
print("0")
else:
ans = 0
for i in range(N):
ans += i
print(ans)
| N = int(eval(input()))
if N == 1:
print("0")
else:
ans = (N * (N-1))//2
print(ans)
| p02924 |
N = int(eval(input()))
ans = sum(range(N))
print(ans) | N = int(eval(input()))
ans = (N-1)*N//2
print(ans)
| p02924 |
# d
n = int(eval(input()))
print((sum(i%(i%n+1) for i in range(1, n+1)))) | # d
n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
N = int(eval(input()))
mod = (N-1)*N/2
for i in range(1,N+1):
if N%i == N:
break
print((int(mod+N-i)))
| n = int(eval(input()))
print((n*(n-1)//2)) | p02924 |
n = int(eval(input()))
ans = 0
for i in range(1, n//2+1):
ans += n+1
ans -= n
if n%2 == 1:
ans += n//2 + 1
print(ans)
| n = int(eval(input()))
ans = (n+1) * (n//2) - n
if n%2 == 1:
ans += n//2 + 1
print(ans)
| p02924 |
n=int(eval(input()))
ans=0
if n==1:
print((0))
exit()
for i in range(n):
ans+=i
print(ans) | n=int(eval(input()))
if n==1:
print((0))
exit()
print(((n*(n-1))//2)) | p02924 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
s = n - 1
ans = 0
for i in range(s+1):
ans += i
print(ans) | # -*- coding: utf-8 -*-
n = int(eval(input()))
s = n - 1
print((s*(s+1)//2)) | p02924 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
tmp = [i for i in range(1, n + 1)]
print((sum(tmp) - n))
| # -*- coding: utf-8 -*-
n = int(eval(input()))
su = n * (n + 1) // 2
print((su - n))
| p02924 |
def main():
N = int(eval(input()))
ans = 0
data = [i for i in range(1, N+1)]
data_c = data.copy()
tmp = data_c.pop(0)
data_c.append(tmp)
for i in range(N):
ans += data[i]%data_c[i]
print(ans)
return 0
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i != N:
ans += i%(i+1)
print(ans)
return 0
if __name__ == '__main__':
main() | p02924 |
def main():
N = int(eval(input()))
ans = 0
for i in range(1, N+1):
if i != N:
ans += i%(i+1)
print(ans)
return 0
if __name__ == '__main__':
main() | def main():
N = int(eval(input()))
ans = (N-1)*N//2
print(ans)
return 0
if __name__ == '__main__':
main() | p02924 |
# 2020/08/16
# AtCoder Beginner Contest 139 - D
# Input
n = int(eval(input()))
# Calc
asum = 0
# for i in range(1, n+1):
# asum = asum + (n + 1 - i) % i
for i in range(1, n):
asum = asum + i
# Output
print(asum)
| # 2020/08/16
# AtCoder Beginner Contest 139 - D
# Input
n = int(eval(input()))
# Calc
ans = n * (n-1) // 2
# Output
print(ans)
| p02924 |
# ABC-139-D
N = int(eval(input()))
A = [i for i in range(1, N)]
print((sum(A))) | # ABC-139-D
N = int(eval(input()))
# TLEになった
# A = [i for i in range(1, N)]
# print(sum(A))
#sum(N) = ((N+1)*N)/2なのでこちらで実施。
print(((N * (N-1))//2)) | p02924 |
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)
def debug(var, name="hoge"):
print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
return
def gau(n):
return n*(n+1)/2
def main():
N = int(input())
mods = [ i+1for i in range(N)]
t... | from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)
def debug(var, name="hoge"):
print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
return
def gau(n):
return n*(n+1)//2
def main():
N = int(input())
if (N==1):
print(0)
el... | p02924 |
from sys import stdin
from itertools import accumulate
n = int(stdin.readline().rstrip())
li = [p for p in range(1,n)]
if n == 1:
print((0))
else:
lin = list(accumulate(li))
print((lin[-1])) | from sys import stdin
n = int(stdin.readline().rstrip())
if n == 1:
print((0))
else:
point = 0
for i in range(1,n):
point += i
print(point) | p02924 |
from sys import stdin
n = int(stdin.readline().rstrip())
point = 0
for i in range(1,n+1):
point += i%n
print(point) | from sys import stdin
n = int(stdin.readline().rstrip())
point = n*(n-1)//2
print(point) | p02924 |
n = int(eval(input()))
count=0
for i in range(n):
count+=i
print(count) | n = int(eval(input()))
n-=1
print((n*(n+1)//2)) | p02924 |
N = int(eval(input()))
array = [i for i in range(1, N+1)]
num = 0
for i in range(N-1):
num += i + 1
print(num) | N = int(eval(input()))
print((N * (N-1) // 2)) | p02924 |
from collections import deque
n = int(eval(input()))
r = list(range(1, n+1))
p = deque(r)
p.rotate(-1)
print((sum(i%p[i-1] for i in r))) | n = int(eval(input()))
print((sum(i%(i+1) for i in range(1, n)))) | p02924 |
sum = 0
N = int(eval(input()))
for n in range(N):
sum += n
print(sum)
| N = int(eval(input()))
def summation(num):
factor = divmod(num, 2)
return (int(num / 2) * (1 + num)) + (factor[0] + 1) * factor[1]
tmp = int(summation(N))
print((tmp - N))
| p02924 |
# -*- coding: utf-8 -*-
N = int(input().strip())
print((sum(int(i) for i in range(N)))) | # -*- coding: utf-8 -*-
N = int(input().strip())
print(((N-1)*N//2)) | p02924 |
n=int(eval(input()))
ans=0
for i in range(n):
ans+=i
print(ans) | n=int(eval(input()))
ans=n*(n-1)//2
print((int(ans))) | p02924 |
N, W = list(map(int, input().split()))
wv = [tuple(map(int, input().split())) for _ in range(N)]
w1 = wv[0][0]
l1, l2, l3, l4 = [], [], [], []
for wi, vi in wv:
if wi==w1:
l1.append(vi)
elif wi==w1+1:
l2.append(vi)
elif wi==w1+2:
l3.append(vi)
else:
l4.appen... | N, W = list(map(int, input().split()))
L = [[] for _ in range(4)]
wv = [tuple(map(int, input().split())) for _ in range(N)]
w0 = wv[0][0]
for w, v in wv:
L[w-w0].append(v)
for i in range(4):
L[i].sort(reverse=True)
acc = [[0] for _ in range(4)]
for i in range(4):
for j in range(len(L[i])):... | p03734 |
N, W = map(int, input().split())
ws = []
vs = []
for i in range(N):
w, v = map(int, input().split())
ws.append(w)
vs.append(v)
w1 = ws[0]
s = 0
for i in range(N):
ws[i] -= w1
s += ws[i]
dp = [[[0]*(s+1) for i in range(N+1)] for k in range(N)]
for k in range(N):
for i in range(1,N+1):
for ... | N, W = map(int, input().split())
ws = []
vs = []
for i in range(N):
w, v = map(int, input().split())
ws.append(w)
vs.append(v)
w1 = ws[0]
s = 0
for i in range(N):
ws[i] -= w1
s += ws[i]
dp = [[[0]*(s+1) for i in range(N+1)] for k in range(N)]
for k in range(N):
if (k+1)*w1 > W:
break
fo... | p03734 |
N,W=list(map(int,input().split()))
w0,v=list(map(int,input().split()))
goods=[[v],[],[],[]]
for i in range(N-1):
w,v=list(map(int,input().split()))
goods[w-w0].append(v)
val=[]
for x in range(4):
goods[x].sort(reverse=True)
valx=[0]*(len(goods[x])+1)
for k in range(len(goods[x])):
... | N,W=list(map(int,input().split()))
goods=[[] for i in range(4)]
w1=-1
for i in range(N):
w,v=list(map(int,input().split()))
if i==0:
w1=w
goods[w-w1].append(v)
S=[]
for x in range(4):
goods[x].sort(reverse=True)
G=goods[x]
now=[0]*(len(G)+1)
for i in range(len(G)):
... | p03734 |
# coding: utf-8
import array, bisect, collections, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
def II(): return int(eval(input()))
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
... | # coding: utf-8
import array, bisect, collections, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7
def II(): return int(eval(input()))
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
... | p03734 |
import sys
inf = 1 << 32
def solve():
N, W = list(map(int, input().split()))
ws = []
vs = []
for i in range(N):
wi, vi = list(map(int, input().split()))
ws.append(wi)
vs.append(vi)
dp = [[[-inf]*(3*N + 1) for j in range(N + 1)]
... | import sys
def solve():
N, W = list(map(int, input().split()))
v = [[] for i in range(4)]
for i in range(N):
wi, vi = list(map(int, input().split()))
if i == 0:
base = wi
v[0].append(vi)
else:
v[wi - base].append(vi)
for i in... | p03734 |
from collections import defaultdict as dd
def sol(n, w, wis, vis):
rv = 0
best = dd(int)
for i, (wi, vi) in enumerate(zip(wis, vis)):
if wi < w:
best[(wi, i)] = max(best[(wi, i)], vi)
rv = max(vi, rv)
frontline = [(i, wis[i], vis[i]) for i in range(n - 1, ... |
def sol(n, w, wis, vis):
rv = 0
w1 = wis[0]
coll = [[] for _ in range(n)]
for wi, vi in zip(wis, vis):
coll[wi - w1].append(vi)
coll = [sorted(x, reverse=True) for x in coll]
lis = list(map(len, coll))
for k1 in range(min(lis[0] + 1, n + 1)):
for k2 in range(mi... | p03734 |
N,W=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(N)]
w1=wv[0][0]
wm=max([i[0] for i in wv])
Wlist=[0]+[j*(w1+i) for j in range(1,N+1) for i in range(4)]
dp=[[0]*(4*N+1) for _ in range(N+1)]
#dp[i][j]:N個の物に対して強度(Wlist[j])のバッグ
for i in range(1,N+1):
w,v=wv[i-1]
for j i... | import bisect
N,W=list(map(int,input().split()))
wv=[list(map(int,input().split())) for _ in range(N)]
w1=wv[0][0]
Wlist=[0]+[j*w1+i for j in range(1,N+1) for i in range(3*j+1)]
Wlist=sorted(set(Wlist))
LW=len(Wlist)
dp=[[0]*LW for _ in range(N+1)]
#dp[i][j]:N個の物に対して強度(Wlist[j])のバッグ
for i in range(1,N+1):
... | p03734 |
#!/usr/bin/env python3
import sys
def solve(N: int, W: int, w: "List[int]", v: "List[int]"):
from itertools import groupby, product
wv_list = [list(g) for k, g in groupby(sorted(zip(w, v), key=lambda x:(x[0],-x[1]))... | #!/usr/bin/env python3
import sys
def solve(N: int, W: int, w: "List[int]", v: "List[int]"):
from itertools import groupby, product
base_w = w[0]
v_list = [[] for _ in range(4)]
for ww, vv in zip(w, v):
v_list[ww-base_w].append(vv)
v_list = [sorted(vv, reverse=True) for vv in v_lis... | p03734 |
N,W = list(map(int, input().split()))
ws = []
vs = []
for i in range(N):
w,v = list(map(int, input().split()))
ws.append(w)
vs.append(v)
ws_m = [w-ws[0] for w in ws]
"""
i番目まで見て、n個選んでいて、重さがwのときのvの最大値
ただし、wはN個選んだときにW-N*[w[0]]となっているので、そこをmaxとする
dp[i][n][w]
"""
dp = [[[-1]*(3*N+10) for i in ran... | N,W = list(map(int, input().split()))
ws = []
vs = []
for i in range(N):
w,v = list(map(int, input().split()))
ws.append(w)
vs.append(v)
ws_m = [w-ws[0] for w in ws]
"""
i番目まで見て、n個選んでいて、重さがwのときのvの最大値
ただし、wはN個選んだときにW-N*[w[0]]となっているので、そこをmaxとする
dp[i][n][w]
"""
dp = [[-1]*(3*N+1) for i in range... | p03734 |
N,W = list(map(int, input().split()))
wvs = []
for i in range(N):
w,v = list(map(int, input().split()))
wvs.append((w,v))
# dp : n個入っていて、合計がwのときの最大値
w0 = wvs[0][0]
dp = [[[-1]*(330) for i in range(110)] for k in range(110)]
dp[0][0][0] = 0
for i in range(N):
w, v = wvs[i]
dw = w-w0
for j... | N,W = list(map(int, input().split()))
wvs = []
for i in range(N):
w,v = list(map(int, input().split()))
wvs.append((w,v))
# dp : n個入っていて、合計がwのときの最大値
w0 = wvs[0][0]
dp = [[[-1]*(330) for i in range(110)] for k in range(110)]
dp[0][0][0] = 0
for i in range(N):
w, v = wvs[i]
dw = w-w0
for j... | p03734 |
N, W = list(map(int, input().split()))
vs = [[] for _ in range(4)]
w1, v1 = list(map(int, input().split()))
vs[0].append(v1)
for i in range(N - 1):
w, v = list(map(int, input().split()))
vs[w - w1].append(v)
#print(vs)
for i in range(4):
vs[i].sort()
#print(vs)
ans = 0
for i in range(N + 1):
... | N, W = list(map(int, input().split()))
vs = [[] for _ in range(4)]
w1, v1 = list(map(int, input().split()))
vs[0].append(v1)
for i in range(N - 1):
w, v = list(map(int, input().split()))
vs[w - w1].append(v)
#print(vs)
s = [[0] for _ in range(4)]
for i in range(4):
vs[i].sort()
for j in range... | p03734 |
import sys
input = sys.stdin.readline
from itertools import accumulate
N,W = list(map(int,input().split()))
WV = [[int(i) for i in input().split()] for _ in range(N)]
MINW = WV[0][0]
W0 = sorted([0] + [v for w,v in WV if w == MINW])
W1 = sorted([0] + [v for w,v in WV if w == MINW+1])
W2 = sorted([0] + [v ... | import sys
input = sys.stdin.readline
from itertools import accumulate
N,W = list(map(int,input().split()))
WV = [[int(i) for i in input().split()] for _ in range(N)]
MINW = WV[0][0]
# それぞれの重さについての価値のリスト
W0 = sorted([0] + [v for w,v in WV if w == MINW])
W1 = sorted([0] + [v for w,v in WV if w == MINW+1])
... | p03734 |
import sys
input = sys.stdin.readline
from itertools import accumulate
N,W = list(map(int,input().split()))
WV = [[int(i) for i in input().split()] for _ in range(N)]
MINW = WV[0][0]
# それぞれの重さについての価値のリスト
W0 = sorted([0] + [v for w,v in WV if w == MINW])
W1 = sorted([0] + [v for w,v in WV if w == MINW+1])
... | N,W = list(map(int, input().split()))
WV = [[int(i) for i in input().split()] for _ in range(N)]
MINW = WV[0][0]
W0,W1,W2,W3 = [],[],[],[]
for w,v in WV:
if w == MINW: W0.append(v)
elif w == MINW + 1: W1.append(v)
elif w == MINW + 2: W2.append(v)
elif w == MINW + 3: W3.append(v)
W0.sort(r... | p03734 |
def solve():
from itertools import accumulate
N, W = list(map(int, input().split()))
e = tuple([] for _ in range(4))
w1, v1 = list(map(int, input().split()))
e[0].append(v1)
for _ in range(N - 1):
_w, _v = list(map(int, input().split()))
e[_w - w1].append(_v)
... | def solve():
from itertools import accumulate
N, W = list(map(int, input().split()))
e = tuple([] for _ in range(4))
w1, v1 = list(map(int, input().split()))
e[0].append(v1)
for _ in range(N - 1):
_w, _v = list(map(int, input().split()))
e[_w - w1].append(_v)
... | p03734 |
def solve():
from itertools import accumulate
N, W = list(map(int, input().split()))
e = tuple([] for _ in range(4))
w1, v1 = list(map(int, input().split()))
e[0].append(v1)
for _ in range(N - 1):
_w, _v = list(map(int, input().split()))
e[_w - w1].append(_v)
... | def main():
N, W = list(map(int, input().split()))
ctr = [0] * 4
goods = [[] for _ in range(4)]
w1, v1 = list(map(int, input().split()))
ctr[0] += 1
goods[0].append(v1)
for _ in range(N - 1):
wi, vi = list(map(int, input().split()))
wi -= w1
ctr[wi] += 1... | p03734 |
# -*- coding: utf-8 -*-
n,W = list(map(int, input().split()))
iw,v = list(map(int, input().split()))
d = {
0: [v]
,1: []
,2: []
,3: []
}
for _ in range(1,n):
w,v = list(map(int,input().split()))
d[w-iw].append(v)
for i in range(4):
d[i] = sorted(d[i], reverse=True)
ret = -1... | # -*- coding: utf-8 -*-
n,W = list(map(int, input().split()))
iw,v = list(map(int, input().split()))
d = {
0: [v]
,1: []
,2: []
,3: []
}
for _ in range(1,n):
w,v = list(map(int,input().split()))
d[w-iw].append(v)
for i in range(4):
d[i] = sorted(d[i], reverse=True)
ret = -1... | p03734 |
INFTY = 10**10
N,W = list(map(int,input().split()))
X = [list(map(int,input().split())) for _ in range(N)]
dp = [[[-INFTY for _ in range(3*(N-1)+1)] for _ in range(N+1)] for _ in range(N+1)]
for i in range(N+1):
dp[i][0][0] = 0
for i in range(1,N+1):
for j in range(1,i+1):
for k in range(3*(N-1)... | N,W = list(map(int,input().split()))
A = [list(map(int,input().split())) for _ in range(N)]
w1 = A[0][0]
C = {0:[],1:[],2:[],3:[]}
for i in range(N):
w,v = A[i]
C[w-w1].append(v)
C[0] = sorted(C[0],reverse=True)
C[1] = sorted(C[1],reverse=True)
C[2] = sorted(C[2],reverse=True)
C[3] = sorted(C[3],rever... | p03734 |
from itertools import accumulate
n,W,*L=list(map(int,open(0).read().split()))
l=[[] for _ in range(4)]
lim=[1]*4
m=min(L[::2])
for w,v in zip(*[iter(L)]*2):
l[w-m].append(v)
lim[w-m]+=1
ll=[]
for x in l:
ll.append([0]+list(accumulate(sorted(x)[::-1])))
ans=0
for i in range(lim[0]):
for j in range(lim[1... | from itertools import accumulate
n,W,*L=list(map(int,open(0).read().split()))
l=[[] for _ in range(4)]
lim=[1]*4
m=min(L[::2])
for w,v in zip(*[iter(L)]*2):
l[w-m].append(v)
lim[w-m]+=1
ll=[]
for x in l:
ll.append([0]+list(accumulate(sorted(x)[::-1])))
ans=0
for i in range(lim[0]):
if m*i>W:
continu... | p03734 |
N, constW = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
W0 = WV[0][0]
L = [[] for _ in range(4)]
for w, v in WV:
w -= W0
L[w].append(v)
L[0].sort(reverse=True)
L[1].sort(reverse=True)
L[2].sort(reverse=True)
L[3].sort(reverse=True)
ans = 0
for i in range(1, c... | import sys
input = sys.stdin.readline
def main():
N, constW = list(map(int, input().split()))
WV = [list(map(int, input().split())) for _ in range(N)]
W0 = WV[0][0]
L = [[] for _ in range(4)]
for w, v in WV:
w -= W0
L[w].append(v)
L[0].sort(reverse=True)
L[1].sort(reverse=True)
L[2... | p03734 |
# -*- coding: utf-8 -*-
from itertools import accumulate, product
from operator import itemgetter
def inpl(): return tuple(map(int, input().split()))
N, W = inpl()
I = [inpl() for _ in range(N)]
w1 = I[0][0]
A = {w1 + x: [] for x in range(4)}
for w, v in I:
A[w].append(v)
for k, v in list(A.items())... | # -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
from itertools import accumulate, product
N, W = inpl()
A = []
for _ in range(N):
A.append(inpl())
B = [[] for _ in range(4)]
w1 = A[0][0]
for w, v in A:
B[w-w1].append(v)
B = [sorted(b, reverse=True) for b in B]
C =... | p03734 |
n, w = list(map(int, input().split()))
dp = [[[-1]*4*n for j in range(n+1)] for i in range(n+1)]
dp[0][0][0] = 0
w1 = None
for i in range(n):
ws, vs = list(map(int, input().split()))
if i == 0:
w1 = ws
ws -= w1
for j in range(i+2):
for k in range(4*n):
if j-1 >= ... | n,w = list(map(int, input().split()))
w4 = [[] for i in range(4)]
w1 = None
for i in range(n):
ws, vs = list(map(int,input().split()))
if i == 0:
w1 = ws
ws -= w1
w4[ws].append(vs)
for i in range(4):
w4[i].sort(reverse=True)
tmp = [0]
for j in w4[i]:
tmp.append... | p03734 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
from collections import defaultdict
import sys
N_MAX = 100
W_MAX = 10**9
V_MAX = 10**7
INF = 10**10
def main(N, W, items):
dp = defaultdict(lambda: INF)
dp[0] = 0
for i in range(N):
iw, iv = items[i]
for v, w in list(dp.items()):
... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, W, items):
w1 = items[0][0]
dp = [[[0] * (3 * N + 1) for _ in range(N + 1)] for __ in range(N + 1)]
dp[0][0][0] = 0
for i in range(N):
iw, iv = items[i]
iw -= w1
for j in range(N + 1):
for... | p03734 |
from collections import defaultdict
n, wmax = list(map(int, input().split()))
dp = [defaultdict(int) for _ in range(n+1)]
dp[0][0] = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w0 = w
for j in range(n+1):
for k in range(300):
weight = j*w0+k... | from collections import defaultdict
n, wmax = list(map(int, input().split()))
dp = [defaultdict(int) for _ in range(2)]
dp[0][0] = 0
for i in range(n):
w, v = list(map(int, input().split()))
if i == 0:
w0 = w
dp[(i+1)%2] = defaultdict(int)
for j in range(n+1):
for k in range(... | p03734 |
#!/usr/bin/env python3
import sys
from collections import defaultdict
import heapq
from copy import deepcopy
# 各重さごとに価値降順でソート
# とっていく
# 重さ合計は w0 * k ~ (w0 + 3) * kのどれか N=100だと15000通りくらい
def solve(N: int, W: int, ws: "List[int]", vs: "List[int]"):
w0 = ws[0]
dp = defaultdict(lambda: [-1, []]) # dp[... | #!/usr/bin/env python3
import sys
from itertools import accumulate, product
# 各重さごとに価値降順でソート
# とっていく
# 重さ合計は w0 * k ~ (w0 + 3) * kのどれか N=100だと15000通りくらい
def solve(N: int, W: int, ws: "List[int]", vs: "List[int]"):
w0 = ws[0]
items = [[] for _ in range(4)]
accum = [[] for _ in range(4)]
for... | p03734 |
from sys import stdin,setrecursionlimit
n,w = [int(x) for x in stdin.readline().rstrip().split()]
li = [list(map(int,stdin.readline().rstrip().split())) for _ in range(n)]
def knapsack(n,w,li):
#li[i][0]が重さ,li[i][1]が価値(ときどき逆になることがあるので注意)
dp = [[0 for i in range(w+1)]for j in range(n+1)]
#dp[i][total... | from sys import stdin,setrecursionlimit
n,w = [int(x) for x in stdin.readline().rstrip().split()]
li = [list(map(int,stdin.readline().rstrip().split())) for _ in range(n)]
jw = li[0][0]
omosa = [[] for _ in range(4)]
for i in li:
omosa[i[0]-jw].append(i[1])
for i in range(len(omosa)):
omosa[i].s... | p03734 |
def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i+j].isdigit():
t += s[i+j]
if i+j == l-1:
break
j += 1
... | def String2List(s):
L = []
flag = True
l = len(s)
for i in range(l):
if s[i].isdigit() and flag:
t = ""
j = 0
while s[i+j].isdigit():
t += s[i+j]
if i+j == l-1:
break
j += 1
... | p00109 |
def divide(x, y):
s = 1
if(x < 0):s *= -1
if(y < 0):s *= -1
return abs(x) / abs(y) * s
operator = {"+":(lambda x,y: x+y),
"-":(lambda x,y: x-y),
"*":(lambda x,y: x*y),
"/":divide
}
def ind(src, x):
if x not in src:return 1<<30
... | def divide(x, y):
s = 1
if(x < 0):s *= -1
if(y < 0):s *= -1
return abs(x) / abs(y) * s
operator = {"+":(lambda x,y: x+y),
"-":(lambda x,y: x-y),
"*":(lambda x,y: x*y),
"/":divide
}
def ind(src, x):
if x not in src:return 1<<30
... | p00109 |
base = 127
mask = (1 << 32) - 1
def calc_hash(f, pl, tl, with_array):
dl = tl - pl
tmp = []
t = 1
for _ in range(pl):
t = (t * base) & mask
e = 0
for i in range(pl):
e = (e * base + f[i]) & mask
for i in range(dl):
tmp.append(e)
e = (e * bas... | base = 127
mask = (1 << 32) - 1
def calc_hash(f, pl, tl):
dl = tl - pl
tmp = set()
t = 1
for _ in range(pl):
t = (t * base) & mask
e = 0
for i in range(pl):
e = (e * base + f[i]) & mask
for i in range(dl):
tmp.add(e)
e = (e * base - t * f[i]... | p02250 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=[];c=1;d=[]
for i in range(1,n):
b.append(a[i]-a[i-1])
for j in range(1,n-1):
if b[j]*b[j-1]<0 and j-1 not in d:
c+=1
d.append(j)
print(c) | n=int(eval(input()))
a=list(map(int,input().split()))
b=[];c=1;d=-1
for i in range(1,n):
if a[i]-a[i-1]<0:b.append(-1)
elif a[i]-a[i-1]>0:b.append(1)
for j in range(1,len(b)):
if b[j]*b[j-1]<0 and d!=j-1:
c+=1
d=j
print(c) | p03745 |
N = int(eval(input()))
sub = 0
count = 1
A = [int(i) for i in input().split()]
if N > 1:
pre_num = A[1]
pre_sub = A[1] - A[0]
for num in A[2:]:
if not pre_num == num:
if pre_sub * (num - pre_num) < 0:
count += 1
pre_sub = 0
else:
pre_sub = num - pre_... | _ = int(eval(input()))
A = [int(a) for a in input().split()]
selector = 0
count = 1
pre_a = A[0]
for a in A[1:]:
if selector == 0:
selector = a - pre_a
elif selector * (a - pre_a) < 0:
count += 1
selector = 0
pre_a = a
print(count) | p03745 |
def sign(x):
return (x > 0) - (x < 0)
def main():
_ = int(eval(input()))
a = list(map(int, input().split()))
ans = []
arr = []
for an in a:
if len(arr) < 2:
arr.append(an)
else:
state = sum([el - arr[i] for i, el in enumerate(arr[1:])])
... |
def sign(x):
return (x > 0) - (x < 0)
def main():
_ = int(eval(input()))
a = list(map(int, input().split()))
ans = []
arr = []
state = 0
for an in a:
if len(arr) < 2:
arr.append(an)
else:
state += (arr[-1] - arr[-2])
if s... | p03745 |
n=int(eval(input()))
a=list(map(int, input().split()))
ans,c,d=0,1,True
while c<n:
if a[c]==a[c-1]:
c+=1
continue
if d:
f=a[c]>a[c-1]
d=False
elif f:
if a[c]<a[c-1]:
ans+=1
d=True
else:
if a[c]>a[c-1]:
an... | n=int(eval(input()))
a=list(map(int, input().split()))
ans=1
d=0
for i in range(1,n):
diff=a[i]-a[i-1]
if d==0:
d=diff
elif d*diff<0:
d=0
ans+=1
print(ans) | p03745 |
N = int(eval(input()))
A = list(map(int, input().split()))
First = True
ans = 1
status = None
for i in range(1, N):
if First:
if A[i-1] < A[i]:
status = "up"
First = False
continue
elif A[i-1] > A[i]:
status = "down"
First = ... | N = int(eval(input()))
A = list(map(int, input().split()))
ans = 1
status = "Unset"
for i in range(1, N):
if status == "Unset":
if A[i-1] < A[i]:
status = "UP"
elif A[i-1] > A[i]:
status = "DOWN"
else:
if status == "UP" and A[i-1] > A[i]:
... | p03745 |
# AGC013A - Sorted Arrays
def main():
n = int(eval(input()))
A = tuple(map(int, input().rstrip().split()))
# compress continuous parts of same numbers (e.g. 111 -> 1)
B, cur = [], 0
for i in A:
if i != cur:
B += [i]
cur = i
B += [0]
# check the ... | # AGC013A - Sorted Arrays
def main():
n = int(eval(input()))
A = tuple(map(int, input().split()))
ans, cur = 0, A[0]
flg = 0 # unknown (0), increasing (1), decreasing (2)
for i in A:
if (flg == 1 and i < cur) or (flg == 2 and i > cur): # end of trend
ans += 1
... | p03745 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,*A = list(map(int,read().split()))
# まず、重複を除外
B = [A[0]] + [y for x,y in zip(A,A[1:]) if x != y]
seq = []
answer = 0
for x in B:
if not seq:
answer += 1
seq.append(... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, *A = list(map(int, read().split()))
# 減少中、増大中であるようなときの数列の個数のmin
dp = 1, 1
for i in range(1, N):
if A[i] > A[i-1]:
dp = min(dp)+1, min(dp[0]+1, dp[1])
elif A[i] == A[i-1]... | p03745 |
def main():
n, *a = list(map(int, open(0).read().split()))
c = 1
f = 0
d = {True: 1, False: -1}
for i, j in zip(a, a[1:]):
if i == j:
continue
else:
g = d[i < j]
if f * g == -1:
f = 0
c += 1
else:
f = g
... | def main():
n, *a = list(map(int, open(0).read().split()))
c = 1
f = 0
d = [-1,1]
for i, j in zip(a, a[1:]):
if i == j:
continue
else:
g = d[i < j]
if f * g == -1:
f = 0
c += 1
else:
f = g
print(c)
... | p03745 |
N = int(eval(input()))
A = list(map(int, input().split()))
if N == 1:
print((1))
elif N == 2:
print((1))
else:
cnt = 0
for i in range(N - 1):
if A[i] == A[i + 1]:
A[i] = 0
cnt += 1
for _ in range(cnt):
A.remove(0)
#print(A)
i = 1
... | N = int(eval(input()))
B = list(map(int, input().split()))
if N == 1:
print((1))
elif N == 2:
print((1))
else:
A = [B[0]]
cnt = 0
for i in range(N - 1):
if B[i] == B[i + 1]:
pass
else:
A.append(B[i+1])
i = 1
ans = 1
n = len(A)
... | p03745 |
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 1
i = -1
flg = True
while True:
i += 1
if i >= n-1:
break
if a[i] < a[i+1]:
flg = True
elif a[i] > a[i+1]:
flg = False
else:
continue
for k in range(i, n-1):
if (flg and a[k] > a[k+1]) or ((not flg) and a[k]... | n = int(eval(input()))
a = list(map(int, input().split()))
cnt = 1
b = [0] + a
c = [(i-j)//abs(i-j) for i, j in zip(a, b) if i != j]
del c[0]
if c:
mae=c[0]
d=iter(c)
for x in d:
if x != mae:
cnt += 1
try:
mae = d.__next__()
except StopIteration:
break
print(c... | p03745 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=0
ans=1
for i in range(n-1):
if b==0 and a[i]!=a[i+1]:b=(a[i]<a[i+1])-(a[i]>a[i+1])
elif a[i]<a[i+1] and b==-1:
ans+=1
b=0
elif a[i]>a[i+1] and b==1:
ans+=1
b=0
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
b=0
ans=1
for i in range(n-1):
if b==0 and a[i]!=a[i+1]:
if a[i]<a[i+1]:b=1
else:b=-1
elif(a[i]<a[i+1] and b==-1)or(a[i]>a[i+1] and b==1):
ans+=1
b=0
print(ans) | p03745 |
n = int(eval(input()))
a = list(map(int, input().split()))
count = 0
sign = 0
num = 0
ans = 0
for i, ai in enumerate(a):
if count == 0:
num = ai
sign = 0
count += 1
elif count == 1:
if ai > num:
sign = 1
elif ai < num:
sign = -1
... | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
up = None
for l, r in zip(a, a[1:]):
if l == r:
continue
if l < r:
if up is None:
up = True
elif not up:
ans += 1
up = None
else:
if up is None:
... | p03745 |
n = int(eval(input()))
aa =list(map(int, input().split()))
list1 =[0] * n
cnt = 0
for i in range(n-1):
if aa[i+1] > aa[i]:
list1[i+1] = 1
elif aa[i+1] < aa[i]:
list1[i+1] = -1
elif aa[i+1] == aa[i]:
list1[i+1] = 0
while 1 in list1 and -1 in list1:
if list1[1] == 1:
for... | n = int(eval(input()))
aa =list(map(int, input().split()))
list1 =[0] * n
cnt = 1
for i in range(n-1):
if aa[i+1] > aa[i]:
list1[i+1] = 1
elif aa[i+1] < aa[i]:
list1[i+1] = -1
elif aa[i+1] == aa[i]:
list1[i+1] = 0
while 1 in list1 and -1 in list1:
del list1[:max(list1.index(1),... | p03745 |
N = int(eval(input()))
A = list(map(int, input().split()))
if(N == 1):
print((1))
exit(0)
cur = A[0]
# 昇順(1)か降順(0)かのフラグ
ans = 1
flag = -1
for i in range(1, N):
if(cur == A[i]): continue
if(flag == -1):
if(A[i] > cur): flag = 1
elif(A[i] < cur): flag = 0
cur = A[i]
... | N = int(eval(input()))
A = list(map(int, input().split()))
if(N == 1):
print((1))
exit(0)
cur = A[0]
# 昇順(1)か降順(0)かのフラグ
ans = 1
flag = -1
for i in range(1, N):
if(cur == A[i]): continue
if(flag == -1):
if(A[i] > cur): flag = 1
elif(A[i] < cur): flag = 0
elif(flag == 1 a... | p03745 |
import sys
def solve():
n = int(input())
A = [int(i) for i in input().split()]
flag = 0
l = 0
r = 0
cnt = 0
while r < n - 1:
if A[r] == A[r + 1]:
r += 1
elif A[r] < A[r + 1]:
if flag == 2:
cnt += 1
fl... | import sys
def solve():
n = int(eval(input()))
a = [int(i) for i in input().split()]
ans = 0
mode = 0
for i in range(1, n):
if a[i] > a[i - 1]:
if mode == -1:
ans += 1
mode = 0
else:
mode = 1
... | p03745 |
__DEUBG__ = 0
import math
import sys
num = int(eval(input()))
seq = list(map(int, input().split()))
prev = None
tmp = []
increase = None
count = 0
def dump(x):
from pprint import pprint
pprint(x)
#breakpoint()
for x in seq:
if __DEUBG__:
print(x)
print(tmp)
i... | num = int(eval(input()))
seq = list(map(int, input().split()))
prev = None
increase = None
count = 0
prev = seq[0]
for x in seq[1:]:
if increase is True:
if x >= prev:
pass
else:
increase = None
count += 1
elif increase is False:
if x... | p03745 |
N = int(eval(input()))
line = [int(x) for x in input().split(' ')]
count = 1
prev = line[0]
i = 0
while i < len(line):
if prev == line[i]:
i += 1
continue
elif prev < line[i]:
for j in range(i,len(line)):
if line[j] < prev:
count+=1
i = j
break
prev = l... | N = int(eval(input()))
line = [int(x) for x in input().split(' ')]
count = 1
prev = line[0]
i = 0
while i < len(line):
if prev == line[i]:
i += 1
continue
elif prev < line[i]:
for j in range(i,len(line)):
if line[j] < prev:
count+=1
break
prev = line[j]
i =... | p03745 |
from collections import deque
n = int(eval(input()))
a = list(map(int,input().split()))
d = deque(a)
tmp = []
cnt = 0
while d:
v = d.popleft()
if len(tmp)<=1:
pass
else:
if not (v >= tmp[-1] >= tmp[-2] >= tmp[0] or v <= tmp[-1] <= tmp[-2] <= tmp[0]):
tmp = []
cnt += 1
tmp... | from collections import deque
n = int(eval(input()))
a = list(map(int,input().split()))
d = deque(a)
tmp = []
cnt = 0
while d:
v = d.popleft()
if len(tmp)>=2:
if not (v >= tmp[-1] >= tmp[0] or v <= tmp[-1] <= tmp[0]):
tmp = []
cnt += 1
tmp.append(v)
print((cnt+1 if tmp else cn... | p03745 |
def my_sign(n):
return (n > 0) - (n < 0)
def kugiri(cnt, lst):
if len(lst) <= 1:
return cnt
else:
pm = lst[0]
i = 1
fl = 0
while i < len(lst):
if pm == lst[i]:
i += 1
continue
else:
... | def main():
N = int(eval(input()))
lst = [int(_) for _ in input().split()]
last = lst[0]
A = [last]
for i in range(1, N):
if lst[i] == last: continue
last = lst[i]
A.append(lst[i])
left = right = output = 0
while left < len(A):
if left == len(A)-1:
... | p03745 |
from itertools import groupby
N = int(eval(input()))
A = list(map(int, input().split(" ")))
b = [A[i+1]-A[i] for i in range(N-1)]
for i in range(b.count(0)):
b.remove(0)
b = [0<b_i for b_i in b]
b = [len(list(v)) for k, v in groupby(b)]
# print(b)
if len(b) <= 1:
print((1))
exit()
... | # 傾きの正負の変化を調べるのに、
# AとB(傾き)をかけてその符号を見るという方法があると気づいた
N = int(eval(input()))
A = list(map(int, input().split(" ")))
c = 1
e = 0
for i in range(N-1):
d = A[i+1]-A[i]
# print(d, e, e*d < 0)
# 一方が負の数、もう一方が正の数なら
if e*d < 0:
c += 1
e = 0
elif d != 0: # この条件忘れた
e = d
... | p03745 |
n = int(eval(input()))
array = list(map(int, input().split()))
status = 0
past = 0
tail = 0
count = 1
for i in range(1, n):
past = status
if(array[i-1] < array[i]):
if(status == 0):
past = 1
status = 1
elif(array[i-1] > array[i]):
if (status == 0):
... | n = int(eval(input()))
array = list(map(int, input().split()))
status = 0
past = 0
count = 1
for i in range(1, n):
past = status
if(array[i-1] < array[i]):
if(status == 0):
past = 1
status = 1
elif(array[i-1] > array[i]):
if (status == 0):
past = ... | p03745 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
t = 0
for k in range(1,N):
if A[k-1] > A[k]:
t = -1
break
elif A[k-1] < A[k]:
t = 1
break
if t==0:
print((1))
exit(0)
k = 0
while k < N-1:
k += 1
if t == 1:
if A[k-1] >... | N = int(eval(input()))
A = list(map(int,input().split()))
A = A
f = 0
ans = 1
for k in range(N-1):
if f == 0:
if A[k] > A[k+1]:
f = -1
elif A[k] < A[k+1]:
f = 1
elif f == 1:
if A[k] > A[k+1]:
ans += 1
f = 0
else:
... | p03745 |
n,*l=list(map(int,open(0).read().split()))
a=b=0
c=0
l+=[0]
while True:
while l[a]<=l[a+1] and a!=n-1:
a+=1
while l[b]>=l[b+1] and b!=n-1:
b+=1
a=b=max(a,b)+1
c+=1
if a==n-1:
c+=1
break
elif a==n:
break
print(c) | n,*l=list(map(int,open(0).read().split()))
a=b=c=0;f=1;l+=[0,1]
while f:
while l[a]<=l[a+1]:a+=1
while l[b]>=l[b+1]:b+=1
a=b=max(a,b)+1
c+=1;f=a<n
print(c) | p03745 |
N = int(eval(input()))
A = list(map(int, input().split()))
def solve(N,A):
liss = []
lis = []
lis.append(A[0])
a = A[0]
for i in range(1,N):
if len(lis)==1 or prev==0:
if A[i]>a:
prev = 1
elif A[i]<a:
prev = -1
... | N = int(eval(input()))
A = list(map(int, input().split()))
def solve(N,A):
liss = []
lis = []
lis.append(A[0])
a = A[0]
for i in range(1,N):
if len(lis)==1 or prev==0:
if A[i]>a:
prev = 1
elif A[i]<a:
prev = -1
... | p03745 |
N = int(eval(input()))
A = list(map(int, input().split()))
def solve(N,A):
ans = 1
lis = [A[0]]
for i in range(1,N):
if len(lis)==1 or diff==0:
diff = A[i]-A[i-1]
elif (A[i]-A[i-1])*diff<0:
ans += 1
lis = []
lis.append(A[i])
a =... | N = int(eval(input()))
A = list(map(int, input().split()))
def solve(N,A):
ans = 1
lis = [A[0]]
for i in range(1,N):
if len(lis)==1 or diff==0:
diff = A[i]-A[i-1]
elif (A[i]-A[i-1])*diff<0:
ans += 1
lis = []
lis.append(A[i])
return ... | p03745 |
N = int(eval(input()))
A = input().split()
c = 1
i = 1
while i <= N-2:
if int(A[i])-int(A[i-1]) > 0:
if int(A[i+1])-int(A[i]) < 0:
c += 1
i += 2
elif int(A[i+1])-int(A[i]) > 0:
i += 1
else:
while int(A[i])-int(A[i-1]) == 0:
i += 1
if int(A[i])-int(A[i-1]) < 0:
c += 1
... | N = int(eval(input()))
A = input().split()
c = 1
i = 1
while i <= N-1:
if int(A[i])-int(A[i-1]) == 0:
del A[i-1]
N -= 1
else:
i += 1
i = 1
while i <= N-2:
if int(A[i])-int(A[i-1]) > 0:
if int(A[i+1])-int(A[i]) < 0:
c += 1
i += 2
else:
i += 1
else:
if int(A[i+1])-int(A... | p03745 |
n = eval(input())
a = list(map(int, input().split()))
b = []
for i in range(1, n):
if a[i] - a[i-1] != 0:
b.append(a[i] - a[i-1])
dont_mind = True
c = 1
i = 1
while i < len(b):
prev = b[i-1]
t = prev * b[i]
if t >= 0:
i += 1
continue
if t < 0:
c += 1... | # coding: utf-8
# AGC 013 a
# Here your code !
n = eval(input())
if n <= 2:
print(1)
exit()
a = list(map(int, input().split()))
c = 1
status = "n"
i = 1
while i < n:
if status == "n":
if a[i-1] < a[i]:
status = "i"
elif a[i-1] > a[i]:
status... | p03745 |
# coding:utf-8
import sys
from collections import Counter
input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
ans = 1
prev = A[0]
state = 0
for i in range(1, N):
if state == 0:
if A... | # coding:utf-8
import sys
from collections import Counter
# input = sys.stdin.readline
INF = float('inf')
MOD = 10 ** 9 + 7
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
ans = 1
prev = A[0]
state = 0
for i in range(1, N):
if state == 0:
if... | p03745 |
# coding:utf-8
def inpl(): return list(map(int, input().split()))
N = int(eval(input()))
A = inpl()
ans = 1
prev = A[0]
state = 0 # 1: 増加, 0: 横ばい, -1: 減少
for i in range(1, N):
if state == 0:
if A[i] > prev:
state = 1
elif A[i] < prev:
state = -1
... | # coding:utf-8
import sys
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return ... | p03745 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
i = 1
while i <= N-1:
if m < A[i]:
if state == 0:
state = 1
m = A[i]
elif state == 1:
m = A[i]
else:
ans += 1... | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
i = 1
while i <= N-1:
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if sta... | p03745 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
i = 1
while i <= N-1:
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if sta... | N = int(eval(input()))
A = list(map(int,input().split()))
#state0は未定、1は広義単調増加、2は広義単調減少
state = 0
m = A[0]
ans = 1
for i in range(1,N):
if m < A[i]:
if state == 0:
state = 1
elif state == 2:
ans += 1
state = 0
elif m > A[i]:
if state == ... | p03745 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
up = dn = False
for a,b in zip(A,A[1:]):
if a < b:
if up: continue
up = True
if dn:
ans += 1
up = dn = False
elif a > b:
if dn: continue
dn = True
if up:
... | N = int(eval(input()))
A = list(map(int,input().split()))
up = dn = False
ans = 1
p = A[0]
for a in A:
if p < a:
up = True
elif p > a:
dn = True
if up and dn:
ans += 1
up = dn = False
p = a
print(ans) | p03745 |
N = int(eval(input()))
A = list(map(int,input().split()))
ans = 0
while len(A):
for i in range(len(A)-2):
if (A[i+2]-A[i+1]>0)!=(A[i+1]-A[i]>0) and A[i+2]-A[i+1]!=0 and A[i+1]-A[i]!=0:
A = A[i+2:]
ans += 1
break
else:
break
print((ans+1)) | N = int(eval(input()))
A = list(map(int,input().split()))
ans = 1
d = 0
tmp = A[0]
for a in A[1:]:
if d*(a-tmp) < 0:
ans += 1
d = 0
else:
d += a-tmp
tmp = a
print(ans) | p03745 |
def upper_or_lower(i):
if A[i] < A[i + 1]:
return "upper"
elif A[i] > A[i + 1]:
return "lower"
else:
return upper_or_lower(i + 1)
N = int(eval(input()))
A = list(map(int, input().split()))
state = "upper" # state が upper か lower で判定
ans = 1
# i = 0 の処理
if (len(A)... | N = int(eval(input()))
A = list(map(int, input().split()))
change = 0 # 1, 0, -1
ans = 1
for i in range(N-1):
if A[i+1] - A[i] > 0:
if change == 0:
change = 1
elif change == -1:
ans += 1
change = 0
else:
continue
elif A[i+... | p03745 |
n = int(eval(input()))
a = list(map(int, input().split()))
if n <= 2:
print((1))
exit()
dec, inc = False, False
cnt = 1
for i in range(n-1):
if a[i+1] - a[i] < 0:
dec = True
elif a[i+1] - a[i] > 0:
inc = True
if dec and inc:
cnt += 1
dec, inc = F... | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 1
up = None
for x, y in zip(a, a[1:]):
if x < y:
if up is None:
up = True
elif not up:
ans += 1
up = None
elif x > y:
if up is None:
up = False
elif ... | p03745 |
def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
idx = 0
ans = 0
for i in range(len(A)):
if idx + 1 > len(A) - 1 :
break
m = ""
if A[idx] < A[idx + 1]:
m = "+"
elif A[idx] > A[idx + 1]:
m ... | def main():
N = int(eval(input()))
A = [int(a) for a in input().split()]
idx = 0
ans = 0
for i in range(len(A)):
if idx + 1 > len(A) - 1 :
break
m = ""
if A[idx] < A[idx + 1]:
m = "+"
elif A[idx] > A[idx + 1]:
m = "-... | p03745 |
import sys
read= sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 1000000007
sys.setrecursionlimit(10**7)
#N,*A = map(int,read().split())
N = int(eval(input()))
A = list(map(int,input().split()))
State = 0
res = 1
for i in range(1,N):
if A[i... | import sys
read= sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 1000000007
sys.setrecursionlimit(10**7)
#N,*A = map(int,read().split())
N = int(eval(input()))
A = list(map(int,input().split()))
#現在作ってる数列の種類を記録
# 単調増加：1
# 単調減少 ：-1
# 初期値:0
State ... | p03745 |
n=int(eval(input()))
a=list(map(int,input().split()))+[0]
a=[a[i] for i in range(n) if a[i]!=a[i+1]]
s=0
while a:
n=len(a)
if n==1:
a=[]
else:
d=a[0]-a[1]>0
for i in range(n-1):
if d==(a[i]-a[i+1]<0):
a=a[i+1:]
break
else:
a=[]
s+=1
print(s)
| n = int(eval(input()))
ans = 1
a, b = False, False
x = list(map(int, input().split()))
for i in range(1, n):
if x[i] > x[i - 1]:
a = True
if x[i] < x[i - 1]:
b = True
if a and b:
a, b = False, False
ans += 1
print(ans)
| p03745 |
N = int(eval(input()))
cnt = 0
L = list(map(int,input().split()))
while True:
try:
if L[0] <L[1]>L[2] or L[0] > L[1] <L[2]:
a0=L.pop(0)
a1=L.pop(0)
cnt += 1
else:
L.pop(0)
except:
break
print((1+cnt))
| N = int(eval(input()))
cnt = 0
tmp = ''
M = list(map(int,input().split()))
L = []
for x in M:
if x == tmp:
pass
else:
L.append(x)
tmp = x
while True:
try:
if L[0] <L[1]>L[2] or L[0] > L[1] <L[2]:
a0=L.pop(0)
a1=L.pop(0)
... | p03745 |
def main():
n = int(eval(input()))
A = list(map(int, input().split()))
res = 0
i = 1
while i < len(A) - 1:
if (A[i - 1] < A[i] and A[i] > A[i + 1]) or (A[i - 1] > A[i] and A[i] < A[i + 1]):
res += 1
A = A[i + 1:]
i = 1
else:
... | def main():
n = int(eval(input()))
A = list(map(int, input().split()))
res = 1
inc = 0
dec = 0
for i in range(n - 1):
if A[i] < A[i+1]:
inc += 1
elif A[i] > A[i+1]:
dec += 1
if inc and dec:
res += 1
... | p03745 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.