input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
numbers = list(map(int,input().split()))
cnt = 0
for i in range(n):
if min(numbers[:i+1]) >= numbers[i]:
cnt += 1
print(cnt)
| n = int(eval(input()))
numbers = list(map(int,input().split()))
cnt = 0
a = 2*10**5
for i in range(n):
a = min(numbers[i],a)
if a >= numbers[i]:
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
num = list(map(int,input().split()))
count = 0
for _ in range(N):
if min(num[:_+1]) == num[_]:
count += 1
print(count)
| N = int(eval(input()))
num = list(map(int,input().split()))
count = 0
m = num[0]
for _ in range(N):
if m >= num[_]:
m = num[_]
count += 1
print(count) | p02791 |
import sys
input = sys.stdin.readline
x = int(eval(input()))
li = list(map(int, input().split()))
a = 0 # カウントする
for i in range(len(li)):
c = 0
j = 0
while i >= j:
if li[i] <= li[j]:
c += 1
if c == i+1:
a += 1
j+=1
print(a) |
x = int(eval(input()))
li = list(map(int, input().split()))
a = 0
Min = li[0]
for i in range(len(li)):
if li[i] <= Min:
Min = li[i]
a += 1
print(a) | p02791 |
import bisect
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N):
if i == 0:
count += 1
elif min(P[:i+1]) == P[i]:
count += 1
print(count) | import bisect
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
last_min = P[0]
for i in range(N):
last_min = min(last_min, P[i])
if i == 0:
count += 1
elif last_min == P[i]:
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
pre = p[0]
for i, now in enumerate(p):
if now <=pre:
count+=1
pre = min(p[:i+1])
print(count)
| n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
pre = p[0]
for now in p:
if now <=pre:
count+=1
pre = now
print(count)
| p02791 |
def resolve():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, P[0]):
if i == min(P[:P.index(i)+1]):
ans += 1
print(ans)
resolve() | def resolve():
N = int(eval(input()))
P = list(map(int, input().split()))
min = P[0]
ans = 1
for i in P:
if i < min:
min = i
ans += 1
print(ans)
resolve() | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
l = []
for i in P:
l.append(i)
if i == min(l):
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
mi = P[0]
for i in range(N):
if P[i] <= mi:
mi = P[i]
cnt += 1
print(cnt) | p02791 |
#入力:N(int:整数)
def input1():
return int(eval(input()))
#入力:N,M(int:整数)
def input2():
return list(map(int,input().split()))
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
N=input1()
p=input_array()
count=0
for i in range(N):
flag=True
for j in range(len(p[:i+1])):
if p[i]<=p[j]:
flag=True
else:
flag=False
break
if flag:
count+=1
print(count)
| #入力:N(int:整数)
def input1():
return int(eval(input()))
#入力:N,M(int:整数)
def input2():
return list(map(int,input().split()))
#入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
N=input1()
p=input_array()
count=0
min_int=0
for i in range(N):
num=p[i]
if i==0:
min_int=num
count+=1
elif num<=min_int:
min_int=num
count+=1
print(count)
| p02791 |
N = int(eval(input()))
lists = list(map(int, input().split()))
count = 0
for i in range(N):
lists_slice = lists[:i+1]
lists_min = min(lists_slice)
if lists_min >= lists[i]:
count+=1
# cnt = 0
# for j in lists_slice:
# if lists_slice[i] <= j:
# cnt += 1
# if cnt == i+1:
# count+= 1
print(count) | N = int(eval(input()))
lists = list(map(int, input().split()))
count = 0
ans = 0
for i in range(N):
if i == 0:
ans = lists[i]
count += 1
else:
if ans >= lists[i]:
count += 1
ans = min(ans, lists[i])
else:
ans = min(ans, lists[i])
# lists_slice = lists[:i+1]
# lists_min = min(lists_slice)
# if lists_min >= lists[i]:
# count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
Bool = [1 for i in range(n)]
for i in range(n):
if Bool[i]:
for j in range(0,i):
if p[i] > p[j]:
Bool[i] = 0
print((sum(Bool))) | n = int(eval(input()))
p = list(map(int,input().split()))
MIN = n+1
count = 0
for i in range(n):
if MIN > p[i]:
count += 1
MIN = min(MIN,p[i])
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
minp = p[0]
cnt = 0
for i in range(n):
if p[i]<=minp:cnt+=1
minp = min(minp,p[i])
print(cnt) | def main():
n = int(eval(input()))
p = list(map(int,input().split()))
minp = p[0]
cnt = 0
for i in range(n):
if p[i]<=minp:cnt+=1
minp = min(minp,p[i])
print(cnt)
main() | p02791 |
n = int(eval(input()))
num_list = [int(i) for i in input().split()]
k = 0
for i in range(len(num_list)):
if i != len(num_list)-1:
if min(num_list[:i+1]) == num_list[i]:
k += 1
else:
if min(num_list) == num_list[i]:
k += 1
print(k) | n = int(eval(input()))
num_list = [int(i) for i in input().split()]
k = 0
for i in range(len(num_list)):
if i == 0:
temp_min = num_list[i]
else:
temp_min = min(temp_min, num_list[i])
if i != len(num_list)-1:
if temp_min == num_list[i]:
k += 1
else:
if temp_min == num_list[i]:
k += 1
print(k) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
l=n
ans=0
for i in range(1,n+1):
if p.index(i)<l:
ans+=1
l=p.index(i)
print(ans)
| 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)
| p02791 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt = 0
for i in range(N):
if P[i] <= min(P[:i+1]):
cnt += 1
print(cnt) | import sys
input = sys.stdin.readline
N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt = 1
minP = P[0]
for i in range(1, N):
if minP >= P[i]:
cnt += 1
minP = P[i]
print(cnt)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
count = 0
for i in range(n):
if i == 0:
count += 1
else:
if min(p[:i]) >= p[i]:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int,input().split()))
m = 10**10
count = 0
for i in range(n):
if p[i] <= m:
count += 1
m = min(m,p[i])
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
if P[i] == min(P[:i+1]):
cnt += 1
print(cnt)
| N = int(eval(input()))
P = list(map(int, input().split()))
min_value = P[0]
cnt = 1
for i in range(1, N):
if P[i] < min_value :
min_value = P[i]
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = [0]*N
for i in range(N):
if min(P[0:i+1]) >= P[i]:
ans[i] = 1
print((sum(ans))) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = [0]*N
min_cal = [0]*N
min_cal[0] = P[0]
for i in range(N-1):
min_cal[i+1] = min(min_cal[i],P[i+1])
for i in range(N):
if min_cal[i] >= P[i]:
ans[i] = 1
print((sum(ans))) | 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
current = max(p)+1
for i in range(n):
if p[i] <= current:
current = p[i]
ans +=1
# if p[i] == min(p[:i+1]):
# ans+=1
print(ans)
| p02791 |
a = int(eval(input()))
b = list(map(int, input().split()))
n = 0
for i in range(0,a):
l = 0
for j in range(0,i):
if b[i] <= b[j]:
l += 1
if l == i:
n += 1
print(n) | n = int(eval(input()))
m = list(map(int, input().split()))
l = 0
s = m[0]
for i in range(0,n):
if s >= m[i]:
s = m[i]
l += 1
print(l) | p02791 |
def main():
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
for i in range(n):
#print(p_list[:(i+1)])
if min(p_list[:(i+1)]) >= p_list[i]:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
def main():
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 1
tmp = p_list[0]
for i in range(n-1):
if tmp >= p_list[i+1]:
ans += 1
tmp = p_list[i+1]
print(ans)
if __name__ == '__main__':
main()
| p02791 |
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_right
sys.setrecursionlimit(10**7)
N = int(eval(input()))
P = list(map(int, input().split()))
rP = list(reversed(P))
cnt = 0
for i, rp in enumerate(rP):
for val in rP[i+1:]:
if rp > val:
break
else:
cnt += 1
print(cnt)
| import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_right
sys.setrecursionlimit(10**7)
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
minv = P[0]
for p in P:
minv = min(minv, p)
if p == minv:
cnt += 1
print(cnt)
| p02791 |
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) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
curr_min = 0
for i in range(N):
if not curr_min:
curr_min = P[i]
cnt += 1
else:
if P[i] <= curr_min:
curr_min = P[i]
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
for i in range(N):
if(min(P[:i+1]) == P[i]):
res += 1
print(res)
| N = int(eval(input()))
P = list(map(int, input().split()))
res = 0
mini = P[0]
for i in range(N):
mini = min(mini, P[i])
if(mini >= P[i]):
res += 1
print(res)
| p02791 |
n=int(eval(input()))
b=list(map(int,input().split()))
count=1
temp=[b[0]]
for i in range(1,n):
temp.append(b[i])
if b[i]==min(temp):
count=count+1
print(count) | n=int(eval(input()))
b=list(map(int,input().split()))
count=1
temp=b[0]
for i in range(1,n):
if b[i]==min(b[i],temp):
count=count+1
temp=b[i]
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
count = 0
for i in range(N):
for t in range(i):
if P[i] > P[t]:
count += 1
break
print((N - count)) | N = int(eval(input()))
P = list(map(int,input().split()))
result = 1
mini = P[0]
for i in P:
if mini > i:
result += 1
mini = i
print(result) | p02791 |
n = int(eval(input()))
numbers = list(map(int, input().split(' ')))
counter = 0
for i in range(n):
flag = True
for j in range(i):
if numbers[i] > numbers[j]:
flag = False
if flag is True:
counter += 1
print(counter) | n = int(eval(input()))
numbers = list(map(int, input().split(' ')))
counter = 0
min_value = numbers[0]
for number in numbers:
if number <= min_value:
counter += 1
min_value = number
print(counter) | 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
m=P[0]
for i in range(N):
if m >= P[i]:
ans += 1
m = P[i]
print(ans)
| p02791 |
N=int(eval(input()))
P = list(map(int,input().split()))
ans=0
m=10**10
for i in range(N):
if m >= P[i]:
ans += 1
m = P[i]
print(ans) | N=int(eval(input()))
P = list(map(int,input().split()))
ans=0
m=10**10
for i in range(N):
if min(m,P[i])==P[i]:
ans+=1
m=P[i]
print(ans) | p02791 |
n = int(eval(input()))
p_li = list(map(int, input().split()))
answer = 0
for i in range(len(p_li)):
count_flag = True
for j in range(i):
if p_li[i] <= p_li[j]:
continue
else:
count_flag = False
break
if count_flag:
answer += 1
print(answer)
| n = int(eval(input()))
p_li = list(map(int, input().split()))
answer = 0
now_min = 999999
for i in range(len(p_li)):
if now_min > p_li[i]:
now_min = p_li[i]
answer += 1
print(answer)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(1, n+1):
s = min(p[:i])
if (s == p[i-1]):
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
s = p[0]
for i in range(1, n+1):
s = min(s, p[i-1])
if (s == p[i-1]):
count += 1
print(count) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
c = 1
for i in range(1, len(P)):
if P[i] == min(P[:i+1]):
c += 1
print(c)
| n = int(eval(input()))
P = list(map(int, input().split()))
c = 1
minv = P[0] # その数より左にあるかずは全大きくさくなければならない
for i in range(1, len(P)):
if minv > P[i]:
c += 1
minv = min(minv, P[i])
print(c)
| p02791 |
if __name__ == '__main__':
n = int(eval(input()))
p = list(map(int, input().split(" ")))
count = 0
for i in range(n):
flag = 0
for j in range(n):
if i > j:
if p[i] > p[j]:
flag = 1
break
# print(i, j)
if flag == 0:
count = count + 1
print(count) | if __name__ == '__main__':
n = int(eval(input()))
p = list(map(int, input().split(" ")))
count = 0
min_num = 10000000
for i in p:
if i < min_num:
count = count + 1
min_num = i
print(count)
| p02791 |
def resolve():
N = int(eval(input()))
P = list(map(int, input().split()))
n = 0
x = 10 ** 20
for i in range(N):
if x < P[i]:
continue
else:
x = P[i]
for j in range(i):
if P[i] > P[j]:
break
else:
n += 1
print(n)
resolve() | def resolve():
N = int(eval(input()))
P = list(map(int, input().split()))
n = 0
x = 10 ** 20
for i in range(N):
if x >= P[i]:
x = P[i]
n += 1
print(n)
resolve() | p02791 |
N=int(eval(input()))
x=list(map(int,input().split()))
counter=0
flag=True
for i in range(N):
a=x[i]
for j in range(i+1):
if flag==False:
continue
if a>x[j] and flag:
counter+=1
flag=False
flag=True
print((N-counter))
| N=int(eval(input()))
x=list(map(int,input().split()))
counter=0
flag=True
#最小値
a=x[0]
for i in range(N):
if a>x[i] :
a=x[i]
if a<x[i]:
counter+=1
print((N-counter))
| p02791 |
N = int(eval(input()))
A = list(map(int,input().split()))
cnt = 1
for i in range(1,N):
for j in range(0,i):
if A[i] > A[j]:
break
else:
cnt += 1
print(cnt) | N = int(eval(input()))
A = list(map(int,input().split()))
cnt = 0
# for i in range(1,N):
# for j in range(0,i):
# if A[i] > A[j]:
# break
# else:
# cnt += 1
min_value = A[0]
for i in range(N):
if min_value >= A[i]:
cnt += 1
min_value = A[i]
print(cnt) | p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
score = 1
for i in range(1,n):
if min(p[:i]) >= p[i]:
score += 1
print(score) | n = int(eval(input()))
p = [int(i) for i in input().split()]
score = 1
m = p[0]
for i in range(1,n):
m = min(m, p[i-1])
if m >= p[i]:
score += 1
print(score) | p02791 |
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if a[i] <= min(a[:i+1]):
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
minimum = n
for i in range(n):
if a[i] <= minimum:
ans += 1
minimum = a[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
min = P[0]
for i in range(N):
if P[i] <= min:
min = P[i]
count += 1
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
def main():
count = 0
min = P[0]
for i in range(N):
if P[i] <= min:
min = P[i]
count += 1
print(count)
main() | p02791 |
loop = int(eval(input()))
num_list = list(map(int, input().split()))
ans = 0
for idx, n in enumerate(num_list):
flg = True
if idx > 0:
for m in num_list[: idx]:
if m < n:
flg = False
break
if flg:
ans += 1
print(ans) | loop = int(eval(input()))
num_list = list(map(int, input().split()))
ans = 0
min_value = 20000000
for n in num_list:
flg = True
if min_value < n:
flg = False
else:
min_value = n
if flg:
ans += 1
print(ans) | p02791 |
# -*- coding: utf-8 -*-
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) | # -*- coding: utf-8 -*-
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min_val = P[0]
for i in range(N):
if P[i] <= min(min_val, P[i]):
ans += 1
min_val = min(min_val, P[i])
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
num = 1
for i in range(1, N):
if min(P[:i]) >= P[i]:
num += 1
else:
num = num
print(num) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
curMin = 1e9
for i in range(N):
curMin = min(curMin, P[i])
if curMin == P[i]:
ans += 1
print(ans) | p02791 |
def function(p, i):
a = p[i]
amin = min(p[:i+1])
if amin == a:
return 1
else:
return 0
n = int(eval(input()))
p = list([int(x) for x in input().split()])
sums = sum([function(p,i) for i in range(n)])
print(sums) | n = int(eval(input()))
p = list([int(x) for x in input().split()])
count = 0
maxs = p[0]
for i in range(n):
if maxs >= p[i]:
maxs = p[i]
count += 1
print(count) | p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
correct_answer_count = 0
for i in range(N):
bat_answer_count = 0
for j in range(i):
if len(A) < j:
continue
if not (A[i] <= A[j]):
bat_answer_count += 1
if bat_answer_count == 0:
correct_answer_count += 1
print(correct_answer_count)
| n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
p_min = p[0]
for i in range(n):
pi = p[i]
if pi <= p_min:
cnt += 1
p_min = pi
print(cnt) | p02791 |
n = int(eval(input()))
pn = list(map(int, input().split()))
count = 1
for i in range(1,len(pn)):
if min(pn[:i]) > pn[i]: count += 1
print(count)
| n = int(eval(input()))
pn = list(map(int, input().split()))
count = 1
min = pn[0]
for i in range(1,len(pn)):
if min > pn[i - 1]: min = pn[i - 1]
if min > pn[i]: count += 1
print(count)
| p02791 |
import sys
input = sys.stdin.readline
N=int(eval(input()))
P=list(map(int,input().split()))
count = 0
for i in range(N):
if P[i]<=min(P[:i+1]):
count += 1
print(count)
| import sys
input = sys.stdin.readline
N=int(eval(input()))
P=list(map(int,input().split()))
count = 0
saisyouti = P[0]
for i in range(N):
if P[i]<=saisyouti:
count += 1
saisyouti=P[i]
print(count) | p02791 |
# coding: utf-8
# Your code here!
from collections import deque
N = int(eval(input()))
P = deque(list(map(int, input().split())))
ctr = 0
Array = []
for i in range(N):
Array.append(P.popleft())
if Array[-1] == min(Array):
ctr += 1
print(ctr) | # coding: utf-8
# Your code here!
from collections import deque
N = int(eval(input()))
P = deque(list(map(int, input().split())))
ans, tmp, minnum = 0, 0, pow(10,9)
Array = []
for i in range(N):
tmp = P.popleft()
Array.append(tmp)
if tmp < minnum:
minnum = tmp
if Array[-1] == minnum:
ans += 1
print(ans)
| p02791 |
#!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
# = input()
n = int(eval(input()))
# = map(int, input().split())
p = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
ans = 0
for i in range(n):
if min(p[:i+1]) == p[i]:
ans += 1
print(ans)
| #!/usr/bin/env python3
import collections
import itertools as it
import math
#import numpy as np
# = input()
n = int(eval(input()))
# = map(int, input().split())
p = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
ans = 0
min_ = 10**9
for i in range(n):
if p[i] < min_:
ans += 1
min_ = p[i]
print(ans)
| p02791 |
N=int(eval(input()))
Pn=[]
P=input().split()
for p in P:
Pn.append(int(p))
count=1
nowmin=Pn[0]
for i in range(1,len (Pn)):
targetArr=Pn[:i]
if Pn[i]<nowmin:
count+=1
nowmin = Pn[i]
print(count)
| N=int(eval(input()))
P=input().split()
Pn=[]
Pn.append(int(P[0]))
count=1
nowmin=Pn[0]
for i in range(1,len(P)):
if int(P[i])<nowmin:
count+=1
nowmin = int(P[i])
print(count)
| p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
t = p[0]
ans = 0
for i in range(n):
if t >= p[i]:
ans += 1
t = min(p[i],t)
print(ans) | n = int(eval(input()))
p = [int(i) for i in input().split()]
t = p[0]
ans = 0
for i in range(n):
if t >= p[i]:
ans += 1
t = p[i]
print(ans) | p02791 |
N = int(eval(input()))
p = list(map(int,input().split()))
cou1 = 0
cou2 = 0
num1 = min(p)
num2 = p.count(num1)
for i in range(N):
num3 = min(p[0:i+1])
if p[i] == num3:
cou1 += 1
if p[i] == num1:
cou2 += 1
if cou2 == num2:
break
print(cou1)
| #41
import math
N = int(eval(input()))
p = list(map(int,input().split()))
cou = 0
x = math.inf
for j in range(N):
if min(x,p[j]) == p[j]:
x = p[j]
cou += 1
print(cou)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
#n = 4
#p = [4,3,2,1]
count = 0
for i in range(n):
for j in range(i):
if p[i] > p[j]:
break
else:
count+=1
continue
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
#n = 5
#p = [4,2,5,1,3]
count = 0
temp_min = p[0]
for i in range(n):
if temp_min >= p[i]:
count+=1
temp_min = p[i]
print(count) | p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
x=0
y=[]
z=l[0]
for i in range(n):
#y=y+[l[i]]
z=min(z,l[i])
if l[i]<=z:
x+=1
print(x)
| n=int(eval(input()))
l=list(map(int,input().split()))
x,y=0,l[0]
for i in range(n):
y=min(y,l[i])
if l[i]<=y:
x+=1
print(x) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(1, n+1):
if i in set(P):
count += 1
P = P[:P.index(i)]
if len(P) == 0:
break
print(count) | n = int(eval(input()))
P = list(map(int, input().split()))
count = 0
tmpmin = P[0]
for p in P:
if p <= tmpmin:
count += 1
tmpmin = p
print(count) | p02791 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(n):
if a[i]==min(a[0:i+1]) :
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
mini=a[0]
for i in range(n):
if mini>=a[i]:ans+=1
mini=min(a[i],mini)
print(ans) | p02791 |
N = int(eval(input()))
Ps = list(map(int,input().split()))
count = N
for i in range(N+1):
P = Ps[i-1]
for j in range(i):
if P > Ps[j]:
count=count-1
break
print(count) | N = int(eval(input()))
Ps = list(map(int,input().split()))
count = 0
y = Ps[0]
for i in range(N):
y = min(Ps[i],y)
if y == Ps[i]:
count=count+1
print(count) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
count=0
P_new=[]
for index in range(N):
P_new.append(P[index])
P_new.sort()
if P_new[0]==P[index]:
count+=1
print(count) | N=int(eval(input()))
P=list(map(int,input().split()))
count=0
P_new=[]
for index in range(N):
P_new.append(P[index])
if P_new[0]>P_new[index]:
P_new[0]=P_new[index]
if P_new[0]==P[index]:
count+=1
print(count) | p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
aa = list(reversed(A))
cnt = 0
for i in range(0,N):
if aa[i] == min(aa[i:]):
cnt += 1
print(cnt)
| N = int(eval(input()))
A = list(map(int, input().split()))
m = A[0]
cnt = 1
for i in range(1,N):
m = min(m, A[i])
if A[i] <= m:
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(1, N+1):
if A[i-1] == 1:
count += N - i
break
else:
for j in range(1, i+1):
if A[j-1] < A[i-1]:
count += 1
break
ans = N - count
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
M = N+1
ans = 0
for i in range(1, N+1):
if M > A[i-1]:
M = A[i-1]
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
numbers = [int(i) for i in input().split()]
cnt = 0
for i, n in enumerate(numbers):
if min(numbers[:i+1]) == n:
cnt += 1
if n == 1:
break
print(cnt) | N = int(eval(input()))
numbers = [int(i) for i in input().split()]
cnt = 0
min_num = numbers[0]
for i, n in enumerate(numbers):
if min_num >= n:
cnt += 1
min_num = n
if n == 1:
break
print(cnt) | p02791 |
N=int(eval(input()))
p=list(map(int,input().split()))
Q=0
for i in range(N):
if min(p[0:i+1])>=p[i]:
Q+=1
print(Q) | N=int(eval(input()))
p=list(map(int,input().split()))
Q=0
min_p=1000000
for i in range(N):
if min(p[i],min_p)>=p[i]:
Q+=1
min_p=min(p[i],min_p)
print(Q) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
tp = p[0:i+1]
if (min(tp) >= p[i]):
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
pmax = p[0]
for i in range(n):
if (p[i] <= pmax):
ans += 1
pmax = p[i]
print(ans)
| p02791 |
n = int(eval(input()))
tl = input().split()
l = [int(i) for i in tl]
mn = n
count = 0
for i in range(len(l)):
if l[i] > mn:
continue
sl = l[0:i+1]
mn = min(sl)
count += 1
print(count)
| n = int(eval(input()))
tl = input().split()
l = [int(i) for i in tl]
mn = n
count = 0
mn_i = 0
for i in range(len(l)):
if l[i] > mn:
continue
sl = l[mn_i:i+1]
mn = min(sl)
mn_i = i
count += 1
print(count)
| p02791 |
n=int(eval(input()))
A=list(map(int,input().split()))
cnt=0
for i in range(n):
if min(A[:i+1])==A[i]:
cnt+=1
print(cnt) | n=int(eval(input()))
A=list(map(int,input().split()))
cnt=0
x=A[0]
for i in range(n):
if A[i]<=x:
cnt+=1
x=min(x,A[i])
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 1
for i in range(1,N):
for j in range(i):
if(P[i]>P[j]):
break
elif(i == j + 1):
count+=1
print(count)
| N = int(eval(input()))
P = list(map(int, input().split()))
Pmin = float("inf")
count = 0
for i in P:
if i < Pmin:
Pmin = i
count += 1
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
p_list = [True for i in range(n)]
for i in range(1,n):
for j in range(i):
if p[i] > p[j]:
p_list[i] = False
break
print((p_list.count(True))) | n = int(eval(input()))
p = list(map(int, input().split()))
q = p[0]
count = 1
for i in range(1,n):
if q > p[i]:
count += 1
q = min(q, p[i])
print(count) | p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
min_list = []
min_list.append(p_list[0])
ans = 1
for i in range(1, n):
if p_list[i] <= min(min_list):
ans += 1
min_list.append(p_list[i])
print(ans)
| n = int(eval(input()))
p_list = list(map(int, input().split()))
min_num = p_list[0]
ans = 1
for i in range(1, n):
if p_list[i] <= min_num:
ans += 1
min_num = min(min_num, p_list[i])
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(N):
m = min(P[:i+1])
if m >= P[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
m = 10 ** 6
for i in range(N):
if P[i] <= m:
ans += 1
m = P[i]
print(ans) | p02791 |
#!/usr/bin/env python3
import sys
def solve(N: int, P: "List[int]"):
count=0
mi=P[0]
for i in range(1,N+1):
ans=P[:i]
if i==1:
count+=1
#print(i)
else:
if min(mi,ans[-1])==ans[-1]:
count+=1
mi=ans[-1]
#print(i)
print(count)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
P = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, P)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, P: "List[int]"):
count=0
mi=P[0]
for i in range(1,N+1):
if i==1:
count+=1
#print(i)
else:
if min(mi,P[i-1])==P[i-1]:
count+=1
mi=P[i-1]
#print(i)
print(count)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
P = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
solve(N, P)
if __name__ == '__main__':
main()
| p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
ans=n
for i in range(1,n):
for j in range(i,-1,-1):
if l[i]>l[j]:
ans-=1
break
print(ans) | n=int(eval(input()))
l=list(map(int,input().split()))
ans=0
tmp=l[0]
for i in range(n):
if tmp>=l[i]:
tmp=l[i]
ans+=1
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
for i in range(N):
for n in range(i + 1):
if P[n] < P[i]:
break
if i == n:
count += 1
print(count)
| N = int(eval(input()))
P = list(map(int, input().split()))
MIN = list()
count = 0
MIN.append(P[0])
for i in range(1, N):
MIN.append(min(MIN[i - 1], P[i]))
for i in range(0, N):
if P[i] <= MIN[i]:
count += 1
print(count)
| p02791 |
#!/usr/bin/env python3
N = int(eval(input()))
P = list(map(int, input().split()))
# print(N, P)
count = 0
for i in range(N):
l = P[:i+1]
# print(l)
if P[i] <= min(l):
count += 1
print(count)
| #!/usr/bin/env python3
N = int(eval(input()))
P = list(map(int, input().split()))
# print(N, P)
count = 0
min_prev = P[0] + 1
for i in range(N):
if P[i] < min_prev:
min_prev = P[i]
count += 1
print(count)
| p02791 |
n=int(eval(input()))
l=list(map(int,input().split()))
ans=1
for i in range (1,n):
low=min(l[:i+1])
if low==l[i]:
ans+=1
print(ans) | n=int(eval(input()))
l=list(map(int,input().split()))
ans=0
low=l[0]
for i in range (n):
if l[i]<=low:
low=l[i]
ans+=1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
#print(p)
ans = 0
#for i in range(1, n+1):
# cnt = 0
# for j in (1, i):
# if p[i] <= p[j]:
# cnt += 1
# print(cnt)
# if cnt == i:
# ans += 1
for i in range(n):
#q = p[0:i+1]
#print(q)
if p[i] <= min(p[0:i+1]):
ans += 1
print(ans) | N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt=1
tmp=P[0]
for i in range(1, N):
tmp = min(tmp, P[i-1])
if tmp >= P[i]:
cnt+=1
# print(i, cnt)
print(cnt) | p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt=1
tmp=P[0]
for i in range(1, N):
tmp = min(tmp, P[i-1])
if tmp >= P[i]:
cnt+=1
# print(i, cnt)
print(cnt) | n = int(eval(input()))
p = [int(x) for x in input().split()]
cnt = 0
tmp = p[0]
for i in range(n):
tmp = min(tmp, p[i])
if p[i] == tmp:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = [int(i) for i in input().split()]
cnt = 1
for i in range(1,N):
if P[i] < min(P[:i]):
cnt += 1
print(cnt) | N = int(eval(input()))
P = [int(i) for i in input().split()]
mi = 1000000
cnt = 0
for i in range(N):
mi = min(P[i],mi)
if P[i] <= mi:
cnt += 1
print(cnt) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
mem=set()
c=0
for i in range(N):
if i > 0:
if P[i] <= min(mem):
c+=1
else:
c+=1
mem.add(P[i])
print(c) | N=int(eval(input()))
P=list(map(int,input().split()))
mini=(10**5)*2
c=0
for i in range(N):
if P[i] <= mini:
mini=P[i]
c+=1
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
for n in range(N):
if n == 0:
cnt += 1
else:
L = P[:n]
L.sort()
if P[n] <= L[0]:
cnt += 1
print(cnt)
| N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
res = float('Inf')
for n in range(N):
if P[n] < res:
res = P[n]
cnt += 1
print(cnt) | p02791 |
n= int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(len(A)):
isMatch = True
for j in range(i):
if A[j] <= A[i]:
isMatch = False
if(isMatch):
count = count + 1
print(count)
| n= int(eval(input()))
A = list(map(int, input().split()))
count = 0
minVal = A[0]
for i in range(len(A)):
if A[i] <= minVal:
count = count + 1
minVal = A[i]
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
m = [10**6]
for j in range(1, n):
m.append(min(p[:j]))
ans = 1
for i in range(1, n):
if m[i] >= p[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
m = []
a = p[0]
for j in range(n):
if a >= p[j]:
a = p[j]
m.append(a)
else:
m.append(a)
ans = 1
for i in range(n-1):
if m[i] > m[i+1]:
ans += 1
print(ans) | p02791 |
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) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
tmp_min = p[0]
for i in range(1, n):
tmp_min = min(tmp_min, p[i])
if tmp_min == p[i]:
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
tmp_min = p[0]
for i in range(1, n):
tmp_min = min(tmp_min, p[i])
if tmp_min == p[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 1
tmp_min = p[0]
for i in range(1, n):
if tmp_min >= p[i]:
tmp_min = p[i]
cnt += 1
print(cnt)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
flag = True
for i in range(N):
flag = True
P_i = P[i]
for j in range(i + 1):
if P_i > P[j]:
flag = False
if flag:
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1
min = P[0]
flag = True
for i in range(1, N):
if P[i] <= min:
cnt += 1
min = P[i]
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
min = pow(10, 6)
flag = True
for i in range(N):
if P[i] <= min:
cnt += 1
min = P[i]
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 0
min = N + 1
flag = True
for i in range(N):
if P[i] <= min:
cnt += 1
min = P[i]
print(cnt) | p02791 |
from collections import deque
n = int(eval(input()))
p = list(map(int,input().split()))
p_cutted = []
p_cutted = deque(p_cutted)
ans = 0
for i in range(n):
p_cutted.append(p[i])
if min(p_cutted) == p[i]:
ans += 1
print(ans)
| from collections import deque
n = int(eval(input()))
p = list(map(int,input().split()))
p_cutted = []
p_cutted = deque(p_cutted)
min_p_cutted = p[0]
ans = 0
for i in range(n):
p_cutted.append(p[i])
if min_p_cutted >= p[i]:
min_p_cutted = p[i]
ans += 1
print(ans)
| p02791 |
_,p=open(0)
m=10**18
c=0
for p in map(int,p.split()):
c+=p<m
m=min(m,p)
print(c) | _,p=open(0)
m=9e9
c=0
for p in map(int,p.split()):c+=p<m;m=min(m,p)
print(c) | p02791 |
_,p=open(0)
m=9e9
c=0
for p in map(int,p.split()):c+=p<m;m=min(m,p)
print(c) | _,p=open(0)
m=9e9
c=0
for p in map(int,p.split()):
if p<m:c+=1;m=p
print(c) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
cnt, i = 1, 0
min = P[0]
for i in range(i + 1, N):
if min >= P[i]:
cnt += 1
min = P[i]
print(cnt) | N = int(eval(input()))
P = list(map(int, input().split()))
cnt = 1 # P[0] is counted forcely
min = P[0]
for p in P:
# (1≤j≤i),Pj=>Pi
if min > p:
min = p
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 1
min = A[0]
for i in range(1, N):
if min > A[i]:
cnt += 1
min = A[i]
print(cnt) | N = int(eval(input()))
A = list(map(int, input().split()))
cnt = 1
min = A[0]
for a in A:
if min > a:
cnt += 1
min = a
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
a = []
ans = 0
for i in range(N):
a.append(P[i])
if min(a) >= P[i]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
a = P[0]
ans = 0
for i in range(N):
if P[i] <= a:
a = P[i]
ans += 1
print(ans) | p02791 |
def func():
return
n = int(eval(input()))
# s = input()
# a, b = map(int, input().split())
p = list(map(int, input().split()))
# a = input().split()
cnt = 0
for i in range(n):
if min(p[:i+1]) == p[i]:
cnt += 1
print(cnt) | def func():
return
n = int(eval(input()))
# s = input()
# a, b = map(int, input().split())
p = list(map(int, input().split()))
# a = input().split()
cnt = 0
min_ = n
for i in range(n):
min_ = min(min_, p[i])
if min_ == p[i]:
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
P = [float('inf')]+P
for i in range(1,n+1):
if min(P[0:i]) >= P[i]:
ans += 1
#print(P[0:i])
print(ans)
| n = int(eval(input()))
l = list(map(int,input().split()))
ans = 0
tmpmin = l[0]
for i in range(n):
if l[i] <= tmpmin:
ans += 1
tmpmin = min(tmpmin,l[i])
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
res = 0
aa = 0
for i in p:
if res ==0:
res += 1
aa += 1
continue
if i <= min(p[0:aa]):
res += 1
aa += 1
print(res)
| n = int(eval(input()))
p = list(map(int, input().split()))
res = 0
aa = p[0]
for i in p:
if aa >= i:
res += 1
aa = i
print(res) | p02791 |
l = int(eval(input()))
order = list(input().split())
for i in range(l):
order[i] = int(order[i])
a = 0
c = 0
for i in range(l):
for j in range(i+1):
if order[j] >= order[i]:
c = c + 1
if c - 1 == i:
a = a + 1
if j == i:
c = 0
print(a) | l = int(eval(input()))
order = list(input().split())
for i in range(l):
order[i] = int(order[i])
min = order[0]
a = 0
for i in range(l):
if order[i] <= min:
a = a + 1
min = order[i]
print(a)
| p02791 |
n = int(eval(input()))
*p, = list(map(int, input().split()))
ans = 0
for i in range(n):
flag = True
for j in range(0, i+1):
if p[i] > p[j]:
flag = False
break
if flag:
ans += 1
print(ans)
| n = int(eval(input()))
*p, = list(map(int, input().split()))
m = p[0]
ans = 0
for i in range(n):
if p[i] <= m:
ans += 1
m = min(m, p[i])
print(ans)
| p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
ans = 0
for i, p in enumerate(p_list):
if p == min(p_list[:i+1]):
ans += 1
print(ans)
| n = int(eval(input()))
p_list = list(map(int, input().split()))
mi = p_list[0]
ans = 1
for i in range(1, n):
if mi >= p_list[i]:
ans += 1
mi = p_list[i]
print(ans) | p02791 |
#front small ng
def checkFront(start,a):
nowIndex = start
for i in range(len(a)):
#print("hikaku",a[start],a[nowIndex])
if(a[start] > a[nowIndex]):
#print("out")
return 0
else:
if(nowIndex == 0):
#print("ok")
return 1
else:
nowIndex -= 1
n = int(eval(input()))
a = list(map(int, input().split()))
ans = 0
for i in range(n):
ans += checkFront(i,a)
#print(i,ans)
print(ans) | #front small ng
def checkFront(start,a):
global smallest
nowIndex = start
if(a[start] > smallest):
#print("out")
return 0
else:
smallest = a[start]
return 1
n = int(eval(input()))
a = list(map(int, input().split()))
smallest = a[0]
ans = 0
for i in range(n):
ans += checkFront(i,a)
print(ans) | p02791 |
n = int(eval(input()))
P = [int(i) for i in input().split()]
r = 1
for i in range(1, n):
if P[i] < min(P[:i]):
r += 1
print(r) | n = int(eval(input()))
P = [int(i) for i in input().split()]
r = 0
m = n+1
for i in range(n):
if P[i] < m:
r += 1
m = P[i]
print(r) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for k in range(N):
# k＝０を避けるため
s = P[0:k+1]
min_k = min(s)
if min_k == P[k]:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
m = 10**6
ans = 0
for p in P:
if p < m:
m = p
ans += 1
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 = 1
min_val = p[0]
for i in range(1, n):
min_val = min(p[i], min_val)
if min_val == p[i]:
ans += 1
print(ans) | p02791 |
p_num = int(eval(input()))
p = list(map(int,input().split()))
count = 0
for i in range(p_num):
for j in range(i+1):
if p[i] > p[j]:
break
else:
count += 1
print(count)
| p_num = int(eval(input()))
p = list(map(int,input().split()))
count = 1
min_num = p[0]
for i in p[1:]:
if i < min_num:
min_num = i
count += 1
print(count)
| p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.