solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int max = arr[0];
int min = arr[0];
int cnt = 0;
for (int i = 1; i < n; i++) {
if (arr[i] > max) {
cnt++;
max = arr[i];
} else if (arr[i] < min) {
cnt++;
min = arr[i];
}
}
cout << cnt;
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
g=list()
g.append(l[0])
count=0
for i in range(1,len(l)):
maxuntil=max(g)
minuntil=min(g)
g.append(l[i])
if l[i]>maxuntil or l[i]<minuntil:
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
x=[int(i) for i in input().split()]
max=min=x[0]
a=0
for i in range(1,n):
if x[i]>max:
max=x[i]
a+=1
if x[i]<min:
min=x[i]
a+=1
print(a)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
int c = 0;
int maxsofar = arr[0];
int minsofar = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > maxsofar)
c++;
else if (arr[i] < minsofar)
c++;
maxsofar = max(maxsofar, arr[i]);
minsofar = min(minsofar, arr[i]);
}
cout << c << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ma = -1;
int mi = -1;
int n;
cin >> n;
int k;
cin >> k;
ma = k;
mi = k;
int sum = 0;
for (int i = 1; i < n; i++) {
cin >> k;
if (k > ma) {
sum++;
ma = k;
}
if (k < mi) {
sum++;
mi = k;
}
}
cout << sum << endl;
}
| 7 | CPP |
n = int(input())
scores = list(map(int, input().split()))
min = 0
max = 0
count = 0
for i in range(n):
if i == 0:
min = scores[i]
max = scores[i]
else:
if scores[i] > max:
max = scores[i]
count += 1
elif scores[i] < min:
min = scores[i]
count += 1
print(count)
| 7 | PYTHON3 |
n = int(input())
A = list(map(int, input().split()))
max_num = A[0]
min_num = A[0]
ans = 0
for i in range(1, n):
if A[i] > max_num:
ans += 1
max_num = A[i]
elif A[i] < min_num:
ans += 1
min_num = A[i]
print(ans)
| 7 | PYTHON3 |
n = int(input())
marks = list(map(int,input().split()))
minMarks, maxMarks = marks[0],marks[0];count = 0
for i in marks[1:]:
if i > maxMarks:
count += 1
maxMarks = i
elif i < minMarks:
count += 1
minMarks = i
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, a[1000], b = 0, i, max, min = -2000001;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
max = a[0];
min = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min) {
min = a[i];
b++;
}
if (a[i] > max) {
b++;
max = a[i];
}
}
printf("%d\n", b);
return 0;
}
| 7 | CPP |
n = int(input())
score = [int(x) for x in input().split()]
max = score[0]
min = score[0]
amaze = 0
for i in range(1,n):
b = score[i]
if b > max:
amaze += 1
max = b
elif b < min:
amaze += 1
min = b
print(int(amaze))
| 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
mini=arr[0]
maxi=arr[0]
c=0
for i in range(1,n):
if(arr[i]>maxi):
maxi=arr[i]
c+=1
if(arr[i]<mini):
mini=arr[i]
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
data = list(map(int, input().split()))
max_result = data.pop(0)
min_result = max_result
result = 0
for i in data:
if i > max_result:
result += 1
max_result = i
elif i < min_result:
result += 1
min_result = i
print(result)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
amazing = 0
b = []
for ele in a:
b.append(ele)
if b.index(ele) > 0:
if b.count(ele) == 1 and (ele is max(b) or ele is min(b)):
amazing+=1
print(amazing) | 7 | PYTHON3 |
inp = input()
inp1 = input().split()
best = inp1[0]
worst = inp1[0]
x = 0
for num in range(1, len(inp1)):
if int(inp1[num]) > int(best):
best = inp1[num]
x += 1
elif int(inp1[num]) < int(worst):
worst = inp1[num]
x += 1
print(x) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
MAX, MIN = a[0], a[0]
k = 0
for i in range(1, n):
if a[i] > MAX:
MAX = a[i]
k += 1
if a[i] < MIN:
MIN = a[i]
k += 1
print(k) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
cin >> test;
int number;
int arr[1000];
int min = 10000;
int max = 0;
int i;
int counter = 0;
for (i = 0; i < test; i++) {
cin >> number;
arr[i] = number;
}
max = arr[0];
min = arr[0];
for (int j = 0; j < test; j++) {
if (arr[j] > max) {
max = arr[j];
counter++;
}
if (arr[j] < min) {
min = arr[j];
counter++;
}
}
cout << counter << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
long long n, m, cnt;
long long a[N], mn = N, mx;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
mx = max(a[i - 1], mx);
mn = min(a[i - 1], mn);
if (a[i] > mx || a[i] < mn) {
cnt++;
}
}
cout << cnt;
}
| 7 | CPP |
competitions = int(input())
marks = list(map(int, input().split()))
incredible_competitions = 0
length = len(marks)
maximum = marks[0]
minimum = marks[0]
for incredible in range(1, length):
if marks[incredible] > maximum:
maximum = marks[incredible]
incredible_competitions += 1
elif marks[incredible] < minimum:
minimum = marks[incredible]
incredible_competitions += 1
print(incredible_competitions)
| 7 | PYTHON3 |
a=int(input())
d=[int(i) for i in input().split()]
start_amaze=d[0]
last_amaze=d[0]
count=0
for i in range(len(d)-1):
if (start_amaze > d[i+1]):
start_amaze=d[i+1]
count=count+1
if (last_amaze < d[i+1]):
last_amaze=d[i+1]
count=count+1
print(count)
| 7 | PYTHON3 |
n=int(input())
cont=[int(x) for x in input().split()]
a=0
b=cont[0]
c=cont[0]
for i in range (1,len(cont),1):
if cont[i] > b:
b=cont[i]
a+=1
elif cont[i] < c:
c=cont[i]
a+=1
print(a) | 7 | PYTHON3 |
n = int(input())
lis = list(map(int, input().split()))
max = lis[0]
min = lis[0]
amz = 0
for i in lis:
if i > max:
amz += 1
max = i
else:
if i < min:
amz += 1
min = i
print(amz) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e3 + 5;
int n, a[nmax], cnt;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
int mi = a[0], ma = a[0];
for (int i = 0; i < n; i++) {
if (a[i] > ma) {
cnt++;
ma = a[i];
}
if (a[i] < mi) {
cnt++;
mi = a[i];
}
}
cout << cnt;
}
| 7 | CPP |
n, t = int(input()), list(map(int, input().split()))
s, m, M = 0, t[0], t[0]
for i in range(1, len(t)):
if t[i] > M:
M = t[i]
s += 1
elif t[i] < m:
m = t[i]
s += 1
print(s) | 7 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
print(sum(1 for i in range(1, n) if max(p[:i]) < p[i] or min(p[:i]) > p[i])) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
int MAX, MIN, x, ans = 0;
scanf("%d", &n);
scanf("%d", &x);
MIN = MAX = x;
for (int i = 1; i < n; i++) {
scanf("%d", &x);
if (x > MAX) {
MAX = x;
ans++;
}
if (x < MIN) {
MIN = x;
ans++;
}
}
printf("%d\n", ans);
}
| 7 | CPP |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Sep 3 11:42:55 2020
@author: anirudhasarmatumuluri
"""
def main():
n = int(input())
arr = [int(x) for x in input().split()]
min = max = arr[0]
count = 0
for i in range(1,n):
if arr[i]>max:
max = arr[i]
count+=1
if arr[i]<min:
min = arr[i]
count+=1
print(count)
main() | 7 | PYTHON3 |
a=int(input())
k=0
A=[int(i) for i in input().split()]
min=A[0]
max=A[0]
for i in range(1,len(A)):
if A[i]>max:
k+=1
max=A[i]
if A[i]<min:
min=A[i]
k+=1
print(k)
| 7 | PYTHON3 |
repetition = int(input())
numbers = list(map(int, input().split()))
lowest_num = 0
highest_num = 0
counter = 0
for i in range(repetition):
if (i == 0):
lowest_num = numbers[i]
highest_num = numbers[i]
if (numbers[i] > highest_num):
counter += 1
highest_num = numbers[i]
elif (numbers[i] < lowest_num):
counter += 1
lowest_num = numbers[i]
print(counter) | 7 | PYTHON3 |
n=int(input())
z=input().split()
z=list(map(int,z))
def uu(k):
qq=True
if z[k]>max(z[:k]) or z[k]<min(z[:k]):
qq=False
return qq
a=0
for i in range(n):
if i==0:
continue#0 meifabi zhijie tiaoguo
if uu(i)==False:
a+=1
print(a) | 7 | PYTHON3 |
n=int(input())
res=input().split(' ')
k=0
for i in range(1, len(res)):
result=int(res[i])
mi=100000
ma=-1
for j in range(i):
if (int(res[j])<mi):
mi=int(res[j])
if (int(res[j])>ma):
ma=int(res[j])
if (result<mi or result>ma):
k+=1
print(k)
| 7 | PYTHON3 |
prefs = int(input())
preformances = [int(i) for i in input().split()]
best = preformances[0]
worst = preformances[0]
amazing = 0
for i in preformances:
if i > best:
best = i
amazing += 1
elif i < worst:
worst = i
amazing += 1
print(amazing) | 7 | PYTHON3 |
a = int(input())
marks = list(map(int, input().split()))
minimum = marks[0]
maximum = marks[0]
count = 0
for i in marks :
if i > maximum :
maximum = i
count += 1
if i < minimum :
minimum = i
count += 1
else :
pass
print (count) | 7 | PYTHON3 |
input=__import__('sys').stdin.readline
n = int(input())
lis= list(map(int,input().split()))
mm=mi=lis[0]
ans=0
for i in range(1,n):
cur=lis[i]
if cur>mm:
ans+=1
mm=cur
if cur<mi:
ans+=1
mi=cur
print(ans)
| 7 | PYTHON3 |
n=int(input())
total=0
numbers=[int(i) for i in input().split()]
max1,min1=numbers[0],numbers[0]
for i in range(1,n):
if numbers[i]>max1:
total+=1
max1=numbers[i]
elif numbers[i]<min1:
total+=1
min1=numbers[i]
print(total) | 7 | PYTHON3 |
n = int(input())
Grades = [int(i) for i in input().split(' ')]
a = max(Grades)
b = min(Grades)
i = 0
HA = 0
if n == 1:
print(0)
else:
while i < n:
m = 0
counter = 0
while m < i:
if Grades[i] > Grades[m]:
counter += 1
m += 1
if counter == m:
HA += 1
counter = 0
m = 0
while m < i:
if Grades[i] < Grades[m]:
counter += 1
m += 1
if counter == m:
HA += 1
i += 1
print(HA-2) | 7 | PYTHON3 |
n=int(input())
ls=input().split()
ls=[int(i) for i in ls]
ls1=[ls[0]]
count=0
for i in ls:
if i>max(ls1) or i<min(ls1):
count+=1
ls1.append(i)
print(count)
| 7 | PYTHON3 |
n = int(input())
scores = [int(i) for i in input().split()]
min = scores[0]
max = scores[0]
res = 0
for i in range(1,n):
if scores[i] > max:
res+=1
max = scores[i]
if scores[i] < min:
res+=1
min = scores[i]
print(str(res))
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
max = l[0]
min= l[0]
c = 0
for i in range(n):
if l[i] > max:
max = l[i]
c += 1
if l[i] < min:
min = l[i]
c += 1
print(c) | 7 | PYTHON3 |
n=int(input())
A=[int(x) for x in input().split()]
Min=A[0]
Max=A[0]
cnt=0
for i in range(1,n):
flag_Min=False
flag_Max=False
if Min>A[i]:
flag_Min=True
Min=A[i]
if Max<A[i]:
flag_Max=True
Max=A[i]
if flag_Max or flag_Min:
cnt+=1
print(cnt) | 7 | PYTHON3 |
num = int(input(""))
lst = list(map(int,input().split(" ")))
amazing = 0
max_lst = lst[0]
min_lst = lst[0]
for i in range(0,len(lst)):
if lst[i] < min_lst:
min_lst = lst[i]
amazing = amazing+1
if lst[i] > max_lst :
max_lst = lst[i]
amazing = amazing+1
print(amazing)
| 7 | PYTHON3 |
if __name__ == "__main__":
n=int(input())
N=list(map(int,input().split()))
minmum=N[0]
maxmum=N[0]
amazing=0
for i in N[1:]:
if (i<minmum):
minmum=i
amazing+=1
if (i>maxmum):
maxmum=i
amazing+=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]<mi):
mi=l[i]
c+=1
if(l[i]>ma):
ma=l[i]
c+=1
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, count = 0;
cin >> n >> x;
int mayor, menor;
mayor = menor = x;
for (int i = 1; i < n; i++) {
cin >> x;
if (x > mayor && x > menor || x < menor && x < menor) count++;
if (x > mayor) mayor = x;
if (x < menor) menor = x;
}
cout << count;
return 0;
}
| 7 | CPP |
_=input()
lst=[int(i) for i in input().split()]
big=lst[0]
small=lst[0]
c=0
for i in lst[1:]:
if i > big:
big=i
c+=1
elif i<small:
small=i
c+=1
print(c)
| 7 | PYTHON3 |
n = int(input())
lis = map(int,input().split())
lis = list(lis)
maxi = lis[0]
mini = lis[0]
cnt = 0
for i in lis:
if(i > maxi):
maxi = i
cnt+=1
if(i < mini):
mini = i
cnt += 1
# print(maxi,mini)
print(cnt) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
counter=0
i=1
while i<n:
if arr[i]>max(arr[0:i]) or arr[i]<min(arr[0:i]):
counter+=1
i+=1
print(counter)
| 7 | PYTHON3 |
n = int(input())
amazingHigh = 0
amazingLow = 0
amazingCount = 0
pointList = [int(x) for x in input().split()]
amazingHigh = pointList[0]
amazingLow = pointList[0]
pointList = pointList[1:len(pointList)]
for point in pointList:
if point > amazingHigh:
amazingCount += 1
amazingHigh = point
elif point < amazingLow:
amazingCount += 1
amazingLow = point
print(amazingCount)
| 7 | PYTHON3 |
count = int(input())
m = list(map(int, input().split()))
mn = m[0]
mx = m[0]
amazing = 0
for i in m:
if i > mx:
amazing += 1
mx = i
continue
if i < mn:
amazing += 1
mn = i
print(amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool flag = true;
int n, min(10001), max(-1), counter(0), arr[1000];
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
if (arr[i] > max) {
max = arr[i];
++counter;
}
if (arr[i] < min) {
min = arr[i];
++counter;
}
}
cout << counter - 2 << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
int k = 0;
for (int i = 2; i <= n; i++) {
int c = 0, d = 99999;
for (int j = 1; j <= i - 1; j++) {
c = max(c, a[j]);
d = min(d, a[j]);
}
if (a[i] > c || a[i] < d) k++;
}
cout << k;
}
| 7 | CPP |
n = int(input())
l = list(map(int,input().split()))
if n==1:
print('0')
else:
minv=l[0]
maxv=l[0]
a=0
for i in l:
if i<minv:
minv=i
a+=1
elif i>maxv:
maxv=i
a+=1
print(a)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()[:n]))
mx = arr[0]
mn = arr[0]
c = 0
for i in range(1, n):
if arr[i] > mx:
mx = arr[i]
c += 1
elif arr[i] < mn:
mn = arr[i]
c += 1
print(c)
| 7 | PYTHON3 |
n=int(input(""))
a=list(map(int, input().split()))
maximum=a[0]
minimum=a[0]
count=0
for i in a:
if (i>maximum):
maximum=i
count+=1
elif (i<minimum):
minimum=i
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
scores = [int(a) for a in input().split(" ")]
count = 0
surprise = 0
min = scores[0]
max = scores[0]
while count < len(scores) - 1:
score = scores[count]
if scores[count +1] > max:
max = scores[count +1]
surprise += 1
elif scores[count +1] < min:
min = scores[count +1]
surprise += 1
count += 1
print(surprise)
| 7 | PYTHON3 |
t=int(input())
l=list(map(int,input().split()))
co=0
for i in range (1,t):
g=l[0:i]
m=max(g)
n=min(g)
if l[i]>m or l[i]<n:
co+=1
print(co) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0, mx, mn;
cin >> n;
int arr[n + 1];
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
mx = arr[1];
mn = arr[1];
for (int i = 2; i <= n; i++) {
if (mx < arr[i]) {
cnt++;
mx = arr[i];
} else if (mn > arr[i]) {
cnt++;
mn = arr[i];
}
}
cout << cnt << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int d, count = 0;
cin >> d;
int m1 = d, m2 = d;
count = 0;
n--;
while (n--) {
cin >> d;
if (m1 < d) {
count++;
m1 = d;
}
if (m2 > d) {
count++;
m2 = d;
}
}
cout << count;
}
| 7 | CPP |
n=int(input())
array=list(map(int,input().split()))
lst=list()
c=0
lst.append(array[0])
for j in range(1,n):
if array[j]>max(lst) or array[j]<min(lst) :
c=c+1
lst.append(array[j])
print(c) | 7 | PYTHON3 |
n = int(input())
k = list(map(int,input().split()))
l = [k[0]]
c = 0
for i in range(1,n):
if k[i]>max(l) or k[i]<min(l):
l.append(k[i])
c += 1
print(c)
| 7 | PYTHON3 |
n = int(input())
l =list( map(int ,input().split()))
minl , maxl , am = l[0] , l[0] , 0
for i in range(1,n):
if minl > l[i]:
am +=1
minl = l[i]
if maxl < l[i]:
maxl = l[i]
am +=1
print(am)
| 7 | PYTHON3 |
n = int(input())
mass = input().split()
count = 0
for i in range(len(mass)):
mass[i] = int(mass[i])
mx = mass[0]
mn = mass[0]
for i in range(len(mass)):
if mass[i] > mx:
mx = mass[i]
count += 1
if mass[i] < mn:
mn = mass[i]
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
t=1
s=0
line=list(map(int,input().split()))
x=line[0]
y=line[0]
while t<n:
if line[t]>x or line[t]<y:
s=s+1
x=max(x,line[t])
y=min(y,line[t])
t=t+1
print(s)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
k=a[0]
l=a[0]
c=0
for i in a:
if i>k:
c+=1
k=i
elif i<l:
c+=1
l=i
print(c)
| 7 | PYTHON3 |
f = int(input())
s = [int(x) for x in input().split()]
ama = 0
for i in range(1, len(s)):
comp = s[:i]
if s[i] > max(comp) or s[i] < min(comp):
ama += 1
print(ama) | 7 | PYTHON3 |
n=int(input())
L=list(map(int, input().split()))
a=b=L[0]
c=0
for i in L[1:]:
if i<a:
c=c+1
a=i
elif i>b:
c=c+1
b=i
print(c) | 7 | PYTHON3 |
n = int(input())
mylist = list(map(int, input().split()))
low, high = mylist[0], mylist[0]
amazing = 0
for i in range(1, n):
if mylist[i] < low:
amazing += 1
low = mylist[i]
if mylist[i] > high:
amazing += 1
high = mylist[i]
print(amazing) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
res = 0
def check1(x):
for i in range(x):
if a[i] <= a[x]:
return False
return True
def check2(x):
for i in range(x):
if a[i] >= a[x]:
return False
return True
for i in range(1,n):
if check1(i):
res += 1
if check2(i):
res += 1
print(res)
| 7 | PYTHON3 |
num_g = input()
num_g = int(num_g)
li = input().split()
for i in range(len(li)):
temp = li[i]
temp = int(temp)
li[i] = temp
amazings = 0
max = li[0]
min = li[0]
for ele in range(1,len(li)):
if li[ele] > max:
max = li[ele]
amazings += 1
elif li[ele] < min:
min = li[ele]
amazings += 1
print(amazings)
| 7 | PYTHON3 |
def amazing_results(results):
max_result = results[0]
min_result = results[0]
count = 0
for value in results:
if value > max_result:
max_result = value
count += 1
elif value < min_result:
min_result = value
count += 1
return count
number = int(input())
results_of_competitions = list(map(int, input().split()))
print(amazing_results(results_of_competitions)) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
min1,max1=l[0],l[0]
ans=0
for i in l[1:]:
if(i<min1):
min1=i
ans+=1
if(i>max1):
max1=i
ans+=1
print(ans) | 7 | PYTHON3 |
n=int(input())
c=0
li=[int(i) for i in input().split()]
mi,ma=li[0],li[0]
for i in range(1,n):
if(mi>li[i]):
mi=li[i]
c+=1
elif(ma<li[i]):
ma=li[i]
c+=1
print(c)
| 7 | PYTHON3 |
l=int(input(""))
ar=list(map(int,input("").split()))
z=[ar[0]]
count=0
for i in range(1,len(ar)):
if(ar[i]>max(z) or ar[i]<min(z)):
count=count+1
z.append(ar[i])
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[10000];
int main() {
int n, s = 0, k = 0, l = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
if (a[j] < a[i]) {
s++;
} else if (a[j] > a[i]) {
k++;
}
if (s == i - 1 || k == i - 1) {
l++;
}
}
s = 0;
k = 0;
}
cout << l << endl;
return 0;
}
| 7 | CPP |
if int(input())==1:print(0)
else:
a = list(map(int, input().split()));c = 0;d = a[0];e = a[0]
for i in range(1,len(a)+1):
if d<max(a[1:i+1]):c+=1;d=max(a[1:i+1])
if e>min(a[1:i+1]):c+=1;e=min(a[1:i+1])
print(c)
| 7 | PYTHON3 |
n= int(input())
l=list(map(int,input().split()))
amazing=0
best=l[0]
worst=l[0]
for i in range(1,n):
if(l[i]>best):
amazing+=1
best=l[i]
if(l[i]<worst):
amazing+=1
worst=l[i]
print(amazing) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, temp, max, min, cnt = 0;
cin >> x;
cin >> temp;
min = temp;
max = temp;
for (int i = 1; i < x; i++) {
cin >> temp;
if (temp < min) {
min = temp;
cnt++;
}
if (temp > max) {
max = temp;
cnt++;
}
}
cout << cnt;
}
| 7 | CPP |
N = int(input())
scores = list(map(int,input().split()))
result = 0
maxScore = int(scores[0])
minScore = int(scores[0])
for i in range(1,N):
score = int(scores[i])
if(score > maxScore):
maxScore = score
result += 1
elif(score < minScore):
minScore = score
result += 1
print (result) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int maxv = -1, minv = 1000000;
int ret = 0;
for (int i = 0; i < (int)(n); i++) {
int x;
cin >> x;
if (i) {
if (x > maxv)
++ret;
else if (x < minv)
++ret;
}
maxv = max(maxv, x);
minv = min(minv, x);
}
cout << ret << endl;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int,input().split()))
x = a[0]
y = a[0]
t = 0
for i in a:
if i > x:
x = i
t += 1
if i < y:
y = i
t += 1
print(t) | 7 | PYTHON3 |
n = int(input())
scores = [int(i) for i in input().split()]
maxs = scores[0]
mins = scores[0]
count = 0
for s in scores:
if s > maxs:
count += 1
maxs = s
if s < mins:
count += 1
mins = s
print(count)
| 7 | PYTHON3 |
n=int(input())
b=list(map(int,input().split()))
ln=b[0]
hn=b[0]
count=0
for i in range (1,n):
if (b[i]<ln):
count+=1
ln=b[i]
if (b[i]>hn):
count+=1
hn=b[i]
print(count) | 7 | PYTHON3 |
num_of_contests = int(input())
scores = input().split()
scores = [int(y) for y in scores]
max_val = scores[0]
min_val = scores[0]
counter = 0
for x in scores:
if x > max_val:
max_val = x
counter += 1
elif x < min_val:
min_val = x
counter += 1
print(counter)
| 7 | PYTHON3 |
n = int(input())
a = [int(el) for el in input().split(' ')]
if n == 1 :
print(0)
else :
min_a = a[0]
max_a = a[0]
count = 0
for i in range(1, n) :
if a[i] > max_a :
count += 1
max_a = a[i]
elif a[i] < min_a :
count += 1
min_a = a[i]
print(count) | 7 | PYTHON3 |
n = int(input())
amazing = 0
points = [int(x) for x in input().split()]
maxCur = points[0]
minCur = points[0]
for i in range (1, n):
if points[i] > maxCur:
amazing += 1
maxCur = points[i]
elif points[i] < minCur:
amazing += 1
minCur = points[i]
print(amazing) | 7 | PYTHON3 |
n = int(input())
a= [int(s) for s in input().split()]
c=0
refm = a[0]
refl = a[0]
for i in range(1, n):
if a[i] > refm:
refm = a[i]
c+=1
elif a[i] < refl :
refl = a[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
a=[int(j) for j in input().split()]
l=list([])
l.append(a[0])
jieguo=0
for i in range(1,n):
if a[i]>l[-1] or a[i]<l[0]:
l.append(a[i])
jieguo=jieguo+1
else:
l.append(a[i])
l.sort()
print(jieguo)
| 7 | PYTHON3 |
n=int(input())
lst=list(map(int,input().split()))
count=0
maxx=minn=lst[0]
for i in range(1,n):
if lst[i]>maxx:
maxx=lst[i]
count+=1
elif lst[i]<minn:
minn=lst[i]
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
lst=[int(x) for x in input().split()]
c=0
miny=lst[0]
maxy=lst[0]
for i in range(1,n):
if lst[i]<miny:
miny=lst[i]
c+=1
if lst[i]>maxy:
maxy=lst[i]
c+=1
print(c) | 7 | PYTHON3 |
a=int(input())
b=[int(i) for i in input().split()]
past=[b[0]]
amazing=0
for i in b[1:]:
if i>max(past):
amazing+=1
elif i<min(past):
amazing+=1
past.append(i)
print(amazing)
| 7 | PYTHON3 |
n = int(input())
a = [int(a) for a in input().split()]
cmin=a[0]
cmax=a[0]
count=0
for i in range(n):
if a[i]<cmin:
count+=1
cmin=a[i]
elif a[i]>cmax:
count+=1
cmax=a[i]
print(count) | 7 | PYTHON3 |
# I_love_%username% - codeforces
#
import math
import sys
input = sys.stdin.readline
def inp():
return int(input())
def invr():
return list(map(int, input().split()))
n = inp()
nn = invr()
m = nn[0]
M = m
a = 0
for i in range(1, n):
x = nn[i]
if x < m:
m = x
a += 1
# print(i+1)
elif x > M:
M = x
a += 1
# print(i+1)
print(a)
| 7 | PYTHON3 |
n = int(input())
list = [int(x) for x in input().split()]
s = 0
if n==1:
print(0)
else:
for i in range(1,n):
if any(x<=list[i] for x in list[0:i]) and any(x>=list[i] for x in list[0:i]):
s = s
else:
s += 1
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int vis[200];
int main() {
int a, b, mx = 0, mn = 2000000000;
cin >> a;
int res = 0;
for (int i = 0; i < a; ++i) {
cin >> b;
if (i) {
if (b > mx) res++;
if (b < mn) res++;
mx = max(mx, b);
mn = min(mn, b);
} else
mx = mn = b;
}
cout << res << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int entry;
cin >> entry;
int max = entry, min = entry, ans = 0;
for (int i = 0; i < n - 1; i++) {
cin >> entry;
if (entry > max) {
max = entry;
ans++;
} else if (entry < min) {
min = entry;
ans++;
}
}
cout << ans << "\n";
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
c=0
for i in range(1,len(l)):
v=l[i]
bg=0
sm=0
lg=i
for j in range(i-1,-1,-1):
if l[i]>l[j]:
bg+=1
elif l[i]<l[j]:
sm+=1
if bg==lg or sm==lg:
c+=1
print(c)
| 7 | PYTHON3 |
n=int(input())
A=[int(i) for i in input().split()]
s=0
for i in range(n):
i=i+1
B=A[0:i]
if i<n:
if A[i]<min(B) or A[i]>max(B):
s+=1
print(s) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
c_min=0
c_max=0
max_ele=arr[0]
min_ele=arr[0]
for i in range(1,n):
if(min_ele>arr[i]):
c_min+=1
min_ele=arr[i]
elif(max_ele<arr[i]):
c_max+=1
max_ele=arr[i]
print(c_max+c_min)
| 7 | PYTHON3 |
n = int(input())
nums = [int(x) for x in input().split()]
min_v, max_v = nums[0], nums[0]
res = 0
for i in nums[1:]:
if i < min_v or i > max_v:
res += 1
min_v, max_v = min(i, min_v), max(i, max_v)
print(res)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
b = [a[0]]
count = 0
for i in range(1, n):
if a[i] < min(b) or a[i] > max(b):
count += 1
b.append(a[i])
print(count) | 7 | PYTHON3 |
n = int(input())
var = input()
var = list(map(int, var.split()))
minim = maxim = var[0]
aws = 0
for i in range(1, n):
if var[i] < minim:
aws += 1
minim = var[i]
elif var[i] > maxim:
aws += 1
maxim = var[i]
print(aws)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.