solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
points = list(map(int, input().split()))
Max, Min = points[0], points[0]
res = 0
for x in points:
if x < Min:
Min = x
res += 1
if x > Max:
Max = x
res += 1
print(res) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
max_num = min_num = l[0]
amazing = 0
for i in l[1:]:
if i>max_num:
max_num = i
amazing+=1
if i<min_num:
min_num = i
amazing+=1
print(amazing) | 7 | PYTHON3 |
n = input()
line = input().split()
c = len(line)
if c >1:
big = max(int(line[0]),int(line[1]))
small = min(int(line[0]),int(line[1]))
amazing = 0
for i in range(1,c):
if int(line[i]) > big:
amazing = amazing+1
big = int(line[i])
if int(line[i]) < small:
amazing = amazing+1
small = int(line[i])
if line[0]!=line[1]:
amazing =amazing+1
else:
amazing = 0
print(amazing)
| 7 | PYTHON3 |
def main():
n = int(input())
l = [int(x) for x in input().split()]
l = list(set(l))
counter = 1
r = 0
for i in range(0,len(l) - 1):
if l[i] == l[i+1]:
r += 1
else:
break
if len(l) == 1:
counter -= 1
elif l[r] > l[r+1]:
p = l[r]
q = l[r+1]
elif l[r] < l[r+1]:
p = l[r+1]
q = l[r]
for i in range(1, len(l)):
if l[i] > p:
p = l[i]
counter += 1
elif l[i] < q:
q = l[i]
counter += 1
print(counter)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = [a[0]]
count = 0
for i in range(1,n):
if a[i] > max(b):
count += 1
elif a[i] < min(b):
count += 1
b.append(a[i])
print(count)
| 7 | PYTHON3 |
N = int(input())
scores = [ int(i) for i in input().split() ]
MAX = scores[0]
MIN = scores[0]
amazing = 0
for i in range(1, N):
if scores[i] > MAX:
amazing += 1
MAX = scores[i]
elif scores[i] < MIN:
amazing += 1
MIN = scores[i]
print(amazing) | 7 | PYTHON3 |
c = int(input())
s = 0
coms = input().split(' ')
ma = mi = int(coms[0])
for i in range(c):
cur = int(coms[i])
if cur > ma:
ma = cur
s += 1
else:
if cur < mi:
mi = cur
s += 1
print(s) | 7 | PYTHON3 |
n=int(input())
list=[int(x) for x in input().split()]
min=list[0]
max=list[0]
m=0
for i in range(n):
if list[i]>max:
max=list[i]
m+=1
elif list[i]<min:
min=list[i]
m+=1
else:
m+=0
print(m)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int s[1000];
int main() {
int a, b, c, result;
result = 0;
scanf("%d", &a);
for (int i = 0; i < a; ++i) {
scanf("%d", &s[i]);
}
b = s[0];
c = s[0];
for (int i = 0; i < a; i++) {
if (s[i] > b) {
b = s[i];
result++;
} else if (s[i] < c) {
c = s[i];
result++;
}
}
printf("%d", result);
}
| 7 | CPP |
n=input()
arr=[int(x) for x in input().split()]
c,minx,maxx=0,arr[0],arr[0]
for i in arr:
if i>maxx:
maxx=i
c+=1
elif i<minx:
minx=i
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
maxi =a[0]
mini =a[0]
o = 0
for i in a:
if i > maxi:
o += 1
maxi = i
elif i < mini:
o += 1
mini = i
print(o)
| 7 | PYTHON3 |
n = int(input())
s = input().split(" ")
s = [int(n) for n in s]
maxim = s[0]
minim = s[0]
amazing = 0
for i in range(1, len(s)):
contest = s[i]
if contest > maxim:
amazing += 1
maxim = contest
elif contest < minim:
amazing += 1
minim = contest
print(amazing)
| 7 | PYTHON3 |
n=input()
m=input()
a=m.split()
x=1
b=[]
sum=0
while x<int(n):
b.append(int(a[x-1]))
b.sort()
if int(a[x])<b[0] or int(a[x])>b[x-1]:
sum+=1
else:
pass
x+=1
print(sum) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
for i in range(n-1):
if((l[i+1]>l[i]) and (l[i+1]>max(l[0:i+1]))):
c+=1
if((l[i+1]<l[i]) and (l[i+1]<min(l[0:i+1]))):
c+=1
print(c) | 7 | PYTHON3 |
x = int(input())
e = list(map(int,input().split()))
makc = e[0]
minimum = e[0]
V = 0
for i in e:
if i > makc and i > minimum:
makc = i
V += 1
elif i < minimum and i < makc:
minimum = i
V += 1
print (V) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int K = 0, l = 9999999, h, R = 0;
for (int i = 0; i < n; i++) {
cin >> K;
if (i == 0) {
l = K;
h = K;
}
if (h < K) {
R++;
h = K;
}
if (l > K) {
R++;
l = K;
}
}
cout << R << endl;
return 0;
}
| 7 | CPP |
n = int(input())
s = [int(x) for x in input().split()]
ans = 0
for i in range(1,n):
if s[i] < min(s[:i]) or s[i] > max(s[:i]):
ans += 1
print(ans) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
x=a[:1]
for i in a:
mi = min(x)
ma = max(x)
if mi <= i <= ma:
n-= 1
x += [i]
print(n) | 7 | PYTHON3 |
#!/usr/bin/env python
# coding: utf-8
# In[29]:
n=input()
marks=input().split()
count=0
for i in range(len(marks)):
mark=int(marks[i])
if i==0:
max=mark
min=mark
elif mark>max:
count+=1
max=mark
elif mark<min:
count+=1
min=mark
print(count)
# In[ ]:
| 7 | PYTHON3 |
n = int(input())
l = input().split()
sum = 0
M = m = int(l[0])
for i in range(len(l)-1):
if int(l[i+1])> M:
M = int(l[i+1])
sum += 1
if int(l[i+1])< m:
m = int(l[i+1])
sum += 1
print(sum)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
count=0
for i in range(1,len(arr)):
best=max(arr[:i])
worst=min(arr[:i])
if arr[i]<worst or arr[i]>best:
count=count+1
print(count)
| 7 | PYTHON3 |
__author__ = 'myduomilia'
n = int(input())
arr = list(map(int, input().split()))
minimum = maximum = arr[0]
ans = 0
for i in range(1, len(arr)):
if arr[i] > maximum:
maximum = arr[i]
ans += 1
if arr[i] < minimum:
minimum = arr[i]
ans += 1
print(ans)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
less = arr[0]
more = arr[0]
count = 0
for i in range(1,n):
if arr[i]> more :
more = arr[i]
count+=1
if arr[i]<less:
less =arr[i]
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
l = [int(i) for i in input().split()]
cnt = 0
less = l[0]
more = l[0]
for i in range(1,n):
if l[i] < less:
cnt += 1
less = l[i]
if l[i] > more:
cnt += 1
more = l[i]
print(cnt) | 7 | PYTHON3 |
n = int(input())
ipt = [int(x) for x in input().split()]
min_ = ipt[0]
max_ = ipt[0]
counter = 0
for i, val in enumerate(ipt):
if val > max_:
max_ = val
counter += 1
if val < min_:
min_ = val
counter += 1
print(counter)
| 7 | PYTHON3 |
n= int(input ())
cntr=0
value_list = []
get_values = input()
value_list = get_values.split()
min=int(value_list[0])
max=int(value_list[0])
for i in range (1,n):
if int(value_list[i])<int(min) :
min=value_list[i]
cntr+=1
if(int(value_list[i])>int(max)):
max= value_list[i]
cntr+=1
print(cntr) | 7 | PYTHON3 |
inp=int(input())
inp1=input().split()
mi, ma=int(inp1[0]), int(inp1[0])
count=0
for _ in range(1, inp):
if mi>int(inp1[_]):
count+=1
mi=int(inp1[_])
elif ma<int(inp1[_]):
count+=1
ma=int(inp1[_])
print(count)
| 7 | PYTHON3 |
n = int(input())
l = list(input().split())
a = []
amazing = 0
l = [int(i) for i in l]
min = l[0]
max = l[0]
for i in range(1, n):
if l[i] < min:
min = l[i]
amazing += 1
elif l[i] > max:
max = l[i]
amazing += 1
print(amazing) | 7 | PYTHON3 |
n = int(input())
k = input()
k = [int(x) for x in k.split()]
max, min, kol = k[0], k[0], 0
for i in range(len(k)):
if k[i] > max:
max = k[i]
kol += 1
if k[i] < min:
min = k[i]
kol += 1
print(kol)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
return n * n;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
return (P == 0) ? 1 : N * power(N, P - 1);
}
int main() {
int i, n, res, num, mini, maxi;
while (scanf("%d", &n) == 1) {
scanf("%d", &num);
maxi = mini = num;
res = 0;
for (i = 0; i < n - 1; i++) {
scanf("%d", &num);
if (num > maxi) {
res++;
maxi = num;
}
if (num < mini) {
res++;
mini = num;
}
}
printf("%d\n", res);
}
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
min_f=a[0];max_f=a[0]
udivlenie=0
for i in range(1,n):
if a[i]>max_f:
udivlenie+=1
max_f=a[i]
if a[i]<min_f:
udivlenie+=1
min_f=a[i]
print(udivlenie) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
b=a
ncount=0
for i in range (0,n-1):
c=b[:i+1]
c.sort()
#print(c)
if b[i+1]<c[0]:
ncount+=1
elif b[i+1]>c[i]:
ncount+=1
print (ncount)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
u=a[0]
d=a[0]
am=0
for i in a:
if i>u:
u=i
am+=1
if i<d:
d=i;
am+=1
print(am) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
cnt=0
less=a[0]
more=a[0]
for i in range(1,n):
if a[i]<less:
cnt+=1
less=a[i]
if a[i]>more:
cnt+=1
more=a[i]
print(cnt) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
mi, ma = l[0], l[0]
c = 0
for i in range(1, n):
if l[i] < mi:
c += 1
mi = l[i]
elif l[i] > ma:
c += 1
ma = l[i]
print(c)
| 7 | PYTHON3 |
n = int(input())
ls = list(map(int, input().split()))
ans = 0
mxN = ls[0]
mnN = ls[0]
for i in range(1, n):
if ls[i] > mxN:
ans += 1
mxN = ls[i]
if ls[i] < mnN:
ans += 1
mnN = ls[i]
print(ans) | 7 | PYTHON3 |
def Main():
n = int(input())
pts = list(map(int, input().split()))
namz = 0
minn = pts[0]
maxx = pts[0]
for i in range(1, n):
if pts[i] < minn:
minn = pts[i]
namz += 1
elif pts[i] > maxx:
maxx = pts[i]
namz += 1
print(namz)
if __name__ == "__main__":
Main()
| 7 | PYTHON3 |
n=int(input())
li=[int(i) for i in input().split(" ")]
cnt,mn,mx=0,li[0],li[0]
for i in range(1,n):
if li[i]<mn:
cnt+=1
elif li[i]>mx:
cnt+=1
mn=min(mn,li[i])
mx=max(mx,li[i])
print(cnt) | 7 | PYTHON3 |
n=int(input())
s=[int(i) for i in input().split()]
best=s[0]
worst=s[0]
ncount=0
for i in range(1,n):
if s[i]>best:
ncount+=1
best=s[i]
elif s[i]<worst:
ncount+=1
worst=s[i]
else:
continue
print(ncount)
| 7 | PYTHON3 |
n=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=int(input())
l=[int(i) for i in input().split()]
t=0
for i in range(1,n):
if l[i]>max(l[0:i]) or l[i]<min(l[0:i]):
t+=1
print(t)
| 7 | PYTHON3 |
t=int(input())
b=[int(i) for i in input().split()]
max=b[0]
min=b[0]
d=0
for i in b:
if i<min:
d+=1
min=i
elif i>max:
d+=1
max=i
print(d) | 7 | PYTHON3 |
# your code goes here
# your code goes here
n = int(input())
a = [int(i) for i in input().split()]
if len(a)==1:
print("0")
else:
c=0
x = a[0]
y = a[0]
for i in range(1,len(a)):
if a[i]>x:
c+=1
x=a[i]
elif a[i]<y:
c+=1
y=a[i]
print(c) | 7 | PYTHON3 |
if __name__ == '__main__':
n = int(input().strip())
arr = [int(__) for __ in input().strip().split()]
ma = mi = arr[0]
ans = 0
for i in range(1, n):
if arr[i] > ma:
ans += 1
ma = arr[i]
elif arr[i] < mi:
ans += 1
mi = arr[i]
print(ans)
| 7 | PYTHON3 |
n=int(input())
l=[int(i) for i in input().split()]
k=0
m=[l[0]]
for i in range(1,n):
if int(max(m))<int(l[i]) or int(min(m))>int(l[i]):
k=k+1
else:
pass
m.append(l[i])
print(k)
| 7 | PYTHON3 |
#!/bin/python3
int(input())
score = [int(i) for i in input().split()]
best = score[0]
worst = score[0]
c = 0
for x in score[1:]:
if x > best or x < worst:
c += 1
if x > best:
best = x
elif x < worst:
worst = x
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n;
cin >> n;
int mi = 0, mx = 0, a, cnt = 0, aa;
cin >> aa;
mi = aa;
mx = aa;
while (n > 1) {
cin >> a;
if (a < mi) {
mi = a;
cnt++;
}
if (a > mx) {
mx = a;
cnt++;
}
n--;
}
cout << cnt << endl;
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(1,n):
if a[i]>max(a[:i]):
c+=1
elif a[i]<min(a[:i]):
c+=1
print(c)
| 7 | PYTHON3 |
length=int(input())
score=list(map(int,input().split(' ')))
max=score[0]
min=score[0]
count=0
for i in range(1,length):
if(score[i]>max):
max=score[i]
count+=1
elif(score[i]<min):
min=score[i]
count+=1
else:
continue
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n = 0;
cin >> n;
int minimum = 10001;
cin >> minimum;
int maximum = minimum;
int coolnessCount = 0;
for (int i = 1; i < n; i++) {
int currentNumber;
cin >> currentNumber;
if (currentNumber > maximum) {
coolnessCount += 1;
maximum = currentNumber;
}
if (currentNumber < minimum) {
coolnessCount += 1;
minimum = currentNumber;
}
}
cout << coolnessCount << "\n";
return 0;
}
| 7 | CPP |
n=int(input())
line_=input()
line=[int(i) for i in line_.split()]
i=1
count=0
max=line[0]
min=line[0]
while i<len(line):
if line[i]>max :
count=count+1
max=line[i]
i=i+1
elif line[i]<min:
count=count+1
min=line[i]
i=i+1
else:
count=count
i=i+1
print(count)
| 7 | PYTHON3 |
n = int(input())
scores = [int(i) for i in input().split()]
min = max = scores[0]
amazing = 0
for i in range(1, n):
if scores[i] > max:
max = scores[i]
amazing += 1
elif scores[i] < min:
min = scores[i]
amazing += 1
print(amazing) | 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
n=1
tt=0
man=b[0]
mins=b[0]
for i in range (a):
if b[i] > man:
man=b[i]
tt+=1
elif b[i] < mins:
mins=b[i]
tt+=1
print(tt)
| 7 | PYTHON3 |
a = int(input())
b = [int(x) for x in input().split()]
count = 0
for i in range(1, a):
if(all([b[i] < c for c in b[:i]]) or all([b[i] > c for c in b[:i]])):
count = count + 1
print(count) | 7 | PYTHON3 |
n=int(input())
x=input().split()
x=[int(i)for i in x]
y=[x[0]]
k=0
for i in x:
if i>max(y) or i<min(y):
k=k+1
y.append(i)
print(k)
| 7 | PYTHON3 |
n = int(input())
contests = list(map(int, input().split()))
mx = contests[0]
mn = contests[0]
count = 0
for i in range(0, n):
if contests[i] > mx:
mx = contests[i]
count+=1
if contests[i] < mn:
mn = contests[i]
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
args = list(map(int, input().split()))
minResult, maxResult = args[0], args[0]
count = 0
for i in range(1, len(args)):
if args[i] > maxResult:
count += 1
maxResult = args[i]
if args[i] < minResult:
count += 1
minResult = args[i]
print(count)
| 7 | PYTHON3 |
a=int(input())
b=input().split()
c=0
d=int(b[0])
f=int(b[0])
for i in range (1,a):
if int(b[i])>d:
c+=1
d=int(b[i])
if int(b[i])<f:
c+=1
f=int(b[i])
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, x, mn, mx, a;
int main() {
cin >> n;
cin >> x;
mn = x;
mx = x;
for (int i = 2; i <= n; i++) {
cin >> x;
if (x > mx) {
mx = x;
a++;
}
if (x < mn) {
mn = x;
a++;
}
}
cout << a;
return 0;
}
| 7 | CPP |
n = int(input())
data = [int(x) for x in input().split()]
curmin = data[0]
curmax = data[0]
count = 0
for i in range(1, len(data)):
if curmin > data[i]:
curmin = data[i]
count += 1
elif curmax < data[i]:
curmax = data[i]
count += 1
print(count) | 7 | PYTHON3 |
input()
a = list(map(int,input().split()))
mini = a[0]
maxi = a[0]
result = 0
for element in a[1:]:
if element < mini:
mini = element
result += 1
elif element > maxi:
maxi = element
result += 1
print(result)
| 7 | PYTHON3 |
if __name__ == "__main__":
n = int(input())
l = list(map(int,input().split()))
c = -1
ma = -1
mi = 11000
for i in range(n):
if l[i] > ma:
ma = l[i]
c += 1
if ma < mi:
mi = ma
continue
if l[i] < mi:
mi = l[i]
c += 1
print(c)
| 7 | PYTHON3 |
n = input()
x = 0
l = [int(x) for x in input().split()]
min, high = l [0] , l[0]
for elt in l:
if elt < min:
x+=1
min = elt
elif elt > high :
x+=1
high = elt
print(x)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split(' ')))
min = a[0]
max = a[0]
c = 0
for i in range(1,n):
if a[i]<min:
min = a[i]
c = c+1
elif a[i]>max:
max = a[i]
c = c+1
print(c) | 7 | PYTHON3 |
Amazing = 0
input()
Scores = list(map(int, input().split()))
for i in range(1, Scores.__len__()):
if Scores[i] > max(Scores[:i]) or Scores[i] < min(Scores[:i]):
Amazing += 1
print(Amazing) | 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
res=0
min=b[0]
max=b[0]
for k in range(1,a):
if b[k]<min:
res+=1
min=b[k]
if b[k]>max:
res+=1
max=b[k]
print(res)
| 7 | PYTHON3 |
n = int(input())
score = list(map(int, input().split()))
mx = score[0]
mn = score[0]
ans = 0
for i in range(1, n):
if score[i] > mx:
ans += 1
mx = score[i]
elif score[i] < mn:
ans += 1
mn = score[i]
print(ans) | 7 | PYTHON3 |
dumb = input()
l = [int(x) for x in input().split()]
ma = l[0]
mi = l[0]
count = 0
for i in l[1:]:
if i > ma:
ma = i
count += 1
elif i < mi:
mi = i
count += 1
print(count) | 7 | PYTHON3 |
t=int(input())
arr=list(map(int,input().split()))
max=arr[0]
min=arr[0]
count=0
for i in range(1,t):
if arr[i]>max:
count=count+1
max=arr[i]
elif arr[i]<min:
count=count+1
min=arr[i]
else:
continue
print(count) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
h = l = a[0]
amazing = 0
for i in range(1,n):
if a[i] > h or a[i] < l:
amazing +=1
h = max(h,a[i])
l = min(l,a[i])
print(amazing)
| 7 | PYTHON3 |
n = int(input())
ls = [int(x) for x in input().split()]
mn = ls[0]
mx = ls[0]
count = 0
for i in range(1,n):
if (mn > ls[i]):
mn = ls[i]
count += 1
elif (mx < ls[i]):
mx = ls[i]
count += 1
print(count) | 7 | PYTHON3 |
l=[]
c=0
n=int(input())
l=list(map(int,input().split()))[:n]
for i in range(1,n):
if(l[i]>max(l[:i]) or l[i]<min(l[:i])):
c+=1
print (c) | 7 | PYTHON3 |
n=int(input())
mas=list(map(int,input().split(" ")))
i=1
mi=mas[0]
ma=mas[0]
res=0
while i<len(mas):
if mi>mas[i]:
mi=mas[i]
res+=1
if ma<mas[i]:
ma=mas[i]
res+=1
i+=1
print(res) | 7 | PYTHON3 |
n=int(input())
x=list(map(int,input().split()))
y=[x[0]]
count=0
for i in x:
if i > max(y) or i < min (y):
count=count+1
y.append(i)
print(count)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().rstrip().split()))
C=0
m=a[0]
for i in range(1,len(a)):
if m>a[i]:
C=C+1
m=a[i]
m=a[0]
for i in range(1,len(a)):
if m<a[i]:
C=C+1
m=a[i]
print(C)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[10000];
int main() {
int n, i, max, min, num = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &arr[i]);
min = arr[0], max = arr[0];
for (i = 1; i < n; i++) {
if (arr[i] > max) {
max = arr[i];
num++;
}
if (arr[i] < min) {
min = arr[i];
num++;
}
}
printf("%d", num);
return 0;
}
| 7 | CPP |
n = int(input())
my_list = list(map(int, input().split()))
max = my_list[0]
min = my_list[0]
sum = 0
for i in my_list:
if i > max:
max = i
sum += 1
if i < min:
min = i
sum += 1
print(sum) | 7 | PYTHON3 |
n= int(input() )
lis = [int(x) for x in input().split()]
min = (lis[0])
max=lis[0]
count=0
for i in range(1,len(lis) ):
if max<lis[i]:
max = lis[i]
count+=1
elif min>lis[i]:
min = lis[i]
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
flst = []
c = 0
flst.append(lst[0])
for i in lst[1:]:
flst.append(i)
if (max(flst) == i or min(flst) == i) and flst.count(i) == 1:
c += 1
print(c)
| 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
mx = 0
mi = 10000
cnt = 0
for i in range(n):
if i > 0:
if a[i] > mx or a[i] < mi:
cnt += 1
if a[i] > mx:
mx = a[i]
if a[i] < mi:
mi = a[i]
if i == 0:
continue
print(cnt)
| 7 | PYTHON3 |
n=int(input())
k=[int(x) for x in input().split(" ")]
min=k[0]
max=k[0]
sum=0
for x in k:
if x<min:
min=x
sum+=1
elif x>max:
max=x
sum+=1
print(sum) | 7 | PYTHON3 |
x = int(input())
y = input().split()
output = 0
lst = []
if(x==1):
print(output)
else:
i = 1
lst.append(int(y[0]))
while(i<x):
lst.sort()
if(int(y[i]) > lst[len(lst)-1]):
output += 1
elif(int(y[i]) < lst[0]):
output += 1
lst.append(int(y[i]))
i += 1
print(output)
| 7 | PYTHON3 |
n=int(input())
score=list(map(int,input().split()))
l=score[0]
s=score[0]
count=0
for i in score:
if i>l:
l=i
count=count+1
for i in score:
if i<s:
s=i
count=count+1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
m=a[0]
n=a[0]#m for max while n for min
s=0
for i in a:
if i>m:
s+=1
m=i
if i<n:
s+=1
n=i
print(s)
| 7 | PYTHON3 |
def solve(arr):
ans = 0
for i in range(1,len(arr)):
if arr[i] > max(arr[0:i]) or arr[i] < min(arr[0:i]):
ans += 1
return ans
if __name__ == "__main__":
input()
print(solve(list(map(int,input().split(" "))))) | 7 | PYTHON3 |
n=int(input())
inp=list(map(int,input().split()))
mx=inp[0]
mn=inp[0]
cntr=0
for i in range(1,n):
if inp[i]>mx:
cntr+=1
mx=inp[i]
elif inp[i]<mn:
cntr+=1
mn=inp[i]
print(cntr) | 7 | PYTHON3 |
#!/usr/bin/python3
def readln(): return tuple(map(int, input().split()))
n, = readln()
ans = 0
a = 10**9
b = -1
for r in readln():
ans += b != -1 and (r < a or r > b)
a = min(a, r)
b = max(b, r)
print(ans)
| 7 | PYTHON3 |
n=int(input())
l = list(map(int,input().split()))
minimum = l[0]
maximum = l[0]
r = 0
for i in l:
if i > maximum:
r += 1
maximum = i
if i < minimum:
r += 1
minimum = i
print(r)
| 7 | PYTHON3 |
n=int(input())
a=input().split()
a=[int(i) for i in a]
b=1
c=0
while b<n:
list1=a[:b]
if a[b]>max(list1) or a[b]<min(list1):
c=c+1
else:c=c
b+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
x=list(map(int,input().split()))
c=0
m=x[0]
s=x[0]
for i in range(1,len(x)):
if x[i]>m:
c+=1
m=x[i]
elif x[i]<s:
c+=1
s=x[i]
print(c)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
rez = 0
mx = a[0]
mn = a[0]
for i in a:
if i < mn:
mn = i
rez += 1
if i > mx:
mx = i
rez += 1
print(rez)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
am=0
temp=[]
temp.append(l[0])
mx=temp[0]
mn=temp[0]
for i in range(1,len(l)):
temp.append(l[i])
m1=max(temp)
m2=min(temp)
if mx<m1:
mx=m1
am+=1
else:
if mn>m2:
mn=m2
am+=1
print(am)
| 7 | PYTHON3 |
n=int(input())
a = list(map(int, input().split()))
max=min=a[0]
aw=0
if 1<=n<=1000:
for i in range(n):
if a[i]>max:
max=a[i]
aw+=1
elif a[i]<min:
min=a[i]
aw+=1
print(aw)
else:
prinnt("Net resheenya")
| 7 | PYTHON3 |
n=int(input())
l=[int(i) for i in input().split()]
x=y=l[0]
cnt=0
for i in range(1,n):
if l[i]<y:
y=l[i]
cnt+=1
elif l[i]>x:
x=l[i]
cnt+=1
print(cnt)
| 7 | PYTHON3 |
n = int(input())
am = 0
g = [int(s) for s in input().split()]
maxx, minn = g[0], g[0]
for ele in g:
if ele > maxx:
maxx = ele
am +=1
elif ele < minn :
minn = ele
am +=1
print(am) | 7 | PYTHON3 |
#!/usr/bin/env python
# coding=utf-8
input_s = int(input())
input_l = input().split(' ')
number_max = -1
number_min = 999999
s = 0
for l in input_l:
ll = int(l)
if ll > number_max:
s += (1 if number_max != -1 else 0)
number_max = ll
if ll < number_min:
s += (1 if number_min != 999999 else 0)
number_min = ll
print(s)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = [a[0]]
k = 0
for i in range(1, n):
if a[i] not in b:
b.append(a[i])
if a[i] == max(b) or a[i] == min(b):
k += 1
print(k) | 7 | PYTHON3 |
n=int(input())
cd=[int(i)for i in input().split()]
j,k=cd[0],cd[0]
p=0
for i in range(1,n):
if cd[i]>j:
p=p+1
j=cd[i]
if cd[i]<k:
p=p+1
k=cd[i]
print(p)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
mx=l[0]
mn=l[0]
c=0
for i in l:
if i>mx:
mx=i
c+=1
if i<mn:
mn=i
c+=1
print(c)
| 7 | PYTHON3 |
x=input()
z=int(x)
y = input().split()
minm=int(y[0])
maxm=minm
sum=0
for i in y:
b=int(i)
if(b<minm):
sum+=1
minm=b
elif(b>maxm):
sum+=1
maxm=b
print(sum)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.