solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
point_list = [int(x) for x in input().split()]
res = 0
max = point_list[0]
min = point_list[0]
for point in point_list:
if point > max:
res += 1
max = point
elif point < min:
res += 1
min = point
print(res) | 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
last=[s[0]]
lmin=s[0]
lmax=s[0]
r=0
for i in range(n-1):
last.append(s[i+1])
if s[i+1]==max(last) and lmax!=last[i+1] or s[i+1]==min(last) and lmin!=last[i+1]:
r+=1
if s[i+1]==max(last):
lmax=s[i+1]
if s[i+1]==min(last):
lmin=s[i+1]
print(r)
| 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
s = 0
for i in range(n):
for j in range(0, i):
if a[j]==a[i]:
a[i]='delete'
b=a.count('delete')
for i in range(b):
a.remove('delete')
for i in range(1, len(a)):
mina, maxa = a[0], a[0]
for j in range(0, i + 1):
if a[j] > maxa:
maxa = a[j]
if a[j] < mina:
mina = a[j]
if a[i] == mina or a[i] == maxa:
s += 1
print(s) | 7 | PYTHON3 |
'''
CF problem 155A
@autor Yergali B
'''
n=int(input())
a=list(map(int,input().split()))
Max, Min = a[0], a[0]
counter = 0
for x in a:
if x < Min:
Min = x
counter+= 1
if x > Max:
Max = x
counter+= 1
print(counter)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int x;
cin >> x;
int count = 0;
int maxi;
int mini;
for (int i = 0; i < x; i++) {
cin >> n;
if (i == 0) {
maxi = n;
mini = n;
}
if (n > maxi) {
count++;
maxi = n;
}
if (n < mini) {
count++;
mini = n;
}
}
cout << count << endl;
}
| 7 | CPP |
n = int(input())
a = [int(x) for x in input().split()]
count = 0
res = []
res.append(a[0])
for i in range(1,n):
temp = a[0:i+1]
if a[i] == max(temp):
if a[i] not in res:
count += 1
res.append(a[i])
elif a[i] == min(temp):
if a[i] not in res:
count += 1
res.append(a[i])
print(count) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
s = 0
for i in range(1,n):
if l[i] < min(l[:i]) or l[i] > max(l[:i]):
s+=1
print(s) | 7 | PYTHON3 |
n = int(input())
max = -1
min = 1e9
ans = 0
for i in map(int, input().split(' ')):
if i > max:
max = i
ans += 1
if i < min:
min = i
ans += 1
print(ans - 2) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = c = a[0]
ans = 0
for i in range(1, n):
if a[i] > b:
ans += 1
b = a[i]
if a[i] < c:
ans += 1
c = a[i]
print(ans)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
count=0
for i in a:
if i<min(b) or i>max(b):
count+=1
b.append(i)
print(count)
| 7 | PYTHON3 |
n=input()
li=list(map(int,input().split( )))
max=li[0]
min=li[0]
counter=0
for i in range(int(n)):
if max<li[i]:
max=li[i]
counter+=1
if min >li[i]:
min=li[i]
counter+=1
print(counter)
| 7 | PYTHON3 |
n = int(input())
points = list(map(int, input().split()))
a = []
count = 0
for i in points:
try:
if i > max(a):
count += 1
elif i < min(a):
count += 1
except ValueError:
pass
a.append(i)
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, max, min;
cin >> n;
int arr1[n], arr2[n];
for (int i = 0; i < n; i++) {
arr2[i] = 0;
}
for (int i = 0; i < n; i++) {
cin >> arr1[i];
}
max = arr1[0];
for (int i = 1; i < n; i++) {
if (arr1[i] > max) {
max = arr1[i];
arr2[i] = 1;
}
}
min = arr1[0];
for (int i = 1; i < n; i++) {
if (arr1[i] < min) {
min = arr1[i];
arr2[i] = 1;
}
}
int tot = 0;
for (int i = 0; i < n; i++) {
if (arr2[i] == 1) {
tot += 1;
}
}
cout << tot;
}
| 7 | CPP |
num = int(input())
results = input().split(" ")
cur_max = int(results[0])
cur_min = int(results[0])
answer = 0
for i in results:
val = int(i)
if cur_max < val:
cur_max = val
answer += 1
if cur_min > val:
cur_min = val
answer += 1
print(answer, end="")
| 7 | PYTHON3 |
# 155A - I_love_\%username\%
# https://codeforces.com/problemset/problem/155/A
def main():
n = int(input())
A = tuple(map(int, input().rstrip().split()))
ans, ma, mi = 0, A[0], A[0]
for i in A[1:]:
if i > ma:
ans += 1
ma = i
elif i < mi:
ans += 1
mi = i
print(ans)
if __name__ == "__main__":
main() | 7 | PYTHON3 |
n = int(input())
arr = [int(x) for x in input().split()]
highest = lowest = arr[0]
count = 0
for x in arr:
if x > highest:
count += 1
highest = x
elif x < lowest:
count += 1
lowest = x
print(count) | 7 | PYTHON3 |
n = int(input())
pnt = list(map(int, input().split()))
mx = pnt[0]
mn = pnt[0]
amazing = 0
for i in range(1, n) :
if pnt[i] > mx or pnt[i] < mn :
amazing += 1
mx = max(mx, pnt[i])
mn = min(mn, pnt[i])
print(amazing) | 7 | PYTHON3 |
n, lst = int(input()), list(map(int, input().split()))
print(sum([max(lst[:i]) < lst[i] or min(lst[:i]) > lst[i] for i in range(1, n)])) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
ma = a[0]
mn = a[0]
res = 0
for i in a[1::]:
if i > ma:
ma = i
res +=1
if i < mn:
mn = i
res += 1
print(res) | 7 | PYTHON3 |
n = int(input())
contest_scores = list(map(int, input().split()))
min_score = max_score = contest_scores[0]
result = 0
for k in range(1, len(contest_scores)):
tmp_score = contest_scores[k]
if tmp_score > max_score:
result += 1
if tmp_score < min_score:
result += 1
max_score = max(tmp_score, max_score)
min_score = min(tmp_score, min_score)
print(result) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
int min = -1;
int max = 10001;
int count = 0;
cin >> t;
int a[t];
for (int i = 0; i < t; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
for (int i = 1; i < t; i++) {
if (max < a[i]) {
max = a[i];
count++;
}
if (min > a[i]) {
min = a[i];
count++;
}
}
cout << count << endl;
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
b=[a[0]]
f=0
for i in range(1,n):
if a[i]>b[-1] or a[i]<b[0]:
f+=1
b+=[a[i]]
b.sort()
print(f)
| 7 | PYTHON3 |
n=int(input())
z=list(map(int,input().split()))
min=z[0]
max=z[0]
c=0
for i in range(1,n):
if(z[i]>max):
c=c+1
max=z[i]
if(z[i]<min):
c=c+1
min=z[i]
print(c) | 7 | PYTHON3 |
n = int(input()) - 1
if not n:
input()
print(0)
else:
m = [int(x) for x in input().split()]
pair = [0, -1]
pair[0] = m[0]
for item in m[1:]:
if item != pair[0]:
pair[1] = item
break
if pair[1] == -1:
print(0)
else:
pair.sort()
s = 1
for el in m[2:]:
if el > pair[1]:
pair[1] = el
s += 1
elif el < pair[0]:
pair[0] = el
s += 1
print(s)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().rstrip().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 |
n=int(input())
s=input().split()
k=[0]*(n+1)
for i in range(n):
k[i]=int(s[i])
a=b=k[0]
m=0
for i in range(1,n):
if k[i]<b:
m=m+1
b=k[i]
elif k[i]>a:
m=m+1
a=k[i]
print(m)
| 7 | PYTHON3 |
n = int(input())
s = list(map(int, input().split()))
maxi = mini = s[0]
ans = 0
for i in s[1:]:
if i > maxi:
ans += 1
maxi = i
elif i < mini:
ans += 1
mini = i
print(ans)
| 7 | PYTHON3 |
n = int(input())
l = input().split()
l = [int(x) for x in l]
high = l[0]
low = l[0]
count = 0
for i in range(n):
if l[i] > high:
high = l[i]
count += 1
elif l[i] < low:
low = l[i]
count += 1
else:
count += 0
print(count)
| 7 | PYTHON3 |
n = input()
score = input().split()
amazing = 0
bawah = int(score[0])
atas = int(score[0])
for i in score:
if int(i) < bawah:
amazing += 1
bawah = int(i)
elif int(i) > atas:
amazing += 1
atas = int(i)
print(amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, x;
long long int ans = 0;
long long int min = INT_MAX, max = INT_MIN;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> x;
if (i == 0) {
min = x;
max = x;
}
if (x < min) {
min = x;
ans++;
}
if (x > max) {
max = x;
ans++;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
lst = list(map(int,input().split()))
minMax = [lst[0],lst[0]]
count = 0
for i in range(len(lst)-1):
if lst[i+1]>lst[i] and lst[i+1]>max(minMax):
minMax[1] = lst[i+1]
count += 1
if lst[i+1]<lst[i] and lst[i+1]<min(minMax):
minMax[0] = lst[i+1]
count += 1
print(count)
| 7 | PYTHON3 |
num = eval(input())
score = [eval(i) for i in input().split()]
a = score[0]
b = score[0]
count = 0
for i in range(num):
if score[i] > a or score[i] < b: count += 1
a = max(a, score[i])
b = min(b, score[i])
print(count) | 7 | PYTHON3 |
n=int(input())
str1=input()
list1=str1.split(" ")
list2=[int(list1[0])]
x=0
for i in range(1,n):
if int(list1[i])>max(list2) or int(list1[i])<min(list2):
x=x+1
list2.append(int(list1[i]))
else:
list2.append(int(list1[i]))
print(x) | 7 | PYTHON3 |
n = int(input())
nums = input().split()
amaz = 0
maxim,minim = int(nums[0]),int(nums[0])
for i in range(1,n):
nums[i] = int(nums[i])
if nums[i] < minim:
minim = nums[i]
amaz += 1
elif nums[i] > maxim:
maxim = nums[i]
amaz += 1
print(amaz)
| 7 | PYTHON3 |
def Boredom():
n = int(input())
x = list(map(int, input().split()))
if n == 0 or n == 1:
print("0")
else:
small = x[0]
big = x[0]
times = 0
for i in range(1, n):
if x[i] < small:
small = x[i]
times += 1
elif x[i] > big:
big = x[i]
times += 1
print(times)
Boredom()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a;
int x, y = 10001, z = -1;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
if (x < y) {
y = x;
a++;
}
if (x > z) {
z = x;
a++;
}
}
cout << a - 2 << endl;
return 0;
}
| 7 | CPP |
n = int(input())
min_s = None
max_s = None
cnt = 0
for s in input().split():
if min_s == None:
min_s = int(s)
if max_s == None:
max_s = int(s)
if min_s > int(s):
min_s = int(s)
cnt += 1
elif max_s < int(s):
max_s = int(s)
cnt += 1
print(cnt)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
min_so_far = max_so_far = a[0]
num_amazing = 0
for i in range(1,n):
if a[i] > max_so_far:
num_amazing += 1
max_so_far = a[i]
elif a[i] < min_so_far:
num_amazing += 1
min_so_far = a[i]
print(num_amazing) | 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split()))[:n]
maxi=m[0]
mini=m[0]
s=0
for i in range(1,n):
if (m[i]<mini):
s=s+1
mini=m[i]
elif(m[i]>maxi):
s=s+1
maxi=m[i]
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, each, mx, mn, count(0);
cin >> n;
cin >> each;
mx = each;
mn = each;
while (n-- > 1) {
cin >> each;
if (each < mn) {
count++;
mn = each;
} else if (each > mx) {
count++;
mx = each;
}
}
cout << count << "\n";
return 0;
}
| 7 | CPP |
# -*- coding: utf-8 -*-
"""
Created on Fri Oct 16 19:05:39 2020
@author: feibiaodi
"""
n=int(input())
d=[int(x) for x in input().split()]
c=0
for i in range(1,n):
if d[i]>max(d[0:i]) or d[i]<min(d[0:i]):
c=c+1
print(c) | 7 | PYTHON3 |
n = int(input())
points = [int(c) for c in input().split()]
ans = 0
_min, _max = 10001, 0
for i, p in enumerate(points):
if i == 0:
_min = _max = p
elif p > _max:
_max = p
ans += 1
elif p < _min:
_min = p
ans += 1
print(ans)
| 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
mx = lst[0]
mn = lst[0]
cur = lst[0]
solve = 0
for i in range(len(lst)):
if i == 0:
continue
if lst[i] > mx:
mx = lst[i]
solve += 1
if lst[i] < mn:
mn = lst[i]
solve += 1
print(solve)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
counter = 0
maxNum = minNum = a[0]
for num in a:
if num > maxNum:
maxNum = num
counter += 1
if num < minNum:
minNum = num
counter += 1
print(counter) | 7 | PYTHON3 |
n=int(input())
c=[int(i) for i in input().split()]
best=c[0]
worst=c[0]
amazing=0
for i in range(1,n):
if c[i]>best:
amazing+=1
best=c[i]
if c[i]<worst:
amazing+=1
worst=c[i]
print(amazing)
| 7 | PYTHON3 |
n=int(input())
s=set()
li=[int(i)for i in input().split()]
s.add(li[0])
m=li[0]
n=li[0]
c=0
for i in li[1:]:
if i not in s and ((i>m and i>n) or (i<m and i<n)):
s.add(i)
c=c+1
m=max(m,i)
n=min(n,i)
print(c) | 7 | PYTHON3 |
n = int(input())
inp = input().split()
pts = [int(i) for i in inp]
min_pts = pts[0]
max_pts = pts[0]
ans = 0
for i in pts:
if i < min_pts:
ans += 1
min_pts = i
elif i > max_pts:
ans += 1
max_pts = i
print (ans)
| 7 | PYTHON3 |
n=input()
n=int(n)
m=input()
m=m.split()
a=[]
for i in range(n):
a.append(int(m[i]))
ma=a[0]
mi=a[0]
count=0
for i in range(1,n):
if(a[i]<mi):
mi=a[i]
count+=1
elif(a[i]>ma):
ma=a[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
x=[int(x) for x in input().split()]
if len(x)<2:
print(0)
elif len(x)>=2:
for i in range (n-1):
if x[i]== x[i+1]:
c=0
else:
c=1
for i in range (n-1):
if x[i]!=x[i+1]:
b=min(x[i],x[i+1])
a=max(x[i], x[i+1])
break
for i in range(2,n):
if x[i]>a :
c+=1
a=x[i]
elif x[i]<b:
c+=1
b=x[i]
print(c)
| 7 | PYTHON3 |
t=int(input())
l=list(map(int,input().split()))
m=l[0]
mx=l[0]
count=0
for i in l:
if mx<i:
count+=1
mx=i
if i<m:
count+=1
m=i
print(count)
| 7 | PYTHON3 |
n=int(input())
p=[int(i)for i in input().split()]
a=0
for i in range(1,len(p)):
if p[i]>max(p[0:i]):
a+=1
elif p[i]<min(p[0:i]):
a+=1
print(a)
| 7 | PYTHON3 |
n = int(input())
com = list(map(int, input().split()))
min = com[0]
max = com[0]
res = 0
for i in range(1, len(com)):
if com[i] < min:
min = com[i]
res += 1
elif com[i] > max:
max = com[i]
res += 1
print(res)
| 7 | PYTHON3 |
a=int(input())
b=input().split()
mi=int(b[0])
ma=int(b[0])
z=0
for i in range(a):
r=int(b[i])
if r>ma:
ma=r
z+=1
elif r<mi:
mi=r
z+=1
print(z)
| 7 | PYTHON3 |
length = int(input())
scores = [int(i) for i in input().split()]
max = scores[0]
min = scores[0]
counter = 0
for i in range(length-1):
if scores[i+1] > max:
max = scores[i+1]
counter += 1
if scores[i+1] < min:
min = scores[i+1]
counter += 1
print(counter) | 7 | PYTHON3 |
n=int(input())
line=input().split()
list=[int(x) for x in line]
counter=0
for i in range(1,n):
l=list[:i]
if list[i]>max(l) or list[i]<min(l):
counter+=1
print(counter) | 7 | PYTHON3 |
'''
instagram : essipoortahmasb2018
channel Telegram : essi_python
'''
i = input
i()
count = 0
l = list(map(int,i().split()))
MAX = MIN = l[0]
c = 0
for j in range(1,len(l)):
if l[j] > MAX:
MAX = l[j]
c+=1
elif l[j] < MIN:
MIN = l[j]
c+=1
else:
pass
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n;
cin >> n;
int arr[n];
int mn, mx;
cin >> mn;
int c = 0;
mx = mn;
for (int i = 1; i < n; i++) {
cin >> arr[i];
if (arr[i] > mx) {
c++;
mx = arr[i];
} else if (arr[i] < mn) {
c++;
mn = arr[i];
}
}
cout << c;
}
| 7 | CPP |
n=int(input())
a=(input().split())
maks=int(a[0])
mini=int(a[0])
s=0
if(n==1):
print(s)
exit()
else:
for i in range(0, n):
if(int(a[i])>maks):
s=s+1;
maks=int(a[i])
elif(int(a[i])<mini):
s=s+1
mini=int(a[i])
print(s) | 7 | PYTHON3 |
def solve(scores):
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
return amazing
n = int(input())
scores = input().split(" ")
scores = [int(i) for i in scores]
print(solve(scores)) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
performances = 0
more = l[0]
smaller = l[0]
for i in l[1:]:
if i > more:
performances += 1
more = i
elif i < smaller:
performances += 1
smaller = i
print(performances) | 7 | PYTHON3 |
n = int(input())
numbers = list(map(int, input().split()))
maxi = mini = list(numbers)[0]
wow = 0
for i in numbers:
if i < mini:
wow+=1
mini = i
elif i > maxi:
wow+=1
maxi = i
else:
continue
print(wow)
| 7 | PYTHON3 |
n = int(input())
s = list(map(int, input().split()))
res = 0
cmin, cmax = s[0], s[0]
for i in range(1, n):
if s[i] > cmax:
res += 1
cmax = s[i]
elif s[i] < cmin:
res += 1
cmin = s[i]
print(res) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
mn = mx = a[0]
awe = 0
for i in range(1, n):
if mn > a[i]:
awe += 1
mn = a[i]
if mx < a[i]:
awe += 1
mx = a[i]
print(awe)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(1,n):
if a[i]> max(a[0:i]) or a[i]< min(a[0:i]):
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
maxi = a[0]
mini = a[0]
ans = 0
for i in range(1,n):
if(a[i]>maxi):
ans+=1
maxi = a[i]
if(a[i]<mini):
ans+=1
mini = a[i]
print(ans) | 7 | PYTHON3 |
a = input()
b = list(map(int,input().strip().split()))
c = None
d = None
l = len(b)
count = 0
for i in range(0,l):
if c is None and d is None:
c = b[0]
d = b[0]
if b[i] > c:
count += 1
c = b[i]
elif b[i] < d:
count += 1
d = b[i]
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int b = a[0], c = a[0], x = 0;
for (int i = 0; i < n; i++) {
if (a[i] > b) {
b = a[i];
x++;
}
if (a[i] < c) {
c = a[i];
x++;
}
}
cout << x;
return 0;
}
| 7 | CPP |
n = int(input())
points = 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 points[i] > points[a]:
subcounter_highest = subcounter_highest + 1
elif points[i] < points[a]:
subcounter_lowest = subcounter_lowest + 1
if subcounter_highest == i or subcounter_lowest == i:
counter = counter + 1
print(counter) | 7 | PYTHON3 |
n=int(input())
num=list(map(int,input().split()))
count=0
for i in range(1,n):
l=num[:i]
ls=[j<num[i] for j in l]
ps=[j>num[i] for j in l]
if all(ls) or all(ps):
count+=1
print(count) | 7 | PYTHON3 |
def trial():
num = int(input())
ps = list(map(int, input().split()))
counter = 0
move = ps[0]
low = ps[0]
for i in range(1, num):
if ps[i] < low:
counter += 1
low = ps[i]
elif ps[i] > move:
counter += 1
move = ps[i]
return print(counter)
trial() | 7 | PYTHON3 |
def _155A(scores):
count = 0
min_score = scores[0]
max_score = scores[0]
for index, score in enumerate(scores):
if index != 0:
if score > max_score:
max_score = score
count += 1
elif score < min_score:
min_score = score
count += 1
return(count)
input()
scores = list(map(lambda x: int(x), input().split()))
print(_155A(scores))
| 7 | PYTHON3 |
n=int(input())
val=list(map(int,input().split()))
inti=val[0]
inti2=val[0]
count=0
for i in range(1,n):
if val[i]>inti:
inti=val[i]
count+=1
if val[i]<inti2:
inti2=val[i]
count+=1
print(count) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
best = l[0]
worst = l[0]
ans = 0
for i in range(1,n):
if l[i]>best:
ans+=1
best = l[i]
if l[i]<worst:
ans += 1
worst = l[i]
print(ans) | 7 | PYTHON3 |
n=int(input())
l=input().split()
mi=int(l[0])
ma=mi
ans=0
for i in range(1,n):
s=int(l[i])
if s>ma:
ma=s
ans+=1
if s<mi:
mi=s
ans+=1
print(ans)
| 7 | PYTHON3 |
n = int(input())
score = [int(i) for i in input().split()]
amaze = 0
ma = mi = score[0]
for i in range(1,n):
if (score[i] > ma):
ma = score[i]
amaze += 1
elif (score[i] < mi):
mi = score[i]
amaze += 1
print(amaze)
| 7 | PYTHON3 |
n = int(input())
g = []
r = []
event = 0
for i in range(n):
a = map(int,input().split())
g += a
break
for u in g:
r.append(u)
if u == max(r) or u == min(r):
if r.count(u) == 1:
event += 1
else:
continue
else:
event += 0
print(event - 1) | 7 | PYTHON3 |
n = int(input())
num_list = list(map(int, input().split()))
max_num = num_list[0]
min_num = num_list[0]
amaze_count = 0
for i in num_list:
if i> max_num:
amaze_count+=1
max_num = i
elif i< min_num:
amaze_count+=1
min_num = i
print(amaze_count)
| 7 | PYTHON3 |
a = int(input())
b = input()
list1 = [int(i) for i in b.split()]
m,n = [list1[0],list1[0]]
w = 0
for i in range(1,a):
if list1[i] > n:
w += 1
n = list1[i]
if list1[i] < m:
w += 1
m = list1[i]
print(w)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
unsigned int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int count = 0;
int min = arr[0];
int max = arr[0];
for (int i = 0; i < n; i++) {
if (max < arr[i]) {
count++;
max = arr[i];
} else if (min > arr[i]) {
count++;
min = arr[i];
}
}
cout << count;
}
| 7 | CPP |
n=int(input())
b=input().split()
t=[]
m=[]
score=0
for i in range(1,n+1):
t.append(int(b[i-1]))
if len(t)>1:
if t[-1]>max(m) or t[-1]<min(m):
score=score+1
m.append(int(b[i-1]))
else:
m.append(int(b[i-1]))
else:
m.append(int(b[i-1]))
print(score)
| 7 | PYTHON3 |
x = int(input())
y = [int(i) for i in input().split()]
b = 0
a = -1
z = 0
c = 999999
for i in y:
if a == -1:
a = i
c = i
else:
if i > a:
a = i
z += 1
elif i < c:
c = i
z += 1
print(z)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
small = 0
big = 0
s = 0
for i in range(n):
if i == 0:
big = small = a[i]
if a[i] > big:
big = a[i]
s += 1
if a[i] < small:
small = a[i]
s += 1
print(s)
| 7 | PYTHON3 |
n = int(input())
points = [int(i) for i in input().split()]
a = 0
minp, maxp = points[0], points[0]
for i in range(1,n):
if points[i] < minp:
minp = points[i]
a += 1
elif points[i] > maxp:
maxp = points[i]
a += 1
print(a)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int nax = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INTF = 2147483647;
const long long LLF = 9223372036854775807;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, a, majing = 0;
cin >> n;
cin >> a;
int best = a;
int worst = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > best) {
majing++;
best = a;
}
if (a < worst) {
majing++;
worst = a;
}
}
cout << majing << "\n";
return 0;
}
| 7 | CPP |
x=int(input())
a=list(map(int,input().split()))
mn=a[0]
mx=a[0]
ans=0
for i in range(1,x):
if a[i]<mn:
mn=a[i]
ans+=1
elif a[i]>mx:
mx=a[i]
ans+=1
print(ans) | 7 | PYTHON3 |
n = int(input())
ball = list(map(int, input().split()))
abd = 0
for el in range(1, n):
if ball[el] > max(ball[:el]) or ball[el] < min(ball[:el]):
abd += 1
print(abd) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
best, worst = l[0],l[0]
numPerformances = 0
for i in range(1,len(l)):
if l[i] < worst:
numPerformances += 1
worst = l[i]
elif l[i] > best:
numPerformances += 1
best = l[i]
print(numPerformances) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
minScore,maxScore,ans = arr[0],arr[0],0
for i in range(1,n):
if arr[i] < minScore:
ans += 1
minScore = arr[i]
elif arr[i] > maxScore:
ans += 1
maxScore = arr[i]
print(ans) | 7 | PYTHON3 |
n = int(input())
l = [int(m) for m in input().split()]
count = 0
for i in range(1, len(l)):
flag = True
for j in range(0,i):
if l[i] <= l[j]:
flag = False
break
if flag == True:
count = count + 1
for i in range(1, len(l)):
flag = True
for j in range(0,i):
if l[i] >= l[j]:
flag = False
break
if flag == True:
count = count +1
print(count)
| 7 | PYTHON3 |
n = int(input())
score = list(map(int,input().split()))
amazing = 0
ma = mi = score[0]
for i in range(n-1):
if score[i+1] < mi:
amazing += 1
mi = score[i+1]
if score[i+1] > ma:
amazing += 1
ma = score[i+1]
print(amazing)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
mi=l[0]
ma=l[0]
c=0
for i in range(1,n):
if(l[i]>ma):
c+=1
ma=l[i]
elif(l[i]<mi):
c+=1
mi=l[i]
print(c) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
ma=a[0]
mi=a[0]
m=0
for i in range(1,n):
if a[i]>ma:
m+=1
ma=a[i]
elif a[i]<mi:
m+=1
mi=a[i]
print(int(m)) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
mn = 0
mx = 0
count = 0
for i in range(n):
if i == 0:
mn = arr[0]
mx = arr[0]
continue
if mn <= arr[i] <= mx:
continue
if mn > arr[i]:
mn = arr[i]
count += 1
elif mx < arr[i]:
mx = arr[i]
count += 1
print(count) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
max=min=a[0]
c=0
for i in range(1,n):
if max>a[i]:
c=c+1
max=a[i]
elif min<a[i]:
min=a[i]
c=c+1
print(c) | 7 | PYTHON3 |
a=int(input())
sa=input().split(' ')
sa2=[]
for element in sa:
sa2.append(int(element))
maxim=sa2[0]
minim=sa2[0]
count=0
for x in range(1, len(sa2)):
if sa2[x]<minim:
count+=1
minim=sa2[x]
if sa2[x]>maxim:
count+=1
maxim=sa2[x]
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0, a[1000];
cin >> n;
cin >> a[0];
int mx = a[0];
int mn = a[0];
for (int i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] > mx) {
c++;
mx = a[i];
}
if (a[i] < mn) {
c++;
mn = a[i];
}
}
cout << c;
return 0;
}
| 7 | CPP |
n=int(input())
k=0
a=[int(n) for n in input().split(" ")]
rec=a[0]
antirec=a[0]
i=1
for i in range(len(a)):
if a[i]>rec:
rec=a[i]
k=k+1
elif a[i]<antirec:
antirec=a[i]
k=k+1
print(k)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int, input().split()))
count=0
min=l[0]
max=l[0]
for i in range(1,n):
if l[i]<min:
min=l[i]
count+=1
elif l[i]>max:
max=l[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
if len(a)<=1:
print(0)
else:
x=0
for i in range(1, n):
if (a[i]>max(a[0:i])) or (a[i]<min(a[0:i])):
x+=1
print(x)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
count=0
for i in range(1,n):
b=a[0:i+1]
if min(b[0:i])>b[-1] or max(b[0:i])<b[-1]:
count+=1
print(count) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.