solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
L = list(map(int,input().split()))
max_score=L[0]
min_score=L[0]
amazing = 0
for i in range(1,n):
if L[i] < min_score:
amazing+=1
min_score = L[i]
elif L[i] > max_score:
amazing+=1
max_score = L[i]
print(amazing)
| 7 | PYTHON3 |
n=int(input())
l=[]
l=input().split()
s=0
for i in range (len(l)):
l[i]=int(l[i])
for i in range (len(l)-1):
if l[i+1]>max(l[:i+1]) or l[i+1]<min(l[:i+1]):
s=s+1
print(s)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(n):
if i == 0:
l.append(a[i])
continue
if a[i]>max(l)or a[i]<min(l):
l.append(a[i])
print(len(l)-1) | 7 | PYTHON3 |
while True:
try:
n=int(input())
l=input().split()
ma=int(l[0])
a=0
mi=int(l[0])
for i in range(1,n):
c=int(l[i])
if c<mi:
mi=c
a=a+1
elif c>ma:
ma=c
a=a+1
else:
mi=mi
ma=ma
a=a
print(a)
except EOFError:
break
| 7 | PYTHON3 |
n = int(input())
score = list(map(int, input().split()))
if n == 1:
num = 0
elif n >= 2 and score[0] == score[1]:
num = 0
for i in range(2, n):
lst = score[:i]
s = max(lst)
b = min(lst)
if score[i] > s or score[i] < b:
num += 1
else:
num = 1
for i in range(2, n):
lst = score[:i]
s = max(lst)
b = min(lst)
if score[i] > s or score[i] < b:
num += 1
print(num)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
p=[]
p.append(l[0])
count=0
for i in l[1:]:
if i > max(p) or i<min(p):
count += 1
p.append(i)
print(count) | 7 | PYTHON3 |
n,ans=int(input()),0
a= list(map(int, input().split()))
for i in range(1,n):
if a[i]<min(a[:i]):ans+=1
elif a[i]>max(a[:i]):ans+=1
print(ans)
| 7 | PYTHON3 |
#155A
a = int(input())
p = list(map(int, input().split()))
k = 0; g = []; g.append(p[0])
for i in p:
if (i > max(g) or i < min(g)):
g.append(i)
k+=1
print(k)
| 7 | PYTHON3 |
n=int(input())
inp=list(map(int,input().split()))
max1=inp[0]
min1=inp[0]
lst=[]
for i in range(1,n):
if(inp[i] > max1):
max1=inp[i]
lst.append(inp[i])
elif(inp[i] < min1):
min1=inp[i]
lst.append(inp[i])
print(len(set(lst)))
| 7 | PYTHON3 |
n=int(input())
line=[int(i) for i in input().split()]
maxline=[line[0]]
minline=[line[0]]
total=0
for i in line:
if i>maxline[-1]:
maxline.append(i)
total +=1
elif i<minline[-1]:
minline.append(i)
total +=1
else:
continue
print(total)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
max=l[0]
min=l[0]
count=0
for i in range(1,n):
if l[i]<min:
count=count+1
min=l[i]
elif l[i]>max:
count=count+1
max=l[i]
print(count) | 7 | PYTHON3 |
a = int(input())
lst = list(map(int,input().split()))
max=lst[0]
min=lst[0]
counter=0
for i in range(1,a):
if lst[i]> min:
counter +=1
min=lst[i]
elif lst[i]<max:
counter+=1
max=lst[i]
print(counter)
| 7 | PYTHON3 |
# cook your dish here
n=int(input())
lst=list(map(int,input().split()))
mini,maxi=lst[0],lst[0]
count=0
for i in range(1,len(lst)):
if lst[i]>maxi:
maxi=lst[i]
count+=1
elif lst[i]<mini:
mini=lst[i]
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
results = [int(i) for i in input().split()]
record = anti_record = results[0]
amazing_perfomances = 0
for i in range(1, n):
if results[i] > record:
record = results[i]
amazing_perfomances += 1
elif results[i] < anti_record:
anti_record = results[i]
amazing_perfomances += 1
print(amazing_perfomances)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
i=1
s=0
while i<n:
if a[i]>max(a[0:i]) or a[i]<min(a[0:i]):
s+=1
i+=1
print(s) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
mi=0
mx=0
count=0
if n==1:
print(0)
else:
mi=l[0]
mx=l[0]
for i in range(1,n):
if l[i]<mi:
count+=1
mi=l[i]
elif l[i]>mx:
count+=1
mx=l[i]
print(count)
| 7 | PYTHON3 |
n=int(input())
s=input().split()
lst=list()
count=0
for i in range(n):
lst.append(int(s[i]))
for i in range(n):
if i==0:
best=lst[i]
worst=lst[i]
else:
if lst[i]>best:
best=lst[i]
count+=1
if lst[i]<worst:
count+=1
worst=lst[i]
print(count) | 7 | PYTHON3 |
n=int(input())
scores = list(map(int,input().split()))
best = scores[0]
worst = scores[0]
res=0
for i in scores[1:]:
if i < worst:
worst=i
res+=1
if i>best:
best=i
res+=1
print(res) | 7 | PYTHON3 |
n=int(input())
s=input().split()
k=0
for i in range(1,len(s)):
br=0
b=0
for j in range(0,i):
if int(s[i])>int(s[j]):
br+=1
if int(s[i])<int(s[j]):
b+=1
if br==i or b==i:
k+=1
print(k)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
cnt = 0
mini = a[0]
maxi = a[0]
for i in range(len(a)-1):
if a[i+1]>maxi:
cnt+=1
maxi = a[i+1]
if a[i+1]<mini:
cnt+=1
mini = a[i+1]
print(cnt) | 7 | PYTHON3 |
import math
n=int(input())
data=list(map(int,input().split()))
MAX=data[0]
MIN=data[0]
cnt=0
for i in range(1, n):
if data[i]>MAX:
MAX=data[i]
cnt+=1
if data[i]<MIN:
MIN=data[i]
cnt+=1
print(cnt) | 7 | PYTHON3 |
T = int(input())
data = list(map(int, input().split()))
initial = data[0]
min_score = initial
max_score = initial
c = 0
for i in data:
if i < min_score or i > max_score:
min_score = i if i < min_score else min_score
max_score = i if i > max_score else max_score
c += 1
print(c) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
s=0
amax=amin=a[0]
for i in a:
if i>amax or i<amin:
s+=1
amax=max(amax,i)
amin=min(amin,i)
print(s)
| 7 | PYTHON3 |
n=int(input())
points=list(map(int, input().split()))
max_point=points[0]
min_point=points[0]
count=0
for i in range(1,n):
if points[i]>max_point:
count+=1
max_point=points[i]
if points[i]<min_point:
count+=1
min_point=points[i]
print(count) | 7 | PYTHON3 |
# JAI SHREE RAM
import math; from collections import *
import sys; from functools import reduce
# sys.setrecursionlimit(10**6)
def get_ints(): return map(int, input().strip().split())
def get_list(): return list(get_ints())
def get_string(): return list(input().strip().split())
def printxsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
UGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)
# sys.stdin=open("input.txt","r");sys.stdout=open("output.txt","w")
# for _testcases_ in range(int(input())):
n = int(input())
li = get_list()
mn = mx = li[0]
ans = 0
for i in range(1, n):
if li[i] < mn:
mn = li[i]
ans += 1
elif mx < li[i]:
mx = li[i]
ans += 1
print(ans)
'''
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
THE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )
Link may be copy-pasted here if it's taken from other source.
DO NOT PLAGIARISE.
>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!
''' | 7 | PYTHON3 |
n = int(input())
lis = list(map(int,input().split()))
count = 0
amax = lis[0]
amin = lis[0]
if n > 1 :
for i in range(1,n):
if lis[i] < amin :
count += 1
amin = lis[i]
elif lis[i] > amax :
count+=1
amax = lis[i]
print(count)
else:
print(0) | 7 | PYTHON3 |
def main():
n = int(input())
a = [int(x) for x in input().split()]
max = a[0]
min = a[0]
b = 0
for i in range(n):
if a[i] > max:
max = a[i]
b = b + 1
if a[i] < min:
min = a[i]
b = b + 1
print(b)
if __name__ == '__main__':
main() | 7 | PYTHON3 |
n = int(input())
A = list(map(int, input().split(' ')))
cool = 0
for i in range(n):
if i == 0:
large = A[i]
small = A[i]
else:
if A[i] > large:
cool += 1
large = A[i]
if A[i] < small:
cool += 1
small = A[i]
print(cool)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
s = 0
for i in range(1, n):
if arr[i] > max(arr[:i]) or arr[i] < min(arr[:i]):
s += 1
print(s) | 7 | PYTHON3 |
n=int(input())
cnt=0
t=list(map(int,input().split()))
max=t[0]
min=t[0]
for i in t:
if i>max:
max=i
cnt+=1
if i<min:
min=i
cnt+=1
print(cnt) | 7 | PYTHON3 |
n = int(input())
x = list(map(int, input().split()))
max=x[0]
min=x[0]
ans = 0
for i in x:
if i>max:
ans += 1
max = i
elif i<min:
ans += 1
min = i
print(ans) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
b=a[0]
c=a[0]
d=0
for i in range(n):
if a[i]>b:
b=a[i]
d=d+1
elif a[i]<c:
c=a[i]
d=d+1
print(d)
| 7 | PYTHON3 |
n = int(input())
point = list(map(int,input().split()))[:n]
max = min = point[0]
count = 0
for i in range(1,n):
if(point[i] > max or point[i] < min):
if(point[i]> max):
max = point[i]
else:
min = point[i]
count+= 1
print(count) | 7 | PYTHON3 |
input();x,*b=map(int,input().split());y,r=x,0
for v in b:
if v<x or v>y:r+=1
x=min(x,v);y=max(y,v)
print(r) | 7 | PYTHON3 |
b=input()
a = [int(i) for i in input().split()]
min=a[0]
max=a[0]
res=0
for i in a:
if i>max:
max=i
res+=1
elif i<min:
min=i
res+=1
print(res)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=l[0]
c=0
d=0
for i in range(1,len(l)):
if(l[i]>m):
m=l[i]
c=c+1
m=l[0]
for j in range(1,len(l)):
if(l[j]<m):
m=l[j]
d=d+1
print(c+d) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=l[0]
p=l[0]
c=0
for i in range(1,n):
if l[i]>m :
m=l[i]
c+=1
elif l[i]<p:
p=l[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
minimum=a[0]
maximum=a[0]
count=0
for i in range(1,n):
if(a[i]<minimum):
minimum=a[i]
count+=1
elif(a[i]>maximum):
maximum=a[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
count=0
x=[]
x.append(l[0])
for i in range(1,n):
if l[i]<min(x) or l[i]>max(x):
count+=1
x.append(l[i])
print(count)
| 7 | PYTHON3 |
maxi, mini, current, answer = -1, 10000, 0, 0
SCount = int(input())
a = list(map(int, input().split()))
for x in range(0,SCount):
if x == 0:
maxi = a[x]
mini = a[x]
elif x != 0:
if maxi < a[x]:
maxi = a[x]
answer += 1
if mini > a[x]:
mini = a[x]
answer += 1
print(answer)
| 7 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
c = 0
mx_in = p[0]
min_in = p[0]
for i in range(1, n):
if p[i] > mx_in:
mx_in = p[i]
c += 1
elif p[i] < min_in:
min_in = p[i]
c += 1
print(c) | 7 | PYTHON3 |
n=int(input())
a=list(map(int, input().split()))
max=a[0]
min=a[0]
k=0
for i in range (1,n):
if (a[i]>max):
k+=1
max=a[i]
if (a[i]<min):
k+=1
min=a[i]
print(k)
| 7 | PYTHON3 |
n=int(input())
score=[int(x) for x in input().split()]
ans=0
for i in range(1,n):
a,b=0,0
for j in range(i):
if score[i]>score[j]:
a+=1
elif score[i]<score[j]:
b+=1
if a==i or b==i:
ans+=1
print(ans) | 7 | PYTHON3 |
import sys
import math
n = input()
t = list(input().split())
t = [int(i) for i in t ]
max = t[0]
min = t[0]
cnt = 0
for i in range(1,len(t)):
if t[i]>max:
max = t[i]
cnt+=1
elif t[i]<min:
min = t[i]
cnt+=1
print(cnt) | 7 | PYTHON3 |
n = int(input())
L = []
L = input().split()
A = int(L[0])
B, C = A, A
P = 0
for i in range(1,n):
v = int(L[i])
if v<B:
B = v
P+=1
elif v>C:
C = v
P+=1
print(P)
| 7 | PYTHON3 |
n = int(input())
i = [int(x) for x in input().split()]
count,mx,mn = 0,i[0],i[0]
for j in range(1,len(i)):
if i[j] > mx:
mx = i[j]
count += 1
if i[j] < mn:
mn = i[j]
count += 1
# if i[j-1] < i[j]:
# count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()[:n]))
s=len(arr)
m=arr[0]
b=arr[0]
count=0
for i in range(s):
if arr[i]>b:
b=arr[i]
count=count+1
elif arr[i]<m:
m=arr[i]
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
Num = list(map(int, input().split( )))
high_score, low_score, amazing_n = (Num[0], Num[0], 0)
for i in Num:
if i > high_score:
amazing_n += 1
high_score = i
elif i < low_score:
amazing_n += 1
low_score = i
else:
pass
print(amazing_n)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, f = 0, k;
cin >> l >> k;
int m = k, n = k;
for (int i = 1; i < l; i++) {
cin >> k;
if (k > m) {
m = k;
f++;
} else if (k < n) {
n = k;
f++;
}
}
cout << f;
}
| 7 | CPP |
contests = int(input())
scores = list(map(int, input().split()))
amazingScores = [scores[i] for i in range(len(scores)) if (scores[i] == max(scores[:i+1:])) or (scores[i] == min(scores[:i+1:]))]
print(len(set(amazingScores)) - 1) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
s = m = l[0]
c = 0
for i in range(1,len(l)):
k = l[i]
if k > s:
c+=1
s = k
elif k < m:
c += 1
m=k
print(c) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
mx = mn = a[0]
ans = 0
for i in range(1, n):
k = a[i]
if k < mn:
mn = k
ans += 1
elif k > mx:
mx = k
ans += 1
print(ans)
| 7 | PYTHON3 |
n= int(input())
ls = list(map(int,input().split()))
_min = ls[0]
_max = ls[0]
amazing = 0
for i in range(1,len(ls)):
if ls[i]>_max:
_max = ls[i]
amazing += 1
elif ls[i]<_min:
_min = ls[i]
amazing += 1
print(amazing)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Tue Nov 5 17:23:26 2019
@author: LV
"""
input()
score = [int(x) for x in input().split()]
total = 0
for i in range(1, len(score)):
if(score[i] > max(score[:i]) or score[i] < min(score[:i])):
total += 1
else:
continue
print(total) | 7 | PYTHON3 |
n=int(input())
s = [int(x) for x in input().split()]
count=0
mini = s[0]
maxi = s[0]
for i in range (0,n-1):
if s[i+1]< mini:
count+=1
mini=s[i+1]
elif s[i+1]>maxi :
count+=1
maxi = s[i+1]
print(count) | 7 | PYTHON3 |
#I_love_%username%
n=int(input())
a=list(map(int,input().split()))
c=0
p=q=a[0]
for i in range(len(a)):
if(p>a[i]):
c+=1
p=a[i]
if(q<a[i]):
c+=1
q=a[i]
print(c)
| 7 | PYTHON3 |
n=int(input())
arr = list(map(int, input().split()))
mn=arr[0]
mx=arr[0]
cnt=0
for i in range(1,n):
if(arr[i]>mx):
mx=arr[i]
cnt+=1
elif(arr[i]<mn):
mn=arr[i]
cnt+=1
print(cnt)
| 7 | PYTHON3 |
n = int(input(""))
l = list(input().split())
l2 = []
for i in l:
l2.append(int(i, 10))
c = 0
for i in range(1, n):
l1 = l2[0 : i]
if(l2[i] < min(l1) or l2[i] > max(l1)):
c = c + 1
print(c)
| 7 | PYTHON3 |
n=int(input())
data=input()
lst=list()
for i in data.split():
lst.append(int(i))
largest=lst[0]
smallest=lst[0]
count=0
for j in lst:
if j>largest:
largest=j
count=count+1
elif j<smallest:
smallest=j
count=count+1
print(count)
| 7 | PYTHON3 |
n = int(input())
points = [int(num) for num in input().split()]
mayor = points[0]
menor = points[0]
i = 1
count = 0
while (i < n):
if (points[i] > mayor):
mayor = points[i]
count += 1
elif (points[i] < menor):
menor = points[i]
count += 1
i+= 1
print(count) | 7 | PYTHON3 |
n = int(input())
x = list(map(int, input().split()))
num = 0
for i in range(1, n):
if x[i] > max(x[:i]) or x[i] < min(x[:i]):
num += 1
print(num)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
count = 0
maxel = arr[0]
minel = maxel
for i in range(1, len(arr)):
if arr[i] > maxel :
maxel = arr[i]
count += 1
if arr[i] < minel:
count += 1
minel = arr[i]
print(count)
| 7 | PYTHON3 |
n=int(input())
a=[0,]*n
a=[int(i) for i in input().split()]
ma=a[0]
mi=a[0]
s=0
for i in range(1,n):
if a[i]>ma:
s+=1
ma=a[i]
elif a[i]<mi:
s+=1
mi=a[i]
print(s)
| 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
maxim = a[0]
minim = a[0]
ctr = 0
for i in range(1,n):
if a[i] > maxim:
maxim = a[i]
ctr += 1
elif a[i] < minim:
minim = a[i]
ctr += 1
print (ctr) | 7 | PYTHON3 |
n = int(input())
point = list(map(int, input().split()))
minimum = point[0]
maximum = point[0]
ans = 0
for i in range(1, n):
if(point[i] < minimum or point[i] > maximum):
ans += 1
minimum = min(minimum, point[i])
maximum = max(maximum, point[i])
print(ans) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(1,n):
if a[i]<min(a[:i]) or a[i]>max(a[:i]):
c+=1
print(c) | 7 | PYTHON3 |
t = int(input())
l = list(map(int,input().split()))
r = []
s = 0
mina = 999999
maxa = -999999
for i in range(len(l)):
if i == 0:
maxa= l[0]
mina = l[0]
continue
if l[i] > maxa:
s+=1
maxa = l[i]
if l[i] < mina:
s+=1
mina = l[i]
pass
print(s) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=l[0]
s=l[0]
c=0
for i in l:
if(i>m):
m=i
c+=1
elif(i<s):
s=i
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
scores=[int(x)for x in input().split()]
ans=0
a=scores[0]
b=scores[0]
for score in scores:
if score>a:
ans+=1
a=score
elif score<b:
ans+=1
b=score
print(ans)
| 7 | PYTHON3 |
n = int(input())
a = [int(_) for _ in input().split()]
cnt = 0
mn = mx = a[0]
for x in a[1:]:
if mn != min(mn, x):
cnt += 1
if mx != max(mx, x):
cnt += 1
mn = min(mn, x); mx = max(mx, x)
print(cnt)
| 7 | PYTHON3 |
t = int(input())
a = list(map(int, input().split()))
b = [a[0]]
b_max = a[0]
b_min = a[0]
c = 0
for i in range(1, t):
if a[i] > b_max or a[i] < b_min:
c += 1
b.append(a[i])
b_max = max(b)
b_min = min(b)
print(c)
| 7 | PYTHON3 |
n=int(input())
line=[int(i) for i in input().split()]
ama=0
Max,Min=line[0],line[0]
for i in range(1,n):
if line[i]>Max:
Max=line[i]
ama+=1
elif line[i]<Min:
Min=line[i]
ama+=1
print(ama)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
count=0
mini=l[0]
maxi=l[0]
for i in range(1,len(l)):
if l[i]<mini:
count+=1
mini=l[i]
elif l[i]>maxi:
count+=1
maxi=l[i]
print(count) | 7 | PYTHON3 |
input()
x = input().split()
for i in range(len(x)):
x[i] = int(x[i])
maks = x[0]
mins = x[0]
counter = 0
for i in range(1,len(x)):
if not (mins<= x[i] <= maks):
counter +=1
if x[i] < mins:
mins = x[i]
else:
maks = x[i]
print(counter)
| 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
c = 0
for i in range(1,n):
less = True
more = True
for j in range(0,i):
if a[i]>=a[j]:
more = False
if a[i]<=a[j]:
less = False
if more or less:
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().strip().split()))
l = 0
for i in range(1, len(arr)):
max_i = max(arr[:i])
min_i = min(arr[:i])
if arr[i] > max_i or arr[i] < min_i:
l += 1
print(l) | 7 | PYTHON3 |
ns=int(input())
scores = list(map(int,input().split(" ")))
smallest = largest = scores[0]
amazing = 0
for score in scores[1:]:
if(score < smallest):
smallest = score
amazing+=1
if(score > largest):
largest = score
amazing+=1
print(amazing)
| 7 | PYTHON3 |
n=input()
s=list(map(int,input().split()))
m1=0
m2=100000
r=0
for i in range(int(n)):
if i==0:
m1=s[i]
m2=s[i]
else:
if s[i]>m1:
r+=1
m1=s[i]
else:
if s[i]<m2:
r+=1
m2=s[i]
print(r) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
min = a[0]
max = a[0]
count = 0
for i in range(n):
if a[i]>max:
max = a[i]
count+=1
if a[i]<min:
min =a[i]
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
m=a[0]
l=a[0]
f=0
for i in range(1,n):
if a[i]>m :
f+=1
m=a[i]
if a[i]<l:
f+=1
l=a[i]
print(f) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
tot = 0
mn = mx = l[0]
for i in l[1:]:
if i < mn:
tot += 1
mn = i
elif i > mx:
tot += 1
mx = i
print(tot)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
k = 0
minx, maxx = l[0], l[0]
for i in range(2, n + 1):
x = l[:i]
## print(x)
if min(x) == x[-1]:
if x.count(min(x)) > 1:
continue
else:
k += 1
elif max(x) == x[-1]:
if x.count(max(x)) > 1:
continue
else:
k += 1
print(k)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
m1=a[0]
m2=a[0]
c=0
for i in range(1,n):
if a[i]>m1:
m1=a[i]
c+=1
elif a[i]<m2:
m2=a[i]
c+=1
print(c)
| 7 | PYTHON3 |
n = int(input())
res = [int(x) for x in input().split()]
max = res[0]
min = res[0]
counter = 0
for i in range(1, n):
if res[i] > max:
max = res[i]
counter += 1
elif res[i] < min:
min = res[i]
counter += 1
print(counter) | 7 | PYTHON3 |
n=int(input())
a=input()
s=[int(i) for i in a.split()]
min1=s[0]
max1=s[0]
c=0
for i in range(1,n):
if s[i]>max1:
c+=1
max1=s[i]
if s[i]<min1:
c+=1
min1=s[i]
print(c)
| 7 | PYTHON3 |
t=int(input())
l1=list(map(int, input().split()))
maxi=l1[0]
mini=l1[0]
c=0
d=0
for i in range(len(l1)):
if(l1[i]>maxi):
maxi=l1[i]
c+=1
elif(l1[i]<mini):
mini=l1[i]
d+=1
print(c+d)
| 7 | PYTHON3 |
n=int(input())
out=0
lista=list(map(int,input().split()))
maxv=lista[0]
minv=lista[0]
for j in range(0,n-1):
if(lista[j+1]>lista[j]):
if(lista[j+1]>maxv):
maxv=lista[j+1]
out+=1
elif(lista[j+1]<lista[j]):
if(lista[j+1]<minv):
minv=lista[j+1]
out+=1
print(out)
| 7 | PYTHON3 |
n=int(input())
lst=input().split()
for i in range(n):
lst[i]=int(lst[i])
count=0
for j in range(1,n):
if (lst[j]>max(lst[0:j]))or (lst[j]<min(lst[0:j])):
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
cur_max = a[0]
cur_min = a[0]
s = 0
for j in range(1,n):
if a[j] > cur_max:
s += 1
cur_max = a[j]
if a[j] < cur_min:
s += 1
cur_min = a[j]
print(s) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
j=0
for i in range(1,n):
x=max(a[0:i])
y=min(a[0:i])
if a[i]>x or a[i]<y:
j+=1
print(j) | 7 | PYTHON3 |
n=int(input())
inp=input().split()
mx=int(inp[0])
mn=int(inp[0])
az=0
for i in range(n):
if int(inp[i])>mx:
mx=int(inp[i])
az+=1
if int(inp[i])<mn:
mn=int(inp[i])
az+=1
print (az)
| 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
ch=0
s1=[]
for i in range(n-1):
s1.append(int(s[i]))
if int(s[i+1])>max(s1) or int(s[i+1])<min(s1):
ch+=1
print(ch) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
lar = a[0]
sma = a[0]
c = 0
for i in range(len(a)-1):
if( lar > a[i+1]):
lar = a[i+1]
c += 1
if(sma < a[i+1]):
sma = a[i+1]
c += 1
print(c)
| 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
worst=s[0]
best=s[0]
w=0
b=0
for i in range(1,len(s)):
if s[i]>best:
best=s[i]
b+=1
if s[i]<worst:
worst=s[i]
w+=1
print (w+b)
| 7 | PYTHON3 |
from collections import Counter
import string
import math
import sys
def array_int():
return [int(i) for i in sys.stdin.readline().split()]
def vary(number_of_variables):
if number_of_variables==1:
return int(sys.stdin.readline())
if number_of_variables>=2:
return map(int,sys.stdin.readline().split())
def makedict(var):
return dict(Counter(var))
mod=100000007
n=vary(1)
num=array_int()
count=0
for i in range(1,n):
k=0
for j in range(i):
if num[j]<num[i] and (k==0 or k==1):
k=1
continue
if num[j]>num[i] and (k==0 or k==2):
k=2
continue
else:
break
else:
count+=1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int compartments;
int main(void) {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int counter = 0;
for (int i = 1; i < n; i++) {
int MIN = 10001, MAX = 0;
for (int j = 0; j < i; j++) {
MIN = min(MIN, arr[j]);
MAX = max(MAX, arr[j]);
}
if (MAX < arr[i] || MIN > arr[i]) {
counter++;
}
}
cout << endl;
cout << counter;
}
| 7 | CPP |
n = int(input())
scores = list(map(int, input().split()))
mx = scores[0]
mn = scores[0]
c = 0
for i in range(1, n):
if scores[i] > mx:
mx = scores[i]
c += 1
elif scores[i] < mn:
mn = scores[i]
c += 1
print(c) | 7 | PYTHON3 |
#155A I Love UserName
a=input()
b=list(map(int,input().split()))
counter=1
if len(b)==1:
print(0)
elif len(b)==2:
if b[0]==b[1]:
print(0)
else:
print(1)
else:
if b[0]==b[1]:
counter=0
minimum=min(b[0],b[1])
maximum=max(b[0],b[1])
for i in range(2,len(b)):
if b[i]<minimum:
minimum=b[i]
counter+=1
if b[i]>maximum:
maximum=b[i]
counter+=1
print(counter)
| 7 | PYTHON3 |
n = int(input())
ar = list(map(int,input().split()))
ma = ar[0]
mi = ar[0]
ans = 0
for i in ar:
if ma < i:
ans += 1
ma = i
if mi > i:
ans += 1
mi = i
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main(void) {
int n, max, min, i, amazing, score;
scanf("%d", &n);
scanf("%d", &max);
min = max;
for (amazing = 0, i = 1; i < n; i++) {
scanf("%d", &score);
if (max < score) {
amazing++;
max = score;
} else if (min > score) {
amazing++;
min = score;
}
}
printf("%d", amazing);
return 0;
}
| 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.