solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
int main() {
int n, j, i, t = 0, s, min, max;
scanf("%d", &n);
if (n == 0) {
printf("0");
return 0;
}
int a[n];
scanf("%d", &a[0]);
if (n == 0 || n == 1) {
printf("0");
return 0;
}
scanf("%d", &a[1]);
if (a[1] > a[0]) {
max = a[1];
min = a[0];
s = 1;
} else if (a[0] > a[1]) {
min = a[1];
max = a[0];
s = 1;
} else if (a[0] == a[1]) {
s = 0;
max = a[1];
min = a[1];
}
for (i = 2; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] <= max && a[i] >= min) {
s = s;
continue;
} else if (a[i] > max) {
max = a[i];
s = s + 1;
} else if (a[i] < min) {
min = a[i];
s = s + 1;
}
}
printf("%d", s);
return 0;
}
| 7 | CPP |
def amazing_performance():
input()
scores = [int(elem) for elem in input().split(" ")]
result = 0
minn = maxx = scores[0]
for elem in scores[1:]:
if elem < minn:
result += 1
minn = elem
elif elem > maxx:
result += 1
maxx = elem
return result
print(amazing_performance()) | 7 | PYTHON3 |
n=int(input())
L=input().split()
L=[int(i) for i in L]
mini=maxi=L[0]
count=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 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0, n, min = INT_MAX, max = INT_MIN;
cin >> n;
while (n--) {
int a;
cin >> a;
if (a > max) {
max = a;
c++;
}
if (a < min) {
min = a;
c++;
}
}
cout << c - 2;
}
| 7 | CPP |
n=int(input())
line=[int(i) for i in input().split()]
maxi=line[0]
mini=line[0]
amaz=0
for i in range(1,n):
if line[i]>maxi:
maxi=line[i]
amaz+=1
if line[i]<mini:
mini=line[i]
amaz+=1
print(amaz) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int,input().split()))
total = 0
best = arr[0]
worse = arr[0]
for x in arr:
if x > best:
best = x
total += 1
elif x < worse:
worse = x
total += 1
print(total) | 7 | PYTHON3 |
n=input()
x=map(int,input().split())
l=[]
for i in x:
l.append(i)
counter=0
low=l[0]
top=l[0]
for i in range(1,len(l)):
if (l[i]>l[i-1])and l[i]>top:
counter+=1
top=l[i]
elif (l[i]<l[i-1]) and (l[i]<low):
low=l[i]
counter+=1
print(counter)
| 7 | PYTHON3 |
n=input()
x=input().split()
a=0
h = x[0]
l = x[0]
for i in range (1,len(x)):
if int(x[i])> int(h):
a+=1
h=x[i]
if int(x[i])< int(l):
a+=1
l = x[i]
print (a) | 7 | PYTHON3 |
n = int(input())
asdf = input().split()
a = []
for bs in asdf:
a.append(int(bs))
s = 0
for i in range(1, n):
if a[i] > max(a[:i]) or a[i] < min(a[:i]):
s += 1
print (s) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
min,max,count=a[0],a[0],0
for i in range(0,n):
k=a[i]
if(k>max):
count+=1
max=k
elif(k<min):
count+=1
min=k
print(count) | 7 | PYTHON3 |
n = int(input())
if n == 1:
print(0)
else:
ct = [int(i)for i in input().split()]
best = ct[0]
worst = ct[0]
num = 0
for i in ct:
if i > best:
best = i
num += 1
if i < worst:
worst = i
num += 1
print(num)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
ansm=arr[0]
ansl=arr[0]
c=0
for i in range(n):
if(arr[i]>ansm):
c+=1
ansm=arr[i]
elif(arr[i]<ansl):
c+=1
ansl=arr[i]
print(c) | 7 | PYTHON3 |
n=int(input())
c=0
p=list(map(int, input().split()))
a=[p[0]]
q=p[1:]
for i in q:
if i>max(a) or i<min(a):
c+=1
else:
continue
a.append(i)
print(c) | 7 | PYTHON3 |
n = int(input())
scores = [int(x) for x in input().split()]
cur_min = scores[0]
cur_max = scores[0]
cnt = 0
for s in scores[1:]:
if cur_min > s:
cnt += 1
cur_min = s
elif cur_max < s:
cnt += 1
cur_max = s
print(cnt)
| 7 | PYTHON3 |
n = int(input())
b = []
c = 0
d = 0
k = 0
a = list(map(int,input().split()))
for i in range(1,len(a)+1):
b = a[0:i]
c = max(b)
d = min(b)
e = b[0:len(b)-1]
if b[len(b)-1] == c and not c in e or b[len(b)-1] == d and not d in e:
k += 1
print(k-1)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
if n==1:
amaz=0
if n>1:
amaz=0
Q=True
for i in range(1,n):
for j in range(0,i):
if a[i]>a[j]:
Q=True
else:
Q=False
break
if Q==True:
amaz+=1
P=True
for i in range(1,n):
for j in range(0,i):
if a[i]<a[j]:
P=True
else:
P=False
break
if P==True:
amaz+=1
print(amaz)
| 7 | PYTHON3 |
import sys
import io
import os
total = 0
failed = 0
def run(test,res):
x = io.StringIO()
with io.StringIO(test) as sys.stdin:
with x as sys.stdout:
work()
z = x.getvalue().strip()
sys.stdout = sys.__stdout__
print("Passed?", z == res)
print("Expected: ", res)
print("Actual : ", z)
global total, failed
total += 1
failed += 1 if (z != res) else 0
def work():
n = input()
a = list(map(int, input().split()))
min = a[0]
max = a[0]
c = 0
for x in a[1:]:
if x<min:
min = x
c += 1
if x>max:
max = x
c += 1
print(c)
def test():
run("""5
100 50 200 150 200""", "2")
run("""10
4664 6496 5814 7010 5762 5736 6944 4850 3698 7242""", "4")
if('LOCALTEST' in os.environ):
test()
print("\n Result: %s (%d total, %d passed)" % ("FAILED" if (failed>0) else "PASSED", total, failed))
else:
work()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void to_upper(string &s) {
for (int i = 0; i < s.size(); i++) s[i] = toupper(s[i]);
}
void to_lower(string &s) {
for (int i = 0; i < s.size(); i++) s[i] = tolower(s[i]);
}
int main() {
int n;
cin >> n;
int x;
cin >> x;
n--;
int minim = x, maxim = x;
int res = 0;
while (n--) {
cin >> x;
if (x < minim) {
minim = x;
res++;
} else if (x > maxim) {
maxim = x;
res++;
}
}
cout << res << "\n";
}
| 7 | CPP |
_ = int(input())
r = [int(x) for x in input().split()]
_max = r[0]
_min = r[0]
n = 0
for i in range(1, len(r)):
res = r[i]
if res > _max:
n += 1
_max = res
elif res < _min:
n += 1
_min = res
print(n) | 7 | PYTHON3 |
n,r=int(input()),list(map(int,input().split()))
b,w,t=r[0],r[0],0
for x in r[1:]:
if x > b:
b=x
t+=1
elif x < w:
w=x
t+=1
print(t) | 7 | PYTHON3 |
a=input()
lst = input().split()
max = int(lst[0])
min = int(lst[0])
count = 0
for i in lst:
i=int(i)
if i > max:
max = i
count+=1
if i < min:
min = i
count+=1
print(count)
| 7 | PYTHON3 |
n=input()
l=list(map(int,input().split()))
t=0
for i in range(len(l)):
if i>0 and (l[i]>max(l[:i]) or l[i]<min(l[:i])):
t+=1
print(t)
| 7 | PYTHON3 |
i = int
y = input
n = i(y())
ar = [i(x) for x in y().split(' ')]
a = 0
m = [ar[0]]*2
for j in range(1,n):
if (ar[j]<m[0]):
a+=1
m[0]=ar[j]
elif (ar[j]>m[1]):
a+=1
m[1]=ar[j]
print(a)
| 7 | PYTHON3 |
n = int(input(''))
m = [int(i) for i in input('').split(' ')[:n]]
mx = m[0]
mn = m[0]
cnt = 0
for i in range(0,len(m)):
if m[i] > mx:
cnt += 1
mx = m[i]
elif m[i] < mn:
cnt += 1
mn = m[i]
print(cnt)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef vector<pair<int, int> > vii;
int n, x, maks, mins, jml;
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
cin >> x;
maks = x;
mins = x;
for (int i = 1; i < n; i++) {
cin >> x;
if (x > maks) {
maks = x;
jml++;
}
if (x < mins) {
mins = x;
jml++;
}
}
cout << jml;
return 0;
}
| 7 | CPP |
n = int(input())
s = list(map(int,input().split()))
max_s = s[0]
min_s = s[0]
c = 0
for i in range(n):
if s[i] < min_s:
min_s = s[i]
c+=1
elif s[i] > max_s:
max_s = s[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
pieces=input().split()
P=[]
for i in pieces:
P.append(int(i))
ama=0
for i in range(1,len(P)):
big=0
small=0
for j in range(i):
if P[j]>P[i]:
big += 1
elif P[j]<P[i]:
small += 1
if big==i or small==i:
ama += 1
print(ama) | 7 | PYTHON3 |
n=int(input())
points=[int(i) for i in input().split()]
sum1=0
for i in range(1,n):
if points[i]<min(points[:i]) or points[i]>max(points[:i]):
sum1+=1
print(sum1)
| 7 | PYTHON3 |
t = int(input())
arr = [int(x) for x in input().split()]
M = arr[0]
m = arr[0]
count = 0
for i in range(1,t):
if arr[i]>M:
count += 1
M = arr[i]
elif arr[i]<m:
count += 1
m = arr[i]
print(count)
| 7 | PYTHON3 |
n= int(input())
pnts=list(map(int,input().split()))
com=list()
ama=0
com.append(pnts[0])
for i in range(1,n):
if pnts[i]>max(com) or pnts[i]<min(com) :
ama+=1
com.append(pnts[i])
print(ama)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
k=0
for i in range(1,len(a)):
if a[i]<min(a[:i]) or a[i]>max(a[:i]):
k+=1
print(k) | 7 | PYTHON3 |
m=int(input())
x=[int(x) for x in input().split()]
if(m==1):
print(0)
else:
maximum=x[0]
minimum=x[0]
count=0
for i in x:
if(i<minimum):
count=count+1
minimum=i
if(i>maximum):
count=count+1
maximum=i
print(count)
| 7 | PYTHON3 |
n = int(input())
b = []
z = 0
a = list(map(int, input().split()))
for i in range(n):
b.append(a[i])
if i > 0:
if a[i] < min(a[:i]):
z = z + 1
elif a[i] > max(a[:i]):
z = z + 1
print(z) | 7 | PYTHON3 |
# i=input
# i()
# m,*s=map(int,i().split())
# n=m
# x=0
# for c in s:
# if c>m:
# x+=1
# m=c
# if c<n:
# x+=1
# n=c
# print(x)
n = int(input())
s = list(map(int,input().split()))[:n]
c = 0
x = s[0]
x2 = s[0]
for i in range(1,n+1):
if (s[i-1]>x):
c+=1
x = s[i-1]
if (s[i - 1] < x2):
c += 1
x2 = s[i - 1]
print(c)
| 7 | PYTHON3 |
n = int(input())
vals = list(map(int, input().split()))
count = 0
mi = ma = vals[0]
for v in vals[1:]:
if v < mi:
mi = v
count += 1
if v > ma:
ma = v
count += 1
print(count)
| 7 | PYTHON3 |
n = int(input())
string = [int(i) for i in input().split()]
maximum = string[0]
minimum = string[0]
counter = 0
for i in string:
if i > maximum:
maximum = i
counter += 1
elif i < minimum:
minimum = i
counter += 1
print(counter)
| 7 | PYTHON3 |
if __name__ == "__main__":
ariel = int(input())
arriel = input().split(" ")
contAriel = 0
arriel = list(map(int, arriel))
for i in range(1, len(arriel)):
contArielMenor = 0
contArielMayor = 0
for j in range(i):
if arriel[i] >= arriel[j]:
contArielMenor = 1
if arriel[i] <= arriel[j]:
contArielMayor = 1
if not contArielMayor:
contAriel += 1
if not contArielMenor:
contAriel += 1
print(contAriel) | 7 | PYTHON3 |
n=int(input())
li=list(map(int,input().split()))
min_=li[0]
max_=li[0]
count=0
for i in range(1, len(li)):
if li[i]>max_:
max_=li[i]
count+=1
elif li[i]<min_:
min_=li[i]
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
points = [int(x) for x in input().split()]
min_points = points[0]
max_points = points[0]
counter = 0
for result in range(1, len(points)):
if points[result] < min_points:
counter += 1
min_points = points[result]
if points[result] > max_points:
counter += 1
max_points = points[result]
print(counter)
| 7 | PYTHON3 |
n = int(input())
scores = list(map(int, input().split()))
min = scores[0]
max = scores[0]
a = 0
for i in range(1,len(scores)):
if scores[i] < min:
a += 1
min = scores[i]
if scores[i] > max:
a += 1
max = scores[i]
print(a)
| 7 | PYTHON3 |
n=int(input());
x=[int(x) for x in input().split()];
y=[x[0]];
result=0;
for i in range(1,n):
if x[i]>max(y) or x[i]<min(y):
result+=1;
y.append(i);
y[i]=x[i];
print(result); | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m1=l[0]
m2=l[0]
c=0
for i in range(n):
if l[i]<m2:
m2=l[i]
c=c+1
elif l[i]>m1:
m1=l[i]
c=c+1
else:
continue
print(c)
| 7 | PYTHON3 |
t=1
#t= int(input())
def solve(score,n):
ls = [score[0]]
k=0
for i in range(1,n):
if (score[i]>max(ls)) or (score[i]<min(ls)):
k+=1
#print(score[i])
ls.append(score[i])
print(k)
while t:
n = int(input())
score = list(map(int, input().split()))
solve(score,n)
t-=1 | 7 | PYTHON3 |
n = int(input())
m = list(map(int, input().split()))
max, min, c = m[0], m[0], 0
for i in range(n):
if m[i] > max:
max = m[i]
c += 1
if m[i] < min:
min = m[i]
c += 1
print(c)
| 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split(' ')]
minn = a[0]
maxx = a[0]
total = 0
for i in range(1, n):
if a[i] < minn:
minn = a[i]
total += 1
if a[i] > maxx:
maxx = a[i]
total += 1
print(total)
| 7 | PYTHON3 |
#from collections import *
#from math import *
#from operator import *
I=lambda:map(int,input().split())
def main():
n=int(input())
a=list(I())
ans=0
cmx,cmin=a[0],a[0]
for i in range(1,n):
if a[i]>cmx:
ans+=1
cmx=a[i]
if a[i]<cmin:
ans+=1
cmin=a[i]
print(ans)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
int Min, Max, ans = 0;
cin >> n;
int arr[n];
cin >> arr[0];
Max = Min = arr[0];
for (i = 1; i < n; i += 1) {
cin >> arr[i];
if (arr[i] > Max) {
Max = arr[i];
ans += 1;
}
if (arr[i] < Min) {
Min = arr[i];
ans += 1;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
n= int(input())
m=[int(i) for i in input().split()]
k=0
l=m[0]
lock=True
for j in range(1,n):
if l > m[j]:
for y in range(0,j):
if m[j] >= m[y]:
lock =False
if lock:
k+=1
if l < m[j]:
for y in range(0,j):
if m[j] <= m[y]:
lock =False
if lock:
k+=1
lock=True
l=m[j]
print(k) | 7 | PYTHON3 |
n=int(input())
l=input().split(" ")
for i in range(n):
l[i]=int(l[i])
m,M,t=l[0],l[0],0
for i in range(n):
if l[i]<m:
m=l[i]
t+=1
elif l[i]>M:
M=l[i]
t+=1
print(t) | 7 | PYTHON3 |
n = int(input())
mas = list(map(int, input().split()))
s = 0
mx, mn = mas[0], mas[0]
for i in range(1, n):
if mas[i] > mx:
mx = mas[i]
s += 1
if mas[i] < mn:
mn = mas[i]
s += 1
print(s) | 7 | PYTHON3 |
_ = int(input())
test = list(map(int, input().split()))
bala = test[0]
paein = test[0]
ant = 0
for i in test[1:]:
if i > bala:
bala = i
ant += 1
elif i < paein:
paein = i
ant += 1
print(ant)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
ctr=0
max=min=arr[0]
for i in range(1,n):
if arr[i]>max:
ctr+=1
max=arr[i]
elif arr[i]<min:
ctr+=1
min=arr[i]
print(ctr) | 7 | PYTHON3 |
n=int(input())
c=0
a=list(map(int,input().split()))
maximum=a[0]
minimum=a[0]
for i in range(n):
if a[i]>maximum:
c=c+1
maximum=a[i]
# print(c)
elif a[i]<minimum:
c=c+1
minimum=a[i]
# print(c)
print(c)
| 7 | PYTHON3 |
n=int(input())
amazing=0
a=list(map(int,input().split()))
small=large=a[0]
for i in a[1:]:
if i<small:
small=i
amazing+=1
if i>large:
large=i
amazing+=1
print(amazing) | 7 | PYTHON3 |
n = int(input())
results = [int(elem) for elem in input().split()]
min_r, max_r, counter = results[0], results[0], 0
for i in range(1, n):
key = False
if results[i] > max_r:
max_r = results[i]
key = True
if results[i] < min_r:
min_r = results[i]
key = True
if key:
counter+=1
print(counter) | 7 | PYTHON3 |
useless = input()
data = [int(x) for x in input().split()]
top, bot, a = data[0], data[0], 0
for score in data:
if score > top:
a += 1
top = score
elif score < bot:
a += 1
bot = score
print(a)
| 7 | PYTHON3 |
n = int(input())
li = input().split(' ')
li = list(map(int, li))
res = 0
j = 1
for i in li[1:]:
if i > max(li[:j]) or i < min(li[:j]):
res += 1
j += 1
print(res) | 7 | PYTHON3 |
a=[]
b=[]
while True:
try:
a.append(input())
except:
break
n=int(a[0])
b=a[1].split(' ')
min=int(b[0])
max=int(b[0])
m=0
x=0
for i in range(len(b)):
if int(b[i])>max:
m+=1
max=int(b[i])
if int(b[i])<min:
x+=1
min=int(b[i])
print(m+x) | 7 | PYTHON3 |
x = int(input())
y = [int(i) for i in input().split(" ")]
lyst = [y[0]]
counter = 0
for i in y[1:]:
if i < min(lyst) or max(lyst) < i:
counter += 1
lyst.append(i)
print(counter)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int n, x, cnt, mn, mx;
int main() {
cin >> n;
cin >> x;
if (n == 1) {
cout << 0 << endl;
return 0;
}
mn = mx = x;
for (int i = 1; i < n; i++) {
cin >> x;
if (x < mn || x > mx) {
cnt++;
mn = min(mn, x);
mx = max(mx, x);
}
}
cout << cnt << endl;
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
maxi=mini=l[0]
count=0
for i in l:
if i>maxi:
count+=1
maxi=i
if i<mini:
count+=1
mini=i
print(count)
| 7 | PYTHON3 |
cnt=0
n=int(input())
s=list(map(int,input().split()))
mi,ma=s[0],s[0]
for i in range (n) :
if s[i]>ma:
cnt+=1
ma=s[i]
elif s[i]<mi:
cnt+=1
mi=s[i]
print(cnt)
| 7 | PYTHON3 |
def max(t):
max=t[0]
for i in range(1,len(t)):
if t[i]>max:
max=t[i]
return max
def min(t):
min=t[0]
for i in range(1,len(t)):
if t[i]<min:
min=t[i]
return min
n=int(input())
st=list(map(int,input().split()))
nb=0
for i in range(1,len(st)):
m=max(st[0:i])
n=min(st[0:i])
if st[i]>m:
nb+=1
elif st[i]<n:
nb+=1
print(nb)
| 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]>max:
max=l[i]
count=count+1
if l[i]<min:
min=l[i]
count=count+1
print(count)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
#print(l)
#list for storing amazing numbers
t = []
for i in range(1,len(l)):
c1 = c2 = 0
#c1 is for minimum c2 is for maximum
for j in range(0,i):
if l[j] > l[i]:
c1 += 1
if l[j] < l[i]:
c2 += 1
if c1 == i:
t.append(l[i])
elif c2 == i:
t.append(l[i])
print(len(t))
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
mx=l[0]
mn=l[0]
for i in range(len(l)-1):
if l[i+1]>mx:
mx=l[i+1] #4664 6496 5814 7010 5762 5736 6944 4850 3698 7242
c=c+1
if l[i+1]<mn:
mn=l[i+1]
c=c+1
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; ++i) cin >> arr[i];
int maxi = arr[0], mini = arr[0];
int count = 0;
for (int i = 1; i < n; ++i) {
if (arr[i] > maxi) {
maxi = arr[i];
count++;
} else if (arr[i] < mini) {
mini = arr[i];
count++;
}
}
cout << count;
}
| 7 | CPP |
n = int(input())
s = tuple(map(int, input().split()))
min = s[0]
max = s[0]
ans = 0
for a in s:
if a < min:
min = a
ans = ans + 1
elif a > max:
max = a
ans = ans + 1
print(ans) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split(" ")))
ma=l[0]
mi=l[0]
cnt=0
for i in range(1,len(l)):
if l[i]>ma:
cnt+=1
ma=l[i]
elif l[i]<mi:
cnt+=1
mi=l[i]
print(cnt)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
mx = mn = a[0]
ans = 0
for i in range(1,n):
if a[i]>mx:
mx=a[i]
ans+=1
if a[i]<mn:
mn=a[i]
ans+=1
print(ans) | 7 | PYTHON3 |
a = int(input())
b = [int(i) for i in input().split()]
min = b[0]
max = b[0]
nice = 0
for i in range(a-1):
if b[i+1] > max:
max = b[i+1]
nice+=1
elif b[i+1] < min:
min = b[i+1]
nice+=1
print(nice) | 7 | PYTHON3 |
contestNum = input()
performance = [int(x) for x in input().split(' ')]
maxNum = performance[0]
minNum = performance[0]
amazing = 0
for x in performance:
if x > maxNum:
maxNum = x
amazing += 1
elif x < minNum:
minNum = x
amazing += 1
print(amazing) | 7 | PYTHON3 |
import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
p = -10 ** 10
m = 10 ** 10
ans = -2
for val in a:
if val < m:
ans += 1
m = val
if val > p:
ans += 1
p = val
print(max(ans, 0))
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
worst=l[0]
best=l[0]
count=0
for i in l:
if worst>i:
count+=1
worst=i
if best<i:
count+=1
best=i
print(count) | 7 | PYTHON3 |
if __name__== "__main__":
T=int(input())
lst=input()
lst=lst.split(" ")
maxm=int(lst[0])
minm=int(lst[0])
ans=0
for i in lst:
i=int(i)
if maxm<i:
ans=ans+1
maxm=i
if minm>i:
ans=ans+1
minm=i
print(ans) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
c=0
maxx,minn=a[0],a[0]
for i in range (0,n):
if(a[i]>maxx):
maxx=a[i]
c=c+1
if(a[i]<minn):
minn=a[i]
c=c+1
print(c)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
min = l[0]
count = 0
max = l[0]
for i in l:
if i > max:
max = i
count = count + 1
elif i<min:
min = i
count = count + 1
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=l[0]
M=l[0]
ans=0
for i in range(n):
if l[i]<m:
m=l[i]
ans+=1
elif l[i]>M:
M=l[i]
ans+=1
print(ans) | 7 | PYTHON3 |
n = int(input())
scores = list(map(int, input().split()))
currMax = currMin = scores[0]
amazing = 0
for i in scores:
if i > currMax:
amazing += 1
currMax = i
if i < currMin:
amazing += 1
currMin = i
print (amazing) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
if n==1:
print(0)
else:
max=l[0]
min=l[0]
c=0
for i in range(1,n):
if l[i]<min:
c+=1
min=l[i]
if l[i]>max:
c+=1
max=l[i]
print(c) | 7 | PYTHON3 |
n = int(input())
m = list(map(int, input().split()))
a = m[0]
b = m[0]
s = 0
for i in range(1, len(m)):
if(m[i] > a):
s+=1
a = m[i]
if(m[i] < b):
s+=1
b = m[i]
print(s)
| 7 | PYTHON3 |
n = int(input())
lis = list(map(int,input().split()))
count = 0
for i in range(1,n):
j = i - 1
while lis[i] > lis[j] and j >= 0:
j -= 1
if j == -1:
count += 1
continue
j = i - 1
while lis[i] < lis[j] and j >= 0:
j -= 1
if j == -1:
count += 1
continue
print(count) | 7 | PYTHON3 |
n=int(input())
a=[int(w) for w in input().split()]
b=[a[0]]
Ans=0
for i in range(len(a)):
if a[i]>max(b) or a[i]<min(b): Ans+=1
b.append(a[i])
print(Ans) | 7 | PYTHON3 |
n = int(input())
point = [int(x) for x in input().split()]
count =0
if n == 1:
count =0
else:
a0 = point[0]
a1 = point[1]
amax = max(a0, a1)
amin = min(a0, a1)
if a0 == a1:
count =0
else:
count =1
for i in range(2, n):
if point[i] > amax:
count += 1
amax = point[i]
elif point[i]< amin:
count +=1
amin = point[i]
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
q=[l[0]]
num=0
for i in range(1,n):
if min(q)<=l[i]<=max(q):
q.append(l[i])
else:
num+=1
q.append(l[i])
print(num)
| 7 | PYTHON3 |
import math
n = int(input())
a = list(map(int,input().split()))
maxN = a[0]
res = 0
minN = a[0]
for i in range(1,len(a)):
if (a[i] > maxN or a[i] < minN):
res += 1
maxN = max(maxN, a[i])
minN = min(minN, a[i])
print(res) | 7 | PYTHON3 |
n = int(input())
pts = list(map(int, input().split()))
min_pts = pts[0]
max_pts = pts[0]
count = 0
for p in pts[1:]:
if min_pts > p:
min_pts = p
count += 1
if max_pts < p:
max_pts = p
count += 1
print(count)
| 7 | PYTHON3 |
import re
n=int(input())
r=input()
s=re.split(r'\s+',r)
for i in range(n):
s[i]=int(s[i])
mi=s[0]
ma=s[0]
a=0
for i in range(n):
if s[i]<mi:
mi=s[i]
a+=1
elif s[i]>ma:
ma=s[i]
a+=1
print(a)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
sum = 0
for i in range(1, n):
if max(a[:i]) < a[i] or min(a[:i]) > a[i]:
sum += 1
print(sum) | 7 | PYTHON3 |
total = int(input())
points = [x for x in map(int,input().split())]
high = points[0]
low = points[0]
amazing = 0
for i in points:
if i < low:
amazing += 1
low = i
elif i > high:
amazing += 1
high = i
print(amazing)
| 7 | PYTHON3 |
contests =int(input())
scores = input().split()
low = int(scores[0])
high = int(scores[0])
amazing = 0
for score in scores:
if int(score) > high:
high=int(score)
amazing+=1
if int(score)<low:
low = int(score)
amazing+=1
print(amazing) | 7 | PYTHON3 |
def scores():
global n, s
n = int(input())
s = list(map(int, input().split(" ")))
small = large = s[0]
cA = 0
for i in s[1:]:
if (i < small):
small = i
cA += 1
if (i > large):
large = i
cA += 1
return cA
print(scores()) | 7 | PYTHON3 |
'''input
10
4664 6496 5814 7010 5762 5736 6944 4850 3698 7242
'''
n = int(input())
s = list(map(int, input().split()))
c = 0
for x in range(1,n):
if s[x] > max(s[:x]):
c += 1
elif s[x] < min(s[:x]):
c += 1
print(c) | 7 | PYTHON3 |
if 1:
n=int(input())
a=list(map(int,input().split()))
minv,maxv,mincount,maxcount=a[0],a[0],0,0
for elem in a:
if elem<minv:
minv=min(elem,minv)
mincount+=1
elif elem>maxv:
maxv=max(maxv,elem)
maxcount+=1
print(mincount+maxcount)
| 7 | PYTHON3 |
n = int(input())
str = input()
ls = [int(u) for u in str.split()]
#ls.sort()
ans = 0
max = ls[0]
min = ls[0]
count = 0
for u in ls:
if u < min:
min = u
count += 1
elif u > max:
max = u
count += 1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> scores;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
scores.push_back(temp);
}
int max = scores[0];
int min = scores[0];
int count = 0;
for (int s : scores) {
if (s > max) {
max = s;
count++;
}
if (s < min) {
min = s;
count++;
}
}
cout << count << "\n";
return 0;
}
| 7 | CPP |
n=int(input())
l=[int(i) for i in input().split()]
count=0
for i in range(1,n):
if l[i]>max(l[:i]) or l[i]<min(l[:i]):
count+=1
print(count)
| 7 | PYTHON3 |
num = int(input())
s = str(input()).split()
minus = int(s[0])
maxis = int(s[0])
a = 0
for i in range(num):
if(int(s[i]) > maxis):
a+=1
maxis = int(s[i])
elif(int(s[i]) < minus):
a+=1
minus = int(s[i])
print(a)
| 7 | PYTHON3 |
a=int(input())
s= list(map(int,(input().split())))
count=0
min=s[0]
max=s[0]
for i in range(1,a):
if(s[i]>max):
count=count+1
max=s[i]
elif(s[i]<min):
count=count+1
min=s[i]
print(count)
| 7 | PYTHON3 |
#!/usr/bin/env python3
from sys import stdin, stdout
import re
def solve():
n = int(stdin.readline().strip())
li = list(map(int,stdin.readline().split()))
ans = 0
lo = li[0]
hi = li[0]
for i in range(1,n):
if li[i]<lo:
lo = li[i]
ans += 1
elif li[i]>hi:
hi = li[i]
ans += 1
print(ans)
LOCAL_TEST = not __debug__
if LOCAL_TEST:
infile = __file__.split('.')[0] + '-test.in'
stdin = open(infile, 'r')
tcs = (int(stdin.readline().strip()) if LOCAL_TEST else 1)
t = 1
while t <= tcs:
solve()
t += 1 | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.