input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python
# coding: utf-8
# In[15]:
N = int(eval(input()))
P = list(map(int, input().split()))
print((sum([1 if x == min(P[:i+1]) else 0 for i,x in enumerate(P)])))
# In[ ]:
| #!/usr/bin/env python
# coding: utf-8
# In[22]:
N = int(eval(input()))
P = list(map(int, input().split()))
# In[23]:
ans = 0
tmp = P[0]
for i in range(N):
if P[i] <= tmp:
ans += 1
tmp = P[i]
print(ans)
# In[ ]:
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
flag = True
for j in range(i):
if P[j] < P[i]:
flag = False
break
if flag:
c += 1
print(c) | N = int(eval(input()))
P = list(map(int, input().split()))
c = 1
tmp = P[0]
for i in range(1,N):
tmp = min(tmp,P[i-1])
if tmp >= P[i]:
c += 1
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ret = 0
for i in range(n):
f = True
for j in range(i):
f = f and (p[i] <= p[j])
if not f:
break
if f:
ret +=1
print(ret) | n = int(eval(input()))
p = list(map(int, input().split()))
mn = p[0]
ret = 0
for i in range(n):
if mn >= p[i]:
ret += 1
mn = min(mn, p[i])
print(ret) | p02791 |
n = int(eval(input()))
p_list = list(map(int,input().split()))
count = 1
for i in range(1, n):
if min(p_list[:i+1]) == p_list[i] :
count += 1
print(count) | n = int(eval(input()))
p_list = list(map(int,input().split()))
count = 1
min = min(p_list[:1])
for i in range(1, n):
if min > p_list[i] :
count += 1
min = p_list[i]
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
counter = 1
for i in range(1, N):
if min(P[:i+1])==P[i]:
counter += 1
print(counter) | N = int(eval(input()))
P = list(map(int, input().split()))
counter = 1
minimum = P[0]
for i in range(1, N):
minimum = min(minimum, P[i])
if minimum==P[i]:
counter += 1
print(counter) | p02791 |
N = int(eval(input()))
l = input().split(" ")
P = [int(n) for n in l]
# i=1は必ずOK
c = 1
for i in range(1,N):
n_i = P[i]
p = P[:i+1]
for j in range(i+1):
if p[j] < n_i:
break
if j==i:
c+=1
print(c) | N = int(eval(input()))
l = input().split(" ")
P = [int(n) for n in l]
# i=1は必ずOK
c = 1
min = P[0]
for i in range(1,N):
p = P[i]
if p<=min:
c+=1
min=p
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 1
l = []
for i in range(1,n):
l = p[0:i]
if p[i] <= min(l):
ans += 1
else:
pass
print(ans)
|
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
currentMin = 10 ** 9
s = []
for i in range(n):
if currentMin > min(currentMin,p[i]):
currentMin = min(currentMin,p[i])
s.append(currentMin)
else:
s.append(currentMin)
for i in range(len(p)):
if p[i] == s[i]:
ans += 1
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
while True:
if len(p) == 1:
break
num = p.pop(-1)
if num <= min(p):
count += 1
print((count+1))
| n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
m = p[0]
for i in range(len(p)):
if m >= p[i]:
count += 1
m = p[i]
print(count)
| p02791 |
n=int(eval(input()))
a=list(map(int,input().split()))
cnt=0
for i in range(len(a)):
if a[i]<=min(a[:i+1]):
cnt+=1
print(cnt) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt=0
min_num=p[0]
for i in p:
if i<=min_num:
min_num=i
cnt+=1
print(cnt) | p02791 |
def main():
N=int(eval(input()))
P=[int(_) for _ in input().split()]
ans = 0
for i in range(N):
if P[i] == min(P[:i+1]):
ans += 1
print(ans)
main()
| INF=float('inf')
def main():
N=int(eval(input()))
P=[int(_) for _ in input().split()]
tmp=INF
ans = 0
for i in range(N):
if tmp > P[i]:
ans += 1
tmp = min(tmp, P[i])
print(ans)
main()
| p02791 |
# 初期入力
N = int(eval(input()))
P = list(map(int, input().split()))
# 右から１つ目と２つ目だけ比較し分岐
count =1 # 一つ目（添え字０）は必ずOK
for i in range(1,N):
if P[i-1] < P[i]: # 増えていたら×
#print(P[i],P[:i+1])
continue
elif P[i] ==min(P[:i+1]): # 減っていてかつMinならOK
#print(P[i],P[:i+1])
count +=1
print(count) | # 初期入力
N = int(eval(input()))
P = list(map(int, input().split()))
# 右から１つ目と２つ目だけ比較し分岐
count =1 # 一つ目（添え字０）は必ずOK
P_min = P[0]
for i in range(1,N):
if P[i-1] < P[i]: # 増えていたら×
#print(P[i],P[:i+1])
continue
elif P[i] <= P_min: # 今までのPで最小値ならOK
#print(P[i],P[:i+1])
count +=1
P_min = P[i]
print(count) | p02791 |
n=int(eval(input()))
l=list(map(int, input().split()))
cnt=0
for i in range(1,n+1):
if l[i-1]==min(l[:i]):
cnt+=1
print(cnt) | n=int(eval(input()))
l=list(map(int, input().split()))
cnt=1
nmin=l[0]
for i in range(1,n):
if nmin>=l[i]:
cnt+=1
nmin=l[i]
print(cnt) | p02791 |
n = int(eval(input()))
ps = list(map(int, input().split()))
result = 1
for i in range(1,n):
if ps[i] < min(ps[:i]):
result += 1
print(result) | n = int(eval(input()))
ps = list(map(int, input().split()))
result = 0
min_p = ps[0]
for i in range(0,n):
if ps[i] <= min_p:
result += 1
min_p = ps[i]
print(result) | p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
mi=10**9
mi_lst=[]
cnt=0
for i in range(n):
if l[i]<mi:
mi_lst.append(l[i])
mi=min(mi,l[i])
cnt+=1
else:mi_lst.append(l[-1])
print(cnt) | n=int(eval(input()))
l=list(map(int,input().split()))
mi=10**9
cnt=0
for i in range(n):
if l[i]<mi:
mi=min(mi,l[i])
cnt+=1
print(cnt) | p02791 |
n = int(eval(input()))
plist = list(map(int,input().split()))
islow = True
counter = 0
min = 0
for i in range(len(plist)):
islow = True
if i == 0:
counter += 1
min = plist[i]
current_min = i
elif min > plist[i]:
for j in range(current_min+1, plist.index(plist[i-1])):
if plist[i] <= plist[j]:
pass
else:
islow = False
break
if islow:
counter += 1
min = plist[i]
current_min = i
print(counter) | n = int(eval(input()))
plist = list(map(int,input().split()))
islow = True
counter = 0
min = 0
for i in range(len(plist)):
islow = True
if i == 0:
counter += 1
min = plist[i]
current_min = i
elif min > plist[i]:
counter += 1
min = plist[i]
current_min = i
print(counter) | p02791 |
n = int(eval(input()))
l = list(map(int,input().split()))
count = 0
ll = [l[0]]
for i in range(n):
m = l[i]
ll.append(m)
if min(ll) == m:
count = count + 1
print(count)
| n = int(eval(input()))
l = list(map(int,input().split()))
count = 0
f = l[0]
count = 0
for i in range(n):
m = l[i]
if f >= m :
count += 1
f = m
print(count) | p02791 |
n=int(eval(input()))
a=list(map(int,input().split()))
m=a[0]
ans=0
for i in a:
if i<=m:
ans+=1
m=min(i,m)
#print(m)
print(ans) | now_min=float("inf")
n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for pi in p:
if pi<=now_min:
ans+=1
now_min=pi
print(ans) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(n):
if min(P[:i+1]) == P[i]:
ans += 1
print(ans) | n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min = n+1
for i in range(n):
if P[i] < min:
min = P[i]
ans += 1
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
count=1
for i in range(1,n):
if p[i]<=min(p[:i+1]):
count+=1
print(count) | n=int(eval(input()))
p=list(map(int,input().split()))
count=0
pmin=float('inf')
for i in range(n):
pmin=min(pmin,p[i])
if p[i]<=pmin:
count+=1
print(count) | p02791 |
import sys
n_in = eval(input())
result = input().split()
total = 0
n_in = int(n_in)
for k0 in range(n_in):
count = 0
for l0 in range(k0):
if int(result[k0]) <= int(result[l0]):
count += 1
if count == k0:
total += 1
print(total)
| import sys
n_in = eval(input())
result = input().split()
total = 0
n_in = int(n_in)
p_min = int(result[0])
for k0 in range(n_in):
count = 0
if int(result[k0]) <= p_min:
total += 1
p_min = int(result[k0])
print(total)
| p02791 |
n = int(eval(input()))
l = list(map(int, input().split()))
print((sum(l[i] == min(l[:i+1]) for i in range(n)))) | n = int(eval(input()))
l = list(map(int, input().split()))
m = 200001
ans = 0
for i in range(n):
if l[i] < m:
m = l[i]
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
l = list(map(int, input().split()))
m = 200001
ans = 0
for i in range(n):
if l[i] < m:
m = l[i]
ans += 1
print(ans) | f=input
f(); l=list(map(int,f().split()))
a,m=0,200001
for i in l:
if i<m: m=i; a+=1
print(a) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
tmp = []
ans = 0
for i in range(n):
tmp.append(p[i])
if min(tmp)>=p[i]:
ans+=1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
mtmp = p[0]
ans = 0
for i in range(0,n):
if mtmp>=p[i]:
mtmp=p[i]
ans+=1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
answer = 0
for i in range(N):
if P[i] <= min(P[0: i + 1]):
answer += 1
print(answer)
| N = int(eval(input()))
P = list(map(int, input().split()))
answer = 0
minimum = P[0]
for i in range(N):
if P[i] <= minimum:
answer += 1
minimum = min(P[i], minimum)
print(answer) | p02791 |
N = int(eval(input()))
P = [int(k) for k in input().split()]
result = 0
for i in range(N):
for j in range(0,i):
# j < i
if P[i] > P[j]:
result = result - 1
break
print((N+result))
| N = int(eval(input()))
P = [int(k) for k in input().split()]
maxes = []
mins = []
max = 0
min = 0
result = 0
for i in range(N):
if i == 0:
max = P[i]
min = P[i]
else:
if(max < P[i]):
max = P[i]
if(min > P[i]):
min = P[i]
maxes.append(max)
mins.append(min)
for i in range(N):
if mins[i] == P[i]:
result = result + 1
print(result)
| p02791 |
n = int(eval(input()))
import sys
pn = list(map(int, sys.stdin.readline().split()))
ans = 1
for i in range(1, n):
if min(pn[:i+1])==pn[i]:
ans += 1
print(ans) | n = int(eval(input()))
import sys
pn = list(map(int, sys.stdin.readline().split()))
ans = 1
mini = pn[0]
for i in range(1, n):
mini = min(mini, pn[i])
if mini==pn[i]:
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
line = list(map(int,input().split()))
a = 0
p = []
for i in line:
p.append(i)
m = min(p)
if m >= i:
a += 1
print(a) | N = int(eval(input()))
line = list(map(int,input().split()))
a = 1
m = line[0]
for i in range(N-1):
if m >= line[i]:
m = line[i]
if m >= line[i+1]:
a += 1
print(a) | p02791 |
N = int(eval(input()))
A = list(map(int , input().split()))
count = 0
j_lis = []
for i in range(len(A)):
if min(list(A[0:i+1])) >= A[i]:
count += 1
print(count) | N = int(eval(input()))
A = list(map(int , input().split()))
count = 0
j = A[0]
for i in range(len(A)):
j = min(j , A[i])
if j >= A[i]:
count += 1
print(count) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
a=[]
cnt =0
for i in range(n):
for j in range(i+1):
a.append(p[j])
if min(a) < p[i]:
cnt += 1
a.clear()
print((n-cnt)) | n=int(eval(input()))
p=list(map(int,input().split()))
cnt =0
mi=n + 1
for i in range(1,n+1):
mi = min(mi,p[~-i])
if mi == p[i-1]:
cnt+=1
print(cnt) | p02791 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(0, n):
for j in range(0, i + 1):
if p[i] > p[j]:
break
elif j == i:
count += 1
print(count)
if __name__ == "__main__":
main()
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
n_min = 0
for i in range(0, n):
if i == 0:
count += 1
n_min = p[i]
continue
if p[i] <= n_min:
count += 1
n_min = p[i]
print(count)
if __name__ == "__main__":
main()
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
c = 0
for i in range(n):
c += all(p[i] <= p[j] for j in range(i))
print(c)
| n = int(eval(input()))
p = list(map(int,input().split()))
c = 0
a = p[0]
for i in range(n):
c += p[i] <= a
a = min(p[i],a)
print(c)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n):
if all(p[i] <= p[j] for j in range(i)):
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
mn = float('inf')
for i in range(n):
if p[i] < mn:
ans += 1
mn = min(mn,p[i])
print(ans)
| p02791 |
n=int(eval(input()))
List=list(map(int,input().split()))
newList =[0] * n
count = 0
for i in range(1, n + 1):
# print(i)
# print(List[0:i])
# print(min(List[0:i]))
newList[i - 1] = min(List[0:i])
# print(newList)
for j in range(n):
if(List[j] <= newList[j]):
count = count + 1
print(count) | n=int(eval(input()))
List=list(map(int,input().split()))
newList =[0] * n
count = 0
min = List[0]
# print(List)
for i in List:
# 最小値更新
if i < min:
min = i
# カウントする
if min >= i:
count = count + 1
print(count) | p02791 |
# 任意のj <= iに対して P[i] <= P[j]
N = int(eval(input()))
P = [int(e) for e in input().split()]
i_count = 0
for i in range(N):
if P[i] == min(P[:i+1]):
i_count += 1
print(i_count)
| N = int(eval(input()))
P = [int(e) for e in input().split()]
i_count = 0
min_P = 200001
for i in range(N):
if min_P > P[i]:
min_P = P[i]
i_count += 1
print(i_count)
| p02791 |
N=int(eval(input()))
p = list(map(int,input().split()))
cnt=0
x=[]
for i in range(N):
if i==0:
x+=[p[i]]
cnt+=1
else:
mi = min(x)
if p[i] <= mi:
cnt+=1
x += [p[i]]
else:
continue
print(cnt) | N=int(eval(input()))
p = list(map(int,input().split()))
cnt=0
x=[]
for i in range(N):
if i==0:
x=p[i]
cnt+=1
else:
if p[i]<x:
x=p[i]
if p[i] <= x:
cnt+=1
x = p[i]
else:
continue
print(cnt) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
sum=0
for i in range(n):
count=0
l=i
for j in range(l):
if p[l]<=p[j]:
count+=1
if count==i:
sum+=1
print((str(sum)))
| n=int(eval(input()))
p=list(map(int,input().split()))
count=0
min=1000000
for i in range(n):
if p[i]<=min:
count+=1
min=p[i]
print((str(count)))
| p02791 |
def number(m,l):
count=0
mini=l[0]
for i in range(m):
if l[i]<=mini:
mini=l[i]
#miniはi-1番目のうち最も小さい値であるから、これより小さかったら、i-1番目のどれよりも小さい
count+=1
return count
n=int(eval(input()))
p=list(map(int,input().split()))
result=number(n,p)
print(result) | def number(l):
count=0
mini=l[0]
for i in range(n):
if l[i]<=mini:
mini=l[i]
#miniはi-1番目のうち最も小さい値であるから、これより小さかったら、i-1番目のどれよりも小さい
count+=1
return count
n=int(eval(input()))
p=list(map(int,input().split()))
result=number(p)
print(result) | p02791 |
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 21:01:18 2020
@author: over-
"""
N=int(eval(input()))
P=input().split()
c=1
for i in range(1,N):
bool=True
for j in range(i):
if int(P[i])>int(P[j]):
bool=False
break
if bool: c+=1
print(c) | # -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 21:01:18 2020
@author: over-
"""
N=int(eval(input()))
P=input().split()
c=1
m=int(P[0])
for i in range(1,N):
if m>int(P[i]):
c+=1
m=int(P[i])
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
m = float('INF')
ans = 0
for i in range(N):
if P[i] < m:
ans += 1
m = P[i]
print(ans)
| N = int(eval(input()))
P = list(map(int, input().split()))
minimal = float('inf')
ans = 0
for i in P:
if minimal >= i:
ans += 1
minimal = i
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n):
li = p[:i+1]
if min(li) == p[i]:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
m = p[0]
count = 1
for i in range(1,n):
if m >= p[i]:
m = p[i]
count += 1
print(count) | p02791 |
N = int(eval(input()))
ps = [int(i) for i in input().split()]
cnt = 0
mark = ps[0]
for p in ps:
if mark >= p:
cnt += 1
mark = min(mark, p)
print(cnt)
| N = int(eval(input()))
ps = [int(i) for i in input().split()]
cnt = 1
mark = ps[0]
for p in ps[1:]:
if mark >= p:
cnt += 1
mark = p
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 1; Pj = [P[0]]
for i in range(1, N):
if min(Pj) > P[i]:
count += 1
Pj.append(P[i])
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0; min = N
for i in range(N):
if min >= P[i]:
count += 1
min = P[i]
print(count) | p02791 |
N = int(eval(input()))
P = [int(i) for i in input().rstrip().split(' ')]
c = 0
for i,p in enumerate(P):
for q in P[:i+1]:
if p > q:
break
else:
c += 1
print(c) | N = int(eval(input()))
P = [int(i) for i in input().rstrip().split(' ')]
c = 0
m = 2*10**5
for i,p in enumerate(P):
if m >= p:
m = p
c += 1
print(c) | p02791 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
if min(P[:i+1]) >= P[i]:
cnt += 1
print(cnt) | import sys
input = sys.stdin.readline
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
low = 200001
for i,p in enumerate(P):
if p < low:
low = p
if p <= low:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
count = 1
for i in range(1,N):
if min(P[:i]) >= P[i]:
count += 1
print(count) | N = int(eval(input()))
P = list(map(int,input().split()))
count = 0
min_P = P[0]
for i in range(0,N):
if P[i] < min_P:
min_P = P[i]
if min_P >= P[i]:
count += 1
print(count) | p02791 |
n = int(eval(input()))
x = list(map(int,input().split()))
ans = 1
for i in range(1,n):
if x[i] == min(x[:i+1]):
ans += 1
print(ans)
| n = int(eval(input()))
x = list(map(int,input().split()))
ans = 1
b = x[0]
for i in range(1,n):
if x[i] < b:
ans += 1
b = x[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = [int(i) for i in input().split()]
count = 0
for i in range(0, N):
for j in range(0, i+1):
if P[i] > P[j]:
break
elif j == i:
count += 1
print(count)
| N = int(eval(input()))
P = [int(i) for i in input().split()]
count = 0
min_int = 2 * 10**5
for i in range(0, N):
if P[i] <= min_int:
count += 1
min_int = P[i]
print(count)
| p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
l=[]
for i in range(n):
l.append(i+1)
if p[0]==1:
print((1))
else:
ans=0
k=l.index(1)
for i in range(n):
if p[n-i-1]==l[0]:
ans+=1
l.remove(l[0])
else:
l.remove(p[n-i-1])
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
l=[]
for i in range(n):
l.append(i+1)
if p[0]==1:
print((1))
else:
ans=0
k=float('inf')
for i in range(n):
if p[i]<=k:
k=p[i]
ans+=1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
Q = P[0 : i+1]
if min(Q) == Q[-1]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
tmp = P[0]
ans = 0
for i in P:
if i <= tmp:
ans += 1
tmp = i
print(ans) | p02791 |
import heapq
def main():
N = int(eval(input()))
P = [int(x) for x in input().split()]
ls = [0 for _ in range(N)]
ans = 0
for i in range(N):
ls[P[i]-1] = 1
if sum(ls[0:P[i]])==1:
ans += 1
print(ans)
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
P = [int(x) for x in input().split()]
ls = [0 for _ in range(N)]
ans = 0
mins = 10**10
for i in range(N):
mins = min(mins,P[i])
if mins==P[i]:
ans += 1
print(ans)
if __name__ == '__main__':
main() | p02791 |
N = int(eval(input()))
P = [int(i) for i in input().split()]
c = 0
for i in range(N):
a = min(P[:i+1])
if a >= P[i]:
c += 1
print(c) | N = int(eval(input()))
P = [int(i) for i in input().split()]
c = 0
a = P[0]
for i in range(N):
a = min(a, P[i])
if a >= P[i]:
c += 1
print(c) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
m=P[0]
c=0
for i in range(N):
if P[i]<=m:
c+=1
m=min(m,P[i])
print(c) | N=int(eval(input()))
P=list(map(int,input().split()))
m=P[0]
c=0
for i in range(N):
if P[i]<=m:
c+=1
m=P[i]
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(n-1):
if min(p[:i+1]) > p[i+1]:
ans += 1
print((ans+1)) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
Min= float('inf')
for i in range(n-1):
if Min > p[i]:
Min = p[i]
if Min > p[i+1]:
ans += 1
print((ans+1)) | p02791 |
n=int(eval(input()))
p=[]*n
p=list(map(int,input().split()))
cnt=0
for i in range(n):
for j in range(0,i+1):
if p[j]<p[i]:
break
if i==j:
cnt+=1
print(cnt) | n=int(eval(input()))
p=[]*n
p=list(map(int,input().split()))
cnt=0
com=p[0]
for i in range(n):
if com>=p[i]:
cnt+=1
com=min(com,p[i])
print(cnt)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split(' ')))
res = 0
for i in range(n):
x = p[:i+1]
if min(x) >= p[i]:
res += 1
print(res) | n = int(eval(input()))
p = list(map(int, input().split(' ')))
res = 0
y = p[0]
for i in range(n):
z = p[i]
if y >= z:
y = z
res += 1
print(res) | p02791 |
import copy
n = int(eval(input()))
num = list(map(int,input().split()))
end = n
i = 0
while i < end-1:
for j in range(end-1, i, -1):
if num[j] > num [i]:
num.pop(j)
end = len(num)
i += 1
print(end) | n = int(eval(input()))
num = list(map(int,input().split()))
now = num[0]
cnt = 1
for i in range(1,n):
if (now > num[i]):
cnt+=1
now = num[i]
print(cnt) | p02791 |
n = int(eval(input()))
nums = list(map(int, input().split()))
if nums[0] == 1:
print("1")
else:
cnt = 1
for i in range(1, n):
if nums[i] < min(nums[:i]):
cnt += 1
if nums[i] == 2:
cnt += 1
break
if nums[i] == 1:
break
print(cnt) | n = int(eval(input()))
nums = list(map(int, input().split()))
cnt = 1
min = nums[0]
for i in range(1, n):
if nums[i] < min:
min = nums[i]
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
min_val = min(p[:i+1])
if min_val >= p[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = [int(i) for i in input().split()]
cnt = 0
min_val = p[0]
for i in range(n):
min_val = min(min_val, p[i])
if min_val >= p[i]:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
A = 0
for i in range(N):
if P[i] <= min(P[0:i+1]):
A += 1
if P[i] == 1:
break
elif P[i] == 2:
A+=1
break
print(A) | N = int(eval(input()))
P = list(map(int, input().split()))
A = 0
C = P[0]
for i in range(N):
if P[i] <= C:
C = P[i]
A += 1
print(A) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
res = 0
for i in range(0,n):
flag = True
for j in range(0,i):
if p[i] > p[j]:
flag = False
if flag:
res += 1
print(res) | n = int(eval(input()))
p = [int(i) for i in input().split()]
res = 1
min = p[0]
for i in range(1,n):
if p[i] < min:
res += 1
min = p[i]
print(res) | p02791 |
n = int(eval(input()))
P = [int(el) for el in input().split(" ")]
ans = 0
for i in range(n):
for j in range(i):
if P[i] <= P[j]:
pass
else:
break
else:
ans += 1
print(ans) | n = int(eval(input()))
P = [int(el) for el in input().split(" ")]
ans = 1
m = P[0]
for i in range(1, n):
if P[i] <= m:
ans += 1
m = min(m, P[i])
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
t = p[0]
ans = 0
for i in p:
if i <= t:
ans += 1
t = i
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
x = sum(p)
y = 0
for i in p:
if x >= i:
x = i
y += 1
print(y) | p02791 |
N=int(eval(input()))
p=list(map(int,input().split()))
a=[]
for i in range(N):
for k in range(i):
if p[i]>=p[k]:
a.append(p[i])
c=set(a)
print((N-len(c))) | N=int(eval(input()))
p=list(map(int,input().split()))
a=[]
k=p[0]
for i in range(1,N):
if k>p[i]:
a.append(p[i])
k=p[i]
print((len(a)+1))
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
P = [0] + P
count = 0
min = 10000000000000
for i in range(1, N+1):
if min > P[i]:
min = P[i]
elif min < P[i]:
continue
for j in range(1, i+1):
#print(i, P[i], j , P[j])
if P[i] > P[j]:
#print("out", i)
break
else:
#print("ok", i)
count += 1
if P[i] == 1:
break
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
P = [0] + P
count = 0
min = 10000000000000
for i in range(1, N+1):
if min > P[i]:
min = P[i]
elif min < P[i]:
continue
"""
for j in range(1, i+1):
#print(i, P[i], j , P[j])
if P[i] > P[j]:
#print("out", i)
break
else:
#print("ok", i)
count += 1
"""
count += 1
if P[i] == 1:
break
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
judge = [1]*N
for i in range(N):
for j in range(i):
if P[i] > P[j]:
judge[i] = 0
break
print((judge.count(1))) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
tmp = P[0]
for i in range(1,N):
if P[i] <= tmp:
ans+=1
tmp = P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
count = 0
for i,p in enumerate(P) :
pj_min = min(P[:i+1])
if p <= pj_min :
count += 1
print(count) | N = int(eval(input()))
P = list(map(int,input().split()))
count = 0
minlist = []
for i,p in enumerate(P) :
if i == 0 :
minlist.append(p)
continue
if p < minlist[i-1] :
minlist.append(p)
else:
minlist.append(minlist[i-1])
for i,p in enumerate(P) :
pj_min = minlist[i]
if p <= pj_min :
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
for i in range(0,n):
for j in range(0,i+1):
if p[i] > p[j]:
break
elif j == i:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
n_min = 0
for i in range(0,n):
if i == 0:
ans += 1
n_min = p[i]
continue
if p[i] <= n_min:
ans += 1
n_min = p[i]
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
list_a=[]
for i in range(len(p)):
for j in range(i+1):
list_a.append(p[j])
m = min(list_a)
if m == p[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
list_a=[]
min = p[0]
for i in p:
if min >= i:
min = i
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
for i in range(n):
if min(p[0:i+1]) == p[i]:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
min = n+1
for i in range(n):
if min > p[i]:
count += 1
min = p[i]
print(count) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
for i in range(n):
if p[i] <= min(p[:i+1]):
ans+=1
print(ans) | n=int(eval(input()))
p=list(map(int,input().split()))
ans=0
a=p[0]
for i in range(n):
if p[i] <= a:
ans+=1
a=min(a,p[i])
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
s = [0]*n
for i in range(1,n+1):
a = min(p[:i])
s[i-1] = a
cnt = 0
for i in range(n):
if p[i] == s[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
mi = n + 1
for i in range(n):
mi = min(mi,p[i])
if p[i] == mi:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ok_count = 0
for i in range(N):
ok_flag = True
for j in range(i):
if P[i] > P[j]:
ok_flag = False
break
if ok_flag:
ok_count += 1
print(ok_count)
| N = int(eval(input()))
P = list(map(int, input().split()))
NG_count = 0
min = P[0]
for i in range(N):
if min >= P[i]:
min = P[i]
elif min < P[i]:
NG_count += 1
print((N - NG_count))
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split(' ')))
count = 0
for i, value in enumerate(P):
if min(P[:i+1]) == value:
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split(' ')))
count = 1
min_value = P[0]
for i in range(1, N):
if P[i] <= min_value:
min_value = P[i]
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1 #i=1は絶対満たす
for i in range(1,n):
if p[i] == min(p[:(i+1)]):
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1 #i=1は絶対満たす
now_min = p[0]
for i in range(1,n):
if p[i] <= now_min:
ans+=1
now_min = p[i]
print(ans) | p02791 |
n = int(eval(input()))
s = list(map(int , input().split()))
count = 0
for i in range(n):
if s[i] == min(s[:i + 1]):
count += 1
print(count) | n = int(eval(input()))
s = list(map(int , input().split()))
count = 0
mini = s[0]
for i in range(n):
mini = min(mini , s[i])
if s[i] == mini:
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
count = 0
for i in range(n):
if p[i] <= (min(p[0:i]) if i != 0 else p[0]):
count += 1
print(count) | n = int(eval(input()))
p = [int(i) for i in input().split()]
min = n+1
count = 0
for i in range(n):
if min >= p[i]+1:
count += 1
min = p[i]+1
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
for i in range(N):
if all([P[i] <= p for p in P[:i+1]]):
c += 1
#if P[i] >= P[i + 1]:
# c += 1
print(c)
| N = int(eval(input()))
P = list(map(int, input().split()))
c = 0
m = N+1
for i in range(N):
if P[i] <= m:
c += 1
m = min(P[i], m)
print(c)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(0,N):
if min(P[:i+1]) == P[i]:
ans += 1
else:
continue
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
current_min = N
for i in range(0,N):
current_min = min(current_min, P[i])
if current_min == P[i]:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = n
for i in range(n):
for j in range(i):
if p[j] < p[i]:
ans -= 1
break
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = n
cnt=n+1
for i in range(n):
if cnt < p[i]:
ans -= 1
cnt = min(cnt, p[i])
print(ans)
| p02791 |
a=int(eval(input()))
b=list(map(int,input().split()))
c=[]
d=0
for i in range(a):
c.append(b[i])
if min(c)>=b[i]:
d+=1
else:
pass
print(d) | N=int(eval(input()))
P=list(map(int,input().split()))
b=N
a=0
for i in range(N):
if P[i]<=b:
b=P[i]
a+=1
print(a)
| p02791 |
N = int(eval(input()))
P = [ int(i) for i in input().split()]
num = 0
for base in range(N):
flag = 0
for n in range(base):
if P[n] < P[base]:
flag = 1
if flag == 1:
num = num+1
print((N-num)) | N = int(eval(input()))
P = [ int(i) for i in input().split()]
num = 0
min = N
for base in range(N):
if P[base] <= min:
min = P[base]
num += 1
print(num)
| p02791 |
a = int(eval(input()))
b = list(map(int, input().split()))
b_list = list(b)
count = 0
for i in range(len(b_list)):
if b_list[i] == min(b_list[:i+1]):
count += 1
print(count) | a = int(eval(input()))
b_list = list(map(int, input().split()))
count = 0
mini=a
for i in range(len(b_list)):
if b_list[i] <= mini:
count += 1
mini = b_list[i]
print(count) | p02791 |
n=int(eval(input()))
c=list(map(int,input().split()))
count1=1
for i in range(1,n):
t=max(c[:i])
g=min(c[:i])
if c[i]<=t and c[i]<=g:
count1+=1
print(count1) | n=int(eval(input()))
c=list(map(int,input().split()))
minimum=100000000
count=0
for i in range(len(c)):
if c[i]<minimum:
minimum=c[i]
if c[i]<=minimum:
count+=1
print(count)
| p02791 |
n = int(eval(input()))
p_n = list(map(int, input().split()))
ans = 1
p_i_1 = [p_n[0]]
m = p_n[0]
for i in range(1, n):
if m > p_n[i]:
ans += 1
m = min(m, p_n[i])
p_i_1.append(p_n[i])
if m == 1:
break
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
min=10**8
count=0
for i in range(N):
if P[i]==1:
print((count+1))
exit()
elif min>=P[i]:
count+=1
min=P[i] | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
min=10**8
count=0
for i in range(N):
if P[i]==1:
print((count+1))
exit()
elif min>=P[i]:
count+=1
min=P[i] | N=int(eval(input()))
P=list(map(int,input().split()))
num=100000000
ans=0
for i in P:
if num>i:
ans+=1
num=i
print(ans)
| p02791 |
n = int(eval(input()))
l = list(map(int, input().split()))
ans = 0
for i in range(n):
if min(l[0:i + 1]) == l[i]:
ans += 1
print(ans)
| n = int(eval(input()))
l = list(map(int, input().split()))
ans = 0
min_val = l[0]
for i in range(n):
if min_val >= l[i]:
ans += 1
min_val = l[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cur_min = N+1
count = 0
for i in range(N):
if cur_min >= P[i]:
cur_min = P[i]
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
Q = []
for i in range(N):
if i == 0:
Q.append(P[i])
else:
Q.append(min(Q[-1], P[i]))
cnt = 0
for i in range(N):
if P[i] <= Q[i]:
cnt += 1
print(cnt) | p02791 |
N=int(eval(input()))
P=[int(i) for i in input().split()]
cnt=0
for r in range(N):
if P[r]==min(P[0:r+1]):
cnt+=1
else:
continue
print(cnt) | N=int(eval(input()))
P=[int(i) for i in input().split()]
min=2*(10**5)+1
cnt=0
for r in P:
if min>=r:
min=r
cnt+=1
else:
continue
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for i in range(n):
sorted_p = sorted(p[:i+1])
if sorted_p[0] == p[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
p_min = n+1
for i in range(n):
if p_min > p[i]:
cnt += 1
p_min = p[i]
print(cnt) | p02791 |
def solve(n, p_list):
count = 1
for i in range(n-1):
target_num = p_list.pop()
if min(p_list) > target_num:
count += 1
return count
if __name__ == "__main__":
n = int(eval(input()))
p_list = [int(i) for i in input().split()]
ans = solve(n, p_list)
print(ans) | def solve(n, p_list):
count = 0
j = 2 * 10**5 +1
for i in p_list:
if j > i:
count += 1
j = i
return count
if __name__ == "__main__":
n = int(eval(input()))
p_list = [int(i) for i in input().split()]
ans = solve(n, p_list)
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split( )))
c = 1
for i in range(1,N):
v = min(set(P[:i]))
if v >= P[i]:
c += 1
print(c) | N = int(eval(input()))
P = list(map(int, input().split( )))
c = 1
v = P[0]
for i in range(1,N):
if v >= P[i]:
c += 1
v = P[i]
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
flag = False
for j in range(0, i):
if P[i] <= P[j]:
#print(":", i, P[i], P[j])
continue
else:
flag = True
break
if flag:
continue
else:
#print("::", i, P[i])
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
last = float('inf')
for i in range(N):
if P[i] < last:
cnt += 1
last = P[i]
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
for i in range(1,N):
if min(P[:i])>P[i]:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
m=P[0]
for i in range(1,N):
m=min(m,P[i-1])
if m>P[i]:
ans+=1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n):
if(min(p[0:i+1]) >= p[i]):
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 1
min = p[0]
for i in range(1,n):
if(min >= p[i]):
min = p[i]
if(min >= p[i]):
count += 1
print(count) | p02791 |
n=int(eval(input()))
p =list(map(int,input().split()))
ans = 0
for i in range(n):
if min(p[:i+1]) == p[i]:
ans +=1
print(ans)
| n=int(eval(input()))
p =list(map(int,input().split()))
ans = 0
x = p[0]
for i in range(n):
if x >= p[i]:
ans +=1
x = p[i]
print(ans) | p02791 |
s=input().split()
n=int(s[0])
s=input().split()
lis=[]
out=0
for i in range(n):
lis.append(int(s[i]))
if min(lis)>=int(s[i]):
out+=1
print(out) | s=input().split()
n=int(s[0])
s=input().split()
mini=10000000
out=0
for i in range(n):
if mini>=int(s[i]):
mini=int(s[i])
out+=1
print(out) | p02791 |
N=int(eval(input()))
P=list(map(int, input().split()))
cnt=1
for i in range(1,N):
if P[i] < min(P[0:i]):
cnt+=1
print(cnt) | N=int(eval(input()))
P=list(map(int, input().split()))
cnt=1
if N==1:
print((1))
elif N==2:
if P[1] < P[0]:
print((2))
else:
print((1))
else:
tmp = P[0]
if P[1] <= P[0]:
cnt +=1
for i in range(2,N):
tmp = min(P[i-1],tmp)
if P[i] <= tmp:
cnt+=1
print(cnt) | p02791 |
N=int(eval(input()))
List=list(map(int,input().split()))
counter=0
for i in range(N):
Pj_list=[]
for j in range(i+1):
Pj_list.append(List[j])
Mi=min(Pj_list)
if Mi==List[i]:
counter+=1
print(counter) | N=int(eval(input()))
List=list(map(int,input().split()))
counter=0
mj=N
for i in range(N):
if mj>List[i]:
mj=List[i]
if List[i]==mj:
counter+=1
print(counter) | p02791 |
def pred(i, lst, offset):
for cmpd in lst[offset:i+1]:
if lst[i] > cmpd:
return False
return True
n = int(eval(input()))
p = [int(m) for m in input().split(' ')]
sum = 0
offset = 0
for i in range(n):
if pred(i, p, offset):
sum += 1
offset = i
print(sum) | def pred(i, lst, offset):
for cmpd in lst[offset:i+1]:
if lst[i] > cmpd:
return False
return True
n = int(eval(input()))
p = [int(m) for m in input().split(' ')]
sum = 0
minimum = n + 1
for i in range(n):
if p[i] < minimum:
sum += 1
minimum = p[i]
#sum = 0
#offset = 0
#for i in range(n):
# if pred(i, p, offset):
# sum += 1
# offset = i
print(sum) | p02791 |
n = eval(input())
p = list(int(i) for i in input().split())
count = 1
for i in range(1,len(p)):
if(p[i] <= min(p[0:i])):
count += 1
print(count)
| n = eval(input())
p = list(int(i) for i in input().split())
count = 1
min_num = min(p[0:1])
for i in range(1,len(p)):
if(p[i] <= min_num):
count += 1
min_num = p[i]
print(count)
| p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.