input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N=int(eval(input()))
S=list(map(int, input().split()))
ans=0
for i in range(0,N):
if min(S[:i+1])==S[i]:
ans+=1
print(ans) | N=int(eval(input()))
S=list(map(int, input().split()))
Min=2*(10**5)
ans=0
for i in S:
if Min>=i:
Min=i
ans+=1
print(ans) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min_p = P[0]
for p in P:
if p <= min_p:
ans += 1
min_p = min(min_p, p)
print(ans)
| n = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min_p = P[0]
for p in P:
if p <= min_p:
ans += 1
min_p = p
print(ans)
| p02791 |
n = int(eval(input()))
List = list(map(int, input().split()))
count = 0
for i in range(n):
if List[i] <= min(List[0:i+1:]):
count += 1
print(count) | n = int(eval(input()))
List = list(map(int, input().split()))
count = 1
min = List[0]
for i in range(n):
if min > List[i]:
min =List[i]
count += 1
print(count)
| p02791 |
n = int(eval(input()))
List = list(map(int, input().split()))
count = 1
min = List[0]
for i in range(n):
if min > List[i]:
min =List[i]
count += 1
print(count)
| n = int(eval(input()))
l = list(map(int,input().split()))
min = l[0]
cnt = 0
for i in range(n):
if min >= l[i]:
cnt += 1
min = l[i]
print(cnt) | p02791 |
#!/usr/bin/env python3
def main():
N = int(eval(input()))
*P, = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
if P[i] == min(P[0:i + 1]):
cnt += 1
print(cnt)
main() | #!/usr/bin/env python3
def main():
N = int(eval(input()))
*P, = list(map(int, input().split()))
mini = 10**6
cnt = 0
for _ in P:
if _ < mini:
mini = _
cnt += 1
else:
continue
print(cnt)
main() | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n) :
if i == 0 :
count += 1
else :
mn = min(p[0:i+1])
if mn == p[i] :
count += 1
print(count)
| n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n) :
if i == 0 :
mn = p[i]
count += 1
else :
if mn > p[i] :
mn = p[i]
count += 1
print(count)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for index, p in enumerate(P):
flag = 0
for i in range(index):
if p > P[i]:
flag = 1
if flag == 0:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
min = 10000000
for p in P:
if min > p:
ans += 1
min = p
print(ans) | p02791 |
n = int(eval(input()))
P = list(map(int, input().split()))
sum = 0
for i in range(n):
ans = True
for j in range(i):
if P[i] > P[j]:
ans = False
if ans:
sum += 1
print(sum) | n = int(eval(input()))
P = list(map(int, input().split()))
sum = 0
min = n
for i in range(n):
if min >= P[i]:
min = P[i]
sum += 1
print(sum) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=1
for i in range(1,N):
if min(P[:i])==min(P):
break
if min(P[:i])>P[i]:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int,input().split()))
x=N+1
cnt=0
for i in range(N):
if P[i]<x:
cnt+=1
x=P[i]
print(cnt) | p02791 |
n=int(eval(input()))
li = list(map(int,input().split()))
count=1
li2=[]
if(len(li)!=1):
for i in range(1,n):
li2=li[0:i]
if(min(li2)>=li[i]):
count+=1
print(count)
| n=int(eval(input()))
li = list(map(int,input().split()))
count=1
m=n
for i in range(1,n):
m=min(m,li[i-1])
if(m==1):
break
if(m>=li[i]):
count+=1
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(n):
for j in range(i+1):
if p[i] > p[j]:
break
else:
count += 1
print(count)
| n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
min_val = p[0]
for i in range(n):
if min_val >= p[i]:
min_val = p[i]
if min_val >= p[i]:
count += 1
print(count)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
tmp = p[:i+1]
if min(tmp) >= p[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
tmp_min = p[0]
for i in range(1, n):
if tmp_min >= p[i]:
tmp_min = p[i]
ans += 1
print(ans) | p02791 |
def main():
n = int(eval(input()))
p_list = list(map(int, input().split()))
count = 1
for i in range(1, len(p_list)):
if min(p_list[:i+1]) == p_list[i]:
count += 1
print(count)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
p_list = list(map(int, input().split()))
count = 1
tmp_min = p_list[0]
for i in range(1, len(p_list)):
tmp_min = min(tmp_min, p_list[i])
if tmp_min == p_list[i]:
count += 1
print(count)
if __name__ == '__main__':
main()
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
for i in range(n):
ok_flag = True
for j in range(i+1):
if p[i] > p[j]:
ok_flag=False
if ok_flag:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 0
min_1_i = p[0]
for i in range(n):
min_1_i = min(min_1_i,p[i])
if p[i] <= min_1_i:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
x = list(map(int, input().split()))
count=0
for i in range(N):
if x[i]==1:
count=count+1
break
elif x[i]==min(x[0:i+1]):
count=count+1
print(count)
| N = int(eval(input()))
x = list(map(int, input().split()))
count=0
min=2000000
for i in range(N):
if min>=x[i]:
count=count+1
min=x[i]
print(count)
| p02791 |
N = int(eval(input()))
p = list(map(int,input().split()))
p_temp = float("inf")
ans = N
for i in range(N):
flag = 0
for j in range(i):
if p[j] <= p[i]:
flag = 1
ans -= flag
print(ans) | N = int(eval(input()))
p = list(map(int,input().split()))
p_min = [0]*N
p_min[0] = N+1
for i in range(1,N):
p_min[i] = min(p[i-1],p_min[i-1])
ans = 0
for i in range(N):
if p_min[i] >= p[i]:
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 1
for i in range(1,len(p)):
if min(p[:i]) >= p[i]:
cnt+=1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 1
m = p[0]
for i in range(1,len(p)):
if m >= p[i]:
cnt+=1
m = min(m,p[i])
print(cnt) | p02791 |
n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(n):
if P[i] == min(P[0:i+1]):
ans += 1
print(ans) | n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
mi = P[0]
for i in range(n):
if P[i] <= mi:
mi = P[i]
ans += 1
print(ans) | p02791 |
n,*p=list(map(int,open(0).read().split()))
c=0
for i in range(n):
if p[i]<=min(p[:i+1]):
c+=1
print(c) | n,*p=list(map(int,open(0).read().split()))
c=0
min_p=p[0]
for i in range(n):
min_p=min(min_p,p[i])
if p[i]<=min_p:
c+=1
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
c = 0
for i in range(n):
q = p[0:i+1]
if min(q) == p[i]:
c += 1
print(c) | n = int(eval(input()))
p = list(map(int,input().split()))
c = 0
m = p[0]
for i in range(n):
if p[i] <= m :
m = p[i]
c += 1
print(c) | p02791 |
n, *ps = list(map(int, open(0).read().split()))
cou = 1
for i, p in enumerate(ps[1:], 2):
a = sorted(ps[:i])
if a.index(p)==0:
cou += 1
print(cou) | n, *ps = list(map(int, open(0).read().split()))
mp = ps[0]
cou = 1
for p in ps[1:]:
if mp > p:
cou += 1
mp = p
print(cou) | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
count = N
for i in range(N):
for j in range(i):
if P[i] > P[j]:
count -= 1
break
print(count) | N = int(eval(input()))
P = list(map(int, input().split()))
count = 0
min_num = 2 * 10**5
for i in range(N):
if P[i] <= min_num:
count += 1
min_num = 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()))
m = P[0] #その時点での最小値
cnt = 1 #P[0]の時点でcnt=1
for i in range(N):
if P[i] < m:
m = P[i]
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
list = list(map(int,input().split(" ")))
result = n
for i in range(1,n):
for j in range(i):
if list[i] > list[j]:
result -= 1
break
print(result) | n = int(eval(input()))
list = list(map(int,input().split(" ")))
result = n
tem = list[0]
for i in range(n):
if tem >= list[i]:
tem = list[i]
else:
result -= 1
print(result) | p02791 |
n = int(eval(input()))
li=list(map(int,input().split()))
count = 0
for i in range(n-1):
for j in range(n-i-1):
if (li[n-i-1]>li[n-i-2-j]):
count+=1
break
print((n-count))
| n = int(eval(input()))
a = list(map(int,input().split()))
mymin = a[0]
count = 0
for i in range(len(a)):
if min(mymin, a[i]) == a[i]:
mymin = a[i]
count += 1
print(count)
| p02791 |
N=int(eval(input()))
P=list(map(int, input().split()))
count=0
for i in range(1,N+1):
if min(P[:i])==P[i-1]:
count+=1
print(count) | N=int(eval(input()))
P=list(map(int, input().split()))
m=9999999
count=0
for i in range(1,N+1):
if m>=P[i-1]:
count+=1
m=P[i-1]
print(count) | p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
ps=[]
for i in p:
ps.append(i)
#print(ps)
if min(ps)>=i:
ans+=1
print(ans)
| n = int(eval(input()))
p = list(map(int,input().split()))
ans = 0
ps=[]
p_min = p[0]
for i in p:
if p_min>i:
p_min=i
if p_min>=i:
ans+=1
print(ans)
| p02791 |
N = int(eval(input()))
P_i = list(map(int, input().split()))
total = 0
for i in range(N):
if P_i[i] <= min(P_i[0:i + 1]) :
total += 1
print(total)
| N = int(eval(input()))
P_i = list(map(int, input().split()))
total = 0
equi = P_i[0]
for i in range(N):
if equi >= P_i[i]:
total += 1
equi = P_i[i]
print(total)
| p02791 |
n = int(eval(input()))
l = list(map(int,input().split()))
#print(l)
ans = 0
sv = []
for i in l:
sv.append(i)
if i <= min(sv):
ans += 1
print(ans) | n = int(eval(input()))
l = list(map(int,input().split()))
#print(l)
ans = 0
min_ = 999999
for i in l:
if i <= min_:
min_ = i
ans += 1
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 1
for i in range(1,N):
if P[i] <= min(P[:i]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
ans = 1
small = P[0]
for i in range(1,N):
if P[i] <= small:
ans += 1
small = P[i]
print(ans) | p02791 |
N = int(eval(input()))
P = [int(p) for p in input().split()]
# 先頭は必ずカウント
count = 1
prev_index = N
for c in range(1, N):
if P[c] == min(P[:c+1]):
count += 1
print(count) | N = int(eval(input()))
count = 0
min_num = N
for c in input().split():
p = int(c)
min_num = min(min_num, p)
if min_num == p:
count += 1
print(count) | p02791 |
N = int(eval(input()))
P = [int(x) for x in input().split()]
cnt=1
for i in range(1, N):
if min(P[:i]) >= P[i]:
cnt+=1
# print(i, cnt)
print(cnt) | 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=list(map(int,input().split()))
R=[[True for i in range(N)] for j in range(N)]
R1=[False for i in range(N)]
for i in range(N):
if P[i]<=min(P[:i+1]):
R[i]=True
else:
R[i]=False
print((R.count(True))) | 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)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 1
result = 1
for i in p[1:]:
if i <= min(p[:count]):
result += 1
count += 1
print(result) | n = int(eval(input()))
p = list(map(int, input().split()))
memory = p[0]
count = 0
for i in p:
if i <= memory:
count += 1
if i < memory:
memory = i
print(count) | 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
minp =P[0]
for i in range(1, N):
if minp >= P[i]:
cnt += 1
minp = min(minp, P[i])
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for i in range(n):
if i==0:
cnt+=1
else:
if p[i]<=min(p[0:i]):
cnt+=1
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
for i in range(n):
if i==0:
cnt+=1
f = p[i]
else:
if p[i]<=f:
cnt+=1
f = min(p[i], f)
print(cnt) | p02791 |
N=int(eval(input()))
mylist=list(map(int,input().split()))
#print(mylist)
answer=0
#2重forループでは重すぎるのでTLEになる。
i=0
while i<N:
flag=0
for j in range(i):
#print("iは")
#print(i)
#print("jは")
#print(j)
if mylist[i]>mylist[j]:
#一つでも条件満たさないjがあればflagを-1にする
flag=-1
break
if flag==0:
#flagが0であれば、そのiに対して答えを+1する
answer+=1
i+=1
print(answer) | N=int(eval(input()))
lt=list(map(int,input().split()))
#print(lt)
temp=0
answer=0
for i in range(N):
if i==0:
answer+=1
temp=lt[i]
elif temp>=lt[i]:
answer+=1
temp=lt[i]
print(answer) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
ans=0
for i,p in enumerate(P,1):
if min(P[:i])==p:
ans+=1
print(ans) | N=int(eval(input()))
P=list(map(int, input().split()))
ans=0
mv=N
for p in P:
if p<=mv:
ans+=1
mv=p
print(ans) | p02791 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
a_list = list(map(int, input().split()))
cnt = 0
for i in range(N):
if min(a_list[:i+1]) >= a_list[i]:
cnt += 1
print(cnt) | import sys
input = sys.stdin.readline
N = int(eval(input()))
a_list = list(map(int, input().split()))
cnt = 0
min_a = 10 ** 9
for i in range(N):
min_a = min(min_a,a_list[i])
if min_a >= a_list[i]:
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
num = list(map(int, input().split()))
l = []
l.append(num[0])
count = 1
for i in range(1,n):
if num[i]<=min(a for a in l):
count += 1
l.append(num[i])
else:
l.append(num[i])
print(count) | n = int(eval(input()))
num = list(map(int, input().split()))
min_n = num[0]
count = 1
for i in range(1,n):
if num[i]<=min_n:
count += 1
min_n = num[i]
print(count)
| p02791 |
N = int(eval(input()))
a = list(map(int,input().split()))
n = 0
for i in range(N):
for j in range(0,i+1):
#print(a[i],end=","),print(a[j])
if a[i] > a[j]:
#print("error")
n += 1
break
print((N-n)) | N = int(eval(input()))
a = list(map(int,input().split()))
Min = N+1
n = 0
for i in range(N):
if Min > a[i]:
Min = a[i]
n += 1
print(n) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
c = [0] * n
for i in range(n):
for j in range(i):
if p[i] > p[j]:
c[i] = 1
break
print((c.count(0))) | n = int(eval(input()))
p = [int(i) for i in input().split()]
x = p[0]
ans = 0
for i in p:
if x >= i:
ans += 1
x = i
print(ans) | p02791 |
# -*- coding: utf-8 -*-
# C - Low Elements
import sys
def solve152C(N, plist):
count = 0
isFound = True
for i in range(1, N+1):
for j in range(1, i+1):
if plist[i-1] > plist[j-1]:
isFound = False
break
if(isFound):
count += 1
else:
isFound = True
print(count)
if __name__ == "__main__":
N = int(eval(input()))
plist= list(map(int, input().split()))
solve152C(N, plist)
| # -*- coding: utf-8 -*-
# C - Low Elements
import sys
def solve152C(N, plist):
count = 1
maxnumber = plist[0]
minnumber = plist[0]
isFound = True
for i in range(2, N+1):
p = plist[i-1]
if p < maxnumber and p < minnumber:
count += 1
if p > maxnumber:
maxnumber = p
if p < minnumber:
minnumber = p
print(count)
if __name__ == "__main__":
N = int(eval(input()))
plist= list(map(int, input().split()))
solve152C(N, plist)
| p02791 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
pl = list(map(int, input().split()))
ans = 0
for i in range(n):
mi = min(pl[:i+1])
if mi == pl[i]:
ans += 1
print(ans)
| # -*- coding: utf-8 -*-
n = int(eval(input()))
pl = list(map(int, input().split()))
ans = 0
mi = float('inf')
for p in pl:
if p<mi:
ans += 1
mi = min(mi, p)
print(ans)
| p02791 |
N=int(eval(input()))
Nums = list(map(int,input().split()))
M=[]
for i in range(1,N+1):
tmp_list = Nums[:i]
M_i = min(tmp_list)
M.append(M_i)
cnt=0
for j in range(N):
if Nums[j] ==M[j]:
cnt+=1
print(cnt) | N=int(eval(input()))
Nums = list(map(int,input().split()))
min_value=Nums[0]
cnt=0
for i in range(N):
min_value = min(min_value,Nums[i])
if Nums[i]<=min_value:
cnt+=1
print(cnt) | p02791 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
for j in range(1,i+1):
if a[j-1]<a[i-1]:
break
if j==i:
ans+=1
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
m=a[0]
ans=1
for i,z in enumerate(a):
if i==0:continue
if z<=m:
ans+=1
m=min(m,z)
print(ans)
| p02791 |
N = int(eval(input()))
Num = [int(i) for i in input().split()]
Max = Num[0]
Min = Num[0]
cnt = 1
for i in range(1,N):
if Num[i] <= Max and Min>=Num[i] :
cnt +=1
Max = max(Max,Num[i])
Min = min(Min,Num[i])
#print(Max,Min)
print(cnt)
| def main():
n = int(eval(input()))
p = [int(i) for i in input().split()]
Min = [10**9]
ans = 0
for i in range(n):
Min.append(min(Min[-1],p[i]))
for i in range(n):
if Min[i]>p[i]:
ans += 1
print(ans)
main() | p02791 |
n=int(eval(input()))
P=list(map(int,input().split()))
ans=0
for i in range(n):
M=min(P[0:i+1])
if M==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 = [-1]
P += list(map(int, input().split(' ')))
count = 0
for i in range(1,N+1):
boolean = True
if P[i] <= min(P[1:i+1]):
count += 1
print(count) | N = int(eval(input()))
P = [-1]
P += list(map(int, input().split(' ')))
mini = 10 ** 9
count = 0
for i in range(1,N+1):
if P[i] <= mini:
mini = P[i]
count += 1
print(count) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
minp = P[0]
ans = 0
for i in range(N):
if i != 0:
minp = min(minp,P[i])
if minp == P[i]:
ans += 1
print(ans)
| N = int(eval(input()))
P = list(map(int,input().split()))
minp = P[0]
ans = 0
for i in range(N):
minp = min(minp,P[i])
if minp == P[i]:
ans += 1
print(ans) | p02791 |
N=int(eval(input()))
P=list(map(int,input().split()))
m=10**9
ans=0
for i in range(N):
if P[i]<m:
m=P[i]
ans+=1
print(ans) | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
P=LI()
m=P[0]
cnt=1
for i in range(1,N):
if P[i]<m:
cnt+=1
m=P[i]
print(cnt)
main()
| p02791 |
n =int(eval(input()))
lis = list(map(int, input().split()))
total = 0
for i in range(n):
tmp = lis[i]
flag = 1
for j in range(i):
if tmp > lis[j]:
flag = 0
break
if flag:
total += 1
print(total) | n =int(eval(input()))
lis = list(map(int, input().split()))
total = 0
mini = lis[0]
for i in range(n):
mini = min(mini, lis[i])
if mini == lis[i]:
total += 1
print(total) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
l = p[:i + 1]
if min(l) >= 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):
num = p[i]
if m >= num:
ans += 1
m = min(m, num)
print(ans) | p02791 |
N = int(eval(input()))
P = [int(p) for p in input().split()]
ans = 0
m = P[0]
for i in range(N):
if P[i] <= m:
ans += 1
m = P[i]
print(ans) | N = int(eval(input()))
P = [int(p) for p in input().split()]
M = N+1
cnt = 0
for p in P:
if p < M:
cnt += 1
M = p
print(cnt) | p02791 |
n = int(eval(input()));
A = list(map(int, input().split()));
ans = 0;
for i in range(len(A)):
if min(A[:i+1]) == A[i]:
ans += 1;
else:
pass;
print(ans); | n = int(eval(input()));
A = list(map(int, input().split()));
ans = 0;
min_ = 2 * (10 ** 5);
for i in range(n):
min_ = min(A[i], min_);
if min_ == A[i]:
ans += 1;
else:
pass;
print(ans); | p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
memo = [0] * N
memo[0] = 1
for i in range(1, N):
if P[i] > P[i-1]:
memo[i] = 0
elif P[i] == P[i-1]:
memo[i] = memo[i-1]
else:
if P[i] <= min(P[0:i]):
memo[i] = 1
else:
memo[i] = 0
print((sum(memo)))
| N = int(eval(input()))
P = list(map(int, input().split()))
memo = [0] * N
memo[0] = 1
minn = P[0]
for i in range(1, N):
if P[i] <= minn:
memo[i] = 1
else:
memo[i] = 0
minn = min(minn, P[i])
print((sum(memo)))
| p02791 |
'''
Created on 2020/08/17
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
P=list(map(int,pin().split()))
ans=0
for i in range(N):
if min(P[:i+1])==P[i]:
ans+=1
print(ans)
return
main() | '''
Created on 2020/08/17
@author: harurun
'''
def main():
import sys
pin=sys.stdin.readline
pout=sys.stdout.write
perr=sys.stderr.write
N=int(pin())
P=list(map(int,pin().split()))
ans=0
m=P[0]
for i in range(N):
if m>=P[i]:
m=P[i]
ans+=1
print(ans)
return
main() | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
c=0
for m in range(n):
d=0
for i in range(m):
if p[m]>p[i]:
d+=1
if d==0:
c+=1
print(c)
| n=int(eval(input()))
p=list(map(int,input().split()))
c=0
d=p[0]
for i in range(n):
if p[i]<= d:
d=p[i]
c+=1
print(c) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
tmp = p[0]
for i in range(len(p)):
target = p[i]
flag = True
if tmp < target:
tmp = target
continue
for j in range(i):
if p[i] > p[j]:
flag = False
break
if flag:
count += 1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
min = p[0]
for i in range(len(p)):
if p[i]<=min:
min = p[i]
ans += 1
print(ans) | p02791 |
import copy
N = int(eval(input()))
list = [int(i) for i in input().split()]
count = 0
for j in range(N):
#print(j)
#print(list)
#print("j="+str(j))
list2 = copy.copy(list)
#print(list2)
#print(j)
del list2[j+1:]
#print(list2)
#list2 = sorted(list2)
#print(list[j])
if(min(list2) >= list[j]):
count +=1
print(count)
| N = int(eval(input()))
list = [int(i) for i in input().split()]
ans = 0
min = list[0]
for j in range(N):
if (min >= list[j]):
ans += 1
min = list[j]
else:
continue
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
Nmax = N
for i in range(N):
if min(P[:i + 1]) < P[i]:
Nmax += -1
print(Nmax)
| N = int(eval(input()))
P = list(map(int, input().split()))
Nmax = N
Nmin = P[0]
for i in range(N):
if P[i] <= Nmin:
Nmin = P[i]
else:
Nmax += -1
print(Nmax)
| p02791 |
N = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i, j in enumerate(p):
if i == 0:
ans += 1
continue
else:
if j < min(p[:i]):
ans += 1
print(ans) | N = int(eval(input()))
p = list(map(int, input().split()))
minval = p[0]
ans = 1
for i in p:
if i < minval:
ans += 1
minval = i
print(ans) | p02791 |
n = int(eval(input()))
p = [int(x) for x in input().split()]
c = [1 if p[i] == min(p[:i+1]) else 0 for i in range(n)]
print((sum(c)))
| n = int(eval(input()))
p = [int(x) for x in input().split()]
ans = 1
minp = p[0]
for i in range(1, n):
if (p[i] <= minp):
minp = p[i]
ans += 1
print(ans)
| p02791 |
n = int(eval(input()))
data = list(map(int, input().split()))
ans = 0
# 処理系
for i in range(n):
if min(data[:i+1]) == data[i]:
ans += 1
print(ans)
| n = int(eval(input()))
data = list(map(int, input().split()))
ans = 0
min_ = data[0]
for i in range(n):
# min_ の更新ができれば ans を更新
if min_ >= data[i]:
min_ = data[i]
ans += 1
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, N):
flag = 0
for j in range(i):
if P[j] < P[i]:
flag += 1
break
if flag == 0:
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
minimum = 200001
for p in P:
if p <= minimum:
minimum = p
ans += 1
print(ans) | p02791 |
#!/usr/bin/env python3
n = int(eval(input()))
l = list(map(int, input().split()))
ans = 1
if len(l) == 1:
print((1))
exit()
if len(l) > 1 and l[0] >= l[1]:
ans += 1
for i in range(2, n):
if min(l[:i]) > l[i]:
ans += 1
print(ans)
| #!/usr/bin/env python3
n = int(eval(input()))
l = list(map(int, input().split()))
ans = 1
min_l = l[0]
for i in range(1, n):
if min_l > l[i]:
ans += 1
min_l = l[i]
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
a = p[:i + 1]
if min(a) >= p[i]:
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
c = p[0]
for i in range(n):
#a = p[:i + 1]
if c >= p[i]:
c = p[i]
if c >= p[i]:
ans += 1
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
count = 0
for i in range(len(p)):
tmp = p[i]
a = min(p[:i+1])
if tmp == a:
count+=1
print(count) | n = int(eval(input()))
p = list(map(int, input().split()))
count = 1
tmp = p[0]
for i in p:
a = min(tmp, i)
if tmp != a:
count+=1
tmp = a
print(count) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
c=0
for i in range(n):
if p[i]==min(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 p:
if i<m:
m=i
c+=1
print(c)
| 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()))
mnm = 2 * 10**5
ans = 0
for i in p:
if i <= mnm:
mnm = i
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
l = list(map(int, input().split()))
total = 0
for i in range(n):
count = 0
for j in range(i + 1):
if l[i] <= l[j]:
count += 1
if count == i + 1:
total += 1
print(total) | n = int(eval(input()))
l = list(map(int, input().split()))
total = 0
minl = l[0]
for i in l:
if i <= minl:
total += 1
minl = i
print(total) | p02791 |
def search(ind):
for i in range(ind):
if p_ls[i] < p_ls[ind]:
return 0
return 1
n = int(eval(input()))
p_ls = list(map(int, input().split()))
sub_cnt = 0
one = p_ls.index(1)+1
for i in range(one):
sub_cnt += search(i)
print(sub_cnt)
| n = int(eval(input()))
p_ls = list(map(int, input().split()))
mini = p_ls[0]
cnt = 0
for i in range(n):
if mini >= p_ls[i]:
cnt+=1
mini= p_ls[i]
print(cnt)
| p02791 |
n = int(eval(input()))
p_list = list(map(int, input().split()))
cnt = 0
for i in range(n):
if p_list[i] == min(p_list[:i+1]):
cnt += 1
print(cnt) | n = int(eval(input()))
p_list = list(map(int, input().split()))
cnt = 0
minn = p_list[0]
for i in range(n):
minn = min(p_list[i], minn)
if p_list[i] == minn:
cnt += 1
print(cnt) | p02791 |
n=int(eval(input()))
p=input().split()
num=0
for i in range(n):
for j in range(i+1):
if int(p[j])<int(p[i]):
break
if j==i:
num+=1
print(num)
| n=int(eval(input()))
p=input().split()
num=0
mini=int(p[0])
for i in range(n):
if int(p[i])<=mini:
num+=1
mini=int(p[i])
print(num)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(0, N):
if P[i] <= min(P[0:i+1]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
m = P[0]
for i in range(0, N):
if m > P[i]:
m = P[i]
if P[i] <= m:
ans += 1
print(ans) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
last_ok_postion = 0
last_ok_value = P[0]
count = 1
for i in range(1,N):
if last_ok_value >= P[i]:
m = min(P[last_ok_postion:i])
if m >= P[i]:
count += 1
print(count) | N = int(eval(input()))
P = list(map(int,input().split()))
last_ok_postion = 0
count = 1
for i in range(1,N):
if P[last_ok_postion] >= P[i]:
m = min(P[last_ok_postion:i])
if m >= P[i]:
count += 1
last_ok_postion = i
print(count) | p02791 |
N = int(eval(input()))
P = [int(p) for p in input().split()]
ans = 0
for i in range(N):
if P[i] == min(P[0:i+1]) :
ans += 1
print(ans) | N = int(eval(input()))
P = [int(p) for p in input().split()]
ans = 0
mi = P[0]
for i in range(N):
mi = min(mi, P[i])
if mi >= P[i]:
ans += 1
print(ans) | p02791 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i in range(0, len(P)-1):
if (P[1] <= P[0]):
ans += 1
del(P[0])
else:
del(P[1])
print((ans+1))
| import sys
input = sys.stdin.readline
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
pivot = P[0]
for i in range(0, len(P)):
if (pivot >= P[i]):
ans += 1
pivot = P[i]
print(ans)
| p02791 |
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 0
for i, pi in enumerate(P):
if all([pi < pj for pj in P[:i]]):
ans += 1
print(ans) | N = int(eval(input()))
P = list(map(int, input().split()))
pp = P[0]
ans = 0
for p in P:
if p <= pp:
ans += 1
pp = p
print(ans) | p02791 |
dummy = list(map(int, input().split(" ")))
N = dummy[0]
P = list(map(int, input().split(" ")))
out = 0
for a in range(N):
flag = 1
for b in range(a + 1):
#print(P[a], P[b])
if(P[a] > P[b]):
flag = 0
break
if(flag == 1):
out += 1
#print(P)
print(out) | dummy = list(map(int, input().split(" ")))
N = dummy[0]
P = list(map(int, input().split(" ")))
out = 0
min = N + 1
for a in range(N):
if(P[a] <= min):
min = P[a]
out += 1
#print(P)
print(out) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 0
for i in range(N):
part_min = min(P[:i+1])
if(part_min == P[i]):
cnt += 1
print(cnt) | N = int(eval(input()))
P = list(map(int,input().split()))
cnt = 0
min1 = P[0]
for i in range(N):
if(min1 > P[i]):
min1 = P[i]
if(min1 == P[i]):
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
x = P.pop(0)
m = x
ans = 1
for i in range(N-1):
x = P.pop(0)
if x <= m:
ans += 1
m = x
print(ans) | N = int(eval(input()))
P = list(map(int,input().split()))
x = P[0]
m = x
ans = 1
for i in range(1,N):
x = P[i]
if x <= m:
ans += 1
m = x
print(ans) | p02791 |
N = eval(input())
P_list = input().split()
# N = '5'
# P_list = '4 2 5 1 3'.split()
P_list = [int(i) for i in P_list]
length = int(N)
ans = 0
M = []
for i in range(length):
# print(min(P_list[0:i+1]))
if P_list[i]==min(P_list[0:i+1]):
ans +=1
print(ans) | N = eval(input())
P_list = input().split()
# N = '5'
# P_list = '4 2 5 1 3'.split()
P_list = [int(i) for i in P_list]
length = int(N)
ans = 0
M = []
mini =-1
for i in range(length):
# print(min(P_list[0:i+1]))
if P_list[i] <mini or mini <0:
mini = P_list[i]
if mini == P_list[i]:
ans +=1
# if P_list[i]==min(P_list[0:i+1]):
# ans +=1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
for i in range(1, n):
if p[i] <= min(p[:i]):
ans += 1
print(ans)
| n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
min = p[0]
for i in range(1, n):
if min > p[i]:
min = p[i]
if p[i] <= min:
ans += 1
print(ans)
| p02791 |
n=int(eval(input()))
num=list(map(int,input().split()))
don=[]
cnt=0
for i in num:
flg=True
for j in don:
if i > j:
flg=False
if flg:
don.append(i)
cnt+=1
print(cnt) | n=int(eval(input()))
num=list(map(int,input().split()))
cnt=1
min_n=num[0]
for i in range(1,n):
if num[i] <= min_n:
min_n=num[i]
cnt+=1
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
cnt = n
for i in range(n):
for j in range(i+1):
if p[i] > p[j]:
cnt -= 1
break
print(cnt) | n = int(eval(input()))
p = list(map(int, input().split()))
cnt = 0
minx = max(p)
for i in range(n):
minx = min(p[i],minx)
if minx >= p[i]:
cnt += 1
print(cnt) | p02791 |
N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
x = 0
for i in range(N):
for j in range(i):
if P[i] <= P[j]:
x += 1
if x == i:
ans += 1
x = 0
print(ans)
| N = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
x = P[0]
for i in P:
if i == 1:
ans += 1
x = 1
else:
if x >= i:
ans += 1
x = i
print(ans)
| p02791 |
n = int(eval(input()))
p = list(map(int,input().split()))
cnt = 1
for i in range(1,n):
if p[i] > p[i-1]:
continue
elif min(p[:i+1]) == p[i]:
cnt += 1
print(cnt) | n = int(eval(input()))
p = list(map(int,input().split()))
min_num = 10**6
cnt = 0
for i in range(n):
if p[i] < min_num:
min_num = p[i]
cnt += 1
print(cnt) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
for i in range(1,n):
if min(p[0:i]) >= p[i]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 1
p_min = p[0]
for i in range(1,n):
if p_min >= p[i]:
ans += 1
p_min = min(p_min, p[i])
print(ans) | p02791 |
n = int(eval(input()))
P = [int(_) for _ in 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 = [int(_) for _ in input().split()]
cnt=0
a = P[0]
for i in range(n):
a = min(a,P[i])
if P[i] <= min(a,P[i]):
cnt+=1
print(cnt)
| p02791 |
n = int(eval(input()))
p = [int(i) for i in input().split()]
m = []
for i in range(1,n+1):
m.append(sorted(p[:i])[0])
ans = 0
for i in range(n):
if m[i] == p[i]:
ans += 1
print(ans) | n = int(eval(input()))
ppp = list(map(int, input().split()))
curr = 10 ** 6
ans = 0
for p in ppp:
if p < curr:
ans += 1
curr = p
print(ans) | p02791 |
N = int(eval(input()))
P = [int(i) for i in 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 = [int(i) for i in input().split()]
P_min = P.copy()
for i in range(1,N):
P_min[i] = min(P_min[i-1],P[i])
cnt = 0
for i in range(N):
if P_min[i] >= P[i]:
cnt += 1
print(cnt)
| p02791 |
def main():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
for i in range(1, N):
tmp = min(P[:i])
if P[i] <= tmp:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| def main():
N = int(eval(input()))
P = list(map(int, input().split()))
ans = 1
tmp = P[0]
for i in range(1, N):
if P[i] == 1:
print((ans + 1))
return
tmp = min(tmp, P[i])
if P[i] <= tmp:
ans += 1
print(ans)
if __name__ == "__main__":
main()
| p02791 |
N=int(eval(input()))
A=list(map(int,input().split()))
L=list()
ans=0
for n in A:
L.append(n)
if n==min(L):
ans+=1
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
a=A[0]
ans=1
for n in range(1,N):
if a>A[n]:
ans+=1
a=A[n]
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
a=0
for i in range(1,n):
if p[i] <= min(p[:i]):
a+=1
else:
pass
print((a+1)) | n=int(eval(input()))
p=list(map(int,input().split()))
a=0
b=10**10
for i in range(n):
if p[i] <= b:
a+=1
b=p[i]
else:
pass
print(a) | p02791 |
n = int(eval(input()))
P = list(map(int,input().split()))
ans = 0
for i in range(n):
if P[i] == min(P[0:i+1]):
ans += 1
print(ans) | n = int(eval(input()))
P = list(map(int,input().split()))
num = 2*10**5+1
ans = 0
for i in range(n):
if P[i] <= num:
num = P[i]
ans += 1
print(ans) | p02791 |
n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in range(n):
m = []
for j in range(i+1):
m.append(p[j])
if min(m) == m[-1]:
ans += 1
print(ans) | n = int(eval(input()))
p = list(map(int, input().split()))
ans = 0
for i in p:
if i <= p[0]:
p[0] = i
ans += 1
print(ans) | p02791 |
n=int(eval(input()))
p=list(map(int,input().split()))
data=[n+1]
for i in range(n):
res=min(data)
if res>p[i]:
data.append(p[i])
print((len(data)-1)) | n=int(eval(input()))
p=list(map(int,input().split()))
data=n+1
ans=0
for i in range(n):
if data>p[i]:
data=p[i]
ans+=1
print(ans) | p02791 |
# coding: utf-8
n = int(eval(input()))
P = [int(x) for x in input().split(" ")]
def check(i):
flag = True
for j in range(i):
if P[j] < P[i-1]:
flag = False
break
if flag:
return 1
else:
return 0
ans = 0
for i in range(1,n+1):
ans += check(i)
print(ans) | # coding: utf-8
n = int(eval(input()))
P = [int(x) for x in input().split(" ")]
mx = P[0]
ans = 1
for i in range(1,n):
if mx > P[i]:
ans += 1
mx = P[i]
print(ans) | p02791 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
class BIT:
""" Binary Indexed Tree """
def __init__(self, n):
# 0-indexed
n += 1
nv = 1
while nv < n:
nv *= 2
self.size = nv
self.tree = [0] * nv
def sum(self, i):
""" [0, i]を合計する """
s = 0
i += 1
while i > 0:
s += self.tree[i-1]
i -= i & -i
return s
def add(self, i, x):
""" 値の追加：添字i, 値x """
i += 1
while i <= self.size:
self.tree[i-1] += x
i += i & -i
def get(self, l, r=None):
""" 区間和の取得 [l, r) """
# 引数が1つなら一点の値を取得
if r is None: r = l + 1
res = 0
if r: res += self.sum(r-1)
if l: res -= self.sum(l-1)
return res
N = INT()
A = LIST()
bit = BIT(N)
ans = 0
for i in range(N):
# 自分より左にある、自分より小さな数の個数
if bit.sum(A[i]) == 0:
ans += 1
bit.add(A[i], 1)
print(ans)
| # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
A = LIST()
ans = 0
mn = INF
for a in A:
if a < mn:
mn = a
ans += 1
print(ans)
| p02791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.