solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
i = int(input())
j = list(map(int,input().split()))
c =0
d =[j[0]]
maax =j[0]
miin = j[0]
for a in range(1,i):
d.append(j[a])
ma = max(d)
mi = min(d)
if (ma ==j[a] and ma > maax):
c+=1
maax = ma
if (mi ==j[a] and mi < miin):
c+=1
miin =mi
print(c)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
mx, mn, ans = a[0], a[0], 0
for c in a:
if(c > mx) :
ans += 1
mx = c
if(c < mn) :
ans += 1
mn = c
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, c = 0;
cin >> n >> x;
int mx = x, mn = x;
for (int i = 1; i < n; i++) {
cin >> x;
if (x > mx) {
mx = x;
c++;
} else if (x < mn) {
mn = x;
c++;
}
}
cout << c;
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
s=la=l[0]
a=0
for i in l[1:]:
if(i<s):
s=i
a=a+1
if(i>la):
la=i
a=a+1
print(a)
| 7 | PYTHON3 |
n = int(input())
x = tuple(map(int, input().split()))
r = 0
h = l =x[0]
for i in x:
if i > h:
h = i
r += 1
if i < l:
l = i
r += 1
print(r)
| 7 | PYTHON3 |
n = int(input())
lista = input().split(" ")
scores = list(map(int, lista))
tempScores = []
amazing = 0
actualScore = 0
for i in range(0, n):
if (i>=1):
actualScore = scores[i]
if (actualScore > max(tempScores) or actualScore < min(tempScores)):
amazing+=1
tempScores.append(scores[i])
print(amazing) | 7 | PYTHON3 |
"""
Nombre: I Love Username
id:
Fuente: Codeforces.com
Coder: Cgesu Coder """
n = int(input())
points = list(map(int, input().split()))
amazing = minimo = maximo = 0
for i in range(n):
if i == 0:
minimo = maximo = points[i]
else:
if minimo > points[i]:
minimo = points[i]
amazing += 1
elif maximo < points[i]:
maximo = points[i]
amazing += 1
print(amazing) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
c = []
for i in range(n):
if i == 0:()
else:
if a[i] > max(a[0:i]):
c.append(i)
else:
if a[i] < min(a[0:i]):
c.append(i)
else:()
print(len(c)) | 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
maximum=b[0]
minimum=b[0]
wow=0
for i in b:
if i > maximum:
maximum = i
wow+=1
elif i < minimum:
minimum = i
wow+=1
print(wow) | 7 | PYTHON3 |
'''
n = int(input().strip())
p = list(map(int,input().split()))
zero1 = 0 ; zero2 = 0
for i in p:
if i < 0:
if zero2 > 0:
zero2 -= 1
else:
zero1 += 1
else:
zero2 += i
print(zero1)
'''
n = int(input().strip())
ll = list(map(int,input().split()))
kmin = ll[0]
kmax = ll[0]
jav = 0
for i in range(1,n):
if kmax < ll[i]:
kmax = ll[i]
jav += 1
elif kmin > ll[i]:
jav += 1
kmin = ll[i]
print(jav)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0, x;
cin >> n;
if (n == 1) {
cin >> x;
cout << "0";
} else {
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
int choto = a[0];
int boro = a[0];
for (i = 1; i < n; i++) {
if (a[i] < choto) {
c++;
choto = a[i];
}
if (a[i] > boro) {
c++;
boro = a[i];
}
}
cout << c;
}
return 0;
}
| 7 | CPP |
n = int(input())
sequence = [int(i) for i in input().split(" ")]
min_list = sequence[0]; max_list = sequence[0]
amazing_perf = 0
for score in sequence:
if(score < min_list):
min_list = score
amazing_perf += 1
if(score > max_list):
max_list = score
amazing_perf += 1
print(amazing_perf) | 7 | PYTHON3 |
x=int(input(''))
listA=[int(x) for x in input().split()]
current=listA[0]
worst=listA[0]
best=listA[0]
numAw=0
if len(listA)==1:
print(0)
else:
if listA[1]>current:
best=listA[1]
numAw+=1
elif listA[1]<current:
worst=listA[1]
numAw+=1
for i in range(2,len(listA)):
if listA[i]>best:
best=listA[i]
numAw+=1
elif listA[i]<worst:
worst=listA[i]
numAw+=1
print(numAw) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int solution() { return 0; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
int ans = 0;
int num;
cin >> num;
int maxn = num;
int minn = num;
for (int i = 1; i < n; i++) {
cin >> num;
if (num > maxn) {
ans++;
maxn = num;
} else if (num < minn) {
ans++;
minn = num;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
count = 0
maxi = a[0]
mini = a[0]
for i in range(len(a)):
if a[i] > maxi:
maxi = a[i]
count += 1
elif a[i] < mini:
mini = a[i]
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
mx,mn,c=l[0],l[0],0
for x in range(1,n):
if l[x]>mx:
c+=1
mx=l[x]
elif l[x]<mn:
c+=1
mn=l[x]
print(c) | 7 | PYTHON3 |
n = int(input())
x = input()
x = x.split()
for i in range(n):
x[i] = int(x[i])
h = x[0]
l = x[0]
res = 0
for i in range(1,n):
if x[i]>h:
res += 1
h = x[i]
if x[i]<l:
res += 1
l = x[i]
print(res) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
mx=mn=a[0]; cnt=0
for item in a[1:]:
if item>mx:
cnt+=1; mx=item
elif item<mn:
cnt+=1; mn=item
print(cnt) | 7 | PYTHON3 |
n = int(input())
x = map(int, input().split())
a = b = next(x)
d = 0
for i in x:
if a > i:
a = i
d += 1
if b < i:
b = i
d += 1
print(d) | 7 | PYTHON3 |
number_of_events = int(input())
results = [int(i) for i in input().split()]
highest_value = results[0]
lowest_value = results[0]
output = 0
for i in range(1, len(results)):
if results[i] > highest_value:
output += 1
highest_value = results[i]
if results[i] < lowest_value:
output += 1
lowest_value = results[i]
print(output) | 7 | PYTHON3 |
n = int(input())
l = input().split()
min_l = int(l[0])
max_l = int(l[0])
br = 0
for i in range(1, n):
l[i] = int(l[i])
if l[i] > max_l:
max_l = l[i]
br += 1
elif l[i] < min_l:
min_l = l[i]
br += 1
print(br)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
s=a[0]
b=a[0]
c=0
for i in a:
if i>b:
b=i
c+=1
if i<s:
s=i
c+=1
print(c)
| 7 | PYTHON3 |
i = int(input())
l = list(map(int,input().split()))
mi = ma = l[0]
t = 0
for x in l:
if x < mi: t +=1; mi = x
if x > ma: t += 1; ma = x
print(t) | 7 | PYTHON3 |
# import sys
# sys.stdin = open("input", "r")
n = int(input())
nums = [int(x) for x in input().split()]
min = nums[0]
max = nums[0]
ret = 0
for i in range(1,n):
if nums[i] < min:
min = nums[i]
ret += 1
elif nums[i] > max:
max = nums[i]
ret += 1
print(ret) | 7 | PYTHON3 |
n=int(input())
pt=list(map(int,input().split(' ')))
mi,mx=pt[0],pt[0]
cnt=0
i=1
for i in range(len(pt)):
if pt[i]<mi:
mi=pt[i]
cnt+=1
elif pt[i]>mx:
mx=pt[i]
cnt+=1
i+=1
print(cnt)
| 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
big = a[0]
small = a[0]
res = 0
for i in a:
if i > big:
res += 1
big = i
if i < small:
res += 1
small = i
print(res) | 7 | PYTHON3 |
n=int(input())
line=[int(i) for i in input().split()]
mi=line[0]
ma=line[0]
out=0
for i in range(1,n):
if line[i]<mi:
mi=line[i]
out+=1
if line[i]>ma:
ma=line[i]
out+=1
else:
pass
print(out) | 7 | PYTHON3 |
n=int(input())
a=list(map(int, input().split()))
if n==1:
print("0")
else:
mi=min(a[0],a[1])
ma=max(a[0],a[1])
if mi==ma:
x=0
for i in range(2,n):
if a[i]>ma:
ma=a[i]
x+=1
if a[i]<mi:
mi=a[i]
x+=1
print(x)
else:
mi=min(a[0],a[1])
ma=max(a[0],a[1])
x=1
for i in range(2,n):
if a[i]>ma:
ma=a[i]
x+=1
if a[i]<mi:
mi=a[i]
x+=1
print(x)
| 7 | PYTHON3 |
input()
l = list(map(int,input().split()))
a = 0
n,x = [l[0],l[0]]
for i in l:
if i < n:
n = i
a += 1
elif i > x:
x = i
a += 1
else:
pass
print(a) | 7 | PYTHON3 |
n=int(input())
L=[int(x) for x in input().split()]
t=1
if len(L)==1:
print(0)
elif len(L)==2:
if L[0]==L[1]:
print(0)
else:
print(1)
else:
p=max(L[0],L[1])
q=min(L[0],L[1])
if p>q:
for i in range(2,len(L)):
if L[i]>p or L[i]<q:
t=t+1
p=max(p,L[i])
q=min(q,L[i])
print(t)
else:
t=0
for i in range(2,len(L)):
if L[i]>p or L[i]<q:
t=t+1
p=max(p,L[i])
q=min(q,L[i])
print(t)
| 7 | PYTHON3 |
n=int(input())
h=[int(i) for i in input().split()]
ans=0
m=s=h[0]
for i in range(n):
if h[i]>m:
ans+=1
m=h[i]
if h[i]<s:
s=h[i]
ans+=1
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int idk;
cin >> idk;
int mi = idk, ma = idk, ans = 0;
for (long long i = 1; i < n; i++) {
cin >> idk;
if (idk < mi) {
ans++;
mi = idk;
} else if (idk > ma) {
ans++;
ma = idk;
}
}
cout << ans << endl;
}
| 7 | CPP |
n = int(input())
numbers = list(map(int,input().split(" ")))
count = int(0)
minVal = numbers[0]
maxVal = numbers[0]
for i in numbers :
if(i < minVal) :
count+=int(1)
minVal = i
if(i > maxVal) :
count+=int(1)
maxVal = i
print(count)
| 7 | PYTHON3 |
n = int(input())
ball = list(map(int, input().strip().split(' ')))
q = 0
for i in range(1, n):
if (ball[i] < min(ball[:i])) or (ball[i] > max(ball[:i])):
q += 1
print(q) | 7 | PYTHON3 |
n=int(input())
x=[int(q) for q in input().split()]
c=0
mn=x[0]
mx=x[0]
for i in range(1,len(x)):
if x[i]>mx:
c+=1
mx=max(mx,x[i])
if x[i]<mn:
c+=1
mn=min(x[i],mn)
print(c) | 7 | PYTHON3 |
n = int(input())
mass = list(map(int, input().split()))
cmax = cmin = mass[0]
mass = mass[1:]
rec = 0
for i in mass:
if i > cmax:
cmax = i
rec += 1
elif i < cmin:
cmin = i
rec += 1
print(rec)
| 7 | PYTHON3 |
if __name__=="__main__":
n=int(input())
list1=input().split(' ')
list1=[int(a) for a in list1]
high=list1[0]
low=list1[0]
count=0
for i in range(1,len(list1)):
if low>list1[i] or high<list1[i]:
count+=1
if low>list1[i]:
low=list1[i]
else:
high=list1[i]
print(count)
| 7 | PYTHON3 |
n = int(input())
line = [int(i) for i in input().split()]
num = 0
for i in range(n-1):
if line[i+1]> max(line[0:i+1]) or line[i+1]<min(line[0:i+1]):
num += 1
print(num) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
counter = 0
for i in range(1,n):
subcounter_highest = 0
subcounter_lowest = 0
for a in range(0,i):
if l[i] > l[a]:
subcounter_highest = subcounter_highest + 1
elif l[i] < l[a]:
subcounter_lowest = subcounter_lowest + 1
if subcounter_highest == i or subcounter_lowest == i:
counter = counter + 1
print(counter) | 7 | PYTHON3 |
n = int(input())
ls = [int(i) for i in input().split(' ')]
min_ = ls[0]
max_ = ls[0]
c = 0
for i in range(1, n):
if(min_ <= ls[i] <= max_):
continue
else:
if(ls[i] < min_):
min_ = ls[i]
elif(ls[i] > max_):
max_ = ls[i]
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
a=[int (a) for a in input().split()]
count=0
for i in range(1,n):
if (a[i]>max(a[:i]) or a[i]<min(a[:i])):
count+=1
print (count) | 7 | PYTHON3 |
x=int(input())
y=list(map(int,input().split()))
high=y[0]
low=y[0]
sum=0
for i in range(1,x):
if y[i]>high:
high=y[i]
sum+=1
elif y[i]<low:
low=y[i]
sum+=1
print(sum)
| 7 | PYTHON3 |
n = int(input())
num = list(map(int, input().split()))
number = 0
mini = maxi = num[0]
for i in range(1,n):
if num[i] > maxi:
number += 1
maxi = num[i]
if num[i] < mini:
number += 1
mini = num[i]
print(number) | 7 | PYTHON3 |
n = int(input())
numbers = [int(i) for i in input().split()]
count = -1
amazing = 0
for i in numbers:
count += 1
if count == 0:
continue
if i > max(numbers[:count]) or i < min(numbers[:count]):
amazing += 1
print(amazing) | 7 | PYTHON3 |
n = int(int(input()))
L = [int(x) for x in input().split()]
Min,Max,c = L[0],L[0],0
for i in range(1,n):
if Min != min(L[:i+1]) or Max != max(L[:i+1]): c += 1
Min,Max =min(L[:i+1]), max(L[:i+1])
print(c) | 7 | PYTHON3 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n = I()
a = LI()
ma = mi = a[0]
r = 0
for c in a[1:]:
if ma < c:
r += 1
ma = c
elif mi > c:
r += 1
mi = c
return r
print(main())
| 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
ma = a[0]
mi = a[0]
c = 0
for i in range(1,n):
if a[i] > ma:
ma = a[i]
c += 1
if a[i] < mi:
mi = a[i]
c += 1
print(c)
| 7 | PYTHON3 |
n=int(input())
a=input().split()
for i in range(0,len(a)):
a[i]=int(a[i])
max=min=a[0]
c=0
for i in a:
if(i>max):
c+=1
max=i
if(i<min):
c+=1
min=i
print(c) | 7 | PYTHON3 |
n = int(input())
xs = [int(x) for x in input().split()]
mx = xs[0]
mn = xs[0]
ans = 0
for i in range(1,n):
if xs[i] < mn:
mn = xs[i]
ans += 1
elif xs[i] > mx:
mx = xs[i]
ans += 1
print(ans)
| 7 | PYTHON3 |
from sys import stdin
n=int(stdin.readline().strip())
lis =list(map(int,stdin.readline().strip().split()))
maxim=lis[0]
minin=lis[0]
cont=0
for i in range(1,n):
if lis[i]>maxim:
cont+=1
maxim=lis[i]
elif lis[i]<minin:
cont+=1
minin=lis[i]
print(cont)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
_min = l[0]
_max = l[0]
count = 0
for i in range (1,len(l)):
if l[i] > _max:
count+=1
_max = l[i]
elif l[i] < _min:
count+=1
_min = l[i]
print(count) | 7 | PYTHON3 |
a=int(input())
c=0
p=input().split()
max=int(p[0])
min=int(p[0])
for i in range(1,a):
t=int(p[i])
if t<min:
c=c+1
min=t
elif t>max:
c=c+1
max=t
print(c) | 7 | PYTHON3 |
n=int(input())
t=0
ans=0
for i in input().split():
t+=1
if t==1:
mini=int(i)
maxi=int(i)
else:
ii=int(i)
if ii>maxi:
ans+=1
maxi=ii
if ii<mini:
ans+=1
mini=ii
print(ans)
| 7 | PYTHON3 |
n = input()
lst = input().split()
lst = [int(i) for i in lst]
mi, mx, ans = lst[0], lst[0], 0
for i in lst[1:]:
if i < mi: mi = i; ans += 1
if i > mx: mx = i; ans += 1
print(ans) | 7 | PYTHON3 |
n=int(input ())
s=[int(z) for z in input().split ()]
mmx=s[0]
mmn=mmx
ans=0
for i in s:
if i<mmn:
mmn=i
ans+=1
if i>mmx:
mmx=i
ans+=1
print (ans) | 7 | PYTHON3 |
# coding=utf-8
# Created by TheMisfits
from sys import stdin
_input = stdin.readline
_max, _int, _range, _min = max, int, range, min
def solution():
n = _int(_input())
a = [_int(i) for i in _input().split()]
_min = a[0]
_max = a[0]
ans = 0
for i in _range(1,n):
if a[i] < _min:
ans += 1
_min = a[i]
if a[i] > _max:
ans += 1
_max = a[i]
print(ans)
solution() | 7 | PYTHON3 |
n = int(input())
score = [int(x) for x in input().split()]
passed = [score[0]]
count = 0
for i in range(1, n):
if score[i] > max(passed) or score[i] < min(passed):
count += 1
passed.append(score[i])
else:
passed.append(score[i])
print(count) | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().strip().split()))[:n]
highest = lst[0]
lowest = lst[0]
amazing = 0
for score in lst:
if score > highest:
highest = score
amazing += 1
elif score < lowest:
lowest = score
amazing += 1
print(amazing) | 7 | PYTHON3 |
n=int(input())
list=[int(i) for i in input().split()]
list1=[list[0]]
x=0
for i in list[1:n]:
if i>max(list1) or i<min(list1):
x+=1
list1.append(i)
print(x) | 7 | PYTHON3 |
n=int(input())
inp = list(map(int,input().split()))
maxi=inp[0]
mini=inp[0]
count=0
for i in range(0,len(inp)):
if(inp[i]<mini):
count+=1
mini=inp[i]
elif(inp[i]>maxi):
count+=1
maxi=inp[i]
print (count) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
c = 0
mi = 100000;ma = -10
for i in range(1,len(a)) :
mi = min(a[i-1],mi)
ma = max(a[i-1],ma)
if(a[i]>ma or a[i]<mi) :
c += 1
print(c) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
o=0
i=1
while i<n:
if a[i]>max(a[0:i]) or a[i]<min(a[0:i]):
o+=1
i+=1
print(o)
| 7 | PYTHON3 |
n=int(input())
a=input().split()
a=list(map(int,a))
s=0
c=a[0]
v=a[0]
for i in range(1,n):
if a[i]>c:
c=a[i]
s+=1
elif a[i]<v:
v=a[i]
s+=1
print(s) | 7 | PYTHON3 |
n=int(input())
lis=list(map(int,input().split()))
upper=lis[0]
lower=lis[0]
c=0
for i in range(1,n):
if(lis[i]>upper):
c=c+1
upper=lis[i]
if(lis[i]<lower):
c=c+1
lower=lis[i]
print(c)
| 7 | PYTHON3 |
n=int(input())
k=0
l=list(map(int,input().split()))
for i in range(1,n):
ma=max(l[:i])
mi=min(l[:i])
if l[i]>ma:
k=k+1
if l[i]<mi:
k=k+1
print(k)
| 7 | PYTHON3 |
n=int(input())
l=list(input().split())
num=0
for i in range(1,len(l)):
c=0 #每个循环都要复原
for j in range(i):
if int(l[i])>int(l[j]):
c+=1
elif int(l[i])<int(l[j]):
c+=-1
if c==i or c==-i:
num+=1
print(num)
| 7 | PYTHON3 |
x=int(input());a=list(map(int,input().split()));p=0
for i in range(1,x+1):
if max(a[:i])<a[:i+1][-1] or min(a[:i])>a[:i+1][-1]:
p+=1
print(p)
#author:SK__Shanto__㋛
#code__define__your__smartness | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().rstrip().split()))
mx = mn = a[0]
c = 0
for i in range(n):
if a[i]>mx:
c += 1
mx = a[i]
if a[i]<mn:
c+=1
mn = a[i]
print(c) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
ma=a[0]
mi=a[0]
x=0
for i in range(1,n):
r=a[i]
if r>ma:
x+=1
ma=r
elif r<mi:
x+=1
mi=r
print(x)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
b = []
b.append(a[0])
x=0
for i in range(1,n):
if a[i]>max(b) or a[i]<min(b):
b.append(a[i])
x+=1
else:
x+=0
print(x)
| 7 | PYTHON3 |
n = int(input())
scores = [int(i) for i in input().split()]
k = 0
min = scores[0]
max = scores[0]
for i in scores[1:]:
if i < min:
k += 1
min = i
elif i > max:
k += 1
max = i
print(k)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split(' ')))
d=[]
for i in range(1,len(a)):
b=max(a[i::-1])
c=min(a[i::-1])
if b not in a[i-1::-1] or c not in a[i-1::-1]:
if b==a[i] or c==a[i]:
d.append(a[i])
else:
continue
d=set(d)
print(len(d))
| 7 | PYTHON3 |
n = input()
x = [int(x) for x in input().split()]
max = x[0]
min = x[0]
count = 0
for i in x:
if i > max:
count = count + 1
max = i
elif i < min:
count = count + 1
min = i
print(count) | 7 | PYTHON3 |
n=int(input())
s1=input().split()
s2=[]
b=s1[0]
am=0
for i in range(n):
a=int(s1[i])
s2.append(a)
h=s2[0]
l=s2[0]
for i in range(1,n):
if s2[i]>h:
am=am+1
h=s2[i]
if s2[i]<l:
am=am+1
l=s2[i]
print(am) | 7 | PYTHON3 |
'''
Amirhossein Alimirzaei
Telegram : @HajLorenzo
Instagram : amirhossein_alimirzaei
University of Bojnourd
'''
x=int(input())
n=list(map(int,input().split()))
c=0
for _ in range(1,x):
if((n[_]>max(n[0:_])) or n[_]<min(n[0:_])):
c+=1
#print("n : ",n[_])
print(c)
| 7 | PYTHON3 |
n,arr = int(input()),list(map(int,input().split(' ')))
max,min,sum = arr[0],arr[0],0
for i in range(1,n):
if max<arr[i]:
sum += 1
max = arr[i]
elif min>arr[i]:
sum += 1
min = arr[i]
print(sum)
| 7 | PYTHON3 |
#!/usr/bin/env python
import sys, math
if __name__ == '__main__':
wtf = sys.stdin.read()
wtf = wtf.strip().split('\n')
n = int(wtf[0])
scs = [int(w) for w in wtf[1].split(' ')]
#1≤n≤1000
#10000
assert n >= 1 and n <= 1000, "Precondition failure"
M = scs[0]
m = scs[0]
ans = 0
for sc in scs[1:]:
if sc < M:
M = sc
ans += 1
if sc > m:
m = sc
ans += 1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int coders, a[1002], ans;
bool ok, ok2, ok3, ok4;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> coders;
for (int i = 0; i < coders; i++) cin >> a[i];
for (int i = 1; i < coders; i++) {
ok = false, ok2 = true;
ok3 = false, ok4 = true;
int z = i, cur = a[i];
while (z--) {
if (a[i] > a[z])
ok = true;
else
ok2 = false;
if (a[i] < a[z])
ok3 = true;
else
ok4 = false;
}
if (ok && ok2 || ok3 && ok4) ans++;
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
######################################################
############Created by Devesh Kumar###################
#############[email protected]####################
##########For CodeForces(Devesh1102)#################
#####################2020#############################
######################################################
import sys
input = sys.stdin.readline
# import sys
import heapq
import copy
import math
import decimal
# import sys.stdout.flush as flush
# from decimal import *
#heapq.heapify(li)
#
#heapq.heappush(li,4)
#
#heapq.heappop(li)
#
# & Bitwise AND Operator 10 & 7 = 2
# | Bitwise OR Operator 10 | 7 = 15
# ^ Bitwise XOR Operator 10 ^ 7 = 13
# << Bitwise Left Shift operator 10<<2 = 40
# >> Bitwise Right Shift Operator
# '''############ ---- Input Functions ---- #######Start#####'''
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))
def insr2():
s = input()
return((s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
############ ---- Input Functions ---- #######End
# #####
def pr_list(a):
print(*a, sep=" ")
def main():
# tests = inp()
tests = 1
mod = 998244353
limit = 10**18
ans = 0
for test in range(tests):
n = inp()
a = inlt()
mini = a[0]
maxi = a[0]
ans = 0
for i in range(1,n):
if a[i]>maxi:
ans+= 1
maxi = a[i]
elif a[i] < mini:
ans = ans + 1
mini = a[i]
print(ans)
if __name__== "__main__":
main() | 7 | PYTHON3 |
a = input()
line = [int(i) for i in input().split()]
ma=line[0]
mi=line[0]
j=0
for i in line:
if i >ma:
j+=1
ma=i
elif i<mi:
j+=1
mi=i
print(j) | 7 | PYTHON3 |
n=int(input())
lis=list(map(int,input().split()))
best=lis[0]
worst=lis[0]
res=0
for i in range(1,n):
if(lis[i]>best):
res+=1
best=lis[i]
elif(lis[i]<worst):
res+=1
worst=lis[i]
print(res)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
l=[]
l.append(a[0])
a.remove(a[0])
s=0
while a!=[]:
x=max(l)
y=min(l)
if y<=a[0]<=x:
s+=0
else:
s+=1
l.append(a[0])
a.remove(a[0])
print(s)
| 7 | PYTHON3 |
n = int(input())
a = map(int, input().split())
a = list(a)
a1 = [a[0]]
amazing = 0
minNumber = a[0]
maxNumber = a[0]
for i in range(n - 1):
a1.append(a[i + 1])
if a[i + 1] == max(a1) and maxNumber != a[i + 1] or a[i + 1] == min(a1) and minNumber != a[i + 1]:
amazing = amazing + 1
if a[i + 1] == max(a1):
maxNumber = a[i + 1]
elif a[i + 1] == min(a1):
minNumber = a[i + 1]
print(amazing) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, num, max = 0, min = 0, count = 0;
cin >> num;
int a[num];
for (i = 0; i < num; i++) cin >> a[i];
max = min = a[0];
for (i = 0; i < num; i++) {
if (a[i] > max) {
++count;
max = a[i];
} else if (a[i] < min) {
++count;
min = a[i];
}
}
cout << count << endl;
return 0;
}
| 7 | CPP |
import sys,os,io,time
if os.path.exists('input.txt'):
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
def main():
n=int(input())
arr=list(map(int,input().split()))
mi=arr[0]
ma=arr[0]
res=0
for i in range(1,n):
if arr[i]<mi:
mi=arr[i]
res+=1
if arr[i]>ma:
ma=arr[i]
res+=1
print(res)
main() | 7 | PYTHON3 |
#ashu@gate22
n=int(input())
l=list(map(int,input().split()))
mx=mn=l[0]
no=0
for i in l:
if i>mx :
no+=1
mx=i
elif i<mn:
no+=1
mn=i
print(no) | 7 | PYTHON3 |
n = int(input())
nums = [int(x) for x in input().split()]
maxn = minn = nums[0]
amaze = 0
for x in range(1,n):
if nums[x] > maxn:
maxn = nums[x]
amaze += 1
if nums[x] < minn:
minn = nums[x]
amaze += 1
print(amaze)
| 7 | PYTHON3 |
input()
amazing = 0
performances = [int(num) for num in input().split()]
best = performances[0]
worst = performances[0]
for performance in performances[1:]:
if performance > best:
best = performance
amazing += 1
if performance < worst:
worst = performance
amazing += 1
print(amazing)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
maxb = a[0]
minb = a[0]
cnt = 0
for i in range(1, n):
if a[i] < minb:
minb = a[i]
cnt += 1
if a[i] > maxb:
maxb = a[i]
cnt += 1
print(cnt) | 7 | PYTHON3 |
n = int(input())
a = input().split()
min1 = int(a[0])
max1 = int(a[0])
k = 0
l = 0
for i in range(1,n):
if int(a[i]) > max1:
max1 = int(a[i])
k+=1
for j in range(1,n):
if int(a[j]) < min1:
min1 = int(a[j])
l+=1
print(k+l) | 7 | PYTHON3 |
n, x, r = int(input()), input().split(), 0
mx = mn = int(x.pop(0))
for i in x:
y = int(i)
if y > mx:
mx, r = y, r+1
else:
if y < mn:
mn, r = y, r+1
print(r)
| 7 | PYTHON3 |
n=int(input())
x=0
a=list(map(int,input().split()))
mi=a[0]
ma=a[0]
for i in a[1:]:
if i>ma:
ma=i
x+=1
elif i<mi:
mi=i
x+=1
print(x)
| 7 | PYTHON3 |
n=int(input())
count=0
N=list(map(int, input().split()))
for i in range(1,len(N)):
max1 = max(N[0:i])
min1 = min(N[0:i])
if N[i]>max1 or N[i]<min1:
count+=1
print (count) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().strip().split()))
mi=ma=a[0]
c=0
for i in range(1,n):
if(a[i]<mi):
mi=a[i]
c+=1
elif a[i]>ma :
ma=a[i]
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
x = a[0]
y = a[0]
count = 0
for i in a:
if i > x:
x = i
count+=1
if i < y:
y = i
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
s = []
c = 0
s.append(l[0])
for i in range(1,n):
if(l[i] > max(s)):
c = c + 1
elif(l[i] < min(s)):
c = c + 1
else:
c = c
s.append(l[i])
print(c) | 7 | PYTHON3 |
from sys import exit
n=int(input())
v=[int(x) for x in input().split()]
count=1
c=20000
if len(v)==1:
print('0')
exit(0)
for i in range(len(v)-1):
if v[i]!=v[i+1]:
c=i
break
if c==20000:
print('0')
exit(0)
if v[c]>v[c+1]:
l=v[c]
s=v[c+1]
for i in range(c+2,len(v)):
if v[i]>l:
count+=1
l=v[i]
elif v[i]<s:
count+=1
s=v[i]
print(count)
elif v[c]<v[c+1]:
s=v[c]
l=v[c+1]
for i in range(c+2,len(v)):
if v[i]>l:
count+=1
l=v[i]
elif v[i]<s:
count+=1
s=v[i]
print(count) | 7 | PYTHON3 |
n=int(input())
a=input().split()
b=[int(a[0])]
s=0
for i in range(1,n):
if int(a[i])>max(b) or int(a[i])<min(b):
s+=1
b.append(int(a[i]))
print(s)
| 7 | PYTHON3 |
n=int(input())
l=[int(i) for i in input().split(" ")]
count=0
maxi=mini=l[0]
for i in l[1:]:
if(i<mini):
count+=1
mini=i
elif(i>maxi):
count+=1
maxi=i
print(count) | 7 | PYTHON3 |
n = int(input())
data = list(map(int, input().split()))
M, m = data[0], data[0]
amazing = 0
for i in range(1, n):
if data[i] > M or data[i] < m:
amazing += 1
M = max(data[i], M)
m = min(data[i], m)
print(amazing)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.