solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
import math
n = int(input())
arr = list(map(int, input().split(" ")))
amazing_ct = 0
min_val = arr[0]
max_val = arr[0]
for i in range(1,len(arr)):
if(arr[i]>max_val):
max_val = arr[i]
amazing_ct+=1
elif(arr[i]<min_val):
min_val = arr[i]
amazing_ct+=1
print(amazing_ct)
| 7 | PYTHON3 |
n = int(input())
c=[int(x) for x in input().split()]
mx = mn = c[0]
amazing = 0
for i in range(1,n):
if c[i]>mx or c[i]<mn:
amazing+=1
mx = max(mx,c[i])
mn = min(mn,c[i])
print(amazing)
| 7 | PYTHON3 |
n, l = int(input()), list(map(int, input().split()))
print(sum(1 for i in range(1, n) if l[i] > max(l[:i]) or l[i] < min(l[:i]))) | 7 | PYTHON3 |
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read non spaced string and elements are integers to list of int
get_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))
#to read non spaced string and elements are character to list of character
get_charList_from_str = lambda: list(sys.stdin.readline().strip())
#get word sepetared list of character
get_char_list = lambda: sys.stdin.readline().strip().split()
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print faster
pt = lambda x: sys.stdout.write(str(x))
#--------------------------------WhiteHat010--------------------------------------#
N = get_int()
lst = get_int_list()
mi = mx = lst[0]
count = 0
for i in range(1,N):
if lst[i] < mi:
mi = lst[i]
count += 1
if lst[i] > mx:
mx = lst[i]
count += 1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int arr[10000];
int max = 0, min = 0;
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
max = arr[0];
min = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] < min) {
cnt++;
min = arr[i];
}
if (arr[i] > max) {
cnt++;
max = arr[i];
}
}
if (n == 1) {
cout << 0 << endl;
} else {
cout << cnt << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d;
int main() {
cin >> n >> a;
d = a;
for (int i = 2; i <= n; i++) {
cin >> b;
if (b > a) {
c++;
a = b;
}
if (b < d) {
c++;
d = b;
}
}
cout << c;
return 0;
}
| 7 | CPP |
n=int(input())
if n==1:
print("0")
else:
m=0
a=list(map(int,input().split()))
x=y=a[0]
for i in range(1,n):
z=a[i]
if z>x:
x=z
m+=1
if z<y:
y=z
m+=1
print(m)
| 7 | PYTHON3 |
input()
lst = input().split()
Max = int(lst[0])
Min = int(lst[0])
ctr = 0
for i in lst[1:]:
if(int(i) > Max):
Max = int(i)
ctr += 1
if(int(i) < Min):
Min = int(i)
ctr += 1
print(ctr)
| 7 | PYTHON3 |
n = int(input())
scores = [int(x) for x in input().split()]
high = low = scores[0]
n_amazing = 0
for j in range(1, n):
curr = scores[j]
if curr > high:
high = curr
n_amazing += 1
elif curr < low:
low = curr
n_amazing += 1
print(n_amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], i, c, min, max;
for (i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] > a[1])
min = a[1], max = a[0];
else if (a[0] < a[1])
max = a[1], min = a[0];
else if (a[0] == a[1])
max = a[0], min = a[0];
if (max == min)
c = 0;
else
c = 1;
for (i = 1; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
if (a[i + 1] < min) {
min = a[i + 1];
c++;
}
} else if (a[i] < a[i + 1]) {
if (a[i + 1] > max) {
max = a[i + 1];
c++;
}
}
}
if (n == 1)
cout << "0";
else
cout << c;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
ans = 0
maks = a[0]
mins = a[0]
for i in range(len(a)):
if (maks < a[i]):
ans += 1
maks = a[i]
elif (a[i] < mins):
mins = a[i]
ans += 1
print(ans)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
x=a[:1]
for i in a:
n-=min(x)<=i<=max(x)
x+=[i]
print(n) | 7 | PYTHON3 |
n = int(input())
l = [int(i) for i in input().split()]
mx = l[0]
mn = l[0]
t = 0
for i in range(1,n):
if l[i] < mn :
mn = l[i]
t = t+1
if l[i] > mx :
mx = l[i]
t = t+1
print(t)
| 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
mx=s[0]
mn=s[0]
c=0
for i in range(1,n):
if s[i]>mx:
mx=s[i]
c+=1
elif s[i]<mn:
mn=s[i]
c+=1
else:
continue
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, i, b = -1, w = 1e9, c = 0, d = 0, j;
cin >> n;
vector<int> v;
int p[n];
for (i = 0; i < n; i++) {
cin >> p[i];
for (j = 0; j < i; j++) {
if (p[j] == p[i]) {
d++;
}
}
if (d == 0) {
v.push_back(p[i]);
}
d = 0;
}
for (i = 0; i < v.size(); i++) {
b = max(b, v[i]);
w = min(w, v[i]);
if (b == v[i] && w == v[i]) {
} else if (b == v[i]) {
c++;
} else if (w == v[i]) {
c++;
}
}
cout << c;
return 0;
}
| 7 | CPP |
n = int(input())
nums =list(map(int,input().split()))
i = 1
count = 0
s = set()
first = nums[0]
# print(set(nums))
while i < n:
if nums[i] == first:
i+=1
pass
else:
m = max(nums[:i+1])
if m == nums[i]:
s.add(m)
mi = min(nums[:i+1])
if mi == nums[i]:
s.add(mi)
i+=1
if n == 1:
print(0)
else:
print(len(s))
# print(s)
| 7 | PYTHON3 |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
if n == 1:
print(0)
exit()
ct = 0
minn = maxn = l[0]
for i in range(1, n):
if l[i] > maxn:
ct += 1
maxn = l[i]
elif l[i] < minn:
ct += 1
minn = l[i]
print(ct) | 7 | PYTHON3 |
n = int(input())
p = input()
p = p.split()
hi = int(p[0])
lo = int(p[0])
c = 0
for i in range(1,n):
p[i]=int(p[i])
if p[i]>hi:
hi=p[i]
c+=1
elif p[i]<lo:
lo = p[i]
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
list0=[int(i)for i in input().split()]
max0=list0[0]
min0=list0[0]
a=0
b=0
for i in range(n):
if list0[i]>max0:
a+=1
max0=list0[i]
if list0[i]<min0:
b+=1
min0=list0[i]
print(a+b)
| 7 | PYTHON3 |
import sys
n=int(input())
index=0
count=0
for i in map(int,input().split(' ')):
if(index==0):
min=i
max=i
else:
if(min>i):
count+=1
min=i
if(max<i):
count+=1
max=i
index+=1
print(count) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
ama=0
best=0
worst=0
for i in range(1,n):
best=max(a[j]for j in range(i))
worst=min(a[j]for j in range(i))
if a[i]>best or a[i]<worst:
ama+=1
print(ama) | 7 | PYTHON3 |
# Alireza
# JAHANI
# PH_PY_LA
n = int(input())
result = []
r = 0
listinput = input().split()
for item in range(n):
listinput[item] = int(listinput[item])
for i in range(1, n):
array = listinput[:i+1]
mint = min(array)
maxt = max(array)
if (listinput[i] == mint and array.count(listinput[i]) == 1) or (listinput[i] == maxt and array.count(listinput[i] ) == 1 ):
r += 1
print(r)
| 7 | PYTHON3 |
n = int(input())
s = [int(i) for i in input().split()]
t = 0
mi = s[0]
ma = s[0]
for i in s:
if i > ma:
t += 1
ma = i
elif i < mi:
t += 1
mi = i
print(t) | 7 | PYTHON3 |
x=int(input(""))
y=input("").split()
counter=0
best = worst = int(y[0])
for c in range(1,x):
if int(y[c]) > best:
best=int(y[c])
counter+=1
elif int(y[c]) < worst:
worst=int(y[c])
counter+=1
print(counter) | 7 | PYTHON3 |
n = int(input())
p = [int(x) for x in input().split()]
h, l = p[0], p[0]
c = 0
for i in p:
if i > h:
h = i
c += 1
elif i < l:
l = i
c += 1
print(c) | 7 | PYTHON3 |
nums=int(input())
x=list(map(int,input().split()))
min=x[0]
max=x[0]
count=0
for i in range(nums-1):
if x[i+1]>max:
max=x[i+1]
count+=1
if x[i+1]<min:
min=x[i+1]
count+=1
print(count) | 7 | PYTHON3 |
no_contests = int(input())
contests = list(map(int, input().split()))
current_min = contests[0]
current_max = contests[0]
awesome = 0
for i in range(1, len(contests)):
if contests[i] < current_min:
awesome += 1
current_min = contests[i]
elif contests[i] > current_max:
awesome += 1
current_max = contests[i]
print(awesome)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
c=0
for i in range(1,n):
b.append(a[i])
if((min(b)==a[i] or max(b)==a[i]) and b.count(a[i])==1):
c+=1
print(c) | 7 | PYTHON3 |
def a():
n=int(input())
s = list(map(int, input().split()))
h = s[0]
l = s[0]
z=0
for i in s:
if i<l :
z+=1
l=i
elif i>h:
z+=1
h=i
print(z)
a() | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
a=arr[0]
b=arr[0]
count=0
count1=0
for i in range(1,n):
if(arr[i]<a):
a=arr[i]
count+=1
if(arr[i]>b):
b=arr[i]
count1+=1
print(count+count1)
| 7 | PYTHON3 |
n=int(input())
b = list(map(int, input().split()))
s=0
max=b[0]
min=b[0]
for i in range(len(b)):
if max > b[i]:
max=b[i]
s+=1
elif min < b[i]:
min=b[i]
s+=1
print(s) | 7 | PYTHON3 |
n = int(input())
pp = list(map(int, input().split()))
maxpp = pp[0]
minpp = pp[0]
cool = 0
for i in pp:
if i > maxpp:
maxpp = i
cool += 1
elif i < minpp:
minpp = i
cool += 1
print(cool)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
b=[]
minus=a[0]
plus=a[0]
c=0
for i in range(n):
b.append(a[i])
if i>0:
if a[i]==max(b) and a[i]>plus:
plus=a[i]
c+=1
elif a[i]==min(b) and a[i]<minus:
minus=a[i]
c+=1
## print('minus',minus,'plus',plus)
## print(a[i])
## if a[i]>a[i-1] or a[i]>plus:
## plus=a[i]
##
## elif a[i]<a[i-1] or a[i]<minus:
## minus=a[i]
## print(plus,minus)
## print(b)
print(c)
| 7 | PYTHON3 |
n = int(input())
nums = list(map(int, input().split()))
ma, mi = nums[0], nums[0]
counter = 0
for i in range(1, n):
elem = nums[i]
if elem > ma:
counter += 1
ma = elem
if elem < mi:
counter += 1
mi = elem
print(counter) | 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split(' ')))
a=0
mn=m[0]
mx=m[0]
for i in range(1,n):
if m[i]>mx:
a+=1
mx=m[i]
elif m[i]<mn:
a+=1
mn=m[i]
print(a) | 7 | PYTHON3 |
t = int(input());
n = [];
s = 0;
i=0;
a = [int(x) for x in input().split()];
min_ = a[0];
max_ = a[0];
for x in range(1,t):
if(min_>a[x]):
s+=1;
min_=a[x];
if(max_<a[x]):
s+=1;
max_=a[x];
print(s);
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
mn = mx = a[0]
ans = 0
for i in range(1, n):
if a[i] < mn:
mn = a[i]
ans += 1
if a[i] > mx:
mx = a[i]
ans += 1
print(ans) | 7 | PYTHON3 |
n = input()
A = list(map(int, input().split()))
k = A[0]
m = A[0]
t = 0
for i in A:
if i > k:
t += 1
k = i
elif i < m:
t += 1
m = i
print(t)
| 7 | PYTHON3 |
import sys
contestN = int(sys.stdin.readline())
scores = sys.stdin.readline().split()
result = 0
maxScore = int(scores[0])
minScore = int(scores[0])
for i in range(1,contestN):
score = int(scores[i])
if(score > maxScore):
maxScore = score
result += 1
elif(score < minScore):
minScore = score
result += 1
print(result) | 7 | PYTHON3 |
l=input()
l=[int(i) for i in input().split()]
max=min=l[0]
c=0
for i in l:
if i<min:
min=i
c+=1
elif i>max:
max=i
c+=1
print(c)
| 7 | PYTHON3 |
# You lost the game.
n = int(input())
L = list(map(int, input().split()))
minimum = L[0]
maximum = L[0]
r = 0
for k in range(1,n):
if L[k] < minimum:
r += 1
minimum = L[k]
elif L[k] > maximum:
r += 1
maximum = L[k]
print(r)
| 7 | PYTHON3 |
n=int(input())
a=map(int,input().split())
b=list(a)
c=b[0]
d=b[0]
s=0
for i in range(n):
if b[i]>c:
c=b[i]
s+=1
elif b[i]<d:
d=b[i]
s+=1
else:
s+=0
print(s)
| 7 | PYTHON3 |
n = int ( input ())
l = list ( map ( int , input (). split ()))
c = 0
max=l[0]
min=l[0]
for i in range ( 1 , n ):
if(l[i]>max):
max=l[i]
c+=1
elif(l[i]<min):
min=l[i]
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
print(sum(1 for i in range(1,n) if a[i] > max(a[:i]) or a[i] < min(a[:i])))
| 7 | PYTHON3 |
x = int(input())
a = [int(i) for i in input().split(" ")]
mx = a[0]
mn = a[0]
ap = 0
for i in range(1, x):
if a[i] < mn:
mn = a[i]
ap = ap + 1
elif a[i] > mx:
mx = a[i]
ap = ap + 1
print(ap)
| 7 | PYTHON3 |
n = int(input())
mas = [int(x) for x in input().split()]
k = mas[0]
z = mas[0]
x = 0
for i in range(1,n):
if mas[i] > k:
k = mas[i]
x += 1
if mas[i] < z:
z = mas[i]
x += 1
else:
pass
print(x) | 7 | PYTHON3 |
n = int(input())
valores = list(map(int,input().split()))
a1 = valores[0]
maior,menor = a1,a1
count = 0
valSize = len(valores)
for l in range(1, valSize):
k = valores[l]
if (k > maior):
maior = k
count+=1
if (k < menor):
menor = k
count+=1
print(count) | 7 | PYTHON3 |
a=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 |
nomber_of_inputs=int(input())
s=list(map(int , input().split()))
thefirst=s[0]
thesecond=s[0]
counter=0
for i in range(len(s)):
if s[i]>thefirst:
thefirst=s[i]
counter+=1
for i in range(len(s)):
if s[i] < thesecond:
thesecond = s[i]
counter += 1
print(counter) | 7 | PYTHON3 |
n=int(input())
s=[int(i) for i in input().split()]
a=b=s[0]
num=0
for i in range(1,n):
if s[i]>a or s[i]<b:
num+=1
a=max(s[i],a);b=min(s[i],b)
print(num)
| 7 | PYTHON3 |
n=int(input())
m=input().split()
a=[]
b=[]
c=0
for i in m:
a.append(int(i))
b.append(a[0])
for i in range(1,n):
b.append(a[i])
if (b[i]==max(b) and b.count(max(b))==1) or (b[i]==min(b) and b.count(min(b))==1):
c+=1
print(c) | 7 | PYTHON3 |
m=int(input())
reg=input().split()
max=(int(reg[0]))
min=(int(reg[0]))
counter=0
for i in range(1,m):
if int(reg[i])>max:
max=int(reg[i])
counter+=1
elif int(reg[i])<min:
min=int(reg[i])
counter+=1
print (counter)
| 7 | PYTHON3 |
n=int(input())
l=[int(x) for x in input().split()]
a=[]
num=0
for i in range(len(l)):
if i==0:
a.append(l[i])
else:
if l[i]>a[-1]:
num+=1
a.append(l[i])
a.sort()
elif l[i]<a[0]:
num+=1
a.append(l[i])
a.sort()
print(num) | 7 | PYTHON3 |
n=int(input())
baly=list(map(int,input().split()))
spisok=[]
itog=0
ma=0
mi=0
for i in range(n):
a=baly[i]
spisok.append(a)
if ma<a and i!=0:
itog+=1
elif mi>a:
itog+=1
ma = max(spisok)
mi = min(spisok)
print(itog)
| 7 | PYTHON3 |
n = int(input())
s = list(map(int,input().split()))
x = 0
l = s[0]
h = s[0]
for i in range(n):
if s[i] < l :
x += 1
l = s[i]
elif s[i] > h:
x += 1
h = s[i]
print(x)
| 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
max,min=b[0],b[0]
r=0
for i in range(1,a):
if max<b[i]:
r+=1
max=b[i]
elif min>b[i]:
r+=1
min=b[i]
print(r) | 7 | PYTHON3 |
n=int(input())
l=[int(x) for x in input().split()]
count=0
for i in range(1,n):
q=l[0:i]
if l[i]<min(q) or l[i]>max(q):
count+=1
print(count)
| 7 | PYTHON3 |
n = input()
a = list(map(int,input().split()))
mx = mn = a[0]
res = 0
for c in a:
if c<mn or c>mx:
res += 1
mx = max(mx,c)
mn = min(mn,c)
print(res) | 7 | PYTHON3 |
data=int(input())
l = list(map(int,input().split()))
mylist=l[:data]
initial = mylist[0]
min=initial
max=initial
amaz=0
for i in range(1,len(mylist)):
if mylist[i]>max:
amaz=amaz+1
max= mylist[i]
elif mylist[i]<min:
amaz=amaz+1
min=mylist[i]
print(amaz)
| 7 | PYTHON3 |
n=int(input())
per=[int(i) for i in input().split()]
h=l=per[0]
am=0
for i in range(1,n):
if per[i]>h:
h=per[i]
am+=1
elif per[i]<l:
l=per[i]
am+=1
print(am) | 7 | PYTHON3 |
x=int(input())
z=input().split()
y=[int(i)for i in z]
i=1
max=y[0]
min=y[0]
a=0
while i <x:
if y[i]>max:
a+=1
max=y[i]
if y[i]<min:
a+=1
min=y[i]
i+=1
print(a)
| 7 | PYTHON3 |
n = int(input())
nums = list(map(int, input().split()))
if len(nums) > 1:
best, worst = max(nums[0], nums[1]), min(nums[0], nums[1])
ct = 0
if best != worst:
ct = 1
for i in nums[2:]:
if i > best:
best = i
ct += 1
elif i < worst:
worst = i
ct += 1
print(ct)
else:
print(0)
| 7 | PYTHON3 |
t=int(input())
arr=list(map(int,input().split()))
Max=arr[0]
Min=arr[0]
c=0
for i in range(1,t):
if(arr[i]>Max):
Max=arr[i]
c+=1
if(arr[i]<Min):
Min=arr[i]
c+=1
else:
continue
print(c)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
ans = 0
mi = arr[0]
ma = arr[0]
for i in range(1, n):
temp = arr[i]
if(temp > ma):
ma = temp
ans += 1
elif(temp < mi):
mi = temp;
ans += 1
print(ans, end = '') | 7 | PYTHON3 |
n=int(input())
I=[int(i) for i in input().split()]
l,h=I[0],I[0]
count=0
for i in range(1,n):
if I[i]>h:
count+=1
h=I[i]
elif I[i]<l:
count+=1
l=I[i]
print(count)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sun May 26 17:38:42 2019
@author: avina
"""
n = int(input())
l = list(map(int, input().split()))
a = l[0];e = 0
mins = l[0]; maxs = l[0]
for i in range(1,n):
if l[i]> maxs:
e+=1
maxs = l[i]
if l[i] < mins:
e+=1
mins = l[i]
print(e) | 7 | PYTHON3 |
a=int(input())
b=[int(i) for i in input().split()]
l=0
for i in range(1,a):
if b[i]>max(b[0:i]) or b[i]<min(b[0:i]):
l=l+1
print(l)
| 7 | PYTHON3 |
N = int(input())
A = list(map(int, input().split()))
min = A[0]
max = A[0]
cnt = 0
for i in range(1, N):
if A[i] < min:
cnt += 1
min = A[i]
elif max < A[i]:
cnt += 1
max = A[i]
print(cnt) | 7 | PYTHON3 |
n = int(input())
results = [int(x) for x in input().split()]
c = 0
best = results[0]
worst = results[0]
for r in results[1:]:
if r > best:
best = r
c += 1
if r < worst:
worst = r
c += 1
print(c)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
count=0
maxa=a[0]
mina=a[0]
s=[]
for i in a:
s=s+[i]
if i>maxa:
count+=1
if i<mina:
count+=1
maxa=max(s)
mina=min(s)
print(count)
| 7 | PYTHON3 |
input()
a = list(map(int, input().split()))
mi, ma = a[0], a[0]
z = 0
for i in a[1:]:
if (i > ma):
ma = i
z += 1
if (i < mi):
mi = i
z += 1
print(z) | 7 | PYTHON3 |
n = int(input())
max = 0
min = 10001
ans = 0
k = 1
for i in input().split():
if k == 1:
k = 0
min = int(i)
max = int(i)
continue
if int(i) < min:
ans+=1
min = int(i)
if int(i) > max:
ans+=1
max = int(i)
print(ans) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
maks = a[0]
minim = a[0]
res = 0
for i in range(1,len(a)):
if a[i] > maks:
res += 1
maks = a[i]
if a[i] < minim:
res += 1
minim = a[i]
print(res) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 25 18:55:50 2020
@author: Kashem Pagla
"""
n=int(input())
contest=list(map(int, input().split()))[:n]
high=contest[0];low=contest[0];ans=[]
for i in range(1,len(contest)):
if(contest[i]<low):
low=contest[i]
ans.append(contest[i])
# print(low)
elif(contest[i]>high):
high=contest[i]
ans.append(contest[i])
# print(high)
print(len(ans)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int a[N];
int n, cnt;
int main() {
cin >> n;
cin >> a[0];
if (n == 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i < n; i++) {
cin >> a[i];
sort(a, a + i);
if (a[i] < a[0] || a[i] > a[i - 1]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
}
| 7 | CPP |
n = int(input())
c = 0
a = []
m = input().split()
for i in range(n):
a.append(int(m[i]))
for i in range(n):
l = 0
u = 0
if(i!=0):
for j in range(0,i):
if(a[i]>a[j]):
u+=1
elif(a[i]<a[j]):
l+=1
if((l==i)or(u==i)):
c=c+1
print(c) | 7 | PYTHON3 |
n = int(input())
x = [int(i) for i in input().split()]
t = 0
for i in range(1,n):
if x[i] > max(x[0:i]) or x[i] < min(x[0:i]):
t += 1
print(t)
| 7 | PYTHON3 |
n = int(input())
a = [int(s) for s in input().split()]
min = a[0]
max = a[0]
k = 0
for i in range(1,len(a)):
if a[i]>max:
max = a[i]
k+=1
elif a[i]<min:
min = a[i]
k+=1
print(k) | 7 | PYTHON3 |
n = int(input())
g = [int(i) for i in input().split()]
a = 0
for i in range(1, n):
if g[i] < min(g[:i]) or g[i] > max(g[:i]):
a += 1
print(a)
| 7 | PYTHON3 |
import math
n = int(input())
arr = list(map(int, input().split(" ")))
amazing_ct = 0
for i in range(1,len(arr)):
if(i==1):
min_val = arr[0]
max_val = arr[0]
else:
min_val = min(arr[0:i])
max_val = max(arr[0:i])
if(arr[i]<min_val or arr[i]>max_val):
amazing_ct+=1
print(amazing_ct)
| 7 | PYTHON3 |
n = int(input())
scores = input().split()
counter = 0
best = int(scores[0])
worse = int(scores[0])
scores.remove(scores[0])
for i in scores:
if int(i) > best:
counter += 1
best = int(i)
elif int(i) < worse:
counter += 1
worse = int(i)
print(counter)
| 7 | PYTHON3 |
import math
def solve(n,a):
max=a[0]
min=a[0]
c=0
for i in range(n):
if a[i]>max:
max=a[i]
c+=1
if min>a[i]:
min=a[i]
c+=1
return c
def main():
n=int(input())
a=[int(i) for i in input().split()]
print(solve(n,a))
main()
| 7 | PYTHON3 |
length = int(input())
contests = list(map(int, input().split()))
amazing = 0
for i, contest in enumerate(contests[1:], 1):
if contest > max(contests[:i]) or contest < min(contests[:i]):
amazing += 1
print(amazing) | 7 | PYTHON3 |
N = int(input())
CUP = list(map(int, input().split()))
PIZDEC = 0
check1 = 0
check2 = 0
for i in range (1, N):
for j in range (0, i):
if CUP[i]<CUP[j]:
check1 +=1
elif CUP[i]>CUP[j]:
check2 +=1
if check1 == i or check2 == i:
PIZDEC += 1
check1 = 0
check2 = 0
print(PIZDEC) | 7 | PYTHON3 |
n = int(input())
score = list(map(int, input().split()))
count = 0
cur_max = score[0]
cur_min = score[0]
for x in range(1, n):
if score[x] < cur_min:
cur_min = score[x]
count += 1
elif score[x] > cur_max:
cur_max = score[x]
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input()); count=0; a=[int(i) for i in input().split()]; maximum=minimum=a[0]
for i in range(1,n):
if a[i]>maximum: count+=1
elif a[i]<minimum: count+=1
maximum=max(maximum,a[i])
minimum=min(minimum,a[i])
print(count) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
x=a[0]
y=a[0]
amazing=0
for i in a[1:]:
if i>x:
amazing+=1
x=i
if i<y:
amazing+=1
y=i
print(amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long temp, counts = 0;
cin >> temp;
long long maxi = temp, mini = temp;
for (int i = 1; i < n; i++) {
cin >> temp;
if (temp > maxi) {
maxi = temp;
counts++;
}
if (temp < mini) {
mini = temp;
counts++;
}
}
cout << counts;
cout << "\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max, min, count = 0, i;
cin >> n;
int arr[n];
cin >> arr[0];
max = min = arr[0];
for (i = 1; i < n; i++) {
cin >> arr[i];
if (arr[i] > max) {
max = arr[i];
count++;
} else if (arr[i] < min) {
min = arr[i];
count++;
}
}
cout << count << endl;
}
| 7 | CPP |
n =int(input())
a = list(map(int,input().split()))
max = a[0]; min = a[0];count = 0
for i in range(1,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())
l = list(map(int, input().split()))
minn = l[0]
maxn = l[0]
res = 0
for i in range(1, n):
if (l[i] > maxn):
maxn = l[i]
res += 1
elif (l[i] < minn):
minn = l[i]
res += 1
print(res)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
# @Date : 2018-09-27 13:25:36
# @Author : raj lath ([email protected])
# @Link : link
# @Version : 1.0.0
from sys import stdin
max_val=int(10e12)
min_val=int(-10e12)
def read_int() : return int(stdin.readline())
def read_ints() : return [int(x) for x in stdin.readline().split()]
def read_str() : return input()
def read_strs() : return [x for x in stdin.readline().split()]
nb_scores = read_int()
scores = read_ints()
min_score = scores[0]
amazing = 0
for i in range(1, nb_scores):
amazing += scores[i] > max(scores[:i]) or scores[i] < min(scores[:i])
print(amazing)
| 7 | PYTHON3 |
a = int(input())
l = list(map(int, input().split()))
mn = l[0]
mx = l[0]
c = 0
for i in range(1, a, 1):
if l[i] > mx:
c += 1
mx = l[i]
if l[i] < mn:
c += 1
mn = l[i]
print(c) | 7 | PYTHON3 |
num = int(input())
scores = input().split()
scores = list(map(int, scores))
min = scores[0]
max = scores[0]
counter = 0
for num in scores:
if num > max:
max = num
counter += 1
elif num < min:
min = num
counter += 1
print(counter)
| 7 | PYTHON3 |
n = int(input())
list1 = list(map(int, input().split(' ')))
max1 = list1[0]
min1 = list1[0]
cou = 0
for i in range(1, n):
if list1[i] < min1:
cou += 1
min1 = list1[i]
if list1[i] > max1:
cou += 1
max1 = list1[i]
print(cou) | 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
c=[]
c.append(b[0])
ans=0
for i in range(1,len(b)):
if b[i]<min(c) or b[i]>max(c):
ans+=1
c.append(b[i])
print(ans) | 7 | PYTHON3 |
n=int(input())
l1=list(map(int,input().split()))
x=10001
y=-1
ans=0
for i in range(0,n):
if i==0:
x=l1[i]
y=l1[i]
else :
if l1[i]>x:
ans+=1
x=l1[i]
elif l1[i]<y:
ans+=1
y=l1[i]
print(ans) | 7 | PYTHON3 |
count = 0
input()
data = [int(i) for i in input().split()]
for i in range(2, len(data) + 1):
if data[:i][-1] == min(data[:i]) and data[:i].count(data[:i][-1]) == 1 or \
data[:i][-1] == max(data[:i]) and data[:i].count(data[:i][-1]) == 1:
# print(data[:i], data[:i][-1])
count += 1
print(count)
| 7 | PYTHON3 |
n = int(input())
l = [int(x) for x in input().split()]
a = 0
mini = l[0]
maxi = l[0]
for i in range(1, len(l)):
if(l[i] < mini):
mini = l[i]
a += 1
if(l[i] > maxi):
maxi = l[i]
a += 1
print(a) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(1,n):
if((a[i] not in a[0:i] and a[i]>max(a[0:i])) or (a[i] not in a[0:i] and a[i]<min(a[0:i]))):
c+=1
print(c)
#5
#100 50 200 150 200
#10
#4664 6496 5814 7010 5762 5736 6944 4850 3698 7242
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.