solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
# for( int len = 1; len < n; len++){
# for( int i = 0; i + len < n; i++){
# int j = i + len;
# if(s1[i - 1] == s1[j - 1]){
# /* Your code */
# }
# else{
# /* Your code */
# }
# }
# }
# for len in range(1, 5):
# for i in range(0, 5):
# if i+len>=10:
# break
# j=i+len
# print(i,j)
# from bisect import bisect
# for t in range(1,int(input())+1):
# n,k=[*map(int, input().split())]
# arr=[*map(int, input().split())]
# arr.sort()
# exp=sum(arr)/len(arr)
# for _ in range(k):
# idx = bisect(arr, exp)
# exp=(exp*idx + sum(arr[idx:]))/len(arr)
# print("case #{}: {}".format(t, exp))
# from math import gcd
# N=100
# seen = set()
# for n in range(1, N):
# for m in range(n+1, N):
# x = m**2 - n**2
# y = 2*m*n
# z = m**2 + n**2
# xyz_gcd = gcd(z,gcd(x,y))
# if z<=N:
# triplet = tuple(sorted((x//xyz_gcd, y//xyz_gcd, z//xyz_gcd)))
# if triplet not in seen:
# print(triplet)
# seen.add(triplet)
input()
arr=[*map(int, input().split())]
min=[arr[0]]
max=[arr[0]]
res=0
for i in range(1,len(arr)):
el=arr[i]
if el>max[-1]:
max.append(el)
res+=1
elif el<min[-1]:
min.append(el)
res+=1
print(res)
| 7 | PYTHON3 |
input()
m=-1;n=10001;c=0;count=0
for i in map(int,input().strip().split()):
if c!=0 and (i>m or i<n):
count+=1
m=max(i,m)
n=min(i,n)
c=1
print(count)
| 7 | PYTHON3 |
length = input()
scores = input().split()
l = 0
low = (int)(scores[0])
high = (int)(scores[0])
for i in scores:
if (int)(i)<low:
l = l + 1
low = (int)(i)
if (int)(i)>high:
l = l + 1
high = (int)(i)
print(l) | 7 | PYTHON3 |
n = int(input())
nums = [int(x) for x in input().split()]
maxa = mina = nums[0]
count = 0
for i in range(1, n):
if nums[i] > maxa:
count += 1
maxa = nums[i]
elif nums[i] < mina:
count += 1
mina = nums[i]
print(count) | 7 | PYTHON3 |
input()
s=[int(i) for i in input().split()]
ma,mi=s[0],s[0]
amazing=0
for i in s:
if i>ma:
amazing+=1
ma=i
elif i<mi:
amazing+=1
mi=i
print(amazing)
| 7 | PYTHON3 |
n = int(input())
c = map(int,input().split())
d = []
ans = 0
for i in c:
if i not in d:
d.append(i)
if max(d)==i:
ans += 1
elif min(d)==i:
ans += 1
print(ans-1)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, n, x, r = 0;
cin >> n >> x;
a = b = x;
for (int i = 1; i < n; ++i) {
cin >> x;
if (x > a) ++r, a = x;
if (x < b) ++r, b = x;
}
cout << r;
return 0;
}
| 7 | CPP |
x=int(input())
y=[int(a) for a in input().split()]
z=y[0]
y.remove(y[0])
mi=z
ma=z
a=0
for i in y:
if i<mi:
mi=i
a+=1
elif i>ma:
ma=i
a+=1
print(a) | 7 | PYTHON3 |
a = int(input())
if a == 1:
print(0)
else:
e = 0
b = list(map(int, input().split()))
c = b[0]
d = b[0]
for i in range (1, a):
if b[i] > c:
c = b[i]
e += 1
elif b[i] < d:
d = b[i]
e += 1
print(e) | 7 | PYTHON3 |
a = int(input())
b = list(map(int, input().split()))
amz = 0
hs = ls = b[0]
for i in b[1:]:
if i > hs:
amz += 1
hs = i
if i < ls:
amz += 1
ls = i
print(amz)
| 7 | PYTHON3 |
import sys
input = sys.stdin.readline
def main():
n = int(input())
alst = list(map(int, input().split()))
max_ = alst[0]
min_ = alst[0]
ans = 0
for a in alst[1:]:
if a > max_:
max_ = a
ans += 1
elif a < min_:
min_ = a
ans += 1
print(ans)
main()
"""
for _ in range(int(input())):
main()
""" | 7 | PYTHON3 |
n = int(input())
m = list(map(int, input().split()))
cnt = -2
min_val = 10001
max_val = -1
for v in m:
if v < min_val:
cnt += 1
min_val = v
if v > max_val:
cnt += 1
max_val = v
print(cnt) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
mx=0
maax=a[0]
miin=a[0]
if(len(a)==1):
print (0)
elif(len(a)==1):
print (1)
else:
if(a[0]>a[1]):
miin=a[1]
mx=mx+1
elif(a[0]<a[1]):
maax=a[1]
mx=mx+1
for i in range (2,len(a)):
if(a[i]>maax):
maax=a[i]
mx=mx+1
elif(a[i]<miin):
miin=a[i]
mx=mx+1
print (mx)
| 7 | PYTHON3 |
n = int(input())
A= list(map(int,input().split()))
ma, mi = A[0], A[0]
ans = 0
for i in A[1:]:
if i > ma:
ma = i
ans += 1
if i < mi:
mi = i
ans += 1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 0;
int max1 = a[0];
int min1 = a[0];
for (int i = 0; i < n; i++) {
if (a[i] > max1) {
max1 = a[i];
cnt++;
}
if (a[i] < min1) {
min1 = a[i];
cnt++;
}
}
cout << cnt;
}
| 7 | CPP |
#include <bits/stdc++.h>
#define SYNC ios_base::sync_with_stdio(0);
#define IO STD std_enable = 1; cin.tie(0);
#define STD /*
from sys import (
stdin, stdout, exit as sys_ret)
"""****************************
Interactive Tasks:
/ Python: / """
f_input, f_print, f_flush = (
stdin.readline,
stdout.write,
stdout.flush)
""" / C++ /
#import <cstdio>
fflush(stdout);
or
#import <iostream>
cout << endl;
βββββββββββββββββββββββββ
Don't raise your voice,
improve your argument.
βββββββββββββββββββββββββ
cat /dev/ass > /dev/head
Ctrl+C
cat /knowledge > /dev/head
Β© Jakov Gellert
frvr.ru
****************************"""
# */ using namespace std; int
#define boost_stream(); IO SYNC
# 5
count, min_i, max_i = 0, 0, 0
amount = int(f_input())
contest = [int(_) for _ in f_input().split()]
for i in range(1, amount):
if contest[i] > contest[max_i]:
count += 1
max_i = i
if contest[i] < contest[min_i]:
count += 1
min_i = i
f_print(str(count)) | 7 | PYTHON3 |
n=int(input())
s=input().split()
k=0
t=[int(s[0])]
for i in range(n-1):
ti=int(s[i+1])
if ti>max(t) or ti<min(t):
k=k+1
t.append(ti)
print(k) | 7 | PYTHON3 |
n=int(input())
a=list(input().split(' '))
a=[int(i) for i in a]
if n!=1:
if a[0]!=a[1]:
b=min(a[0],a[1])
c=max(a[0],a[1])
s=1
else:
b=a[0]
c=a[0]
s=0
for i in range(2,n):
if a[i]>c :
s+=1
c=a[i]
elif a[i]<b:
s+=1
b=a[i]
print(s)
else:
print(0)
| 7 | PYTHON3 |
n=int(input())
A=[int(i) for i in input().split()]
Max=A[0]
Min=A[0]
ans=0
for i in range(n):
if A[i]>Max:
ans+=1
Max=A[i]
elif A[i]<Min:
ans+=1
Min=A[i]
print(ans) | 7 | PYTHON3 |
t=int(input())
a=list(map(int,input().split()))
if t==1:
print(0)
else:
b=a[0]
c=a[0]
count=0
for i in range(1,t):
if i==1:
if a[i]>b:
count+=1
b=max(b,a[i])
elif a[i]<c:
count+=1
c=min(c,a[i])
else:
if a[i]>b:
count+=1
b=a[i]
elif a[i]<c:
count+=1
c=a[i]
print(count)
| 7 | PYTHON3 |
a,b,=int(input()),list(map(int,input().split()))
mi,ma,am=b[0],b[0],0
for i in b[1:]:
if i>ma:
am+=1
ma=i
if i<mi:
am+=1
mi=i
print(am)
| 7 | PYTHON3 |
n = int(input()); a = [int(x) for x in input().split()]; ct = 0
for i in range(1, n):
if a[i] < min(a[:i]) or a[i] > max(a[:i]): ct += 1
print(ct)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c = 0;
cin >> n;
vector<long long int> a(n);
cin >> a[0];
long long int max = a[0];
long long int min = a[0];
for (long long int i = 1; i < n; i++) {
cin >> a[i];
if (a[i] > max) {
max = a[i];
c++;
}
if (a[i] < min) {
min = a[i];
c++;
}
}
cout << c;
return 0;
}
| 7 | CPP |
n=int(input())
score = [int(x) for x in input().split()]
a = score[0]
b = score[0]
ans = 0
for i in range(1,n):
if score[i] > a:
ans += 1
a = score[i]
elif score[i] < b:
ans += 1
b = score[i]
print(ans)
| 7 | PYTHON3 |
x=int(input())
l=list(map(int,input().split()))
s=0
for i in range(1,x):
if max(l[:i])<l[i]:
s+=1
if min(l[:i])>l[i]:
s+=1
print(s) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
ma=l[0]
mi=l[0]
count=0
for i in range(n):
if l[i]>ma:
ma=l[i]
count+=1
elif l[i]<mi:
mi=l[i]
count+=1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, max, min;
cin >> n;
cin >> a;
int count = 0;
max = a;
min = a;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max) {
max = a;
count++;
} else if (a < min) {
min = a;
count++;
}
}
cout << count;
return 0;
}
| 7 | CPP |
n=int(input())
a=[int(i) for i in input().split()]
min=a[0]
max=a[0]
amazing=0
for i in range(0,n):
if a[i]>max:
max=a[i]
amazing+=1
elif a[i]<min:
min=a[i]
amazing+=1
else:
continue
print(amazing) | 7 | PYTHON3 |
n=int(input().strip())
a=list(map(int,input().strip().split()))
max=a[0]
min=a[0]
c=0
for i in range(1,len(a)):
if a[i]>max:
max=a[i]
c+=1
if a[i]<min:
min=a[i]
c+=1
print(c) | 7 | PYTHON3 |
n=int(input())
a=list(int(i) for i in input().split())
min_point=a[0]
max_point=a[0]
num=0
for i in a:
if i>max_point:
num+=1
max_point=i
if i<min_point:
num+=1
min_point=i
print(num) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,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=c+1
print(c)
| 7 | PYTHON3 |
input()
Min=None
Max=None
x=input().split()
c=0
for i in x:
if Min==None:
Min=int(i)
if Max==None:
Max=int(i)
continue
if int(i)<Min:
Min=int(i)
c+=1
elif int(i)>Max:
Max=int(i)
c+=1
print(c)
| 7 | PYTHON3 |
while True:
try:
n=int(input())
l=[int(i) for i in input().split()]
minl=maxl=l[0]
amazing=0
for i in range(n-1):
c=l[i+1]
if l[i+1]>maxl or l[i+1]<minl:
amazing+=1
minl=min(minl,c)
maxl=max(maxl,c)
print(amazing)
except EOFError:
break | 7 | PYTHON3 |
# http://codeforces.com/problemset/problem/155/A
n = int(input())
lis = [int(x) for x in input().split()]
max = min = lis[0]
amz = 0;
for i in range(1,n):
if lis[i] > max:
max = lis[i]
amz+=1
elif lis[i] < min:
min = lis[i]
amz+=1
print(amz)
| 7 | PYTHON3 |
num = int(input())
l = list(map(int, input().split()))
maxnum = l[0]
minnum = l[0]
f = 0
for i in range(1, len(l)):
if l[i] > maxnum:
f += 1
maxnum = l[i]
elif l[i] < minnum:
f += 1
minnum = l[i]
print(f) | 7 | PYTHON3 |
n = int(input())
li = list(map(int, input().split()))
count = 0
max_temp = li[0]
min_temp = li[0]
for i in range(n-1):
if li[i+1] > li[i]:
if li[i+1] > max_temp:
count += 1
max_temp = li[i+1]
elif li[i+1] < li[i]:
if li[i+1] < min_temp:
count += 1
min_temp = li[i+1]
if len(li) == 1:
print(0)
elif len(li) == 2:
if li[0] == li[1]:
print(0)
else:
print(1)
else:
print(count)
| 7 | PYTHON3 |
n=int(input())
x=input().split()
mn=int(x[0])
mx=int(x[0])
c=0
for i in x:
if int(i)>mx:
c+=1
mx=int(i)
elif int(i)<mn:
c+=1
mn=int(i)
print(c)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
s=0
for i in range(1,n):
if l[i]<min([l[r] for r in range(0,i)]) or l[i]>max([l[r] for r in range(0,i)]):
s=s+1
print(s)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[1005], i, max1, min1, count = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
max1 = a[0];
min1 = a[0];
for (i = 1; i < n; i++) {
if (a[i] > max1) {
max1 = a[i];
count++;
}
if (a[i] < min1) {
min1 = a[i];
count++;
}
}
cout << count;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
int x;
cin >> x;
int max = x, min = x, ans = 0;
for (int i = 1; i < t; i++) {
int y;
cin >> y;
if (y > max) {
ans++;
max = y;
}
if (y < min) {
min = y;
ans++;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
input()
n = list(map(int, input().split(" ")))
mn, mx, count = n[0], n[0], 0
for i in range(1, len(n)):
if n[i] > mx:
mx = n[i]
count += 1
elif n[i] < mn:
mn = n[i]
count += 1
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().strip().split()))
count=0;
min=l[0];
max=l[0];
for i in range(1,len(l)):
if(l[i]<min):
min=l[i];
count+=1;
elif(l[i]>max):
max=l[i];
count+=1;
else:
pass;
print(count); | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int i, j, k, n, p, count = 0;
int ara[1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &ara[i]);
}
for (i = 1; i < n; i++) {
k = 0;
p = 0;
for (j = 0; j < i; j++) {
if (ara[i] > ara[j])
k += 1;
else if (ara[i] < ara[j])
p += 1;
}
if (i == k || i == p) count += 1;
}
printf("%d", count);
return 0;
}
| 7 | CPP |
# coding=utf-8
if __name__ == '__main__':
n = int(input())
line = str(input()).split()
line = [int(it) for it in line]
max_it = line[0]
min_it = line[0]
value = 0
for i in range(1, n):
if line[i] > max_it:
max_it = line[i]
value += 1
if line[i] < min_it:
min_it = line[i]
value += 1
print(value)
| 7 | PYTHON3 |
input()
n = list(map(int, input().split()))
counter = 1
maximum, minimum = max(n[0:2]), min(n[0:2])
if minimum == maximum:
counter = 0
for i in range(2, len(n)):
if n[i] > maximum:
counter += 1
maximum = n[i]
elif n[i] < minimum:
counter += 1
minimum = n[i]
print(0 if len(n) == 1 else counter)
# UBCF
# CodeForcesian
# β₯
# Ψ΅Ψ―Ψ§Ϋ Ψ¨Ϋ Ψ¬Ψ§Ω
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n >> a;
int min = a, max = a;
int ans = 0;
for (int i = 1; i < n; i++) {
cin >> a;
if (a > max) {
max = a;
ans++;
}
if (a < min) {
min = a;
ans++;
}
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
n = int(input())
numbers = list(map(lambda x: int(x), input().split() ))
amazing = 0
_max = numbers[0]
_min = numbers[0]
for i in range (1, n):
if numbers[i] > _max:
amazing += 1
_max = numbers[i]
elif numbers[i] < _min:
amazing += 1
_min = numbers[i]
print(amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(false);
long long n, i, cnt = 0;
int a[1005];
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
int mx = a[0], mn = a[0];
for (i = 1; i < n; i++) {
if (a[i] > mx || a[i] < mn) cnt++;
mx = max(mx, a[i]);
mn = min(mn, a[i]);
}
cout << cnt;
return 0;
}
| 7 | CPP |
n=int(input())
A=[int(i) for i in input().split()]
total=0
for i in range(1,n):
if A[i]>max(A[:i]):
total+=1
elif A[i]<min(A[:i]):
total+=1
else:
continue
print(total)
| 7 | PYTHON3 |
n = int(input())
count = 0
list1 = list(map(int,input().split()))
list2 = [list1[0]]
for m in range(1,n):
if list1[m] > max(list2) or list1[m] < min(list2):
count += 1
list2.append(list1[m])
print(count)
| 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split()]
summ=0
for i in range(n):
if i==0:
less=a[0]
more=a[0]
continue
if a[i]>more:
summ+=1
more=a[i]
elif a[i]<less:
summ+=1
less=a[i]
print(summ) | 7 | PYTHON3 |
n,a=int(input()),[int(i) for i in input().split()]
print(sum(not min(a[:i]) <= a[i] <= max(a[:i]) for i in range(1,n))) | 7 | PYTHON3 |
N = int(input())
L = list(map(int, input().split()))
minv = L[0]
maxv = L[0]
ans = 0
for i in range(1, N):
if L[i] < minv:
ans += 1
minv = L[i]
if L[i] > maxv:
ans += 1
maxv = L[i]
print(ans)
| 7 | PYTHON3 |
n=int(input())
a = list(map(int, input().split()))
mini=a[0]
maxi=a[0]
k=0
for i in range(1,n):
if a[i]>maxi:
maxi=a[i]
k+=1
if a[i]<mini:
mini=a[i]
k+=1
print(k) | 7 | PYTHON3 |
__author__ = "runekri3"
n = int(input())
points_list = list(map(int, input().split()))
cur_min = cur_max = points_list.pop(0)
performances = 0
for points in points_list:
if points < cur_min:
cur_min = points
performances += 1
elif points > cur_max:
cur_max = points
performances += 1
print(performances) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
x=[]
for i in range(n):
if(i==0):
x.append(l[i])
a=l[i]
b=l[i]
else:
if(l[i]<a or l[i]>b):
c+=1
x.append(l[i])
a=min(x)
b=max(x)
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, s[1000], i, count = 0, max, min, a, b;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &s[i]);
min = max = s[0];
for (i = 0; i < n; i++) {
if (min > s[i]) {
min = s[i];
count++;
}
if (max < s[i]) {
max = s[i];
count++;
}
}
printf("%d\n", count);
return 0;
}
| 7 | CPP |
n = int(input())
l = [int(x) for x in input().split()]
a = 0
for i in range(1,len(l)):
c1 = 0
c2 = 0
for j in range(i-1,-1,-1):
if l[i] < l[j]:
c1 += 1
elif l[i] > l[j]:
c2 += 1
if c1 == i or c2 == i:
a += 1
print(a) | 7 | PYTHON3 |
n=int(input())
a=list(map(int, input().rstrip().split()))
max=a[0]
min=a[0]
c=0
for _ in range(n):
if a[_]<min:
c+=1
min=a[_]
if a[_]>max:
c+=1
max=a[_]
print(c) | 7 | PYTHON3 |
n=int(input())
L=[int(i) for i in input().split()]
amazing=0
def t(i):
A=[L[x] for x in range(0,i)]
if L[i]>max(A) or L[i]<min(A):
return'YES'
else:
return'NO'
for i in range(1,len(L)):
if t(i)=='YES':
amazing=amazing+1
else:
pass
print(amazing)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100000], n, i, max, min, mx, mn, req;
cin >> n;
mx = 0;
mn = 0;
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) {
mx++;
max = a[i];
}
if (a[i] < min) {
mn++;
min = a[i];
}
}
req = mx + mn;
cout << req;
}
| 7 | CPP |
n = int(input())
numbers = list(map(int, input().split()))
maxi = mini = numbers[0]
wow = 0
for i in numbers[1:]:
if i < mini:
wow+=1
mini = i
elif i > maxi:
wow+=1
maxi = i
else:
continue
print(wow) | 7 | PYTHON3 |
n = int(input())
A = [int(i) for i in input().split()]
print(sum([1 for i in range(1,n) if (all(j > A[i] for j in A[:i]) or all(j < A[i] for j in A[:i]))])) | 7 | PYTHON3 |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
t=0
ma=a[0]
mi=a[0]
for i in range(1,n):
if a[i]>ma:
ma=a[i]
t+=1
elif a[i]<mi:
mi=a[i]
t+=1
print(t) | 7 | PYTHON3 |
temp = input()
ar = []
for i in input().split(' '):
ar.append(int(i))
currMax = ar[0]
currMin = ar[0]
count = 0
for i in ar:
if i<currMin:
count = count + 1
currMin = i
elif i>currMax:
count = count + 1
currMax = i
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int smallest, largest, n, count = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == 0) {
smallest = a;
largest = a;
} else {
if (a > largest) {
count += 1;
largest = a;
} else if (a < smallest) {
count += 1;
smallest = a;
}
}
}
cout << count;
}
| 7 | CPP |
n=int(input())
A=list(map(int,input().split()))
count=0
D=[]
for i in A:
if i not in D:
D.append(i)
if max(D)==i:
count+=1
elif min(D)==i:
count+=1
print(count-1) | 7 | PYTHON3 |
a=int(input())
b=[int(c) for c in input().split(' ')]
q=0
mini=b[0]
maxi=b[0]
for i in range(1,a):
if b[i]>maxi:
maxi=b[i]
q+=1
elif b[i]<mini:
mini=b[i]
q+=1
else:
continue
print(q)
| 7 | PYTHON3 |
loop = int(input())
e = str(input())
s = e.split(" ")
sums = 0
maxs =int(s[0])
mins=int(s[0])
for i in range(loop):
if int(s[i]) > maxs:
maxs = int(s[i])
sums+=1
elif int(s[i]) < mins:
mins =int(s[i])
sums+=1
print(sums) | 7 | PYTHON3 |
n = int(input())
l = [int(x) for x in input().split()]
alltimemin = l[0]
alltimemax = l[0]
count = 0
for item in l[1:]:
if item < alltimemin or item > alltimemax:
count += 1
alltimemin = min(item,alltimemin)
alltimemax = max(item,alltimemax)
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=0
mi=l[0]
ma=l[0]
for i in range(n):
if l[i]<mi:
m+=1
mi=l[i]
elif l[i]>ma:
m+=1
ma=l[i]
else:
pass
print(m) | 7 | PYTHON3 |
n=int(input())
A=input().split()
a=0
b=int(A[0])
c=int(A[0])
for i in range (n-1):
if int(A[i+1])>b:
a+=1
b=int(A[i+1])
elif int(A[i+1])<c:
a+=1
c=int(A[i+1])
print(a) | 7 | PYTHON3 |
def read():
return [int(v) for v in input().split()]
def main():
n = read()[0]
a = read()
best, worst = 0, 0
amazing = 0
for i in range(1, n):
if a[best] < a[i]:
amazing += 1
best = i
elif a[worst] > a[i]:
amazing += 1
worst = i
print(amazing)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
n = int(input())
b = list(map(int, input().split()))
max_n, min_n, amazing = b[0], b[0], 0
for i in range(1, n):
m = b[i]
if m > max_n:
max_n = m
amazing += 1
elif m < min_n:
min_n = m
amazing += 1
print(amazing) | 7 | PYTHON3 |
n = int(input())
c = 0
a = [int (i) for i in input().split()]
max = a[0]
min = a[0]
for i in range (1, len(a)):
if a[i] > max:
c += 1
max = a[i]
elif a[i] < min:
c += 1
min = a[i]
print(c)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
mi = a[0]
ma = mi
answer = 0
for i in range(1, n):
x = a[i]
if x < mi:
mi = x
answer += 1
if x > ma:
ma = x
answer += 1
print(answer) | 7 | PYTHON3 |
n = int(input().strip())
contests = map(int, input().strip().split())
best = -1
worst = 10001
answer = 0
for contest in contests:
if contest > best and contest < worst:
best = worst = contest # first round
elif contest > best:
answer += 1
best = contest
elif contest < worst:
answer += 1
worst = contest
print(answer) | 7 | PYTHON3 |
n=int(input())
l=list(map(int, input().split()))
sum1=0
sum2=0
for i in range(1,n):
cnt=0
cnt1=0
for j in range(i,-1,-1):
if l[i]<l[j]:
cnt+=1
elif l[i]>l[j]:
cnt1+=1
if cnt==i:
sum1+=1
elif cnt1==i:
sum2+=1
print(sum1+sum2)
| 7 | PYTHON3 |
# Lang: pypy3.6-v7.1.0-win32\pypy3.exe
# Problem Name: I_love_%username%
# Problem Serial No: 155
# Problem Type: A
# Problem Url: https://codeforces.com/problemset/problem/155/A
# Solution Generated at: 2019-05-11 02:26:48.760825 UTC
n=int(input())
arr=list(map(int,input().split()))
i_max=arr[0]
i_min=arr[0]
rec=0
for k in range(1,len(arr)):
if arr[k]>i_max:
i_max=arr[k]
rec+=1
elif arr[k]<i_min:
rec+=1
i_min=arr[k]
print(rec)
# Accepted | 7 | PYTHON3 |
n = int(input())
l = tuple(map(int, input().split()))
s = 0
ma = mi = l[0]
for i in l[1:]:
if i > ma:
ma = i
s += 1
elif i < mi:
mi = i
s += 1
print(s)
| 7 | PYTHON3 |
n=int(input())
line=[int(k)for k in input().split()]
t=[line[0]]
total=0
for i in range(n):
maxa=max(t)
mina=min(t)
if line[i]>maxa or line[i]<mina:
total+=1
t+=[line[i]]
print(total)
| 7 | PYTHON3 |
n=int(input())
a = list(map(int, input().split()))
max=a[0]
min=a[0]
amz=0
for i in range(n):
if a[i] > max:
max=a[i]
amz+=1
if a[i] < min:
min=a[i]
amz+=1
print(amz) | 7 | PYTHON3 |
n = int(input())
c = [int(x) for x in input().split()]
_min = _max = c[0]
a = 0
for i in range(n):
if c[i] > _max:
_max = c[i]
a += 1
elif c[i] < _min:
_min = c[i]
a += 1
print(a) | 7 | PYTHON3 |
n=int(input())
arr=list(map(int,input().strip().split()))
min=arr[0]
max=arr[0]
c=0
for i in range(n):
if(min>arr[i]):
min=arr[i]
c+=1
if(max<arr[i]):
max=arr[i]
c+=1
print(c)
| 7 | PYTHON3 |
n = int(input())
lst = input().split()
count = 0
for i in range(n):
lst[i] = int(lst[i])
if i == 0:
continue
else:
if lst[i] > max(lst[:i]) or lst[i] < min(lst[:i]):
count = count + 1
print(count) | 7 | PYTHON3 |
# https://codeforces.com/problemset/problem/155/A
kol = int(input())
scores = [int(i) for i in input().split()]
counter = 0
maxim = scores[0]
minim = scores[0]
for elem in scores:
if elem > maxim:
counter +=1
maxim = elem
elif elem < minim:
counter +=1
minim = elem
print(counter)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, total = 0;
cin >> n;
int maxi, mini;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) {
maxi = a[i];
mini = a[i];
} else {
if (a[i] > maxi) {
total++;
maxi = a[i];
} else if (a[i] < mini) {
total++;
mini = a[i];
}
}
}
cout << total << endl;
}
| 7 | CPP |
from sys import stdin
def main():
stdin.readline()
l = list(map(int, stdin.readline().split()))
mi = ma = l[0]
cnt = 0
for x in l:
if ma < x:
ma = x
cnt += 1
elif mi > x:
mi = x
cnt += 1
print(cnt)
main()
| 7 | PYTHON3 |
n=input()
n=int(n)
s = [int(x) for x in input().split()]
maxn=s[0]
minn=s[0]
cnt=0
for i in range(n):
if s[i]>maxn:
maxn=s[i]
cnt+=1
elif s[i]<minn:
minn=s[i]
cnt+=1
print(cnt) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
ma,mi,c=a[0],a[0],0
for i in range(1,n):
if(a[i]>ma):
c=c+1
ma=a[i]
elif(a[i]<mi):
c=c+1
mi=a[i]
print(c) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
maxs=l[0]
mn=l[0]
for i in range(1,n):
if l[i]>maxs:
#print(l[i])
maxs=l[i]
c+=1
elif mn>l[i]:
mn=l[i]
c+=1
print(c)
| 7 | PYTHON3 |
sz=int(input())
points=list(map(int,input().split()))
minn=maxx=points[0]
amazing=0
for i in points:
if i>maxx:
maxx=i
amazing+=1
elif i<minn:
minn=i
amazing+=1
print(amazing) | 7 | PYTHON3 |
# 155A. I_love_%username%
n = int(input())
lst = [int(k) for k in input().split()]
mini = 10001
maxi = -1
s = 0
for i in range(n):
if lst[i] > maxi:
maxi = lst[i]
s += 1
if lst[i] < mini:
mini = lst[i]
s += 1
if s >= 2:
print(s - 2)
else:
print(0)
| 7 | PYTHON3 |
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from itertools import (
accumulate, combinations, combinations_with_replacement, groupby,
permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits
def inp():
return(int(input()))
def inlist():
return(list(map(int, input().split())))
def instr():
s = input()
return(list(s[:len(s)]))
def invr():
return(map(int, input().split()))
n = inp()
a = inlist()
mx = a[0]
mn = a[0]
res = 0
for i in range(1, n):
if a[i] < mn:
res += 1
mn = a[i]
if a[i] > mx:
res += 1
mx = a[i]
print(res)
| 7 | PYTHON3 |
n=int(input())
a=input()
A=a.split()
c=int(A[0])
C=[c]
M=0
for i in range (1,n):
L=int(A[i])
if L>max(C) or L<min(C):
M=M+1
C.append(L)
print(M)
| 7 | PYTHON3 |
#I_love_%username%
n = int(input())
li = list(map(int,input().split()))
c = 0
for i in range(1,len(li)):
if li[i] > max(li[:i]) or li[i]<min(li[:i]):
c+=1
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, Count = 0;
cin >> n;
int ar[n];
for (i = 0; i < n; i++) {
cin >> ar[i];
}
int Max = ar[0];
int Min = ar[0];
for (i = 1; i < n; i++) {
if (ar[i] < Min) {
Min = ar[i];
Count++;
}
if (ar[i] > Max) {
Max = ar[i];
Count++;
}
}
cout << Count << endl;
return 0;
}
| 7 | CPP |
n=int(input())
sum=0
a=[int(x) for x in input().split()]
for i in range(2,n+1):
b=max(a[0:i-1])
d=min(a[0:i-1])
if a[i-1]>b or a[i-1]<d:sum+=1
print(sum) | 7 | PYTHON3 |
n=int(input(""))
l=list(map(int,input().split(" ")))
cont=0
mayor=l[0]
menor=l[0]
for k in l:
if(k>mayor):
cont+=1
mayor=k
elif(k<menor):
cont+=1
menor=k
print(cont) | 7 | PYTHON3 |
n = int(input())
scores = list(int(s) for s in input().split())
hi = low = scores.pop(0)
amazing = 0
for i in scores:
if i > hi or i < low:
amazing += 1
hi = max(hi, i)
low = min(low, i)
print(amazing) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.