solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
input()
a=input().split()
m=M=int(a[0])
ans=0
for i in a:
if int(i)>M:
M=int(i)
ans+=1
elif int(i)<m:
m=int(i)
ans+=1
print(ans)
#http://codeforces.com/problemset/problem/155/A
| 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
mx, mn = lst[0], lst[0]
cnt = 0
for s in lst:
if s > mx:
cnt += 1
mx = s
elif s < mn:
cnt += 1
mn = s
print(cnt)
| 7 | PYTHON3 |
contests = int(input())
string = input()
points = string.split(" ")
for x in range(contests):
temp = points[x]
del points[x]
points.insert(x, int(temp))
amazing = 0
for x in range(1, contests):
temp = points[x]
results = "yes"
for y in range(x):
if not temp > points[y]:
results = "no"
break
if results == "no":
results = "yes"
for y in range(x):
if not temp < points[y]:
results = "no"
break
if results == "yes":
amazing += 1
print(amazing) | 7 | PYTHON3 |
c = int(input()) * 0
arr = [int(i) for i in input().split()]
for i,j in enumerate(arr):
if i:
if j > max(arr[:i]) or j < min(arr[:i]):
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
scores = input().split()
maxs = mins = int(scores[0])
amazing = 0
for i in range(1, n):
s = int(scores[i])
if s < mins:
amazing += 1
mins = s
elif s > maxs:
amazing += 1
maxs = s
print(amazing)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sun Mar 29 15:28:26 2020
@author: the lonely wolf
"""
n = input()
n=int(n) #no of coins
arr = list(map(int, input().split())) ##coins
counter = 0
for i in range(1, len(arr)):
if arr[i] > max(arr[:i]) or arr[i] < min(arr[:i]):
counter = counter + 1
print(int(counter))
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sun Apr 26 21:01:44 2020
@author: Syed Ishtiyaq Ahmed
"""
n=int(input())
arr=[]
arr.append(input().split())
arr2=[]
ac=0
for i in arr[0]:
arr2.append(int(i))
for i in range(1,len(arr2)):
lc=0
gc=0
for j in range(0,i):
if arr2[j]<arr2[i]:
lc+=1
elif arr2[j]>arr2[i]:
gc+=1
if lc==i or gc==i:
ac+=1
print(ac)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
mx, mn = l[0], l[0]
ans = 0
for i in l[1: ]:
if i > mx:
mx = i
ans -= -1
elif i < mn:
mn = i
ans -= -1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int ar[10001];
for (i = 0; i < n; i++) cin >> ar[i];
int mi, ma, c = 0;
mi = ar[0];
ma = ar[0];
for (i = 1; i < n; i++) {
if (ar[i] > ma) {
ma = ar[i];
c++;
} else if (ar[i] < mi) {
mi = ar[i];
c++;
}
}
cout << c << endl;
return 0;
}
| 7 | CPP |
import re
import math
import copy
o=input()
l= [int(i) for i in input().split()]
b=l[0]
s=l[0]
a=0
for d in l:
if d>b:
a+=1
b=copy.deepcopy(d)
elif d<s:
a+=1
s=copy.deepcopy(d)
print(a)
| 7 | PYTHON3 |
n = int(input())
lst = [int(i) for i in input().split()]
total = 0
for i in range(1,n):
past_lst = lst[:i]
if lst[i] > max(past_lst) or lst[i]< min(past_lst):
total += 1
print(total)
| 7 | PYTHON3 |
n = int(input())
arr = list(map(int,input().split()))
low,high = arr[0],arr[0]
count = 0
for i in range(1,n):
if arr[i]<low:
count += 1
low = arr[i]
elif arr[i]>high:
count += 1
high = arr[i]
print(count) | 7 | PYTHON3 |
n = int(input())
pointsInContests = [int(x) for x in input().split()]
def amazingPerformances(n, pointsInContests):
amazingPerformancesVariable = 0
for i in range(0, n):
if i == 0:
best = pointsInContests[i]
worst = pointsInContests[i]
else:
if pointsInContests[i] > best:
amazingPerformancesVariable = amazingPerformancesVariable + 1
best = pointsInContests[i]
if pointsInContests[i] < worst:
amazingPerformancesVariable = amazingPerformancesVariable + 1
worst = pointsInContests[i]
#print(str(i + 1) + ". Best = " + str(best) + ". Worst = " + str(worst))
return amazingPerformancesVariable
print(amazingPerformances(n, pointsInContests))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
large = a[0]
small = a[0]
amazing = 0
for i in range(1, n):
if(large < a[i]):
large = a[i]
amazing += 1
elif(small > a[i]):
small = a[i]
amazing += 1
print(amazing) | 7 | PYTHON3 |
n = int(input())
k = list(map(int,input().split()))
count = 0
max_ = k[0]
min_ = k[0]
for i in range(1,len(k)):
if k[i] > max_:
max_ = k[i]
count+=1
if k[i] < min_:
min_=k[i]
count+=1
print(count)
| 7 | PYTHON3 |
n = int(input())
scores = list(map(int, input().split()))
count = 0
for i in range(1, n):
if max(scores[:i]) < scores[i] or min(scores[:i]) > scores[i]:
count += 1
print(count)
| 7 | PYTHON3 |
n=int(input())
s=[int(s) for s in input().split()]
r=[]
c=0
for i in range(len(s)):
if i==0:
r.append(s[0])
else:
if max(r)<s[i]:
c+=1
elif min(r)>s[i]:
c+=1
r.append(s[i])
print(c)
| 7 | PYTHON3 |
n = int(input(""))
list = [int(x) for x in input("").split()]
del list[n:]
h=list[0]
l=list[0]
count=0
for x in list:
if x>h:
count+=1
h=x
if x<l:
count+=1
l=x
print(count) | 7 | PYTHON3 |
n = int(input())
pts = []
x = input().split()
for i in x:
pts.append(int(i))
best = 0
worst = 0
amazing = 0
best = pts[0]
worst = pts[0]
for i in pts:
if i > best:
best = i
amazing += 1
elif i < worst:
worst = i
amazing += 1
print(amazing)
| 7 | PYTHON3 |
n=int(input())
lst=list(map(int,input().split()))
lst2=[]
for i in lst:
if i not in lst2:
lst2.append(i)
lst1=[]
k=0
i=0
while i<len(lst2):
if lst2[i] not in lst1:
lst1.append(lst2[i])
if (min(lst1)==lst2[i] or max(lst1)==lst2[i]) and len(lst1)>1:
#print(lst2[i],end=' ')
k+=1
i+=1
print(k) | 7 | PYTHON3 |
n = int(input())
mas = list(map(int, input().split()))
_min = _max = mas[0]
count = 0
for i in range(1, n) :
if mas[i] > _max :
count += 1
_max = mas[i]
elif mas[i] < _min :
count += 1
_min = mas[i]
print(count)
| 7 | PYTHON3 |
def best(current, all, index):
for i in range(index):
if int(all[i]) < int(current):
if i == index - 1:
return 1
else:
return 0
def worst(current, all, index):
for i in range(index):
if int(all[i]) > int(current):
if i == index - 1:
return 1
else:
return 0
length = int(input())
scores = input().split()
count = 0
for i in range(1, len(scores)):
count = count + best(scores[i], scores, i) + worst(scores[i], scores, i)
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i, cnt = 0;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) scanf("%d", &a[i]);
int max = a[0];
int min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max = a[i];
cnt++;
} else if (a[i] < min) {
min = a[i];
cnt++;
}
}
printf("%d\n", cnt);
return 0;
}
| 7 | CPP |
n = int(input())
l = list(map(float,input().split()))
print(sum( not min(l[:i]) <=l[i] <=max(l[:i]) for i in range(1,n))) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
"""
created by shhuan at 2017/11/22 11:27
"""
N = int(input())
A = [int(x) for x in input().split()]
maxa = A[0]
mina = A[0]
ans = 0
for v in A[1:]:
if v > maxa or v < mina:
ans += 1
maxa = max(maxa, v)
mina = min(mina, v)
print(ans) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
count=0
for i in a:
if count==0:
min=i
max=i
count+=1
elif i>max:
max=i
count+=1
elif i<min:
min=i
count+=1
print(count-1) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
m=mi=l[0]
x=0
for i in range(1,n):
if l[i]>m:
m=l[i]
x+=1
elif l[i]<mi:
mi = l[i]
x+=1
print(x) | 7 | PYTHON3 |
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
n = I()
a = LI()
c=0
mx,mn=a[0],a[0]
for i in range(1,n):
if a[i]>mx:
c+=1
mx=a[i]
if a[i]<mn:
c+=1
mn=a[i]
pf(str(c))
if __name__ == "__main__":
main() | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
mi = l[0]
ma = l[0]
count = 0
for i in range(1,len(l)):
if(l[i]<mi):
mi = l[i]
count = count+1
if(l[i]>ma):
ma = l[i]
count = count+1
print(count) | 7 | PYTHON3 |
n=int(input())
score=input().split()
amazing=[]
ans=0
for i in range(n):
score[i]=int(score[i])
amazing.append(score[0])
for i in range(1,n):
amazing.append(score[i])
amazing.sort()
if score[i]<amazing[1] or score[i]>amazing[i-1]:
ans+=1
print(ans) | 7 | PYTHON3 |
n=int(input())
score=[int(i) for i in input().split()]
if n==1:
print(0)
elif n==2:
if score[0]==score[1]:
print(0)
else:
print(1)
else:
amazing=0
min=score[0]
max=score[0]
for i in range(1,n):
if min <= score[i]<= max:
amazing+=0
elif score[i]>max:
max=score[i]
amazing+=1
else:
min=score[i]
amazing+=1
print(amazing)
| 7 | PYTHON3 |
n = int(input())
point = list(map(int,input().split()))
amaz = 0
if n > 1:
b = [point[0]]
i = 1
while i < n:
if point[i] > max(b) or point[i] < min(b):
b.append(point[i])
amaz += 1
else:
pass
i += 1
print(amaz)
| 7 | PYTHON3 |
n = int(input())
m = [int(i) for i in input().split()]
mn = m[0]
mx = m[0]
r = 0
p = m[0]
for i in m[1:]:
if p < i:
if i > mx:
mx = i
r += 1
if p > i:
if i < mn:
mn = i
r += 1
print(r) | 7 | PYTHON3 |
input()
m, *s=map(int,input().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 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p, ma, mi, a = 0;
cin >> n;
cin >> p;
ma = p;
mi = p;
while (n--) {
cin >> p;
if (p < mi || p > ma) a++;
ma = max(ma, p);
mi = min(mi, p);
}
cout << a;
return 0;
}
| 7 | CPP |
n=int(input())
a=[int(x) for x in input().split()]
mi=a[0]
ma=a[0]
c=0
for i in a[1:]:
if i>ma:
ma=i
c+=1
elif i<mi:
mi=i
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().split()))
hist=[arr[0]]
m=0
for i in arr[1:]:
if i>max(hist) or i<min(hist):
m+=1
hist.append(i)
print(m)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c = 0;
cin >> n;
int a[n];
for (i = 0; i < n; i++) cin >> a[i];
int max = a[0];
int min = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max) {
max = a[i];
c++;
} else if (a[i] < min) {
min = a[i];
c++;
}
}
cout << c;
}
| 7 | CPP |
n=int(input())
l=[int(c) for c in input().split()]
'''for j in range(0,n):
x=int(input())
l.append(x)'''
min=l[0]
max=l[0]
amz=0
for i in range(1,n):
if(max<l[i]):
amz+=1
max=l[i]
elif(min>l[i]):
amz+=1
min=l[i]
print(amz)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int mx, mn;
cin >> mx;
mn = mx;
int a = 0;
if (n == 1) {
cout << "0\n";
return 0;
}
while (n--) {
int t;
cin >> t;
if (t > mx) {
mx = t;
a++;
}
if (t < mn) {
mn = t;
a++;
}
}
cout << a << endl;
return 0;
}
| 7 | CPP |
n = int(input())
li = list(map(int,input().split()))
k = 0
max = 0
min = 0
for i in range(1,n):
if li[i]> li[max]:
max = i
k=k+1
if li[i]<li[min]:
min = i
k = k+1
print(k)
| 7 | PYTHON3 |
counter=0
input()
test=list(map(int,input().split()))
a=[test[0]]
for i in range(1,len(test)):
if test[i] not in a:
a.append(test[i])
if test[i]==max(test[:i+1]) or test[i]==min(test[:i+1]):
counter+=1
print(counter) | 7 | PYTHON3 |
import sys
n = int(input())
a = list(map(int, input().split()))
mi = a[0]
ma = a[0]
ans = 0
for i in range(1,n):
if a[i] > ma:
ans += 1
ma = a[i]
if a[i] < mi:
ans += 1
mi = a[i]
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt1, cnt2, cnt = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 1; i < n; i++) {
cnt1 = 0, cnt2 = 0;
for (int j = 0; j < i; j++) {
if (arr[j] > arr[i]) cnt1++;
if (arr[j] < arr[i]) cnt2++;
}
if (cnt1 == i || cnt2 == i) cnt++;
}
cout << cnt;
return 0;
}
| 7 | CPP |
x= int(input())
arr = list(map(int, input().split()))
h = arr[0]
l = arr[0]
amz = 0
for i in range(x ):
if arr[i] > h:
amz+=1
h=arr[i]
elif arr[i] < l :
amz+=1
l=arr[i]
print(amz) | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
min1 = a[0]
max1 = a[0]
s = 0
for i in a:
if i > max1:
s += 1
max1 = i
elif i < min1:
s += 1
min1 = i
print(s) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
small = a[0]
big = a[0]
s = 0
for i in range(1,n):
if a[i]>big:
big = a[i]
s+=1
if a[i]<small:
small = a[i]
s+=1
print(s) | 7 | PYTHON3 |
n=int(input())
con=input().split()
for i in range(n):
con[i]=int(con[i])
ma=mi=con[0]
a=0
for i in range(1,n):
if con[i]>ma:
ma=con[i]
a+=1
if con[i]<mi:
mi=con[i]
a+=1
print(a)
| 7 | PYTHON3 |
n=int(input())
s=input().split()
max=int(s[0])
min=int(s[0])
u=0
for i in range(n):
if(int(s[i])>max):
max=int(s[i])
u+=1
elif(int(s[i])<min):
min=int(s[i])
u+=1
print(u)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
count = 0
min_so_far = l[0]
max_so_far = l[0]
for i in range(1, n): # loop here
canidate_performance = l[i]
if canidate_performance > max_so_far: # greater than all numbers before or less than all numbers before
max_so_far = canidate_performance
count = count + 1 # increment count under a condition
elif canidate_performance < min_so_far:
min_so_far = canidate_performance
count = count + 1
print(count) | 7 | PYTHON3 |
input();x=0
l=list(map(int,input().split()))
if len(l)>1:
a=max(l[0],l[1])
b=min(l[0],l[1])
if a!=b:
x+=1
for i in range(2,len(l)):
if l[i]>a :
x+=1
a=l[i]
if l[i]<b:
x+=1
b=l[i]
print(x)
else:
print(0) | 7 | PYTHON3 |
n = int(input())
super = 0
imax = 0
imin = 0
value = False
for i in map(int, input().split(" ")):
if n > 1:
if not value:
imax = i
imin = i
value = True
if i > imax:
super += 1
imax = i
if i < imin:
super += 1
imin = i
print(super) | 7 | PYTHON3 |
n=int(input())
l=[int(i) for i in input().split()]
ma=l[0]
mi=l[0]
a=0
for i in range(1,n):
if l[i]>ma or l[i]<mi:
a=a+1
ma=max(ma,l[i])
mi=min(mi,l[i])
print(a) | 7 | PYTHON3 |
n=int(input())
s=list(map(int,input().split()))
j=0
for i in range(1,n):
if s[i]>max(s[:i]) or s[i]<min(s[:i]):
j+=1
print(j) | 7 | PYTHON3 |
n=int(input())
scores=[int(x) for x in input().split()]
amazing=0
if n>=2:
worst=scores[0]
best=scores[0]
for i in range(1,n):
if scores[i]>best:
amazing+=1
best=scores[i]
if scores[i] < worst:
amazing+=1
worst=scores[i]
print(amazing) | 7 | PYTHON3 |
n = int(input())
score = list(map(int, input().split()))
if len(score) == 1:
print(0)
quit()
max = score[0]
min = score[1]
s = []
if score[0] < score[1]:
max = score[1]
min = score[0]
if score[1] != score[0]:
s.append(2)
for i in range(2, n):
if score[i] > max:
max = score[i]
#print(i + 1)
s.append(i + 1)
if score[i] < min:
min = score[i]
#print(i + 1)
s.append(i + 1)
print(len(s))
| 7 | PYTHON3 |
n=int(input())
l=input().split()
k=len(l)
i=0
while i<k:
l[i]=int(l[i])
i=i+1
maxi=l[0]
mini=l[0]
count=0
for j in l:
if j>maxi:
count=count+1
maxi=j
elif j<mini:
count=count+1
mini=j
else:
continue
print(count) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
min=a[0]
max=a[0]
count=0
for i in range(1,n):
if a[i]>max:
count=count+1
max=a[i]
if a[i]<min:
count=count+1
min=a[i]
print(count)
| 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Wed Dec 13 09:45:43 2017
@author: admin
"""
n = int(input())
points = [int(x) for x in input().split()]
min_points = points[0]
max_points = points[0]
amazing = 0
for i in range(1,n):
if points[i] < min_points:
amazing += 1
min_points = points[i]
elif points[i]>max_points:
amazing += 1
max_points = points[i]
print(amazing) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[1000];
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
int amazing = 0;
for (int i = 1; i < n; i++) {
double maxi = arr[0], mini = arr[0];
for (int j = i - 1; j >= 0; j--) {
if (arr[j] > maxi)
maxi = arr[j];
else if (arr[j] < mini)
mini = arr[j];
}
if (arr[i] > maxi || arr[i] < mini) amazing++;
}
cout << amazing << '\n';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1000], ans = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 1; i < n; i++) {
bool x = true;
bool y = true;
int j = i - 1;
while (j >= 0) {
if (a[i] > a[j])
x = true;
else {
x = false;
break;
}
j--;
}
j = i - 1;
while (j >= 0) {
if (a[i] < a[j])
y = true;
else {
y = false;
break;
}
j--;
}
if (x || y) ans++;
}
cout << ans;
}
| 7 | CPP |
input()
arr = [int(i) for i in str(input()).split(' ')]
min = max = arr[0]
point = 0
for i in range(1,len(arr)):
if arr[i] < min :
point += 1
min = arr[i]
elif arr[i] > max:
point+=1
max = arr[i]
print(point)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, mx, mn, k = 0, a;
cin >> n >> a;
mx = a;
mn = a;
vector<int> vec(n - 1);
for (int i = 0; i < n - 1; i++) {
cin >> vec[i];
if (vec[i] > mx) {
mx = vec[i];
k++;
}
if (vec[i] < mn) {
mn = vec[i];
k++;
}
}
cout << k;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int key;
vector<int> v;
for (int i = 0; i < n; ++i) {
cin >> key;
v.push_back(key);
}
int max = v[0];
int min = v[0];
int amz = 0;
for (int i = 1; i < n; ++i) {
if (v[i] > max) {
amz++;
max = v[i];
}
if (v[i] < min) {
amz++;
min = v[i];
}
}
cout << amz;
}
| 7 | CPP |
n = int(input())
arr = list(map(int,input().split()))
mn = arr[0]
mx = arr [0]
amzn = 0
for values in arr:
if values<mn:
mn = values
amzn += 1
elif values>mx:
mx = values
amzn += 1
print(amzn)
| 7 | PYTHON3 |
x=int(input())
y=list(map(int,input().split()))
z=0
min=y[0]
max=y[0]
for i in range(len(y)):
if(y[i]<min):
min=y[i]
z+=1
if(y[i]>max):
max=y[i]
z+=1
print(z) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
best = l[0]
worst = l[0]
c = 0
for i in range(1,n):
if l[i] > best:
best = l[i]
c += 1
elif l[i] < worst:
worst = l[i]
c += 1
print(c) | 7 | PYTHON3 |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
pins = list(map(int, input().split()))
max = pins[0]
min = pins[0]
ans = 0
for i in range(1, n):
if max < pins[i]:
ans += 1
max = pins[i]
elif min > pins[i]:
ans += 1
min = pins[i]
stdout.write(str(ans))
| 7 | PYTHON3 |
def discos():
count = input()
word = list(map(int,input().split()))
recordlow = word[0]
recordhigh = word[0]
counter = int()
for x in range(1,len(word)):
if(word[x]<recordlow):
counter +=1
recordlow=word[x]
if(word[x]>recordhigh):
counter +=1
recordhigh=word[x]
print(counter)
discos()
| 7 | PYTHON3 |
import sys
def main():
contest = int(sys.stdin.readline().strip())
scores = [int(x) for x in sys.stdin.readline().strip().split()]
minScores = 0
maxScores = 0
amazing = 0
for i in range(0,contest):
if i == 0:
minScores = maxScores= scores[i]
else:
if scores[i] > maxScores:
amazing += 1
maxScores = scores[i]
elif scores[i] < minScores:
amazing += 1
minScores = scores[i]
print(amazing)
if __name__ == ("__main__"):
main()
| 7 | PYTHON3 |
n = int(input())
s = list(map(int,input().split()))
min = s[0]
max = s[0]
den = 0
for i in range(n):
if s[i] < min :
min = s[i]
den += 1
if s[i] > max :
max = s[i]
den += 1
print(den) | 7 | PYTHON3 |
n=int(input())
ls=input().split(' ')
for i in range(n):
ls[i]=int(ls[i])
cnt=0
for i in range(1,n):
if ls[i]>max(ls[:i]) or ls[i]<min(ls[:i]):
cnt+=1
print(cnt)
| 7 | PYTHON3 |
a=int(input())
arr=list(map(int,input().split()))
arr1=[arr[0]]
count=0
for i in range(1,a):
x=arr[i]
if x>max(arr1) or x<min(arr1):
count+=1
arr1.append(x)
print(count)
| 7 | PYTHON3 |
n = int(input())
s = [int(x) for x in input().split()]
amazing = 0
for i in range(1,n):
m = max(s[0:i])
l = min(s[0:i])
if s[i] > m or s[i] < l:
amazing += 1
print(amazing)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
for i in range(n):
try:
if min>a[i]:t+=1;min=a[i]
if max<a[i]:t+=1;max=a[i]
except:t=0;min=max=a[0]
print(t) | 7 | PYTHON3 |
n=int(input())
con=list(map(int, input().split()))
if n>2:
ma=max(con[0], con[1])
mi=min(con[0], con[1])
res = 0
for i in range(2,n):
if con[i]>ma:
res+=1
ma=con[i]
elif con[i]<mi:
res+=1
mi=con[i]
print(res+(con[0]!=con[1]))
elif n==1 or ( n==2 and con[0]==con[1]):
print(0)
else:
print(1) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().strip().split()))[:n]
mx=mn=a[0]
c=0
for i in a:
if(i>mx or i<mn):
c+=1
if(i>mx):
mx=i
elif(i<mn):
mn=i
print(c) | 7 | PYTHON3 |
input()
lst = list(map(int, input().split(' ')))
a = [lst[0]]; l=0
for i in lst[1:]:
if i < min(a) or max(a) < i:
l += 1
a.append(i)
print(l) | 7 | PYTHON3 |
n = int(input())
x = list(map(int, input().split()))
i = 1
k = 0
max = x[0]
while i<n:
if x[i] > max:
max = x[i]
k += 1
i += 1
min = x[0]
for s in x:
if s < min:
min = s
k += 1
print(k)
| 7 | PYTHON3 |
N = int(input())
ls = list(map(int, input().split()))
m = ls[0]
M = ls[0]
cnt = 0
for i in ls:
if i>M or i<m:
cnt+=1
m = min(m, i)
M = max(M, i)
print(cnt)
| 7 | PYTHON3 |
a=int(input())
b=list(map(int,input().split()))
ma=b[0]
mi=b[0]
cnt=0
for i in range(1,a) :
if b[i]>ma :
ma=b[i]
cnt+=1
elif b[i]<mi :
mi=b[i]
cnt+=1
print(cnt) | 7 | PYTHON3 |
n = int(input())
p = [int(i) for i in input().split()]
max = p[0]
min = p[0]
ans = 0
for i in range(1, n):
if p[i] > max:
max = p[i]
ans += 1
elif p[i] < min:
min = p[i]
ans += 1
print(ans)
| 7 | PYTHON3 |
n = int(input())
scores = list(map(int,input().split()))
ans = 0
sco = [scores[0]]
for i in range(1,n):
m = scores[i]
if (m>max(sco)) or (m<min(sco)):
ans += 1
sco.append(scores[i])
print(ans)
| 7 | PYTHON3 |
a=int(input())
num=0
b=[i for i in input().split(' ')]
ma=b[0]
mi=b[0]
for k in range(a):
if k!=0:
if int(b[k])>int(ma):
num+=1
ma=b[k]
elif int(b[k])<int(mi):
num+=1
mi=b[k]
print(num) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print(0)
else:
mayor = max(a[0], a[1])
menor = min(a[0], a[1])
count = 0
if mayor != menor:
count = count+1
for i in range(2, n):
if a[i] > mayor:
count = count+1
mayor = a[i]
elif a[i] < menor:
count = count+1
menor = a[i]
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
a=l[0]
b=l[0]
c=0
for i in l:
if i>a:
c=c+1
a=i
for i in l:
if i<b:
c=c+1
b=i
print(c)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
s=0
if n==1:
print(0)
raise SystemExit
for i in range(1,n):
if a[i]>max(a[0:i]) or a[i]<min(a[0:i]):
s=s+1
print(s)
| 7 | PYTHON3 |
if __name__=="__main__":
n = int(input())
a = list(map(int,input().split()))
M = a[0]
m = a[0]
c = 0
for x in range(1,n):
if a[x]>M:
M = a[x]
c+=1
elif a[x]<m:
m = a[x]
c+=1
print(c) | 7 | PYTHON3 |
n = int(input())
s = []
count = 0
a = map(int, input().split(maxsplit = n))
s=list(a)
for b in range(1, len(s)):
if s[b] > max(s[0:b]) or s[b] < min(s[0:b]):
count += 1
print(count)
| 7 | PYTHON3 |
n = int(input())
values = [ int(x) for x in input().split() ]
max_v = values[0]
min_v = values[0]
res = 0
for i in values:
if i < min_v:
res += 1
min_v = i
elif i > max_v:
res += 1
max_v = i
print(res) | 7 | PYTHON3 |
n = int(input())
L = [int(i) for i in input().split()]
R = []
a = 0
for i in range(len(L)):
R.append(L[i])
R.sort()
if R[0] == L[i] and i != 0 and R[0] != R[1]:
a +=1
elif R[-1] == L[i] and i != 0 and R[-1] != R[-2]:
a +=1
print(a)
| 7 | PYTHON3 |
n=int(input())
st=input()
li=st.split()
te=[int(li[0])]
k=0
for i in range(1,n):
if int(li[i])>int(te[-1]):
k+=1
elif int(li[i])<int(te[0]):
k+=1
te.append(int(li[i]))
te.sort()
print(k)
| 7 | PYTHON3 |
n = int(input())
b = list(map(int, input().split()))
div = 0
max_b = max(b)
min_b = min(b)
bal_min = 10000
bal_max = 0
if 1 <= n <= 1000:
for i in b:
if max_b == 10000 and min_b == 0 and n == 2:
div = 3
elif min_b == max_b:
div = 2
elif bal_max < i:
bal_max = i
div += 1
if bal_min > i:
bal_min = i
div += 1
elif bal_min > i:
bal_min = i
div += 1
if bal_max < i:
bal_max = i
div += 1
print(div-2) | 7 | PYTHON3 |
num = int(input())
arr = input()
arr = arr.split(" ")
min = int(arr[0])
max = int(arr[0])
count = 0
for i in range(1,num):
if int(arr[i]) > max:
count += 1
max = int(arr[i])
#print(arr[i])
elif int(arr[i]) < min:
count += 1
min = int(arr[i])
#print(arr[i])
print(count) | 7 | PYTHON3 |
n = input()
s = list(map(int, input().split()))
cnt = 0
for i in range(1, len(s)):
t = s[:i]
if s[i] not in t:
t += [s[i]]
if s[i] == max(t) or s[i] == min(t):
cnt += 1
print(cnt) | 7 | PYTHON3 |
n=int(input())
points=list(map(int,input().split()))
Max=points[0]
Min=points[0]
k=0
for i in range(1,n):
if points[i]>Max:
k+=1
Max=points[i]
elif points[i]<Min:
k+=1
Min=points[i]
print(k) | 7 | PYTHON3 |
n=int(input())
points=list(map(int,input().split()))
maxp=points[0]
minp=points[0]
i=1
count=0
while i<len(points):
if points[i]>maxp:
count += 1
maxp=points[i]
if points[i]<minp:
count += 1
minp=points[i]
i=i+1
print(count) | 7 | PYTHON3 |
n=int(input())
list=input().split()
for i in range(n):
list[i]=int(list[i])
#print(list)
count=0
for i in range(1,n):
countmax=0
countmin=0
for j in range(i):
if list[i]>list[j]:
countmax+=1
if list[i]<list[j]:
countmin+=1
if countmax==i or countmin==i:
count+=1
print(count)
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
#a=[int(n) for n in input().split()]
f=0
for i in range(n):
d=0
e=0
j=i+1
for k in range(i):
if a[i]>a[k]:
d+=1
if a[i]<a[k]:
e+=1
if d==i or e==i:
f=f+1
print(f-1) | 7 | PYTHON3 |
a= int(input())
b= list(map(int,input().split(" ")))
minval= b[0]
maxval= b[0]
sum=0
for k in range(1,a):
if b[k] > maxval:
sum += 1
maxval= b[k]
if b[k] < minval:
sum += 1
minval = b[k]
print(sum)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.