solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
scores = list(map(int, input().split(' ')))
count= 0
min, max= scores[0], scores[0]
for i in scores:
if i>max:
count+=1
max=i
elif i<min:
count+=1
min=i
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[1001];
bool lessornot(int index, int low, int high) {
bool flag = true;
for (int i = 0; i <= index; i++) {
if (arr[i] < low || arr[i] > high)
flag = true;
else
flag = false;
}
return flag;
}
int main() {
int n, c = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
int max = arr[0], low = arr[0];
for (int i = 0; i < n; i++) {
if (i == n - 1) i++;
if (arr[i] > max) max = arr[i];
if (arr[i] < low) low = arr[i];
if (lessornot(i + 1, low, max)) c++;
}
cout << c << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int max, min, ans = 0;
int f;
cin >> f;
max = f;
min = f;
for (int i = 0; i < n - 1; i++) {
int d;
cin >> d;
if (d > max) {
max = d;
ans++;
}
if (d < min) {
min = d;
ans++;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
arr = [int(i) for i in input().split()]
min = max = arr[0]
cnt = 0
for i in arr:
if max < i:
cnt += 1
max = i
if min > i:
cnt += 1
min = i
print(cnt) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
mini=a[0]
maxi=a[0]
udiviteln=0
for i in range(1,n) :
if a[i]>maxi :
maxi=a[i]
udiviteln+=1
elif a[i]<mini :
mini=a[i]
udiviteln+=1
print(udiviteln) | 7 | PYTHON3 |
test = int(input())
contest = input()
amazing = 0
allpoints = contest.split()
for i in range(0,test):
allpoints[i] = int(allpoints[i])
min_points = allpoints[0]
max_points = allpoints[0]
for i in range(1,test):
if allpoints[i] < min_points:
min_points = allpoints[i]
amazing += 1
elif allpoints[i] > max_points:
max_points = allpoints[i]
amazing += 1
print(amazing)
| 7 | PYTHON3 |
def coder(n,nums):
if n == 1:
return 0
m = int(nums[0])
l = m
c = 0
for i in range(1, n):
if int(nums[i]) > m:
m = int(nums[i])
c += 1
elif int(nums[i]) < l:
l = int(nums[i])
c += 1
return c
n=int(input())
nums=[]
nums=input().split()
print(coder(n,nums))
| 7 | PYTHON3 |
n=int(input( ))
sc=[int(i) for i in input( ).split( )]
if len(sc)==1:
print(0)
exit( )
else:
b=0
s=0
ma=0
mi=0
for i in range(1,n):
if sc[i]!=sc[0]:
b=i
s+=1
ma=max(sc[i],sc[0])
mi=min(sc[i],sc[0])
break
if s==0:
print(0)
exit( )
for i in range(b+1,n):
if sc[i]>ma:
s+=1
ma=sc[i]
elif sc[i]<mi:
s+=1
mi=sc[i]
print(s)
| 7 | PYTHON3 |
n = int(input())
li = input().split()
ma = int(li[0])
mi = int(li[0])
a = int(0)
for l in li[1:]:
if int(l) > ma:
a += 1
ma = int(l)
if int(l) < mi:
a += 1
mi = int(l)
print(a)
| 7 | PYTHON3 |
n=int(input())
r=list(map(int,input().split()))
mi=ma=r[0]
t=0
for i in range(1,n):
if r[i]<mi:
t+=1
mi=r[i]
if r[i]>ma:
t+=1
ma=r[i]
print(t)
| 7 | PYTHON3 |
n, a = int(input() ), list(map(int, input().split() ) )
mx = mn = a[0]
r = 0
for i in range(1, n):
if a[i] > mx:
mx = a[i]; r += 1
elif a[i] < mn:
mn = a[i]; r += 1
print(r)
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
mini=arr[0]
maxi=arr[0]
ans=0
for i in arr[1:]:
if i<mini:
ans+=1
mini=i
elif i>maxi:
ans+=1
maxi=i
print(ans)
| 7 | PYTHON3 |
def calc(n, nums):
if not nums:
return 0
c, mini, maxi = 0, nums[0], nums[0]
for i in range(1, n):
if nums[i] < mini:
mini = nums[i]
c+=1
elif nums[i] > maxi:
maxi = nums[i]
c+= 1
return c
# get inputs
n = int(input())
nums = list(map(int, input().split()))
print(calc(n, nums))
| 7 | PYTHON3 |
n = int(input())
a = input().split()
event = []
count = 0
for i in range(n):
if len(event) == 0:
event.append(int(a[i]))
elif len(event) == 1:
if int(a[i]) != int(a[i - 1]):
event.append(int(a[i]))
count += 1
else:
if int(a[i]) < min(event):
event.remove(min(event))
event.append(int(a[i]))
count += 1
elif int(a[i]) > max(event):
event.remove(max(event))
event.append(int(a[i]))
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
s=input().split()
mi=ma=int(s[0])
c=0
for i in range(1,n):
if(mi>int(s[i])):
mi=int(s[i])
c+=1
if(ma<int(s[i])):
ma=int(s[i])
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split()))
max=m[0]
min=m[0]
count1=0
count2=0
for i in range(1,n):
if(m[i]<min):
min=m[i]
count1=count1+1
elif(m[i]>max):
max=m[i]
count2=count2+1
else:
continue
count=count1+count2
print(count)
| 7 | PYTHON3 |
n = int(input().strip())
s = input().strip()
l = list(int(x) for x in s.split(' '))
mn = l[0]
mx = l[0]
c = 0
for i in range(1, n):
if l[i] > mx:
c += 1
mx = l[i]
elif l[i] < mn:
c += 1
mn = l[i]
print(c) | 7 | PYTHON3 |
n=int(input())
count=0
x=list(map(int,input().split()))
mx=x[0]
for i in range(n):
if x[i]>mx:
x[i],mx=mx,x[i]
count=count+1
mm=x[0]
for i in range(n):
if x[i]<mm:
x[i],mm=mm,x[i]
count=count+1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[1005];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
int mn = a[0], mx = a[0], sol = 0;
for (int i = 1; i < n; ++i) {
if (a[i] < mn || a[i] > mx) ++sol;
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
printf("%d\n", sol);
return 0;
}
| 7 | CPP |
n=int(input())
point=[int(x) for x in input().split()]
ma=point[0]
mi=point[0]
a=0
for i in range (1,n):
if point[i]>ma:
a+=1
ma=point[i]
elif point[i]<mi:
a+=1
mi=point[i]
print(a) | 7 | PYTHON3 |
n=int(input())
l=list(map(int, input().split()))
high = l[0]
low=l[0]
count=0
for i in range(1,n):
if l[i]>high:
count+=1
high=l[i]
elif l[i]<low:
count+=1
low = l[i]
print(count) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int,input().split()))
minn = arr[0]
maxx = arr[0]
count = 0
for i in range(1, n):
if arr[i] > maxx:
maxx = arr[i]
count += 1
if arr[i] < minn:
minn = arr[i]
count += 1
print(count) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
x, y, res = a[0], a[0], 0
for i in range(1, n):
# print(a[i], x, y)
if a[i] < x:
# print(i)
res += 1
x = a[i]
if a[i] > y:
# print(i)
res += 1
y = a[i]
print(res) | 7 | PYTHON3 |
N = int(input())
line = [int(k) for k in input().split(' ')]
max = line[0]
min = line[0]
sum = 0
for i in range(1,N):
if line[i]> max:
max = line[i]
sum = sum + 1
if line[i] < min:
min = line[i]
sum = sum + 1
print(sum) | 7 | PYTHON3 |
n=int(input())
scores=[int(x) for x in input().split()]
count_amazing=0
i=1
while i<=n-1:
if scores[i]>max(scores[0:i]) or scores[i]<min(scores[0:i]):
count_amazing+=1
else:
count_amazing=count_amazing
i+=1
print(count_amazing)
| 7 | PYTHON3 |
import sys
#sys.stdin = open("in.txt","r")
#sys.stdout = open("out.txt","w")
n = int(input())
points = []
point = map(int,input().split())
for p in point:
points.append(p)
max_point = points[0]
min_point = points[0]
amazing = 0
for i in range(1,n):
if(points[i]>max_point):
amazing+=1
max_point = points[i]
elif(points[i]<min_point):
amazing+=1
min_point = points[i]
print(amazing) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, points[1000], c = 0, max1, min1;
cin >> n;
for (int i = 0; i < n; i++) cin >> points[i];
max1 = points[0];
min1 = points[0];
for (int j = 1; j < n; j++) {
if (points[j] > max1) {
max1 = points[j];
c++;
}
if (points[j] < min1) {
min1 = points[j];
c++;
}
}
cout << c;
return 0;
}
| 7 | CPP |
n = int(input())
s = input().split()
a=int(s[0])
b=int(s[0])
z=0
for i in range(1,n):
if int(s[i])>a:
a=int(s[i])
z=z+1
if int(s[i])<b:
b=int(s[i])
z=z+1
print(z)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, best, worst, d, ans = 0;
cin >> n;
cin >> d;
best = d;
worst = d;
for (int i = 1; i < n; i++) {
cin >> d;
if (d > best) {
best = d;
ans++;
}
if (d < worst) {
worst = d;
ans++;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
mx,mn = a[0],a[0]
ans=0
for i in range(1,n):
if a[i]>mx:
mx = a[i]
ans+=1
elif a[i]<mn:
mn=a[i]
ans+=1
print(ans) | 7 | PYTHON3 |
n = int(input())
pts =input().split()
mx = int(pts[0])
mi = int(pts[0])
count = 0
for i in range(len(pts)):
if int(pts[i]) > mx:
mx = int(pts[i])
count = count + 1
if int(pts[i]) < mi:
mi = int(pts[i])
count = count + 1
print(count)
| 7 | PYTHON3 |
T=int(input())
lst=list(map(int,input().split()))[:T]
x=[]
x.append(lst[0])
count=0
maxx=lst[0]
minn=lst[0]
for i in range(len(lst)):
if lst[i]>maxx:
count+=1
maxx=lst[i]
if lst[i]<minn:
count+=1
minn=lst[i]
print(count) | 7 | PYTHON3 |
a=int(input())
a=list(map(int, input().split()))
mini=a[0]
maxi=a[0]
res=0
for i in range(len(a)):
b=a[i]
if i!=0:
if b<mini:
res+=1
mini=b
elif b>maxi:
res+=1
maxi=b
print(res)
| 7 | PYTHON3 |
int(input())
b=[int(i) for i in input().split()]
min=b[0]
max=b[0]
count=0
for i in range(1,len(b)):
if(b[i]>max):
max=b[i]
count+=1
if(b[i]<min):
min=b[i]
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, 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())
slist = list(map(int,input().split()))
max=slist[0]
min=slist[0]
count=0
for i in slist:
if i<min:
count+=1
min=i
else:
if i>max:
count+=1
max=i
else:
continue
print(count) | 7 | PYTHON3 |
def count_amazing():
n = int(input())
lst = [int(x) for x in input().split()]
max_, min_ = lst[0], lst[0]
num_amazing = 0
for i in range(n):
if lst[i] > max_:
num_amazing += 1
max_ = lst[i]
if lst[i] < min_:
num_amazing += 1
min_ = lst[i]
return num_amazing
if __name__ == '__main__':
print(count_amazing()) | 7 | PYTHON3 |
n = int(input())
s=list(map(int,input().split()))
c=0
for i in range(1,n):
if (s[i]>max(s[0:i])) or (s[i] < min(s[0:i])):
c=c+1
print(c) | 7 | PYTHON3 |
def list_input(): return list(map(int, input().split()))
def multiple_input(): return map(int, input().split())
n = int(input())
a = list_input()
ans = 0
m1, m2 = a[0], a[0]
for i in range(1, n):
if a[i] > m1:
ans += 1
m1 = a[i]
elif a[i] < m2:
ans += 1
m2 = a[i]
print(ans) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
minim=arr[0]
maxim=arr[0]
ans=0
for i in range(1,n):
if arr[i]>maxim:
ans+=1
maxim=arr[i]
elif arr[i]<minim:
ans+=1
minim=arr[i]
print(ans) | 7 | PYTHON3 |
numbs = int(input())
scores = str(input())
scores = scores.split(" ")
for n in range(numbs):
scores[n]=int(scores[n])
k = 0
m = 1
mini = 0
maxi = 0
mini = scores[0]
maxi = scores[0]
while m < numbs:
if scores[m]>maxi:
k+=1
maxi = scores[m]
if scores[m]<mini:
k+=1
mini = scores[m]
m+=1
print(k)
| 7 | PYTHON3 |
import math
n = int(input())
a = list(map(int,input().split(" ")))
mi = a[0]
ma = a[0]
count = 0
for ele in a:
if ele>ma:
count+=1
ma = ele
if ele<mi:
count+=1
mi = ele
print(count)
| 7 | PYTHON3 |
n=int(input())
lst=list(map(int,input().split()))
minn=lst[0]
maxx=lst[0]
count=0
for i in range(1,n):
if lst[i]>maxx:
count+=1
maxx=lst[i]
if lst[i]<minn:
count+=1
minn=lst[i]
print(count) | 7 | PYTHON3 |
n=int(input())
c=list(map(int,input().strip().split()))
count=0
x=[]
x.append(c[0])
for i in range(1,n):
if(c[i]>max(x)):
count=count+1
x.append(c[i])
elif(c[i]<min(x)):
count=count+1
x.append(c[i])
else:
count=count
print(count) | 7 | PYTHON3 |
n = int(input())
c = 0
scores = list(map(int,input().split()))
for i in range(1,n):
sch=0
scl=0
for a in range(0,i):
if scores[i]>scores[a]:
sch+=1
elif scores[i]<scores[a]:
scl+=1
if sch == i or scl == i :
c+=1
print(c) | 7 | PYTHON3 |
sutazi = int(input())
sutaze = list(map(int, input().split()))
amazing = 0
mini = sutaze[0]
maxi = sutaze[0]
for sutaz in sutaze:
if sutaz > maxi:
amazing += 1
maxi = sutaz
if sutaz < mini:
amazing += 1
mini = sutaz
print(amazing)
| 7 | PYTHON3 |
input()
s=list(map(int,input().split()))
ma=s[0]
mi=s[0]
t=0
for i in s:
if i>ma:
ma=i
t+=1
if i<mi:
mi=i
t+=1
print(t) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().strip().split()))[:n]
mx = 0
mn = 10000
cnt = 0
for i in range(0,n):
x = a[i]
if(x>mx):
mx = x
if i>0:
cnt = cnt + 1
#print(mx)
if(mn>x):
mn = x;
if i>0:
cnt = cnt + 1
#print(mn)
print(cnt)
| 7 | PYTHON3 |
i=input
i()
m, *s=map(int,i().split())
n=m
x=0
for c in s:
if c>m:
x+=1
m=c
if c<n:
x+=1
n=c
print(x) | 7 | PYTHON3 |
n = int(input())
m = list(map(int,input().split()))
l = []
count = 0
l.append(m[0])
for i in range(1,n):
if (max(l) < m[i] or min(l) > m[i]):
l.append(m[i])
count += 1
print(count)
| 7 | PYTHON3 |
n = int(input())
s = list(map(int, input().split()))
min = s[0]
max = s[0]
k = 0
for i in range(1,n):
if s[i] > max:
k += 1
max = s[i]
if s[i] < min:
k += 1
min = s[i]
print(k)
| 7 | PYTHON3 |
n=int(input())
arr = list(map(int,input().split()))
c = 0
min=arr[0]
max=arr[0]
for i in range(len(arr)):
if arr[i] > max:
max=arr[i]
c += 1
if arr[i] < min :
min = arr[i]
c += 1
print(c)
| 7 | PYTHON3 |
n=int(input())
li=list(map(int,input().split()))
max,min,c=li[0],li[0],0
for i in li:
if i>max:
c=c+1
max=i
elif i<min:
c=c+1
min=i
else:
continue
print(c) | 7 | PYTHON3 |
n = int(input())
points = list(map(int,input().split()))
large = points[0]
small = points[0]
amazing = 0
for i in range(1,n):
if points[i] > large:
amazing+=1
large = points[i]
elif points[i] < small:
amazing+=1
small = points[i]
print(amazing) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
maxi=arr[0]
mini=arr[0]
cnt=0
for i in range(1,n):
if(arr[i] > maxi):
maxi = arr[i]
cnt += 1
elif(arr[i] < mini):
mini = arr[i]
cnt += 1
print(cnt) | 7 | PYTHON3 |
n = int(input())
p = [int(i) for i in input().split()]
max = p[0]
min = p[0]
s = 0
for i in range(1,n):
if p[i] > max:
max = p[i]
s += 1
elif p[i] < min:
min = p[i]
s += 1
print(s)
| 7 | PYTHON3 |
a=int(input())
n=list(map(int,input().split()))
m=n[:1]
for i in n:
a-=min(m)<=i<=max(m)
m+=[i]
print(a) | 7 | PYTHON3 |
import sys
n = int(sys.stdin.readline())
inp = str(sys.stdin.readline())[:-1].split(' ')
ans = 0
mx = int(inp[0])
mn = mx
for i in range(1,n):
a = int(inp[i])
#print(mx,mn,a)
if a>mx:
mx = a
ans = ans+1
elif a<mn:
mn = a
ans = ans+1
print(ans)
| 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
if __name__ == "__main__":
n = int(input())
scores = list(map(int,input().split(" ")))
print (solve(scores)) | 7 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
score = 0
hi = p[0]
lo = p[0]
p.pop(0)
for perf in p:
if perf < lo:
score += 1
lo = perf
elif perf > hi:
score +=1
hi = perf
print(score) | 7 | PYTHON3 |
n=input()
s=input().split()
ls=list()
ls=s
for i in range(len(ls)):
ls[i]=(int)(ls[i])
c=0
for i in range(1,len(ls)):
if(max(ls[:i])< ls[i] or min(ls[:i]) >ls[i]):
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
max1=a[0]
min1=a[0]
cmax=0
cmin=0
for i in range(1,len(a)):
if(a[i]>max1):
cmax=cmax+1
max1=a[i]
else:
if(a[i]<min1):
cmin=cmin+1
min1=a[i]
print(cmax+cmin)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
n = int(input())
arr = list(map(int,input().split()))
ma = arr[0]
mi = arr[0]
amaz = 0
for i in range(n):
if arr[i]> ma:
ma = arr[i]
amaz += 1
elif arr[i] < mi:
mi = arr[i]
amaz += 1
print(amaz) | 7 | PYTHON3 |
n = int(input())
li = list(map(int,input().split()))
min = li[0]
max = li[0]
count = 0
for i in range(1,n):
if li[i] < min:
count+=1
min = li[i]
elif li[i] > max:
count+=1
max = li[i]
print(count)
| 7 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
if n == 1:
print(0)
else:
d = max(p[0], p[1])
x = min(p[0], p[1])
if d == x:
s = 0
else:
s = 1
for i in range(2, n):
if p[i] > d:
d = p[i]
s += 1
elif p[i] < x:
x = p[i]
s += 1
print(s)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
Max=l[0]
Min=l[0]
c=0
for i in range(1,n):
if(l[i]>Max):
Max=l[i]
c+=1
if(l[i]<Min):
Min=l[i]
c+=1
else:
continue
print(c)
| 7 | PYTHON3 |
n = int(input())
m = list(map(int, input().split()))
b = m[0]
v = m[0]
c = 0
for i in range(1, n):
if b < m[i]:
b = m[i]
c += 1
elif v > m[i]:
v = m[i]
c += 1
print(c)
| 7 | PYTHON3 |
n = int(input())
lst = [int(j) for j in input().split()]
M = lst[0]
m = lst[0]
count = 0
if n == 1:
print(0)
else:
for i in range(1,n):
if lst[i] > M:
count += 1
M = lst[i]
elif lst[i] < m:
count += 1
m = lst[i]
print(count)
| 7 | PYTHON3 |
n=int(input())
l=[int(x) for x in input().split()]
m=0
min=max=l[0]
for i in l:
if i<min:
min=i
m+=1
if i>max:
max=i
m+=1
print(m) | 7 | PYTHON3 |
f=lambda:map(int,input().split())
n=int(input())
pt=list(f())
c=0
mx=mn=pt[0]
for i in pt:
c+=(i>mx or i<mn)
if i>mx:
mx=i
if mn>i:
mn=i
print(c) | 7 | PYTHON3 |
def Amazing(n, s):
a = 0
for i in range(1, n):
if s[i] < min(s[0:i]) or s[i] > max(s[0:i]):
a = a + 1
return a;
z = int(input())
s = [int(n) for n in input().split()]
print(Amazing(z, s)) | 7 | PYTHON3 |
n=int(input())
points=[int(i) for i in input().split()]
output=0
for i in range(1,n):
line=points[0:i+1]
if line[-1]>max(points[0:i]) or line[-1]<min(points[0:i]):
output+=1
print(output)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Aug 2 11:53:29 2019
@author: Khondoker
"""
n =int( input())
q = input()
qlist = q.split()
ans = []
ans.append(int(qlist[0]))
final = 0
for s in range(1,n):
ans.sort()
if ( int(qlist[s]) < ans[0]) or (int(qlist[s])>ans[-1]):
final +=1
ans.append(int(qlist[s]))
print(final)
| 7 | PYTHON3 |
n = int(input())
q = input().split(' ')
imax = int(q[0])
imin = imax
cnt = 0
for i in range(1, n):
x = int(q[i])
if x < imin:
cnt += 1
imin = x
if x > imax:
cnt += 1
imax = x
print(cnt) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Tue Oct 23 16:07:02 2018
@author: Quaint Sun
"""
n=int(input())
points=input().split()
point=[int(points[0])]
t=0
for i in points:
if int(i)>max(point) or int(i)<min(point):
t=t+1
point.append(int(i))
else:
point.append(int(i))
print(t)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ma, mi, a, su;
while (cin >> n) {
su = 0;
scanf("%d", &a);
mi = ma = a;
for (int i = 1; i < n; i++) {
scanf("%d", &a);
if (a > ma) {
su++;
ma = a;
}
if (a < mi) {
su++;
mi = a;
}
}
cout << su << endl;
}
}
| 7 | CPP |
n = int(input(""))
l = list(map(int, str(input("")).split(" ")))
count = 0
max = 0
min = 0
for i in range(n-1):
if l[i+1] > l[max]:
count += 1
max = i+1
elif l[i+1] < l[min]:
count += 1
min = i+1
print(count)
| 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
f=[]
f.append(b[0])
b.remove(b[0])
k=0
for i in b:
if i not in f:
f.append(i)
if i==max(f) or i==min(f):
k+=1
print(k)
| 7 | PYTHON3 |
n=int(input())
point=input().split()
total=0
poi=[int(point[0])]
for i in range(n-1):
M=max(poi)
m=min(poi)
if int(point[i+1])>M or int(point[i+1])<m:
total+=1
poi.append(int(point[i+1]))
print(total)
| 7 | PYTHON3 |
a=int(input())
k=[]
k=list(map(int,input().split()))
mn=k[0]
mx=k[0]
kl=0
for i in k:
if i>mx:
kl+=1
mx=i
if i<mn:
kl+=1
mn=i
print(kl)
| 7 | PYTHON3 |
input()
train = list(map(int, input().split()))
max_ = train[0]
min_ = train[0]
magnificient = 0
for coach in train:
if coach > max_:
max_ = coach
magnificient += 1
if coach < min_:
min_ = coach
magnificient += 1
print(magnificient) | 7 | PYTHON3 |
n = int(input())
li = [int(x) for x in input().split()]
min = li[0]
max = li[0]
count = 0
for i in range(1,len(li)):
if(li[i] > max):
max = li[i]
count = count + 1
if(li[i] < min):
min = li[i]
count = count + 1
print(count) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
l=a[0]
m=a[0]
cnt=0
for i in range(1,n):
if max(l,a[i])==a[i] and l!=a[i]:
cnt+=1
l=a[i]
elif min(m,a[i])==a[i] and m!=a[i]:
cnt+=1
m=a[i]
print(cnt)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
l=h=a[0]
r=0
for i in a:
if i<l or i>h:
r+=1
l,h=min(l,i),max(h,i)
print(r)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int arr[n];
int i, j, cnt = 0, largest = 1;
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
for (i = 1; i < n; i++) {
for (j = 0; j < i; j++) {
if (arr[i] <= arr[j]) {
largest = 0;
break;
}
}
if (largest) cnt++;
largest = 1;
}
for (i = 1; i < n; i++) {
for (j = 0; j < i; j++) {
if (arr[i] >= arr[j]) {
largest = 0;
break;
}
}
if (largest) cnt++;
largest = 1;
}
printf("\n%d", cnt);
return 0;
}
| 7 | CPP |
n = int(input())
arr = input().split(' ')
arr = [int(i) for i in arr]
count = 0
if n == 1:
print(count)
else:
small = 0
great = 0
if arr[0]<arr[1]:
small = arr[0]
great = arr[1]
count+=1
elif arr[0]>arr[1]:
great = arr[0]
small = arr[1]
count+=1
else:
small = arr[0]
great = arr[0]
for i in range(2, n):
if arr[i]>great:
great = arr[i]
count+=1
elif arr[i]<small:
small = arr[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
b=[a[0]]
ans=0
for i in range(1,n):
if a[i]<min(b) or a[i]>max(b):
ans=ans+1
b.append(a[i])
print(ans)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c1=0
for i in range(1,n):
j=i-1
if l[i]>l[j]:
while(j>=0 and l[i]>l[j]):
j=j-1
if j==-1:
c1=c1+1
elif l[i]<l[j]:
while(j>=0 and l[i]<l[j]):
j=j-1
if j==-1:
c1=c1+1
print(c1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, ar[10000], s = 0, lar, small;
cin >> n;
for (i = 0; i < n; i++) cin >> ar[i];
small = ar[0];
lar = ar[0];
for (i = 1; i < n; i++) {
if (ar[i] > lar) {
s++;
lar = ar[i];
} else if (ar[i] < small) {
s++;
small = ar[i];
}
}
printf("%d", s);
return 0;
}
| 7 | CPP |
#!/usr/bin/env python3
if __name__ == "__main__":
n =int(input())
points = list(map(int, input().split()))
count = 0
maxx , minn = points[0], points[0]
for point in points[1:]:
if point > maxx:
count += 1
maxx = point
elif point < minn:
count += 1
minn = point
print(count)
| 7 | PYTHON3 |
n = int(input())
udiv = 0
maxi = 0
mas = [int(i) for i in input().split()]
mini = mas[0]
for i in range(1, n):
for j in range(i):
if mas[j] > maxi: maxi = mas[j]
if mas[j] < mini: mini = mas[j]
if mas[i] > maxi or mas[i] < mini: udiv += 1
print(udiv) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, min, max, ctr = 0;
cin >> n;
cin >> a;
max = a;
min = a;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (a > max) {
ctr++;
max = a;
} else if (a < min) {
min = a;
ctr++;
}
}
cout << ctr;
return 0;
}
| 7 | CPP |
n=int(input())
p=list(map(int,input().split()))
P=[p[0]]
s=0
for i in range(1,n):
if p[i]>max(P) or p[i]<min(P):
s=s+1
P.append(p[i])
print(s)
| 7 | PYTHON3 |
input()
l = list(map(int, input().split(' ')))
mn = l[0]
mx = l[0]
count = 0
for i in range(1, len(l)):
if l[i] > mx:
mx = l[i]
count += 1
elif l[i] < mn:
mn = l[i]
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
max=min=l[0]
a=0
for i in range(1,n):
if l[i]<min:
min=l[i]
a+=1
elif l[i]>max:
max=l[i]
a+=1
print(a) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
# @Date : 2020-01-10 13:17:35
# @Author : raj lath ([email protected])
# @Link : link
# @Version : 1.0.0
import sys
sys.setrecursionlimit(10**5+1)
inf = int(10 ** 20)
max_val = inf
min_val = -inf
RW = lambda : sys.stdin.readline().strip()
RI = lambda : int(RW())
RMI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]
RWI = lambda : [x for x in sys.stdin.readline().strip().split()]
nb_contestant = RI()
scores = RMI()
mins = scores[0]
maxs = scores[0]
coolness = 0
for i in scores[1:]:
if i < mins:
coolness += 1
mins = i
if i > maxs:
coolness += 1
maxs = i
print(coolness)
| 7 | PYTHON3 |
x = input();x =list(map(int,input().split()))
f,a,b = 0,x[0],x[0]
for i in x[1:]:
if i>b:
b=i
f+=1
elif i<a:
a=i
f+=1
print(f) | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
mini = lst[0]
maxi = lst[0]
ans = 0
for x in lst[1:]:
if(x < mini):
mini = x
ans += 1
if(x > maxi):
maxi = x
ans += 1
print(ans)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
c=0
high=low=a[0]
for i in range(1,n):
if a[i]>high:high=a[i];c+=1
if a[i]<low:low=a[i];c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
a, counter = [int(i) for i in input().split()], 0
counter += sum(a[i] < min(a[:i]) or a[i] > max(a[:i]) for i in range(1, n))
print(counter)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.