solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int m;
bool best[1000], worst[1000];
int main() {
int n, a[1000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i != 0)
if (a[i] > a[0])
for (int z = 0; z < i; z++) {
if (a[z] < a[i])
best[i] = true;
else {
best[i] = false;
z = i;
}
}
else if (a[i] < a[0])
for (int z = 0; z < i; z++) {
if (a[z] > a[i])
worst[i] = true;
else {
worst[i] = false;
z = i;
}
}
if (best[i] || worst[i]) m++;
}
cout << m;
return 0;
}
| 7 | CPP |
n=int(input())
points=[int(x) for x in input().split()]
min_point=points[0]
max_point=points[0]
amazing=0
for i in range(1,n):
if points[i]<min_point:
amazing+=1
min_point=points[i]
elif points[i]>max_point:
amazing+=1
max_point=points[i]
print(amazing) | 7 | PYTHON3 |
def iLoveUsername():
n = int(input())
values = input().split()
max = int(values[0])
min = int(values[0])
count = 0
for i in range(len(values)):
if int(values[i]) > max:
max = int(values[i])
count +=1
if int(values[i]) < min:
min = int(values[i])
count+=1
print(count)
iLoveUsername() | 7 | PYTHON3 |
n=int(input());
a=input().split();
b=int(a[0]);
w=int(a[0]);
i=1;
z=0;
while i<n:
if int(a[i])>b:
z+=1;
b=int(a[i]);
if int(a[i])<w:
z+=1;
w=int(a[i]);
i+=1;
print(z);
| 7 | PYTHON3 |
n = int(input())
s = [int(x) for x in input().split(' ')]
ans = 0
for i in range(1, n):
if s[i] > max(s[:i]) or s[i] < min(s[:i]):
ans += 1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, amazing = 0;
bool less = true, greater = true;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
cin >> c[i];
}
for (int i = 1; i < n; i++) {
less = true;
greater = true;
for (int j = i - 1; j < i && j >= 0; j--) {
if (c[i] >= c[j]) {
less = false;
break;
}
}
for (int j = i - 1; j < i && j >= 0; j--) {
if (c[i] <= c[j]) {
greater = false;
break;
}
}
if (less || greater) amazing++;
}
cout << amazing << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, maxi, mini;
cin >> n;
int z[n], o = 0;
for (i = 0; i < n; i++) {
cin >> z[i];
if (i == 0) {
maxi = z[i];
mini = z[i];
}
if (i > 0) {
if (z[i] > maxi) {
o++;
maxi = z[i];
}
if (z[i] < mini) {
o++;
mini = z[i];
}
}
}
cout << o;
}
| 7 | CPP |
def solve(s):
count= 0
m = s[0]
mi = s[0]
for i in range (len(s)):
if(m<s[i]):
m = s[i]
count +=1
if(mi>s[i]):
mi = s[i]
count +=1
return count
if __name__ == '__main__':
n = int(input())
s = list(map(int, input().split()))
print(solve(s))
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
x=0;m=0;c=0
if n==1 and len(l)==1:
print("0")
exit()
else:
for i in range(n):
if i==0:
x=l[i]
m=l[i]
else:
if l[i]>x:
x=l[i]
c+=1
elif l[i]<m:
m=l[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
mn=arr[0]
mx=arr[0]
ans=0
for i in arr:
if i<mn or i>mx:
ans+=1
mn=min(mn,i)
mx=max(mx,i)
print(ans)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
small = a[0]
large = a[0]
s = 0
l = 0
for i in range(1,n):
for j in range(0,i+1):
if(a[j]<small):
small = a[j]
s += 1
if(a[j]>large):
large = a[j]
l += 1
print(s+l) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, points;
cin >> n >> points;
int min(points), max(points), amazing(0);
while (--n) {
cin >> points;
if (points < min) {
min = points;
++amazing;
}
if (points > max) {
max = points;
++amazing;
}
}
cout << amazing << endl;
return 0;
}
| 7 | CPP |
# https://codeforces.com/problemset/problem/155/A
"""
For each contest, Vasya writes number of points coder got
Numbers are written in the order of the contests
Performance is amazing if:
Break his best performance earn strictly more points than in the past
Break his worst performance earn strictly less that in the past
The first contest is not considered amazing
Count the number of amazing performances coder has
"""
import sys
n = int(sys.stdin.readline())
points = list(map(int, sys.stdin.readline().split()))
amazing = 0
max_points, min_points = points[0], points[0]
for point in points:
if point > max_points:
amazing += 1
max_points = point
if point < min_points:
amazing += 1
min_points = point
sys.stdout.write(str(amazing))
| 7 | PYTHON3 |
n=int(input())
sum=0
i=1
a=input()
a=a.split()
max=int(a[0])
min=int(a[0])
for i in range(1,n):
if int(a[i]) >max:
max=int(a[i])
sum += 1
elif int(a[i]) <min:
min=int(a[i])
sum += 1
i += 1
print(sum)
| 7 | PYTHON3 |
n=int(input())
count=0
a=list(map(int,input().split()))
max=a[0];min=a[0]
for i in range(1,n) :
if a[i]>max:
count+=1
max=a[i]
if a[i]<min:
count+=1
min=a[i]
print(count)
#155A | 7 | PYTHON3 |
list=[]
n=int(input())
m=input().split()
for i in range(n):
list.append(int(m[i]))
small=list[0]
large=list[0]
count=0
for i in range(1,len(list)):
if(small>list[i]):
small=list[i]
count=count+1
for j in range(1,len(list)):
if(large<list[j]):
large=list[j]
count=count+1
print(count) | 7 | PYTHON3 |
n = int(input())
results = list(map(int, input().split()))
record_high = results[0]
record_low = results[0]
count = 0
for i in results[1:]:
if i > record_high:
count +=1
record_high = i
elif i < record_low:
count +=1
record_low = i
print(count) | 7 | PYTHON3 |
n = int(input())
nums = [int(a) for a in input().split()]
b = []
for a in nums:
if len(b)==0 or a>max(b):
b.append(a)
elif len(b)==0 or a<min(b):
b.append(a)
print(len(b)-1) | 7 | PYTHON3 |
t = int(input())
li = list(map(int,input().split()))[:t]
min = li[0]
max = li[0]
count = 0
for i in range(1,t):
if li[i]<min:
min = li[i]
count+=1
elif li[i]>max:
max = li[i]
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
scores = list(map(int, input().split()))
max_score, min_score = scores[0], scores[0]
c = 0
for score in range(1, n):
# if scores[score] < scores[score - 1]
if scores[score] > max_score:
max_score = scores[score]
c += 1
elif scores[score] < min_score:
min_score = scores[score]
c += 1
print(c)
| 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split()))
k=0
for i in range(1,n):
if m[i]>max(m[:i]) or m[i]<min(m[:i]):
k+=1
print(k) | 7 | PYTHON3 |
n=int(input())
s=[int(i) for i in input().split()]
M=s[0]
N=s[0]
count=0
for i in range(1,n):
if s[i]>M:
count+=1
M=s[i]
if s[i]<N:
count+=1
N=s[i]
print(count) | 7 | PYTHON3 |
n=int(input())
v=list(map(int,input().split()))
a=[]
b=0
for i in v:
a.append(i)
if len(a)>1 and a.count(i)==1:
if i==max(a) or i==min(a):
b+=1
print(b)
| 7 | PYTHON3 |
line1=int(input())
line2=input().split()
m=[]
for i in line2:
m.append(int(i))
a=m[0]
b=m[0]
count=0
for x in range(line1):
if m[x] <a and m[x] <b:
a=m[x]
count=count+1
elif m[x] >a and m[x] >b:
b=m[x]
count=count+1
print(count)
| 7 | PYTHON3 |
n = int(input())
score = input()
score = score.split(" ")
amaz = 0
highest = 0
lowest = 0
if n == 1:
print (amaz)
else:
if int(score[0]) > int(score[1]):
highest = int(score[0])
lowest = int(score[1])
amaz += 1
elif int(score[0]) < int(score[1]):
highest = int(score[1])
lowest = int(score[0])
amaz += 1
else:
highest = int(score[1])
lowest = int(score[0])
for x in score:
if int(x) > highest :
highest = int(x)
amaz += 1
elif int(x) < lowest :
lowest = int(x)
amaz += 1
else:
pass
print (amaz)
| 7 | PYTHON3 |
n = input()
scores = list(map(int, input().split(' ')))
highest = lowest = scores[0]
ans = 0
for (i, score) in enumerate(scores[1:]):
if score < lowest:
lowest = score
ans += 1
if score > highest:
highest = score
ans += 1
print(ans)
| 7 | PYTHON3 |
import sys
n = int(input())
alist = list(map(int, sys.stdin.readline().split()))
amax = alist[0]
amin = alist[0]
ans = 0
for i in range(1,n):
if alist[i] > amax:
amax = alist[i]
ans += 1
elif alist[i] < amin:
amin = alist[i]
ans += 1
print(ans)
| 7 | PYTHON3 |
x = int(input())
lst = list(map(int,input().split()))
less = lst[0]
big = lst[0]
c=0
for i in range(1,x):
k = lst[i]
if k<less:
c+=1
less = k
if k>big:
c+=1
big = k
print(c) | 7 | PYTHON3 |
n=int(input())
list1=[int(i) for i in input().split()]
s=0
t=0
tt=0
for i in range(n-1):
for m in range(i+1):
if list1[i+1]>list1[m]:
t=t+1
if list1[i+1]<list1[m]:
tt=tt+1
if t==i+1 or tt==i+1:
s=s+1
t=0
tt=0
print(s) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
s=0
b=[]
b.append(a[0])
for i in range(n):
if a[i]>max(b) or a[i]<min(b):
s+=1
b.append(a[i])
print(s) | 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
f=[]
c=0
for i in range(n):
if i==0:
f.append(s[i])
continue
if s[i]<min(f) or s[i]>max(f):
c+=1
f.append(s[i])
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, x, c, y, l, m, a;
a = 0;
l = 0;
m = 0;
scanf("%d", &n);
for (c = 1; c <= n; c++) {
scanf("%d", &y);
if (c == 1)
x = y;
else if (c == 2) {
if (y > x) {
m = y;
l = x;
a = a + 1;
} else if (y < x) {
l = y;
m = x;
a = a + 1;
} else if (y = x) {
m = y;
l = y;
}
} else if (c > 2 && c <= n) {
if (y > m) {
m = y;
a = a + 1;
} else if (l > y) {
l = y;
a = a + 1;
}
}
}
printf("%d\n", a);
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().strip().split()))
c=0
min=max=a[0]
for i in range(1,n):
if a[i]>max:
c+=1
max=a[i]
if a[i]<min:
c+=1
min=a[i]
print(c) | 7 | PYTHON3 |
n = input()
l = list(map(int, input().split()))
largest = l[0]
smallest = l[0]
count = 0
for i in range(1, len(l)):
if largest < l[i]:
largest = l[i]
count += 1
elif smallest > l[i]:
smallest = l[i]
count += 1
print(count) | 7 | PYTHON3 |
a = int(input())
lista = list(map(int,input().split()))
menor = lista[0]
mayor = lista[0]
c =0
for i in range(0,a):
if(lista[i]<menor):
menor = lista[i]
c +=1
if(lista[i]>mayor):
mayor = lista[i]
c +=1
print(c)
| 7 | PYTHON3 |
n = int(input())
l = [ int(x) for x in input().split()]
count = 0
for i in range(n-1):
if l[i+1] > max(l[:i+1]):
count+=1
elif l[i+1]< min(l[:i+1]):
count+=1
print(count) | 7 | PYTHON3 |
n=int(input())
lst=list(map(int,input().split()))
total=0
minn=lst[0]
maxx=lst[0]
for i in range(1,n):
if lst[i]>maxx:
total+=1
maxx=lst[i]
if lst[i]<minn:
total+=1
minn=lst[i]
print(total) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
maks = a[0]
minim = a[0]
hasil = 0
for i in range(1,len(a)):
if a[i] > maks:
hasil += 1
maks = a[i]
if a[i] < minim:
hasil += 1
minim = a[i]
print(hasil)
| 7 | PYTHON3 |
n = int(input())
points = list(map(int, input().split()))
count = 0
for i in range(1, n):
if i > 1:
if points[i] > points[i-1]:
great = True
for j in range(i-2, -1, -1):
if points[i] <= points[j]:
great = False
break
elif points[i] < points[i-1]:
great = True
for j in range(i-2, -1, -1):
if points[i] >= points[j]:
great = False
break
else:
great = False
else:
if points[i] == points[i-1]:
great = False
else:
great = True
if great:
count += 1
print(count) | 7 | PYTHON3 |
number = int(input())
scores = [int(x) for x in input().split(' ')]
amazing_performances = 0
mini = scores[0]
maxi = scores[0]
for i in range(1, number):
if scores[i] < mini:
amazing_performances += 1
mini = scores[i]
if scores[i] > maxi:
amazing_performances += 1
maxi = scores[i]
print(amazing_performances)
| 7 | PYTHON3 |
n=int(input())
points=input().split()
amazing=[]
ans=0
for i in range(n):
points[i]=int(points[i])
amazing.append(points[0])
for i in range(1,n):
amazing.append(points[i])
amazing.sort()
if points[i]<amazing[1] or points[i]>amazing[i-1]:
ans+=1
print(ans)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
ans = 0
for i in range(1,n):
p = min(l[:i])
q = max(l[:i])
if(l[i]>q or l[i]<p):
ans+=1
print(ans) | 7 | PYTHON3 |
n = int(input())
s = list(map(int, input().split()))
amazing = 0
for i in range(n):
if i > 0 and not s[i] in s[:i]:
if s[i] < min(s[:i]) or s[i] > max(s[:i]):
amazing +=1
print(amazing) | 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split()))
z=0
x=[]
if n==2 and m[0]==m[1]:
print(0)
exit()
if n==2:
print(1)
exit()
if n==1:
print(0)
exit()
for i in range(1,n):
x=m[:i+1]
if min(x)==m[i]:
if x.count(m[i])==1:
z+=1
elif max(x)==m[i]:
if x.count(m[i])==1:
z+=1
print(z)
| 7 | PYTHON3 |
n = int(input())
points = list(map(int,input().split()))
count = 0
min1 = max(points)+1
max1 = 0
for x in range(n-1):
if points[x]>max1:
max1 = points[x]
if points[x]<min1:
min1 = points[x]
if points[x+1]>max1 or points[x+1]<min1:
count+=1
print(count) | 7 | PYTHON3 |
input()
a=list(map(int,input().split()))
mn=mx=a[0]
c=0
for i in range(len(a)):
if a[i]<mn:
mn=a[i]
c+=1
if a[i]>mx:
mx=a[i]
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
min = a[0]
max = a[0]
counter = 0
for i in a :
if i > max:
max = i
counter +=1
if i < min:
min = i
counter += 1
print(counter) | 7 | PYTHON3 |
n=int(input())
line=[int(i) for i in input().split()]
maxnum=line[0]
minnum=line[0]
total=0
for i in range(n):
if line[i]>maxnum:
total+=1
maxnum=line[i]
if line[i]<minnum:
total+=1
minnum=line[i]
print(total) | 7 | PYTHON3 |
n=int(input())
count=int(0)
score=list(map(int,input().split()))
for i in range(n):
if i ==0:
low=score[i]
high=score[i]
elif score[i]<low:
low=score[i]
count+=1
elif score[i]>high:
high=score[i]
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=input().split()
b=[]
for i in a:
b.append(int(i))
i=0
for k in range(1,n):
if b[k]>max(b[:k]) or b[k]<min(b[:k]):
i=i+1
else:
continue
print(i)
| 7 | PYTHON3 |
p=input()
k=input().split(" ")
#k=list(k)
k=list(map(int,k))
cnt=0
for i in range(len(k)):
flag=0
for j in range(0,i):
if(k[i]<k[j]):
flag=1
else:
flag=0
break
if(flag==1):
cnt+=1
else:
flag=0
for j in range(0,i):
if(k[i]>k[j]):
flag=1
else:
flag=0
break
if(flag==1):
cnt+=1
print(cnt) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
x,xx=l[0],l[0]
c,c1=0,0
for i in range(1,n):
if x<l[i]:
c+=1
x=l[i]
for i in range(1,n):
if xx>l[i]:
c+=1
xx=l[i]
print(c) | 7 | PYTHON3 |
n, counter = int(input()), 0
a = *map(int, input().split()),
counter += sum(a[i] < min(a[:i]) or a[i] > max(a[:i]) for i in range(1, n))
print(counter) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, max = -1, min = 10001, b = -2;
cin >> n;
vector<int> ar(n + 1);
for (int i = 1; i <= n; i++) {
cin >> ar[i];
if (ar[i] > max) {
max = ar[i];
b++;
}
if (ar[i] < min) {
min = ar[i];
b++;
}
}
cout << b;
return 0;
}
| 7 | CPP |
n=int(input())
s=list(map(int,input().split()))
min,max=s[0],s[0]
x=0
for i in range(1,n):
if s[i]>max:
max=s[i]
x+=1
if s[i]<min:
min=s[i]
x+=1
print(x) | 7 | PYTHON3 |
con=int(input())
num=list(map(int,input().split()))
k=0
for i in range(1,con):
list = []
for j in range(i):
list.append(num[j])
if max(list)<num[i]:
k+=1
elif min(list)>num[i]:
k+=1
print(k) | 7 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
ac = 0
M = p[0]
m = p[0]
for i in p[1:]:
if i > M :
M = i
ac+=1
elif i < m:
m = i
ac+=1
print(ac)
| 7 | PYTHON3 |
def func(n,l):
count = 0
for i in range(1, n):
c=l[:i]
a=max(c)
b=min(c)
if l[i] > a :
count=count+1
if l[i]< b:
count=count+1
return (count)
if __name__=="__main__":
n = int(input())
l = list(map(int, input().strip().split()))
print(func(n,l)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, x = 0, max, min;
cin >> n;
int a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
max = a[0];
min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max = a[i];
x++;
} else if (a[i] < min) {
min = a[i];
x++;
}
}
cout << x;
}
| 7 | CPP |
n = int(input())
M = list(map(int, input().split()))
min = max = M[0]
c = 0
for i in M:
if i > max:
max = i
c += 1
elif i < min:
min = i
c += 1
print(c) | 7 | PYTHON3 |
n=input()
ls=list(map(int,input().split()))
worst=ls[0]
best=ls[0]
count=0
for i in range(1,len(ls)):
if ls[i]<worst:
count=count+1
worst=ls[i]
elif ls[i]>best:
count=count+1
best=ls[i]
print(count) | 7 | PYTHON3 |
t = int(input())
a = list(map(int, input().split()[:t]))
c = 0;
c1 = 0;
temp = a[0];
temp1 = a[0]
for i in range(t - 1):
if temp > a[i + 1]:
c = c + 1
temp = a[i + 1]
elif temp1 < a[i + 1]:
c = c + 1
temp1 = a[i + 1]
print(c)
| 7 | PYTHON3 |
n=int(input())
point=[int(x) for x in input().split()]
max_=point[0]
min_=max_
del point[0]
s=0
for i in point:
if max_ < i:
s+=1
max_=i
elif min_ > i:
s+=1
min_=i
print(s)
| 7 | PYTHON3 |
n=int(input())
List=[int(j) for j in input().split(" ")]
Amazing=0
for i in range(1,n):
count=0
count_1=0
for k in range(i):
if List[i] > List[k] :
count+=1
if List[i] <List[k] :
count_1+=1
if count==i:
Amazing+=1
if count_1==i:
Amazing+=1
print(Amazing)
| 7 | PYTHON3 |
n = int(input())
contests = [int(x) for x in input().split(' ')]
new_max = contests[0]
new_min = contests[0]
res = 0
for i in range(1, n):
if contests[i] > new_max:
new_max = contests[i]
res += 1
elif contests[i] < new_min:
new_min = contests[i]
res += 1
print(res) | 7 | PYTHON3 |
def amazingPerformance(scores):
smallest = largest = scores[0]
howMany = 0
for s in scores[1:]:
if s < smallest:
smallest = s
howMany += 1
if s > largest:
largest = s
howMany += 1
return howMany
size = int(input())
scores = [int(i) for i in input().split()]
print(amazingPerformance(scores)) | 7 | PYTHON3 |
x = input()
x = [int(y) for y in input().split()]
ma = x[0]
mi = x[0]
am = 0
for n in x[1:]:
if n > ma:
ma = n
am+=1
elif n < mi:
mi = n
am+=1
print(am) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
M = a[0]
m = a[0]
s = 0
for i in range(1,n):
if a[i]>M:
s += 1
M = a[i]
if a[i]<m:
s += 1
m = a[i]
print(s) | 7 | PYTHON3 |
n=int(input(""))
list1=list(map(int,input().split()))
list2=[]
list3=[]
for i in range(1,len(list1)+1):
list2.append(max(list1[0:i]))
list3.append(min(list1[0:i]))
l=list(set(list2))
m=list(set(list3))
print(len(l)+len(m)-2)
| 7 | PYTHON3 |
n = int(input())
li = list(map(int, input().split()))
count = 0
min, max = li[0], li[0]
for i in range(1, len(li)):
if li[i] < min:
min = li[i]
count = count + 1
if li[i] > max:
max = li[i]
count = count + 1
print(count) | 7 | PYTHON3 |
n = int(input())
val = list(map(int,input().split(' ')))
max = val[0]
min = val[0]
answer = 0
for i in range(1,len(val)):
if val[i]>max or val[i]<min:
answer+=1
max = val[i] if max<val[i] else max
min = val[i] if min>val[i] else min
print(answer)
| 7 | PYTHON3 |
n=input()
a=[int(i) for i in input().split()]
x=[a[0]]
c=0
for i in range(1,len(a)):
if a[i]<min(x):
c=c+1
elif a[i]>max(x):
c=c+1
x.append(a[i])
print(c)
| 7 | PYTHON3 |
n = int(input())
s = input()
a = s.split()
for i in range(len(a)):
a[i] = int(a[i])
sum = 0
i = 1
while i < len(a):
if all(a[i] > a[j] for j in range(0,i)):
sum += 1
elif all(a[i] < a[j] for j in range(0,i)):
sum += 1
i += 1
print(sum) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a[n], count = 0, i;
for (i = 0; i < n; i++) cin >> a[i];
int min = a[0], max = a[0];
for (i = 1; i < n; i++) {
if (a[i] < min) {
count++;
min = a[i];
}
if (a[i] > max) {
count++;
max = a[i];
}
}
cout << count << endl;
}
| 7 | CPP |
n = int(input())
a=list(map(int,input().split()))+['t']
high = a[0]
low = a[0]
k = 0
for i in range(1,len(a)-1):
if a[i] > high:
high = a[i]
k += 1
elif a[i] < low:
low=a[i]
k += 1
else:
continue
print(k) | 7 | PYTHON3 |
n = int(input())
list = [int(i) for i in input().split()]
t = 0
B = list[0]
S = list[0]
for i in range(1,n):
if list[i] > B:
t = t+1
B = list[i]
if list[i] < S:
t= t+1
S = list[i]
print(t)
| 7 | PYTHON3 |
num = eval(input())
score = [eval(i) for i in input().split()]
benchmarkMax = score[0]
benchmarkMin = score[0]
count = 0
for i in range(num):
if score[i] > benchmarkMax or score[i] < benchmarkMin: count += 1
benchmarkMax = max(benchmarkMax, score[i])
benchmarkMin = min(benchmarkMin, score[i])
print(count) | 7 | PYTHON3 |
n=int(input())
b=list(map(int,input().split()))
# print(n,b)
count=-1
for i in range(len(b)):
mi=0
ma=0
for j in range(i):
if b[i]<b[j]:
mi+=1
elif b[i]>b[j]:
ma+=1
if mi == i or ma == i:
# print(b[i])
count+=1
print(count)
| 7 | PYTHON3 |
tour = int (input(""))
numbers=input("")
numbers=numbers.split()
i=0
biggest=int(numbers[0])
lowest=int(numbers[0])
amazingNumbers=0
for i in numbers:
if int(i)>biggest:
biggest =int(i)
amazingNumbers+=1
elif int(i)<lowest:
lowest =int(i)
amazingNumbers+=1
print(amazingNumbers)
| 7 | PYTHON3 |
'''PRANDNYA WILDCARD ROUND 2019
A) SWITCH CASE'''
'''n=int(input())
for i in range(0,n):
p=input().rstrip().split(' ')
q=int(input())
F=int(p[0])
A=int(p[1])
B=int(p[2])
for j in range(0,q):
u=input().rstrip().split(' ')
T=A;
Y=B;
C=F;
if int(u[0])!=T:
if C==0:
C=1;
else:
C=0;
if int(u[1])!=Y:
if C==0:
C=1;
else:
C=0;
if C==0:
print("OFF")
else:
print("ON")'''
X=0;
n=int(input())
p=input().rstrip().split(' ')
maxf = -9999999;
minf = 1000000
for i in range(0,len(p)):
if i==0:
if int(p[i])>maxf:
maxf = int(p[i])
if int(p[i])<minf:
minf = int(p[i])
else:
if int(p[i])>maxf:
X+=1;
maxf=int(p[i])
if int(p[i])<minf:
X+=1;
minf = int(p[i])
print(X)
| 7 | PYTHON3 |
num = 0
n=int(input())
c=[int(i) for i in input().split()]
m=[c[0]]
minm=m[0]
maxm=m[0]
for i in range(1,len(c)):
f=c[i]
if f<minm:
num+=1
minm=f
elif f>maxm:
num+=1
maxm=f
print(num) | 7 | PYTHON3 |
n=int(input())
num=input()
list=[int(i) for i in num.split()]
l=[list[0]]
k=0
for i in range(1,n):
if int(list[i])>max(l) or int(list[i])<min(l) :
k+=1
l.append(list[i])
else:
k=k
l.append(list[i])
print(k) | 7 | PYTHON3 |
n = int(input())
nums = list(map(int, input().split(' ')))
amaz = 0
low = nums[0]
high = nums[0]
for i in range(1, n):
if nums[i] < low:
amaz += 1
low = nums[i]
elif nums[i] > high:
amaz += 1
high = nums[i]
print(amaz)
| 7 | PYTHON3 |
n = int(input())
lst = []
amazing = 0
scores = input()
scores = list(map(int, scores.split()))
for i in range(n):
score = scores[i]
if len(lst) > 0:
if score > max(lst) or score < min(lst):
amazing += 1
lst.append(score)
print(amazing)
| 7 | PYTHON3 |
n=int(input())
a=[int(i)for i in input().split()]
x=y=a[0]
s=0
for i in range(1,n):
if a[i]>x or a[i]<y:
s=s+1
x=max(x,a[i])
y=min(y,a[i])
print(s) | 7 | PYTHON3 |
#155A
num = int(input())
arr = []
arr = [i for i in input().split()][:num]
arr = [int(i) for i in arr]
amazing = 0
max = arr[0]
min = arr[0]
for i in range(1,len(arr)):
if (arr[i] < min):
min = arr[i]
amazing = amazing + 1
if (arr[i] > max):
max = arr[i]
amazing = amazing + 1
print(amazing)
| 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
c = 0
for i in range(1, n):
if(a[i] > max(a[0:i]) or a[i] < min(a[0:i])):
c += 1
print(c) | 7 | PYTHON3 |
x=int(input())
lt=[int(i) for i in input().split()]
m=lt[0]
n=lt[0]
z=0
for i in range(1,x):
if lt[i]>m:
z+=1
m=lt[i]
elif lt[i]<n:
z+=1
n=lt[i]
print(z) | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
mx = mn = arr[0]
awsm = 0
for i in range(1,n):
if arr[i] > mx:
mx = arr[i]
awsm += 1
elif arr[i] < mn:
mn = arr[i]
awsm += 1
print(awsm)
| 7 | PYTHON3 |
n = int(input())
points = list(map(int, input().split()))
low = points[0]
high= points[0]
amazing =0
for i in range(1, n):
if points[i] < low:
amazing+=1
low = points[i]
if points[i] > high:
amazing +=1
high = points[i]
print (amazing) | 7 | PYTHON3 |
#!/usr/bin/python3
n = int(input())
worst = 0
best = 0
count = 0
scorestr = input().split()
for i in list(range(n)):
score = int(scorestr[i])
if i == 0:
worst = score
best = score
else:
if score < worst:
count += 1
worst = score
if score > best:
count += 1
best = score
print(count) | 7 | PYTHON3 |
def Sol(arr,n):
count = 0
for i in range(1,n):
if arr[i] > max(arr[:i]) or arr[i] < min(arr[:i]):
count += 1
print(count)
return
#for t in range(int(input())):
n = int(input())
arr = list(map(int,input().split()))
#l = list(map(int,input().split()))
Sol(arr,n)
| 7 | PYTHON3 |
n=int(input())
poi=list(map(int,input().split()))
maxPoints=None
minPoints=None
amazPoints=0
for i in poi:
if(maxPoints==None and minPoints==None):
maxPoints=i
minPoints=i
elif(i>maxPoints):
maxPoints=i
amazPoints+=1
elif(i<minPoints):
minPoints=i
amazPoints+=1
print(amazPoints)
| 7 | PYTHON3 |
n=int(input())
l=[i for i in input().split()]
l=[int(i) for i in l]
p=0
i=2
while i<=n-1:
if l[i]>max(l[0:i]) or l[i]<min(l[0:i]):
p=p+1
i=i+1
if len(l)>1 and l[1]!=l[0]:
p=p+1
print(p)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int ToInt(string& s, int len) {
int r = 0;
for (int i = 0, max_ = (len); i < max_; ++i) {
r *= 10;
r += s[i] - '0';
}
return r;
}
int GCD(int a, int b) { return b != 0 ? GCD(b, a % b) : a; }
int LCM(int a, int b) { return a * (b / GCD(a, b)); }
long long Pow(long long n, long long e) {
if (e == 0) return 1;
if (e == 1)
return n;
else if (e & 1) {
long long t = Pow(n, e / 2);
return n * t * t;
} else {
long long t = Pow(n, e / 2);
return t * t;
}
}
int main() {
int N, min, max, t, res = 0;
scanf("%d", &N);
scanf("%d", &t);
min = max = t;
for (int i = 0, max_ = (N - 1); i < max_; ++i) {
scanf("%d", &t);
if (t < min) {
++res;
min = t;
} else if (t > max) {
++res;
max = t;
}
}
printf("%d\n", res);
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(1,n):
c1=0
c2=0
for j in range(i-1,-1,-1):
if a[i]<a[j]:
c1=c1+1
if a[i]>a[j]:
c2=c2+1
if c1==i or c2==i:
s=s+1
print(s) | 7 | PYTHON3 |
count = 0
count_2 = 0
n = int(input())
lis = list(map(int, input().split()))
b = lis[0]
for i in range(len(lis)):
if lis[i]>b:
b=lis[i]
count += 1
#print(count)
c = lis[0]
for num in range(1, len(lis)):
if lis[num] < c:
c = lis[num]
count_2 += 1
#print(count_2)
print(count + count_2) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
maxrecord=l[0]
minrecord=l[0]
for i in range(1,len(l)):
if(l[i]>maxrecord):
maxrecord=l[i]
c+=1
elif(l[i]<minrecord):
minrecord=l[i]
c+=1
print(c) | 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
c=0
cpy=[]
cpy.append(b[0])
for i in range(1,a):
cpy.append(b[i])
if ((b[i]==max(cpy)) or (b[i]==min(cpy))) and (cpy.count(b[i])==1):
c=c+1
print(c)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i, j, count1 = 0, count2 = 0, sum = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
for (j = i - 1; j >= 0; j--) {
if (a[i] > a[j]) {
count1++;
}
if (a[i] < a[j]) {
count2++;
}
if (count1 == i) sum++;
if (count2 == i) sum++;
}
count1 = 0;
count2 = 0;
}
printf("%d", sum);
return 0;
}
| 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.