solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n=(int)(input())
s=list(map(int, input().strip().split(" ")))
count=0
for i in range(n-1):
if(max(s[:i+1])<s[i+1]):
count+=1
elif(min(s[:i+1])>s[i+1]):
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
if n==1:
print ('0')
exit()
m=1
max=max(a[0],a[1])
min=min(a[0],a[1])
for i in range (2,n):
if a[i]>max:
max=a[i]
m+=1
elif a[i]<min:
min=a[i]
m+=1
if a[0]==a[1]:
m-=1
print (m)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
mx=0
mn=0
ans=0
for i in range(n):
eq=l[0]-l[i]
if eq>0:
if abs(eq)>abs(mn):
mn=eq
ans+=1
elif eq<0:
if abs(eq)>abs(mx):
mx=eq
ans+=1
print(ans)
| 7 | PYTHON3 |
# https://codeforces.com/problemset/problem/155/A
import sys
#-----------------------------------------------------------------------------#
try:
sys.stdin = open('inputs.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
finally:
input = sys.stdin.readline
print = sys.stdout.write
#-----------------------------------------------------------------------------#
n = int(input())
points = list(map(int, input().split()))
max_p = points[0]
min_p = points[0]
amazing_count = 0
for point in points:
if point > max_p:
amazing_count += 1
max_p = point
elif point < min_p:
amazing_count += 1
min_p = point
print(str(amazing_count))
| 7 | PYTHON3 |
n=int(input())
score=[int(i) for i in input().split()]
x=score[0];y=x;am=0
for i in score[1:]:
if i>x:
am+=1
x=i
elif i<y:
am+=1
y=i
print(am) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
ans=0
big=a[0]
small=a[0]
for i in range(1,n):
if a[i]>big:
big=a[i]
ans+=1
elif a[i]<small:
small=a[i]
ans+=1
print(ans) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sat Jun 27 15:57:25 2020
@author: pc612
"""
n = int(input())
l = list(map(int, input().split()))
count = 0
m = mi = l[0]
for i in range(1, n):
if l[i]>m:
m = l[i]
count += 1
elif l[i]<mi:
mi = l[i]
count += 1
print(count) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
ans = 0
_max = l[0]
_min = l[0]
for i in range(1, n):
if l[i] > _max:
_max = l[i]
ans += 1
if l[i] < _min:
_min = l[i]
ans += 1
print (ans)
| 7 | PYTHON3 |
_ = input()
scores = [int(x) for x in input().strip().split(' ')]
cnt = 0
max_re = min_re = scores[0]
for x in scores[1:]:
if x > max_re:
max_re = x
cnt += 1
elif x < min_re:
min_re = x
cnt += 1
print(cnt) | 7 | PYTHON3 |
number = int(input())
Ip = input()
Ip = Ip.split(' ')
Ip =[int(x) for x in Ip]
Max, Min = Ip[0], Ip[0]
Total = 0
for i in range(1, number):
if Ip[i] > Max:
Total += 1
Max = Ip[i]
elif Ip[i] < Min:
Total += 1
Min = Ip[i]
print(Total) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
sum=0
max=a[0]
min=a[0]
for i in range(n):
if a[i]<min:
min=a[i]
sum+=1
if a[i]>max:
max=a[i]
sum+=1
print(sum)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
k=0
for i in range(1,n):
x=[a[0]]
for j in range(i):
x.append(a[j])
if a[i]<min(x):
k+=1
if a[i]>max(x):
k+=1
print(k)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split(' ')))
minP,maxP = a[0],a[0]
count = 0
for i in range(1,n):
if a[i] > maxP:
count += 1
maxP = a[i]
elif a[i] < minP:
count += 1
minP = a[i]
print(count)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
big = a[0]
small = a[0]
res = 0
for i in range(1, n):
if a[i] > big:
res += 1
big = a[i]
elif a[i] < small:
res += 1
small = a[i]
print(res) | 7 | PYTHON3 |
n = input()
arr = list(map(int, input().split()))
amazing = 0
for i, a in enumerate(arr):
if i == 0:
mx = mn = a
else:
if a > mx:
amazing += 1
mx = a
if a < mn:
amazing += 1
mn = a
print(amazing) | 7 | PYTHON3 |
input ()
a = list ( map ( int, input ().split () ) )
b = a[0]
c = a[0]
count = 0
for i in a :
if i > b :
b = i
count += 1
elif i < c :
c = i
count += 1
print ( count ) | 7 | PYTHON3 |
n=int(input())
point=input().split()
x=0
for i in range(len(point)):
point[i]=int(point[i])
l=[point[0]]
for i in range(len(point)-1):
if point[i+1]>max(l) or point[i+1]<min(l):
x=x+1
l+=[point[i+1]]
print(x) | 7 | PYTHON3 |
n = input()
l = list(map(int,input().split()))
m = l[0]
mn = l[0]
cnt = 0
for i in l:
if i >m :
m=i
cnt+=1
if i<mn:
cnt+=1
mn = i
print(cnt) | 7 | PYTHON3 |
n = int(input())
ls = list(map(int,input().split()))
c = 0
for i in range(1,n):
if ls[i]>max(ls[:i]) or ls[i]<min(ls[:i]):
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split(' ')]
a1=a[0]
a2=a[0]
i=1
ans=0
while i<n:
if a[i]>a1:
ans=ans+1
a1=a[i]
if a[i]<a2:
ans=ans+1
a2=a[i]
i=i+1
print (ans)
| 7 | PYTHON3 |
n=int(input())
l=map(int,input().split())
l1=list(l)
if(len(l1) == 1):
print("0")
else:
min=0
max=0
if(l1[0] <= l1[1]):
min=l1[0]
max=l1[1]
else:
min=l1[1]
max=l1[0]
count=1
if(l1[0] == l1[1]):
count=0
for i in range(2,len(l1)):
if(l1[i]<min):
count+=1
min=l1[i]
if(l1[i]>max):
count+=1
max=l1[i]
print(count)
| 7 | PYTHON3 |
input()
l = [int(x) for x in input().split()]
curMin = l[0]
curMax = l[0]
ans = 0
for x in l[1:]:
if x < curMin:
ans += 1
curMin = x
if x > curMax:
ans += 1
curMax = x
print(ans)
| 7 | PYTHON3 |
my_input=int(input())
my_scores=input()
my_scores=my_scores.split()
count=0
my_score=[]
for i in my_scores:
my_score.append(int(i))
big=my_score[0]
small=my_score[0]
for i in range(my_input):
if my_score[i]>big:
big=my_score[i]
count+=1
if my_score[i]<small:
small=my_score[i]
count+=1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int total, num, i, koita = 0;
scanf("%d", &total);
for (i = 0; i < total; i++) {
scanf("%d", &num);
v.push_back(num);
}
int maximum = v[0];
int minimum = v[0];
for (i = 1; i < total; i++) {
num = v[i];
if (num > maximum) {
maximum = num;
koita++;
}
if (num < minimum) {
minimum = num;
koita++;
}
}
printf("%d\n", koita);
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
c=0
max=a[0]
min=a[0]
for i in range(1,n):
if a[i]>max:
max=a[i]
c=c+1
if a[i]<min:
min=a[i]
c=c+1
print(c) | 7 | PYTHON3 |
def gr(key,idx,l):
for i in range(idx):
if(key<=l[i]):
return(False)
return(True)
def low(key,idx,l):
for i in range(idx):
if(key>=l[i]):
return(False)
return(True)
n=int(input())
l=list(map(int,input().split()))
count=0
for i in range(1,n):
if(low(l[i],i,l)):
count+=1
elif(gr(l[i],i,l)):
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
performance=list(map(int,input().split()))
max_grade=min_grade=performance[0]
count=0
for i in range(1,len(performance)):
if performance[i]>max_grade:
max_grade=performance[i]
count+=1
if performance[i]<min_grade:
min_grade=performance[i]
count+=1
print (count) | 7 | PYTHON3 |
result = 0
n = input()
str = input()
numbers = str.split(' ')
max = min = int(numbers[0])
for number in numbers[1:]:
if int(number) > max:
max = int(number)
result += 1
elif int(number) < min:
min = int(number)
result += 1
print(result) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
max = a[0]
min = a[0]
count = 0
for i in range (1,n):
if(a[i] > max):
count += 1
max = a[i]
elif(a[i] < min):
count +=1
min = a[i]
print (count) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
high = l[0]
low = l[0]
count = 0
for i in range(len(l)):
if(l[i]>high):
high = l[i]
count+=1
elif(l[i]<low):
low = l[i]
count+=1
print(count) | 7 | PYTHON3 |
input()
points = list(map(int, input().split()))
maximum = points[0]
minimum = points[0]
amazing = 0
for point in points[1:]:
if point > maximum:
amazing += 1
maximum = point
elif point < minimum:
amazing += 1
minimum = point
print(amazing)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
max=l[0]
min=l[0]
for i in range(0,len(l)):
if l[i]>max:
c=c+1
max=l[i]
if l[i]<min:
c=c+1
min=l[i]
print(c)
| 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
count=0
i=1
while i < len(b):
temp=b[:i]
if b[i]>max(temp) or b[i]<min(temp):
count+=1
i+=1
print(count) | 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
c=0
for i in range(1,n):
if s[i]>max(s[:i]) or s[i]<min(s[:i]):c+=1
print(c) | 7 | PYTHON3 |
a=int(input())
s=list(map(int,input().split()))
max=s[0]
min=s[0]
c=0
for i in range(1,a):
if(s[i]>max):
max=s[i]
c+=1
elif(s[i]<min):
min=s[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
A=[int(i) for i in input().split()]
Max=A[0]
Min=A[0]
ans=0
for i in range(n):
if A[i]>Max:
ans+=1
Max=A[i]
elif A[i]<Min:
ans+=1
Min=A[i]
print(ans)
#mshmmqn | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
min=a[0]
max=a[0]
c=0
i=1
while(i<n):
if a[i]>max:
c+=1
max=a[i]
if a[i]<min:
c+=1
min=a[i]
i+=1
print(c)
| 7 | PYTHON3 |
n = int(input())
s = [int(i)for i in input().split()]
cnt = 0
for i in range(1,n):
if s[i]>max(s[0:i]) or s[i]<min(s[0:i]):
cnt += 1
print(cnt) | 7 | PYTHON3 |
s = int(input())
arr = [int(x) for x in input().split()]
maxX, minX, cnt = arr[0], arr[0], 0
for x in arr:
if x > maxX:
cnt = cnt + 1
maxX = x
elif x < minX:
cnt = cnt + 1
minX = x
print(cnt) | 7 | PYTHON3 |
import sys
n=int(input())
l=list(map(int,input().split()))
mx=l[0]
mn=l[0]
cnt=0
if n>1:
for i in l:
if i>mx:
mx=i
cnt=cnt+1
if i<mn:
mn=i
cnt=cnt+1
print(cnt)
else:
print(cnt)
| 7 | PYTHON3 |
n=int(input())
l=[int(x) for x in input().split()]
m1=l[0]
m2=l[0]
c=0
for i in range(1,n):
if(l[i]<m1):
c+=1
m1=l[i]
elif(l[i]>m2):
c+=1
m2=l[i]
print(c)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
u=0
for i in range(1,n):
if l[i]>max(l[:i]) or l[i]<min(l[:i]): u+=1
print(u) | 7 | PYTHON3 |
res = 0
n = int(input())
x = [int(i) for i in input().split()]
mi = ma = x[0]
for i in range(len(x)):
if x[i]> ma:
res+=1
ma = max(ma, x[i])
elif x[i]<mi:
res+=1
mi = min(mi, x[i])
print(res)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return (a.first > b.first);
return (a.first < b.first);
}
struct point {
double x;
double y;
point(double x1, double y1) {
x = x1;
y = y1;
}
};
int main() {
int n;
cin >> n;
int k = 0;
int x;
cin >> x;
int mn = x, mx = x;
for (size_t i = 1; i < n; i++) {
cin >> x;
if (x > mx) {
k++;
mx = x;
}
if (x < mn) {
k++;
mn = x;
}
}
cout << k;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int maxi = arr[0];
int mini = arr[0];
int ctr = 0;
for (int i = 0; i < n; ++i) {
if (arr[i] > maxi) {
ctr++;
maxi = arr[i];
}
if (arr[i] < mini) {
ctr++;
mini = arr[i];
}
}
cout << ctr;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
max=a[0]
min=a[0]
k=0
for i in range(1,len(a)):
if a[i]>max:
max=a[i]
k=k+1
elif min>a[i]:
min=a[i]
k=k+1
print(k) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1001];
int n;
cin >> n;
int max, min;
int count = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
for (int i = 1; i < n; i++) {
if (a[i] > max) {
max = a[i];
count++;
}
if (a[i] < min) {
min = a[i];
count++;
}
}
cout << count << endl;
return 0;
}
| 7 | CPP |
n=int(input())
num=list(map(int, input().split()))
max=num[0]
min=num[0]
s=0
for i in range(n):
if num[i]>max:
max=num[i]
s+=1
elif num[i]<min:
min=num[i]
s+=1
print(s) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
ans = 0
for i in range(1, n):
if arr[i] < min(arr[:i]) or arr[i] > max(arr[:i]):
ans += 1
print(ans)
| 7 | PYTHON3 |
numEvent = int(input())
lista = [int(x) for x in input().split()]
best = lista[0]
worst = lista.pop(0)
amazing = 0
for i in lista:
if i > best:
amazing+=1
best = i
elif i < worst:
amazing+=1
worst = i
print(amazing)
| 7 | PYTHON3 |
n=int(input())
li=[int(x) for x in input().split()]
mini=li[0]
maxi=li[0]
tot=0
for i in range(1,n):
if(li[i]>maxi or li[i]<mini):
tot+=1
mini=min(mini,li[i])
maxi=max(maxi,li[i])
print(tot) | 7 | PYTHON3 |
t=int(input())
x=list(map(int,input().split()))
mini=maxi=x[0]
amazing=0
for i in range(1,t):
if x[i]<mini:
amazing+=1
mini=x[i]
elif x[i]>maxi:
amazing+=1
maxi=x[i]
print(amazing) | 7 | PYTHON3 |
n = int(input())
points = list(map(int, input().split()))[:n]
high = points[0]
low = points[0]
count = 0
for i in range(1, n):
if points[i] > high:
high = points[i]
count += 1
elif points[i] < low:
low = points[i]
count += 1
print(count)
| 7 | PYTHON3 |
def main():
n = int(input())
a = list(map(int, input().split()))
min = a[0]
max = a[0]
c = 0
for i in range(1, len(a)):
if a[i] < min:
c = c+1
min = a[i]
elif a[i] > max:
c = c+1
max = a[i]
print(c)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
n = int(input())
a = 0
score = list(map(int, input().split()))
for x in range(n):
if x == 0:
l, m = score[x], score[x]
if score[x] > m:
m = score[x]
a += 1
if score[x] < l:
l = score[x]
a += 1
print(a) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
ans = 0
for x in range(1, n):
g = 1
l = 1
for y in range(x):
if a[y] >= a[x]:
g = 0
if a[y] <= a[x]:
l = 0
if g ==1 or l == 1:
ans += 1
print(ans)
| 7 | PYTHON3 |
n = int(input())
l = input().split()
mi = int(l[0])
ma = int(l[0])
ans = 0
for i in range(1,n):
if int(l[i]) < mi:
ans += 1
mi = int(l[i])
elif int(l[i]) > ma:
ans += 1
ma = int(l[i])
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int mayor, resp, band, menor;
int n, i;
scanf("%d", &n);
int points[n];
for (i = 0; i < n; i++) {
scanf("%d", &points[i]);
}
mayor = points[0];
menor = points[0];
resp = 0;
band = 1;
for (i = 1; i < n; i++) {
if (points[i] > mayor) {
resp++;
mayor = points[i];
}
if (points[i] < menor) {
resp++;
menor = points[i];
}
}
printf("%d", resp);
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
worst=l[0]
best=l[0]
c=0
for i in range(1,len(l)):
if l[i]<worst:
c+=1
worst=l[i]
if l[i]>best:
c+=1
best=l[i]
print(c)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
b=a[0]
d=a[0]
e=0
for i in range(1,n):
if a[i]>b or a[i]<d:
e+=1
if a[i]>b:
b=a[i]
if a[i] <d:
d=a[i]
print(e) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
mi,ma = l[0],l[0]
a = 0
for i in range(1,n):
if mi>l[i]:
mi = l[i]
a+=1
if ma<l[i]:
a+=1
ma = l[i]
print(a) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int,input().split()))
if(n==1):
print(0)
else:
mini = 0
maxi =0
val = arr[0]
val1 = arr[1]
count =0
if(val1>val):
maxi = val1
mini = val
count+=1
elif(val1<val):
mini = val1
maxi = val
count+=1
else:
maxi = val
mini = val
for i in range(2,n):
if(arr[i]>maxi):
maxi = arr[i]
count+=1
elif(arr[i]<mini):
mini = arr[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
amazing=0
max1=min1=a[0]
for i in range(1,n):
if a[i]>max1:
max1=a[i]
amazing+=1
if a[i]<min1:
min1=a[i]
amazing+=1
print(amazing) | 7 | PYTHON3 |
input()
a = [int(x) for x in input().split()]
mi = a[0]
ma = mi
t = 0
for i in a:
if i > ma:
ma = i
t += 1
elif i < mi:
mi = i
t += 1
print(t) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
nCount=0
if len(a)==1:
print('0')
if len(a)>=2:
b=[a[0]]
for i in range(1,len(a)):
if a[i]>max(b):
nCount+=1
b.append(a[i])
elif a[i]<min(b):
nCount+=1
b.append(a[i])
else:
b.append(a[i])
print(nCount)
| 7 | PYTHON3 |
n=int(input())
sc=[int(i) for i in input().split()]
ans=0
for i in range (1,n):
if sc[i]>max(sc[:i]) or sc[i]<min(sc[:i]):
ans+=1
else:
pass
print(ans) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
min_a = a[0]
max_a = a[0]
ans = 0
for i in range(len(a)):
if a[i] > max_a:
max_a = a[i]
ans += 1
if a[i] < min_a:
min_a = a[i]
ans += 1
print(ans) | 7 | PYTHON3 |
n=int(input())
x=list(map(int,input().split()))
amazing=0
for i in range(1,len(x)):
if x[i]>max(x[:i]) or x[i]<min(x[:i]):
amazing=amazing+1
print(amazing) | 7 | PYTHON3 |
input()
a=list(map(int,input().split()))
amazing=0
maximun=minimun=a[0]
for i in range(1,len(a)):
if a[i]>maximun:
amazing+=1
maximun=a[i]
elif a[i]<minimun:
amazing+=1
minimun=a[i]
print(amazing)
| 7 | PYTHON3 |
n= int(input())
scores = [int(s) for s in input().split()]
maxi = scores[0]
mini = scores[0]
r = 0
for i in scores:
if i> maxi:
maxi = i
r+=1
if i< mini:
mini = i
r+=1
print(r)
| 7 | PYTHON3 |
n=int(input())
l=[int(e) for e in input().split()]
max=l[0]
min=l[0]
cl=0
for e in l[1:]:
if(e<min):
cl+=1
min=e
if(e>max):
cl+=1
max=e
print(cl) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
x=0
for i in range(1, n):
t=i
for j in range(i):
if a[j]<a[i]:
t-=1
if t==0:
x+=1
for i in range(1, n):
t=i
for j in range(i):
if a[j]>a[i]:
t-=1
if t==0:
x+=1
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0, n, max, a, min;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
max = a;
min = a;
} else if (a > max) {
max = a;
count++;
} else if (a < min) {
min = a;
count++;
}
}
cout << count << endl;
return 0;
}
| 7 | CPP |
n = int(input())
scores = [int(x) for x in input().split()]
performance = [scores[0]]
amazing = 0
for i in range(1,n):
if scores[i] > max(performance) or scores[i] < min(performance):amazing += 1
performance.append(scores[i])
print(amazing)
| 7 | PYTHON3 |
n = int(input())
l = [int(i) for i in input().split()]
c = 0
mini = min(l)
if n==1:
print(0)
else:
last = l[0]
mini = l[0]
for i in range(1,n):
if(l[i] > last):
last = l[i]
c+=1
if(l[i] < mini):
mini = l[i]
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
s=input()
a=[int(x) for x in s.split()]
min=a[0]
max=a[0]
ans=0
for x in range(1,n):
if a[x]>max:
max=a[x]
ans+=1
elif a[x]<min:
min=a[x]
ans+=1
print(ans) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
count=0
l1=1
for i in range(1,n):
flag=0
a=0
m=l[i]
# print("+")
for j in range(i-1,-1,-1):
# print(l[j])
if m>l[j]:
flag+=1
elif m<l[j]:
a+=1
# print(flag,a,l1)
if flag == l1 or a == l1:
count+=1
l1+=1
print(count) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
his =[]
his.append(a[0])
k=0
for i in range(1,n):
maxx=max(his)
minn=min(his)
if a[i]>maxx or a[i]<minn:
k+=1
his.append(a[i])
print(k) | 7 | PYTHON3 |
n = int(input())
a = [int(s) for s in input().split()]
maxi, mini, k = a[0],a[0],0
for i in range(1,len(a)):
if maxi < a[i]:
maxi = a[i]
k += 1
elif mini > a[i]:
mini = a[i]
k += 1
print(k) | 7 | PYTHON3 |
import math
import sys
import collections
# imgur.com/Pkt7iIf.png
def getdict(n):
d = {}
if type(n) is list:
for i in n:
if i in d:
d[i] += 1
else:
d[i] = 1
else:
for i in range(n):
t = ii()
if t in d:
d[t] += 1
else:
d[t] = 1
return d
def cdiv(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a*b) // math.gcd(a, b)
n = mi()
a = li()
cmin = cmax = a[0]
r = 0
for i in a:
if i > cmax:
r += 1
cmax = i
if i < cmin:
r += 1
cmin = i
print(r)
| 7 | PYTHON3 |
def main():
contests = int(input())
arr = input().split(' ')
for i in range(0, len(arr)):
arr[i] = int(arr[i])
high = arr[0]
low = arr[0]
curr = 0
for i in range(1, len(arr)):
if high < arr[i]:
high = arr[i]
curr+=1
elif low > arr[i]:
low = arr[i]
curr+=1
print(curr)
main()
| 7 | PYTHON3 |
def main():
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)
main() | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
maxx,minn,cnt=l[0],l[0],0
for ele in l:
if ele>maxx:
maxx=ele
cnt+=1
if ele<minn:
minn=ele
cnt+=1
print(cnt)
| 7 | PYTHON3 |
n = int(input())
p = [int(i) for i in input().split(' ')]
prev = [p[0]]
a = 0
for i in p[1:]:
if i < min(prev) or i > max(prev):
a += 1
prev.append(i)
print(a)
| 7 | PYTHON3 |
t=int(input())
p=list(map(int,input().split()))
min_array=[]
max_array=[]
for i in range(1,t):
flag=1
for j in range(i):
if p[j]>p[i] or p[j]==p[i]:
flag=0
break
if flag!=0:
min_array.append(i)
for i in range(1,t):
flag=1
for j in range(i):
if p[j]<p[i] or p[j]==p[i]:
flag=0
break
if flag!=0:
max_array.append(i)
print(len(min_array)+len(max_array)) | 7 | PYTHON3 |
t=int(input())
arr=list(map(int,input().split()))
mi=arr[0]
ma=arr[0]
c=0
for i in range(len(arr)):
if arr[i]>ma:
c+=1
ma=arr[i]
if arr[i]<mi:
c+=1
mi=arr[i]
print(c)
| 7 | PYTHON3 |
n=int(input())
li=[int(i)for i in input().split()]
l=len(li)
c=0
count=0
d=0
lis=li
for i in range(l):
c=0
d=0
for j in range(i):
if j==i:
break
if li[i]>lis[j]:
c=c+1
if c==i:
count=count+1
if li[i]<lis[j]:
d=d+1
if d==i:
count=count+1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10000], high, low, amaze = 0;
cin >> n;
cin >> a[0];
if (n == 1) {
cout << "0";
return 0;
}
cin >> a[1];
high = a[0];
if (a[1] > high) {
high = a[1];
low = a[0];
} else {
low = a[1];
}
if (a[0] != a[1]) {
amaze++;
}
if (n == 2) {
cout << amaze;
return 0;
}
for (int i = 2; i < n; i++) {
cin >> a[i];
if (a[i] > high) {
high = a[i];
amaze++;
}
if (a[i] < low) {
low = a[i];
amaze++;
}
}
cout << amaze;
return 0;
}
| 7 | CPP |
n = int(input())
scores = list(map(int,input().split()))
smallest = largest = scores[0]
count = 0
for score in scores[1:]:
if score < smallest:
smallest = score
count += 1
if score > largest:
largest = score
count += 1
print(count) | 7 | PYTHON3 |
def solve(lst):
min_val = max_val = lst[0]
amazing = 0
for i in lst[1:]:
if i < min_val:
min_val = i
amazing += 1
elif i > max_val:
max_val = i
amazing += 1
return amazing
n = int(input())
scores = list(map(int, input().split()))
print(solve(scores))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
ma = a[0]
mi = a[0]
r = 0
if len(a)<2:
print(0)
exit()
for i in a:
if i > ma:
ma = i
r += 1
if i < mi:
mi = i
r += 1
print(r) | 7 | PYTHON3 |
n = int(input())
l = input().split()
k = 0
score = 0
maax = int(l[0])
miin = int(l[0])
while k < n:
if int(l[k])>maax:
score = score + 1
maax = int(l[k])
if int(l[k])<miin:
score = score + 1
miin = int(l[k])
k = k + 1
print(score)
| 7 | PYTHON3 |
def main():
n = int(input())
scores = list(map(int , input().split()))
m, M, count = scores[0], scores[0], 0
for i in range(1, n):
if m < scores[i]:
m = scores[i]
count += 1
elif M > scores[i]:
M = scores[i]
count+= 1
print(count)
main()
| 7 | PYTHON3 |
t=int(input())
lst=list(map(int,input().split()))
z=0
p=q=lst[0]
for i in range(1,len(lst)):
if(lst[i]<p):
p=lst[i]
z+=1
if(lst[i]>q):
q=lst[i]
z+=1
print(z) | 7 | PYTHON3 |
num = int(input())
scores = list(map(int, input().split()))
count = 0
minScore = scores[0]
maxScore = scores[0]
for i in range(1, len(scores)):
if scores[i] > maxScore:
count += 1
maxScore= scores[i]
continue
if scores[i] < minScore:
count += 1
minScore = scores[i]
print(count)
| 7 | PYTHON3 |
n = int(input());
ar = [int(x) for x in input().split()];
max = ar[0];
min = ar[0];
c = 0;
for i in range(1,n):
if(max < ar[i]):
c = c+1;
max = ar[i];
elif(min > ar[i]):
min = ar[i];
c = c+1
print(c); | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
maximum=a.pop(0)
minimum=maximum
c=0
for i in a:
if i>maximum:
c=c+1
maximum=i
elif i<minimum:
c=c+1
minimum=i
print(c)
| 7 | PYTHON3 |
numScores = int(input())
scoreList = [int(x) for x in input().split()]
newList = []
newList.append(scoreList[0])
counter = 0
for i in range (1,numScores):
a = max(newList)
b = min(newList)
newList.append(scoreList[i])
if newList[i] > a or newList[i] < b:
counter += 1
print (counter)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
l=[arr[0]]
s=0
for i in range(1,n):
if(max(l)<arr[i] or arr[i]<min(l)):
s+=1
l.append(arr[i])
print(s)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
for i in range(1,len(l)):
g=0
s=0
for j in range(i):
if l[i]>l[j]:
g+=1
if l[i]<l[j]:
s+=1
if g==i or s==i:
c+=1
print(c)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.