solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
import sys
import math
import itertools as it
import operator as op
import fractions as fr
# n,m = map(int,sys.stdin.readline().split())
n = int(sys.stdin.readline().strip())
T = map(int,sys.stdin.readline().split())
d = 0
for t in T:
if t - d > 15:
break
else:
d = t
d = min(d+15,90)
print(d)
| 7 | PYTHON3 |
n = int(input())
BoringTimes = [int(i) for i in input().split(' ')]
flag = 0
if BoringTimes[0] > 15:
flag = 1
print('15')
else:
for i in range(n-1):
if BoringTimes[i+1] - BoringTimes[i] > 15:
flag = 1
print(BoringTimes[i] + 15)
break
if flag == 0 and BoringTimes[n-1] < 75:
flag = 1
print(BoringTimes[n-1] + 15)
if flag == 0:
print('90')
| 7 | PYTHON3 |
n=int(input())
t=[int(i) for i in input().split()]
x=y=0
for i in t:
if(x+15<i):
y=1
x+=15
break
else:
x=i
if(y):
print(x)
else:
if(x>74):
print(90)
else:
print(x+15) | 7 | PYTHON3 |
# http://codeforces.com/contest/673/problem/A
n = int(input())
t = list(map(int,input().split()))
prev = 0
for i in t:
if i - prev > 15:
print (prev+15)
break
prev = i
if i == t[len(t)-1]:
print(prev+15) if prev + 15 <90 else print (90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int t[n + 1];
for (int i = 1; i <= n; i++) cin >> t[i];
int cur = 0, ans = 0, flag = 1;
for (int i = 1; i <= n && flag == 1; i++) {
if (t[i] - cur > 15) {
ans += 15;
flag = 0;
} else {
ans += t[i] - cur;
cur = t[i];
}
}
if (ans <= 75 && flag == 1)
ans += 15;
else if (ans > 75 && flag == 1)
ans = 90;
cout << ans << '\n';
return 0;
}
| 7 | CPP |
q=int(input())
w=list(map(int,input().split()))+[234]
e=15
while w[0]<=e:
e=w[0]+15
del w[0]
print(90 if e>=90 else e) | 7 | PYTHON3 |
time1 = int(input())
time2 = input().split()
time2 = list(map(int, time2))
if time2[0] > 15:
print(15)
else:
for i in range(time1):
if time2[i-1] + 15 < time2[i]:
print(time2[i-1] + 15)
break
if i == time1 -1:
if time2[i] + 15 > 90:
print(90)
else:
print(time2[i] + 15) | 7 | PYTHON3 |
#!/usr/bin/env python3
# https://codeforces.com/problemset/problem/673/A
# Time complexity: O()
def calculate_interesting_minutes(minutes_list):
minutes_list.insert(0, 0)
interesting_minutes = 0
for i in range(len(minutes_list) - 1):
if minutes_list[i+1] - minutes_list[i] > 15:
interesting_minutes = 15 + minutes_list[i]
break
else:
interesting_minutes = 15 + minutes_list[i+1]
if interesting_minutes >= 90:
interesting_minutes = 90
return interesting_minutes
if __name__ == "__main__":
n = int(input())
minutes_list = list(map(int, input().split()))
print(calculate_interesting_minutes(minutes_list)) | 7 | PYTHON3 |
n = int(input())
t = [int(x) for x in input().split()]
t.append(90)
count = 0
previous = 0
for current in t:
if (current - previous > 15):
count += 15
break
else:
count = current
previous = current
print(count)
| 7 | PYTHON3 |
def main():
n = int(input())
c = 0
minutes = [int(i) for i in input().split()]
for m in minutes:
if m - c - 1 >= 15:
print(c + 15)
return
c = m
if c + 15 <= 90:
print(c + 15)
else:
print(90)
main()
| 7 | PYTHON3 |
#!/usr/bin/env python3
def main():
n = int(input())
arr = [int(i) for i in input().split(' ')]
arr_sum = sum(arr)
zeros = len([i for i in arr if i == 0])
if -1*arr_sum == zeros:
print(zeros+1)
return
print(max(0, zeros))
def possible(arr):
halfsum = sum(arr)//2
if halfsum in arr:
return True
for i in range(0, 4):
for j in range(i+1, 4):
if arr[i] + arr[j] == halfsum:
return True
return False
def is_palin(string):
if not string or len(string) == 1:
return True
n = len(string)
for i in range(0, n//2):
pass
# if string[i] != string[]
def give(arr):
prev = 0
for val in arr:
if val - prev > 15:
prev = prev + 15
return prev
else:
prev = val
if 90 - prev <= 15:
return 90
else:
return prev + 15
n = int(input())
arr = [int(i) for i in input().split(' ')]
print(give(arr))
| 7 | PYTHON3 |
import sys
n=int(input())
z=list(map(int,input().split()))
z.append(91)
now=0
for i in z:
if i-now>15:
print(min(90, now+15))
sys.exit(0)
else:
now=i
print(90) | 7 | PYTHON3 |
a = int(input())
b = input()
c = b.split()
if len(c) == 1:
if int(c[0]) > 15:
print(15)
else:
print(int(c[0]) + 15)
else:
for i in range(a):
if i == 0:
if int(c[0]) > 15:
print(15)
break
else:
if int(c[i]) - int(c[i-1]) > 15:
print(int(c[i-1]) + 15)
break
if i == len(c) - 1:
if int(c[i]) + 15 > 90:
print(90)
else:
print(int(c[i])+15)
| 7 | PYTHON3 |
# Tính khoảng thời gian giữa 2 lần kịch tính liên tiếp
# để tìm ra phút bao nhiêu gấu sẽ đi ngủ.
n = int(input())
str_ms = str(input())
ms = str_ms.split(' ')
# Kiểm tra nếu không có phút kịch tính
# ngay tại phần tử đầu tiên.
if int(ms[0]) - 0 > 15:
print(15)
else:
for i in range(len(ms)):
if i == len(ms) - 1:
check = int(ms[i]) + 15
# Ngay tại phần tử cuôi cùng nếu
# sau 15 phút mà lớn hơn 90 phút
# thì gấu sẽ ngủ tại phút 90.
if check >= 90:
print(90)
else:
# Nếu nhỏ hơn 90 phút.
print(check)
break
check = int(ms[i + 1]) - int(ms[i])
if check > 15:
print(int(ms[i]) + 15)
break
| 7 | PYTHON3 |
from sys import exit
n = int(input())
t = [0] + list(map(int, input().split())) + [91]
for i in range(1, len(t)):
if t[i] - t[i-1] > 15:
print(t[i-1] + 15)
exit()
print(90)
| 7 | PYTHON3 |
n = int(input())
lastI = 0
found = False
r = map(int,input().split(" "))
for i in r:
if i>15+lastI and 15+lastI<90:
print(lastI+15)
found = True
break
else:
lastI=i
if not found and lastI>=75:
print(90)
elif not found:
print(lastI+15)
| 7 | PYTHON3 |
a = int(input())
l = [int(i) for i in input().split()]
ans = False
for i in range(a):
if i == 0:
if l[i] > 15:
print(15)
ans = True
break
elif a == 1 and l[i] <= 15:
print(l[i] + 15)
ans = True
else:
if l[i] > l[i-1]+15:
print(l[i-1] + 15)
ans = True
break
if not ans:
print(min(90, l[a-1]+15)) | 7 | PYTHON3 |
#http://codeforces.com/problemset/problem/673/A
n=int(input())
arr=list(map(int, input().split()))
arr.append(90)
arr.insert(0, 0)
def truncate(x):
if (x > 90):
return 90
if (x == 0):
return 90
return x
res =0
for i in range(n+1):
if (arr[i+1] - arr[i] > 15):
res = arr[i] + 15
break
print(truncate(res))
| 7 | PYTHON3 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
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 LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n=I()
l=LI()
ans=0
for x in l:
if ans+15<x:
return ans+15
else:
ans=x
return min(90,ans+15)
# main()
print(main())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[92];
a[0] = 0;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
a[n + 1] = 90;
int ans = 90;
for (int i = 1; i <= n + 1; i++) {
if (a[i] - a[i - 1] > 15) {
ans = a[i - 1] + 15;
break;
}
}
cout << ans;
return 0;
}
| 7 | CPP |
#code
t=int(input())
l=[0]
l.extend(list(map(int,input().strip().split(' '))))
for i in range(1,t+1):
if l[i]-l[i-1]>15:
print(l[i-1]+15)
exit()
else:
continue
if 90-l[-1]<15:
print(90)
else:
print(l[-1]+15) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
l.insert(0,0)
l+=[90]
ans=0
flag=0
for i in range(1,n+2):
if(l[i]-l[i-1]>15):
flag=1
break
else:
ans=l[i]
if(flag==1):
print(ans+15)
else:
print(ans)
| 7 | PYTHON3 |
n = int(input())
m = input().split(' ')
m.insert(0,0)
for i in range(0,len(m)):
m[i] = int(m[i])
m.append(91)
#print(m)
f = 1
for i in range(1,len(m)):
if m[i-1] + 15 < m[i]:
print(m[i-1]+15)
f = 0
break
if f==1:
print(90) | 7 | PYTHON3 |
##n = int(input())
##a = list(map(int, input().split()))
##print(" ".join(map(str, res)))
n = int(input())
t = list(map(int, input().split()))
s = 0
res = 0
for i in range(len(t)):
if t[i]-s-1 >= 15:
res = s+15
break
else:
s = t[i]
res = s+15
res = min(res, 90)
print(res) | 7 | PYTHON3 |
n = int(input())
times = [0] + list(map(int, input().split())) + [90]
for i in range(n + 1):
if times[i + 1] - times[i] > 15:
print(times[i] + 15)
exit()
print(90)
| 7 | PYTHON3 |
def solve(n,data):
if data[0]>15:
return 15
else:
for i in range(n-1):
t = data[i]+15
if (t < data[i+1]):
return t
t = data[n-1]+15
if (t < 90):
return t
else:
return 90
n = int(input())
data = [int(x) for x in input().split()]
print(solve(n,data)) | 7 | PYTHON3 |
import sys
input()
a = sorted([0] + list(map(int, input().split())) + [90])
for i in range(1, len(a)):
if a[i] - a[i - 1] > 15:
print(min(a[i - 1] + 15, 90))
sys.exit(0)
print(90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long> V, L, L1;
vector<pair<char, long long>> B;
vector<string> Ans;
map<int, int> M;
set<long long> S;
set<char>::iterator it;
long long n, m, a, b, c, d, e, f, x, y, z, t, l, r, ans, cnt, score;
string s, winner, temp, p;
long long arr[1001][1001];
bool xy = 0;
char bd;
float ans1;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a - b > 15) {
cout << b + 15;
return 0;
;
}
b = a;
}
cout << min(90ll, a + 15);
}
| 7 | CPP |
def main():
n = int(input())
L = [int(x) for x in input().split()]
print(solver(L))
def solver(L):
if len(L) == 0 or L[0] > 15:
return 15
else:
for i in range(len(L) - 1):
if L[i + 1] - L[i] > 15:
return L[i] + 15
last = L[len(L) - 1]
if last < 75:
return last + 15
else:
return 90
L = [7, 20, 88]
L2 = [16, 20]
L3 = [15, 20, 30]
#print(solver(L3))
main() | 7 | PYTHON3 |
n = int(input())
t = list(map(int, input().split()))
output = 0
prev = 0
for i in t:
if i - prev > 15:
output = prev + 15
break
else:
output = i + 15
if i == 90 or output > 90:
output = 90
prev = i
print(output) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, ans = 0, flag = 0;
scanf("%d", &n);
while (n--) {
scanf("%d", &t);
if (!flag) {
if (t - ans > 15) {
flag = 1;
} else {
ans = t;
}
}
}
printf("%d\n", min(ans + 15, 90));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long s = 0;
for (long long i = 0; i <= n - 1; ++i) {
long long temp;
cin >> temp;
if (temp - s > 15) continue;
s = temp;
}
if (s + 15 < 90)
cout << s + 15 << endl;
else
cout << "90" << endl;
}
| 7 | CPP |
interesting_minutes = int(input())
minutes = input().split(' ')
count = 0
for i in range(interesting_minutes):
if ((int(minutes[i]) - count) > 15):
count += 15
break
else:
if (i == (interesting_minutes - 1) and int(minutes[i]) < 90):
count = int(minutes[i]) + 15
else:
count = int(minutes[i])
if count > 90:
print(90)
else:
print(count) | 7 | PYTHON3 |
def main():
n = int(input())
minutes = list(map(int, input().split()))
minIndex = 0
currentMinute = 0
while minIndex != n:
if (minutes[minIndex] - currentMinute) > 15:
print((currentMinute + 15) % 91)
return False
currentMinute = minutes[minIndex] % 91
if (minutes[minIndex] > 90) :
print(90)
return True
minIndex += 1
if currentMinute + 15 > 90:
print(90)
else:
print(currentMinute + 15)
return True
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
template <class T>
inline T bigmod(T p, T e, T m) {
T ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % m;
p = (p * p) % m;
}
return (T)ret;
};
void solve() {
int n;
cin >> n;
vector<int> items;
for (int i = 1; i <= n; i++) {
int item;
cin >> item;
items.push_back(item);
}
int last = 0;
for (int i = 0; i < n; i++) {
if (items[i] - last > 15) {
break;
}
last = items[i];
}
last = last + 15;
last = min(last, 90);
cout << last << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(10);
cout.tie(nullptr);
cin.tie(nullptr);
int t = 1;
while (t--) {
solve();
}
int pause;
cin >> pause;
return 0;
}
| 7 | CPP |
# Description of the problem can be found at http://codeforces.com/problemset/problem/673/A
n = int(input())
l_n = list(x for x in map(int, input().split()))
l_n.append(90)
t = 0
for n in l_n:
if t + 15 < n:
print(t + 15)
quit()
else:
t = n
print(t) | 7 | PYTHON3 |
n=int(input())
A = list(map(int, input().split()))
g=0
A.append(0)
A.append(90)
A.sort()
for i in range(len(A)-1):
if (A[i+1]-A[i])>15:
print(A[i]+15)
g=10000
break
if g==0:
print(90) | 7 | PYTHON3 |
def match(lst):
a = [0] * 91
for elem in lst:
a[elem] = 1
k = 0
for i in range(1, len(a)):
if a[i] == 1:
k = i
else:
if abs(i - k) >= 15:
return i
return 90
n = int(input())
b = [int(j) for j in input().split()]
print(match(b))
| 7 | PYTHON3 |
# import sys
# sys.stdin = open("test.in","r")
# sys.stdout = open("test.out","w")
n=int(input())
a=list(map(int,input().split()))
if n==1:
if a[0]<=15:
print(a[0]+15)
exit()
else:
print('15')
exit()
for i in range(n-1):
if a[0]>15:
print('15')
exit()
elif a[i+1]-a[i]>15:
print(a[i]+15)
exit()
print(min(90,a[-1]+15))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solu(vector<int> n, int m) {
for (int i = 0; i < m; i++) {
if (n[i] + 15 < n[i + 1]) {
cout << n[i] + 15;
return;
}
}
cout << 90 << endl;
}
int main() {
int size, n, a, b;
cin >> size;
vector<int> v;
v.push_back(0);
for (int i = 0; i < size; i++) {
cin >> n;
v.push_back(n);
}
v.push_back(90);
solu(v, size + 1);
return 0;
}
| 7 | CPP |
s=int(input())
l=list(map(int,input().split()))
flag=0
for i in range(1,91):
if i ==90:
print(i)
elif i in l:
flag=0
else:
flag+=1
if flag ==15:
print(i)
break | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split(' ')))
a.insert(0, 0)
res = 0
limit = 15
for i in range(1, n + 1):
if a[i] - a[i - 1] <= 15:
res += a[i] - a[i - 1]
else:
res += limit
print(res)
exit()
if 90 - a[n] <= 15:
res += 90 - a[n]
else:
res += 15
print(res) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int M[95];
int main() {
int n, num;
scanf("%d", &n);
int now = 15;
for (int i = 0; i < n; i++) {
scanf("%d", &num);
if (num <= now) now = num + 15;
}
printf("%d\n", min(now, 90));
return 0;
}
| 7 | CPP |
a = int(input())
b = [int(x) for x in input().split()]
b.append(90)
c = len(b)-1
for i in range(c):
if b[0]>15:
d=15
break
if b[i+1]-b[i]>15:
d=b[i]+15
break
else:
d=90
print(d) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int st = 0, a, flag = 0;
while (t--) {
cin >> a;
if (flag) continue;
if (a - st > 15)
flag = st + 15;
else
st = a;
}
if (90 - a > 15 && !flag) flag = a + 15;
if (!flag)
cout << 90 << endl;
else
cout << min(flag, 90) << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int* a = new int[n];
for (int i = 0; i < n; i++) cin >> a[i];
if (a[0] > 15)
cout << "15" << endl;
else {
int f = 0;
for (int i = 1; i < n; i++) {
if (a[i] > a[i - 1] + 15) {
cout << (a[i - 1] + 15) << endl;
f = 1;
break;
}
}
if (f == 0) {
if ((a[n - 1] + 15) < 90)
cout << (a[n - 1] + 15) << endl;
else
cout << "90" << endl;
}
}
return 0;
}
| 7 | CPP |
n= int(input())
mi = list(map(int, input().split()))
mi.insert(0,0)
ans=0
i=0
try:
while mi[i+1]-mi[i]<=15:
ans= mi[i+1]
i=i+1
print(ans+15)
except:
if mi[-1]+15>=90:
print(90)
else:
print(mi[-1]+15)
| 7 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
a=[0]+a+[200]
z=0
for i in range(n+1):
if a[i+1]-a[i]>15:
z=i
break
k=a[z]+15
if k>90: k=90
print(k)
| 7 | PYTHON3 |
n = int(input())
s = set(map(int, input().split()))
c = 0
k = 0
for i in range(1,91):
c += 1
k += 1
if i in s:
k = 0
if k == 15:
break
print(c)
| 7 | PYTHON3 |
n, t, c = int(input()), set(map(int, input().split())), 0
for i in range(1, 91):
c = 0 if i in t else c + 1
if c == 15:
print(i)
exit()
print(90) | 7 | PYTHON3 |
def loop(arr, n):
if arr[0] > 15: return 15
for i in range(n):
if arr[i] + 15 < arr[i + 1]:
return arr[i] + 15
return 90
def main():
n = int(input())
arr = list(map(int, input().split()))
arr.append(90)
print(loop(arr, n))
if __name__ == "__main__": main() | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
count = 0
i = 0
while i < n:
if count + 15 < a[i]:
break
else:
count = a[i]
i += 1
print(min(count + 15, 90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fast() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int gcd(int a, int b) { return (!b) ? a : gcd(b, a % b); }
void cv(vector<long> a) {
cout << "--"
<< "\n";
for (int i = 0; i < (int)a.size(); i++)
cout << a[i] << " "
<< "\n";
cout << "//"
<< "\n";
}
bool isPrime(int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i * i <= n; i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
bool isPal(string str) {
int l = 0;
int h = str.size() - 1;
while (h > l) {
if (str[l++] != str[h--]) return false;
}
return true;
}
int main() {
fast();
int n;
cin >> n;
vector<int> v(n);
for (int& x : v) cin >> x;
for (int i = 0, a = 0; i < n; i++) {
if (v[i] - a > 15) {
cout << a + 15 << "\n";
return 0;
}
if (i == n - 1) {
cout << min(v[i] + 15, 90) << "\n";
}
a = v[i];
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100], n, i, sum = 0, br = 0, j = 1;
cin >> n;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= 90; i++) {
br++;
if (br > 15) {
cout << a[j - 1] + 15 << endl;
return 0;
}
if (i == a[j]) {
sum = a[j];
j++;
br = 0;
}
}
cout << 90 << endl;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
flag = 0
temp = a[i]
for j in range(1, 16):
count += 1
if count == temp:
flag = 1
break
if flag == 0:
break
if i == n-1 and flag == 1:
count = count + 15
if count > 90:
count = 90
print(count) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
l.insert(0,0)
l.append(90)
a=0
for x in range(n+1):
d=l[x+1]-l[x]
if d<=15:a+=d
else:
a+=15
break
print(a) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, last = 0, x;
;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x - last > 15) {
break;
} else
last = x;
}
cout << min(last + 15, 90);
return 0;
}
| 7 | CPP |
import sys
import math
#to read string
get_string = lambda: sys.stdin.readline().strip()
#to read list of integers
get_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )
#to read non spaced string and elements are integers to list of int
get_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))
#to read non spaced string and elements are character to list of character
get_charList_from_str = lambda: list(sys.stdin.readline().strip())
#get word sepetared list of character
get_char_list = lambda: sys.stdin.readline().strip().split()
#to read integers
get_int = lambda: int(sys.stdin.readline())
#to print faster
pt = lambda x: sys.stdout.write(str(x))
#--------------------------------WhiteHat010--------------------------------#
n = get_int()
lst = get_int_list()
deadline = 15
for i in range(n):
if lst[i] <= deadline:
deadline = lst[i] + 15
else:
break
print(min(90,deadline)) | 7 | PYTHON3 |
n = int(input())
min = list(map(int,input().split(" ")))[:n]
if min[0] > 15 :
print(15)
else :
for i in range(len(min)-1):
if min[i+1] - min[i] > 15:
print(min[i]+15)
break
else:
print(min[-1]+15 if 90 - min[-1] > 15 else 90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool b[1234];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
b[x] = true;
}
int cnt = 0, ans;
for (ans = 1; ans <= 90; ans++) {
cnt++;
if (b[ans]) cnt = 0;
if (cnt == 15) break;
}
printf("%d\n", min(90, ans));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 1];
a[0] = 0;
for (int i = 1; i < n + 1; i++) {
cin >> a[i];
}
int ans = a[n] + 15;
for (int i = 0; i < n; i++) {
if (a[i + 1] - a[i] <= 15)
continue;
else {
ans = a[i] + 15;
break;
}
}
if (ans > 90) ans = 90;
cout << ans << "\n";
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if ((a - b) > 15) {
cout << b + 15;
return 0;
}
b = a;
}
if (b + 15 < 90) {
cout << b + 15;
return 0;
}
cout << 90;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int n, min = 0, i, t;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &t);
if ((t - min) > 15)
break;
else
min = t;
}
if ((min + 15) >= 90)
min = 90;
else
min = min + 15;
printf("%d", min);
return 0;
}
| 7 | CPP |
first_line = input()
second_line = input()
n = int(first_line)
lst = list(map(lambda a: int(a), second_line.split()))
def solve1(n, lst):
if lst[0] > 15:
return 15
for i in range(len(lst) - 1):
if lst[i + 1] - lst[i] > 15:
return lst[i] + 15
return min(lst[n-1] + 15, 90)
print(solve1(n, lst))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
t = 0
for i in range(n):
if t + 15 < a[i]:
print(t + 15)
exit()
else:
t = a[i]
print(min(t + 15,90)) | 7 | PYTHON3 |
n = int(input())
a = n
a = list(map(int, input().split()))
c = 0
for i in a:
if i - c <= 15:
c = i
if a[0] - 0 > 15:
print(15)
elif 90 - c >= 15:
print(c + 15)
elif 90 - c < 15:
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[92];
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int s = 0, l;
a[0] = 0;
for (int i = 1; i <= n; i++) {
if (a[i] - a[i - 1] > 15) {
s = s + 15;
cout << s;
return 0;
}
s = s + a[i] - a[i - 1];
l = i;
}
if (l == n) {
if (s + 15 >= 90) {
cout << 90;
} else {
cout << s + 15;
}
}
}
| 7 | CPP |
n = int(input())
array = list(map(int, input().split()))
first = array[0]
last = array[n - 1]
sum = first
if(first > 15):
print(15)
exit(0)
for i in range(1, n):
if(array[i] - array[i - 1] > 15):
print(array[i - 1] + 15)
exit(0)
sum = array[n - 1] + 15
if(sum > 90):
sum = 90
print(sum)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
std::vector<int> v;
std::cin >> n;
int width = 0;
for (int i = 0; i < n; i++) {
int temp;
std::cin >> temp;
v.push_back(temp);
}
int watching = 0;
int boring = 15;
for (int i = 0; i < n; i++) {
watching = v[i];
if (watching > boring) {
std::cout << boring;
return 0;
}
if (watching <= boring) {
boring = watching + 15;
}
}
watching += 15;
if (watching > 90) {
std::cout << 90;
return 0;
}
std::cout << watching;
}
| 7 | CPP |
number = int(input())
list_array = str(input())
list_array = list_array.split()
list_array = list_array[0:number]
x = 0
for i in range(len(list_array)):
if (int(list_array[i]) - x) > 15:
break
else:
x = int(list_array[i])
x = min([x + 15, 90])
print(x) | 7 | PYTHON3 |
n = int(input())
v = list(map(int, input().split()))
boring = 0
for i in range(1, 91):
boring += 1
if(i in v):
boring = 0
if(boring == 15):
print(i)
exit(0)
print (90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int i, t = 15;
int main() {
for (std::cin >> i; std::cin >> i && i <= t; t = i + 15)
;
std::cout << (t > 90 ? 90 : t);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans, x, n, s[90], i, m[91];
int main() {
cin >> n;
for (i = 0; i < n; i++) {
cin >> s[i];
m[s[i]] = 1;
}
for (i = 1; i <= 90; i++) {
if (m[i] == 0)
x++;
else
x = 0;
ans++;
if (x == 15) break;
}
cout << ans << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
v.push_back(k);
}
int prev = 0;
int flg = 0;
for (int i = 0; i < n; i++) {
if (v[i] - prev <= 15) {
prev = v[i];
} else {
if (prev + 15 > 90) {
cout << 90 << endl;
} else {
cout << prev + 15 << endl;
}
flg++;
break;
}
}
if (flg == 0) {
if (prev + 15 < 90) {
cout << prev + 15 << endl;
} else {
cout << 90 << endl;
}
}
}
| 7 | CPP |
n = int(input())
ara = list(map(int,input().split()))
ans = 0
if ara[0] <= 15:
ans += ara[0];
for i in range(1,n):
if (ara[i]-ara[i-1]) <= 15:
ans += ara[i]-ara[i-1]
else :
break
ans += 15
if ans > 90:
ans = 90
print(ans)
else :
print('15')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[105];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> arr[i];
}
arr[0] = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] - arr[i - 1] > 15) {
ans = i - 1;
cout << arr[ans] + 15 << endl;
return 0;
}
}
cout << min(arr[n] + 15, 90) << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int tu(int val) { return (1 << val); }
bool iset(int mask, int id) {
if ((mask & tu(id)) != 0) return true;
return false;
}
void doset(int &mask, int id) { mask |= tu(id); }
void dounset(int &mask, int id) { mask = mask & (~tu(id)); }
template <typename T>
string tos(T a) {
stringstream ss;
string ret;
ss << a;
ss >> ret;
return ret;
}
int ar[100];
int main() {
int n;
while (cin >> n) {
int v;
memset(ar, 0, sizeof ar);
;
for (int(i) = (0); (i) < (n); (i)++) {
cin >> v;
ar[v] = 1;
}
int ans = 90;
int br = 0;
for (int(i) = (1); (i) < (91); (i)++) {
if (ar[i] == 0)
br++;
else
br = 0;
if (br == 15) {
ans = i;
break;
}
}
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
def will_watch_minutes(n: int ,minutes_list: list) -> int:
will_watch_minutes = 0
for i in range(n+1):
amount = (minutes_list[i + 1] - minutes_list[i])
if amount <= 15:
will_watch_minutes += amount
else:
return min(will_watch_minutes + 15, 90)
return will_watch_minutes
num_interesting_minutes = int(input())
minutes_list = [0] + [int(i) for i in input().split()] + [90]
print(will_watch_minutes(num_interesting_minutes, minutes_list)) | 7 | PYTHON3 |
n=int(input())
tlist=input().split()
i=0
intlist=[0]
while i<n:
intlist.append(int(tlist[i]))
i+=1
intlist.append(90)
difflist=[]
i=0
while i<=n:
difflist.append(intlist[i+1]-intlist[i])
i+=1
x=[]
i=0
while i<=n:
if difflist[i]>15:
x.append(intlist[i]+15)
i+=1
if len(x)>0:
print(x[0])
else:
print(90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum = 0, count = 0;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (arr[0] > 15) {
cout << 15 << endl;
} else if (n > 1) {
for (int i = 0; i < n - 1; i++) {
int diff = arr[i + 1] - arr[i];
if (diff > 15) {
cout << arr[i] + 15 << endl;
count++;
break;
}
sum = arr[i + 1];
}
if (count == 0) {
if ((90 - sum) > 15)
cout << sum + 15 << endl;
else
cout << sum + (90 - sum) << endl;
}
} else {
cout << arr[0] + 15 << endl;
}
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
res = 15
for i in a:
if (i <= res):
res = i + 15
else:
break
if (res > 90):
res = 90
print(res) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
t = 0
for i in range(n):
if t + 15 < a[i]:
print(t + 15)
exit()
else:
t = a[i]
print(min(90, t + 15)) | 7 | PYTHON3 |
n=int(input())
ans=0
l=[0]+list(map(int,input().split()))
for i in range(n):
if l[i+1]-l[i]<=15:
ans=l[i+1]+15
else: ans=l[i]+15;break
if ans>90: ans=90
if l[0]>15:
print(15)
else: print(ans) | 7 | PYTHON3 |
n = int(input())
t = list(map(int,input().split()))
t = [0]+t +[90]
all = False
for i in range(len(t)-1):
if t[i+1] - t[i] >15:
all = False
if t[i]+15 >90:
print(90)
else:
print(t[i]+15)
break
else:
all = True
if all:
print(90) | 7 | PYTHON3 |
n = int(input())
v = list(map(int, input().split()))
total = 0
mark = 1
for i in range(n):
if v[i] - mark + 1 <= 15:
total += (v[i] - mark + 1)
mark = v[i] + 1
else:
total += 15
print(total)
exit()
print(min(90, total + 15)) | 7 | PYTHON3 |
n = int(input())
moment = list(map(int, input().split()))
def stupid_bear (a):
for i in range (len(a)):
if i == 0:
if a[i] > 15:
ans = 15
return ans
else:
if a[i]- a[i-1] > 15:
ans = a[i-1]+15
return ans
if a[i]- a[i-1] <= 15 and i == len(a)-1:
ans = a[i]
return ans
moment.append(90)
print (stupid_bear(moment)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e9 + 7;
int main() {
vector<int> v;
v.push_back(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
v.push_back(t);
}
bool b = 1;
for (int i = 1; i <= n; i++) {
if ((v[i] - v[i - 1]) > 15) {
cout << v[i - 1] + 15;
b = 0;
return 0;
}
}
if (b) {
cout << min(v[(v.size() - 1)] + 15, 90);
}
}
| 7 | CPP |
if __name__ == '__main__':
n = int(input())
arr = list(map(int, input().split()))
arr.insert(0, 0)
arr.append(90)
timeSpent = 0
for i in range(1,n+2):
if arr[i] - arr[i-1] > 15:
timeSpent = arr[i-1] + 15
break
else:
timeSpent = arr[i] + 15
if timeSpent > 90:
timeSpent = 90
print(timeSpent)
| 7 | PYTHON3 |
x=int(input());a=list(map(int,input().split()));i=0;p=15
while i<x:
if a[i]>p:exit(print(p))
else:p=15+a[i]
i+=1
print(min(a[-1]+15,90)) | 7 | PYTHON3 |
n = int(input())
list = input().split()
iCur = 0
iTemp = 0
iTotal = 0
bIsOver = False
for i in list:
iCur = int(i)
if (iCur - iTemp) > 15:
iTotal += 15
bIsOver = True
break
else:
iTotal = iCur
iTemp = iCur;
if bIsOver == False:
iTotal += 15
if iTotal < 15:
iTotal += 15
elif iTotal > 90:
iTotal = 90
print(iTotal) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100], k;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i <= n; i++)
if (a[i + 1] - a[i] > 15 || i == n) {
k = a[i];
break;
}
cout << min(k + 15, 90);
return 0;
}
| 7 | CPP |
n = int(input())
t = list(map(int, input().split()))
a = [0] * 91
c = True
for e in t:
a[e] = 1
for i in range(1, 91):
if a[i] == 1:
a[i] = 0
else:
a[i] = a[i - 1] + 1
if a[i] == 15:
print(i)
c = False
break
if c == True:
print(90)
| 7 | PYTHON3 |
n = int(input())
cur = 15
for i in map(int,input().split()):
if(i>cur):
break
cur = i + 15
print (min(90,cur))
| 7 | PYTHON3 |
def solve():
n = int(input())
ar = list(map(int, input().split()))
prev = 0
for i in range(n):
if ar[i] - prev > 15:
print(prev + 15)
return
prev = ar[i]
print(min(90, prev + 15))
solve() | 7 | PYTHON3 |
def magic(lit):
for i in range(len(lit)):
lit[i]=int(lit[i])
return lit
def min(a, b):
if(a<b):
return a
else:
return b
n=int(input())
ti=input().split()
ti=magic(ti)
ti.append(0)
ti.sort()
for i in range(1, n+1):
if(ti[i]-ti[i-1]>15):
ans=ti[i-1]
break
else:
ans=ti[i]
print (min(ans+15, 90))
| 7 | PYTHON3 |
n = int(input())
string = input()
minutes = list(map(int, string.split()))
minutes.append(90)
a = 0
for x in minutes:
if x - a > 15:
print(a + 15)
break
a = x
else:
print(90) | 7 | PYTHON3 |
n=int(input())
nmins=list(map(int, input().split()))
min=0
if nmins[0]>15:
min=15
else:
# if (90-nmins[-1])>=15:
# min=nmins[0]+15
#else:
for i in range(len(nmins)):
if nmins[i]-nmins[i-1]>15: # and 90-nmins[-1]>=15:
min=nmins[i-1]+15
break
else:
if 90-nmins[-1]>15:
min = nmins[-1] + 15
else:
min=90
print(min)
#loop. nmins(i+1)-nmins(i)>=15 => stop. min=nmin(i)+15
# nmins(i + 1) - nmins(i) < 15 => continue
# 16 20 30 40 50 60 70 80 90
# loop qua | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int last = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a <= last + 15) {
last = a;
}
}
cout << min(90, last + 15) << endl;
return 0;
}
| 7 | CPP |
x=int(input())
l=list(map(int,input().split()))
i=0
z=0
y=0
if l[0]>15:
z=1
y=15
else:
while(i<=x-1):
if i==x-1:
if l[i]+15<=90:
z=1
y=l[i]+15
break
else:
if l[i+1]-l[i]>15:
z=1
y=l[i]+15
break
i=i+1
if z==0:
y=90
print(y) | 7 | PYTHON3 |
n = int(input())
list = input().split()
iCur = 0
iTemp = 0
iTotal = 0
bIsOver = False
for i in list:
iCur = int(i)
if (iCur - iTemp) > 15:
iTotal += 15
bIsOver = True
break
else:
iTotal = iCur
iTemp = iTotal;
if bIsOver == False:
iTotal += 15
if iTotal < 15:
iTotal += 15
elif iTotal > 90:
iTotal = 90
print(iTotal) | 7 | PYTHON3 |
Subsets and Splits