solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
time = [0] + list(map(int, input().split())) + [90]
for i in range(n + 1):
if time[i + 1] - time[i] > 15:
print(min(time[i] + 15, 90))
break
elif i == n:
print(90)
| 7 | PYTHON3 |
if __name__ == "__main__":
n, x = int(input()), [0] + [int(i) for i in input().split()]
for i in range(1, len(x)):
if x[i] - x[i-1] > 15:
print((x[i-1] + 15))
break
if i == len(x) - 1:
if (x[i] + 15 > 90):
print(90)
else:
print(x[i] + 15)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool deb = false;
int i;
const int N = 100011;
int a[N];
int main() {
int i, j, n;
scanf("%d", &n);
for (i = 1; i < n + 1; ++i) scanf("%d", &a[i]);
a[n + 1] = 90;
sort(a, a + n + 2);
int tt = 0;
for (i = 1; i < n + 2; ++i) {
if (a[i] - a[i - 1] > 15) {
tt = a[i - 1] + 15;
break;
}
}
if (tt == 0) tt = 90;
printf("%d\n", tt);
return 0;
}
| 7 | CPP |
n=int(input())
a=list(map(int,(input().split())))
flag=1
if a[0]>15:
print(15)
elif len(a)==1:
print(a[0]+15)
else:
for i in range(1,n):
if a[i]-a[i-1]>15:
flag=0
print(a[i-1]+15)
break
if flag!=0:
print(min(a[i]+15,90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100], n, t, i;
int ans = 0;
int main() {
memset(a, 0, sizeof(a));
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &t);
a[t] = 1;
}
ans = 0;
for (i = 1; i <= 90; i++) {
if (a[i] == 1)
ans = 0;
else
ans++;
if (ans == 15) break;
}
if (i == 91) i--;
printf("%d\n", i);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = int(1e5);
int n;
map<int, int> s;
int a[MAXN];
int main() {
ios_base::sync_with_stdio(0);
a[0] = 0;
cin >> n;
for (int i = 1; i <= (n); i++) cin >> a[i];
n++;
a[n] = 90;
for (int i = 1; i <= (n); i++)
if (a[i] - a[i - 1] > 15) {
cout << a[i - 1] + 15;
return 0;
}
cout << 90;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t[95];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> t[i];
}
t[0] = 0;
int langkah;
langkah = 0;
for (int i = 1; i <= n; i++) {
int a;
a = t[i] - t[i - 1];
if (a <= 15)
langkah++;
else {
break;
}
}
if (t[langkah] + 15 >= 90)
cout << 90 << endl;
else {
cout << t[langkah] + 15 << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], i, k = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] > 15)
cout << "15";
else {
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] > 15) {
k++;
break;
}
}
if (k == 1)
cout << a[i - 1] + 15;
else {
if (a[n - 1] + 15 <= 90)
cout << a[i - 1] + 15;
else
cout << "90";
}
}
return 0;
}
| 7 | CPP |
input()
data = [0] + list(map(int, input().split())) + [90]
result = 0
for cur, nxt in zip(data, data[1:]):
if nxt - cur > 15:
result = cur + 15
break
result = nxt
print(result)
| 7 | PYTHON3 |
n = int(input())
t = map(int, input().split())
pos = 0
for i in t:
if i - pos - 1 < 15:
pos = i
else:
break
print(min(pos + 15, 90)) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sat Oct 24 15:37:45 2020
@author: Ngo-Manh.Tuan
"""
n = int(input())
interesting = list(map(int, input().split(' ' )))
start = 0
watch = 0
count = 0
for i in interesting:
if i - start <= 15:
watch = i
start = i
else:
break
print(min(90, watch + 15)) | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
ans = 0
cnt = 0
if lst[0] > 15:
ans = 15
else:
if n == 1:
ans = lst[0] + 15
else:
for i in range(len(lst)-1):
dura = lst[i + 1] - lst[i]
if dura > 15:
ans = lst[i] + 15
break
else:
cnt += 1
if cnt == n - 1:
ans = lst[n-1] + 15
if ans > 90:
ans = 90
print(ans) | 7 | PYTHON3 |
# cook your dish here
n=int(input())
a=list(map(int,input().split()))
if a[0]>15:
print(15)
else:
if len(a)==1:
if a[0]>15:
print(15)
else:
print(a[0]+15)
else:
i=1
while i<n:
k=a[i]-a[i-1]
if i==n-1 and k<=15:
if 90-a[-1]<=15:
s=90
break
else:
s=a[-1]+15
break
elif i==n-1 and k>15:
s=a[n-2]+15
break
elif k>15:
s=(a[i-1]+15)
break
i=i+1
print(s)
| 7 | PYTHON3 |
n=int(input())
li=list(map(int,input().split()))
c=0
for i in li:
if i-c>15:
break
else:
c=i
print(min(c+15,90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int inter[100] = {0};
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
inter[x] = 1;
}
for (int i = 1; i <= 76; i++) {
int j = i;
int kk = 0;
while (j <= i + 14) {
if (!inter[j])
kk++;
else
break;
j++;
}
if (kk == 15) {
cout << i + 14 << "\n";
return 0;
}
}
cout << 90 << "\n";
return 0;
}
| 7 | CPP |
number_of_interested_times = int(input())
interested_times = list(map(int, input().split()))
result = 0
def get_interested_time():
if number_of_interested_times == 1:
if interested_times[0] > 15:
return 15
else:
return (interested_times[0] + 15)
pre_intertesed_time = 0
for interested_time in interested_times:
if interested_time - pre_intertesed_time <= 15:
pre_intertesed_time = interested_time
else:
pre_intertesed_time += 15
return pre_intertesed_time
pre_intertesed_time += 15
if pre_intertesed_time > 90:
pre_intertesed_time = 90
return pre_intertesed_time
print(get_interested_time())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int i, n, result = 0;
scanf("%d", &n);
char a[n - 1];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
if (a[i] - a[i - 1] > 15) {
result = a[i - 1] + 15;
break;
}
}
if (n == 1) result = a[0] + 15;
if (a[0] > 15) result = 15;
if (result == 0) {
if (a[n - 1] >= 75)
result = 90;
else
result = a[n - 1] + 15;
}
printf("%d", result);
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
if l[0]>15:
print("15")
else:
c=1
for i in range(1,n):
if l[i]-l[i-1]>15:
print(l[i-1]+15)
c=0
break
if c:
if l[n-1]+15<90:
print(l[n-1]+15)
else:
print("90")
| 7 | PYTHON3 |
n = int(input())
inp = input().split()
a = []
for i in inp:
a.append(int(i))
t = 0
i = 0
while i<n and a[i]-t<=15:
t = a[i]
i += 1
print(min(90,t+15)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 111111;
const int INF = 1e9 + 7;
int n;
int t[N];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> t[i];
t[0] = 0;
t[n + 1] = t[n];
for (int i = 0; i <= n; ++i)
if (t[i] + 15 < t[i + 1]) return cout << t[i] + 15, 0;
cout << min(t[n] + 15, 90);
}
| 7 | CPP |
'''input
60
1 2 4 5 6 7 11 14 16 18 20 21 22 23 24 25 26 33 34 35 36 37 38 39 41 42 43 44 46 47 48 49 52 55 56 57 58 59 60 61 63 64 65 67 68 70 71 72 73 74 75 77 78 80 82 83 84 85 86 88
'''
n = int(input())
t = list(map(int, input().split()))
s = 0
for x in t:
if x - s > 15:
print(s + 15)
break
else:
s = x
else:
print(90 if s > 75 else s + 15) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
s=a[0]
count=0
if a[0]>15:
print(15)
else:
i=0
while i<=n-1:
if i==n-1:
if a[i]+15<90:
count=a[i]+15
else:
count=90
break
elif a[i+1]-a[i]>15:
count=a[i]+15
break
else:
count=a[i]
i+=1
print(count) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int i;
int a[n + 1];
a[0] = 0;
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
int final = 0;
int flag = 0;
for (i = 0; i < n; i++) {
if (a[i + 1] - a[i] > 15) {
final = a[i] + 15;
flag = 1;
break;
}
}
if (flag == 0) {
final = a[n] + 15;
}
if (final < 90)
printf("%d", final);
else
printf("90");
return 0;
}
| 7 | CPP |
#Bear and Game
n = int(input())
lst = list(map(int,input().split()))
t0 = 0
tend = 90
for t in lst:
if t > t0 + 15:
break
else:
t0 = t
if t0 + 15 < tend:
print(t0 + 15)
else:
print(tend)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
l.append(90)
l.insert(0,0)
sum=90
for i in range(n+1):
if l[i+1]-l[i]>15:
sum=l[i]+15
break
print(sum) | 7 | PYTHON3 |
n = int(input())
minutes = list(map(int, input().split()))
start_minute = 1
end_minute = 90
if n <= 1:
length = minutes[0] - start_minute
if length >= 15:
print(15)
else:
print(minutes[0] + 15)
else:
for i in range(n):
if i == 0:
length = minutes[i] - start_minute
if length >= 15:
print(15)
exit()
else:
length = minutes[i] - minutes[i - 1]
if length > 15:
print(minutes[i - 1] + 15)
exit()
if (end_minute - minutes[-1]) < 15:
print(90)
else:
print(minutes[-1] + 15) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
flag = 0
if a[0] > 15:
print(15)
flag = 1
for i in range(1, n):
if (a[i] - a[i-1] > 15) and flag == 0:
print(a[i-1]+15)
flag = 1
break
else:
if not flag:
print(min(a[n-1]+15, 90))
| 7 | PYTHON3 |
n = int(input())
lst = list(map(int,input().strip().split())) [:n]
s=lst[len(lst)-1]
a,b =0,0
f=0
for i,j in enumerate(lst):
if (j-f)>15:
f=f+15
a=1
break
else:
f=j
if a==1:
print(f)
else:
if (s+15) <= 90:
print(s+15)
else:
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, T[9000];
int main(int argc, char *argv[]) {
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
T[x] = 1;
}
int ans = 0, last = 0;
for (int i = 1; i <= 90; ++i) {
if (last == 15) break;
++ans;
++last;
if (T[i]) last = 0;
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
a=int(input())
b=list(map(int, input().split()))
cnt=0
for i in range(0,len(b)-1):
if 0+b[0]>15:
print("15")
cnt+=1
quit()
elif b[i]+15<b[i+1]:
print(b[i]+15)
cnt+=1
quit()
if cnt==0 and a>1 and b[len(b)-1]+15>=90:
print("90")
quit()
if cnt==0 and a>1 and b[len(b)-1]+15<90:
print(b[len(b)-1]+15)
if a==1 and b[0]<=15:
print(b[0]+15)
elif a==1 and b[0]>15:
print("15")
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
c=0
flag=1
if l[0]>15:
print(15)
elif n==1:
print(l[0]+15)
else:
for i in range(n-1):
if l[i+1]-l[i]>15:
c=l[i]+15
flag=0
break
else:
c=l[i]
if flag==1:
if l[-1]+15<90:
print(l[-1]+15)
else:
print(90)
else:
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int input() {
int n;
cin >> n;
return n;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int n, now = 0;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) cin >> vec[i];
vec.push_back(90);
for (int i = 0; i < n; i++) {
if (now + 15 < vec[i]) {
cout << now + 15 << endl;
return 0;
}
now = vec[i];
}
cout << min(90, vec[n - 1] + 15) << endl;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int,input().split()))
a.insert(0,0)
for i in range(n):
if a[i] + 15 < a[i+1]: print(a[i]+15); exit()
if a[-1] + 15 >= 90: print(90)
else: print(a[-1]+15) | 7 | PYTHON3 |
a=int(input())
b=[0]+list(map(int,input().split()))+[90]
for i in range(a+1):
if b[i+1]-b[i]>15:
print(b[i]+15)
exit()
print(90)
| 7 | PYTHON3 |
def interesting(lst):
if lst[0] > 15:
return 15
s = 0
for i in range(1, len(lst)):
if lst[i] - lst[i - 1] > 15:
return 15 + lst[i - 1]
return min(90, lst[-1] + 15)
n = int(input())
a = [int(j) for j in input().split()]
print(interesting(a))
| 7 | PYTHON3 |
input()
X = list(map(int, input().split()))
if X[0] > 15:
print(15)
exit()
if len(X) == 1:
print(X[0] + 15)
exit()
for i in range(1, len(X)):
if X[i] - X[i - 1] > 15:
print(X[i - 1] + 15)
exit()
if i == len(X) - 1:
print(90 if 90 - X[i] <= 15 else X[i] + 15)
exit()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[100];
int main() {
int i, sol;
cin >> n;
a[0] = 0;
n++;
a[n] = 90;
for (i = 1; i <= n; ++i) {
cin >> a[i];
if (a[i] - a[i - 1] - 1 >= 15) {
sol = a[i - 1] + 15;
cout << sol << "\n";
return 0;
}
}
cout << "90\n";
return 0;
}
| 7 | CPP |
import sys
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
# ///==========MAIN=============///
n=int(input())
Arr=get_array()
Arr=[0]+Arr+[90];flag=0
for i in range(1,n+2):
if Arr[i]-Arr[i-1]>15:
print(min(Arr[i-1]+15,90))
flag=1
break
if flag==0:
print(90)
| 7 | PYTHON3 |
read = lambda : map(int, input().split())
n = int(input())
t = list(read())
def calc():
if t[0] > 15 :
return 15
t.append(90)
for i in range(n):
if t[i] + 15 < t[i + 1] :
return t[i] + 15
return 90
print(calc()) | 7 | PYTHON3 |
n=int(input())
x=0;j=15;t=True
a = list(map(int, input().strip().split()))[:n]
for i in range(0,len(a)):
if(a[i]>j):
t=False
if(t):
j=a[i]+15
if(j>90):j=90
print(j) | 7 | PYTHON3 |
n, l = int(input()), list(map(int, input().split()))
for i in range(n):
if(l[0] > 15):
print(15)
break
if(i == n - 1):
print(min(l[i] + 15, 90))
elif(l[i + 1] > l[i] + 15):
print(l[i] + 15)
break | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
a.append(90)
#print (len(a))
a.insert(0, 0)
a.append(1000)
for i in range (1, len(a)):
if (a[i] - a[i - 1] > 15):
print (min(90, a[i - 1] + 15))
break | 7 | PYTHON3 |
def count_time(list_minutes,initial=0):
output=0
if list_minutes==[]:
if initial in range(75,90):
return 90-initial
elif initial == 90:
return 0
else:
return 15
current = list_minutes[0]
interval = abs(current-initial)
if interval > 15:
return 15
else:
return interval + count_time(list_minutes[1:],current)
no_use= input()
list_minutes= list(map(int, input().strip().split( )))
print(count_time(list_minutes))
| 7 | PYTHON3 |
n = int(input())
A = list(map(int, input().split()))
A = A[::-1]
A.append(0)
A = A[::-1]
m = 0
h = 0
for i in range(1, n + 1):
if A[i] - A[i - 1] <= 15 or (i == 1 and A[i] - A[i - 1] < 16):
m += (A[i] - A[i - 1])
else:
m += min(15, A[i]-A[i-1])
h = 1
break
if h == 0:
m += 15
m = min(m, 90)
print(m) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main(void) {
long long int n, a[100], i, tmp, c = 0;
scanf("%lld", &n);
for (i = 0; i < n; i++) scanf("%lld", &a[i]);
if (a[0] > 15)
printf("15");
else {
for (i = 1; i < n; i++) {
if ((a[i] - a[i - 1]) > 15) {
tmp = a[i - 1];
c++;
break;
}
}
if (c > 0)
printf("%lld", tmp + 15);
else {
if (a[n - 1] + 15 <= 90)
printf("%lld", a[n - 1] + 15);
else
printf("90");
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l = 0;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
if (t - l > 15) {
cout << min(l + 15, 90);
break;
}
if (i == n - 1) {
cout << min(t + 15, 90);
break;
}
l = t;
}
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
t = 15
for i in range(n):
if a[i] > t:
break
else:
t = a[i] + 15
if t > 90:
print(90)
else:
print(t) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
ans = 0
for i in range(n):
if l[i] > ans + 15:
break
else:
ans = l[i]
if ans > 75:
print(90)
else:
print(ans+15) | 7 | PYTHON3 |
def solve():
n = int(input().strip())
t = [0 for _ in range(n + 3)]
t[0] = 0
tmp = list(map(int, input().strip().split()))
for i in range(n):
t[i + 1] = tmp[i]
t[n + 1] = 90
for i in range(0, n + 1):
if t[i + 1] - t[i] > 15:
print(t[i] + 15)
return
print(90)
solve() | 7 | PYTHON3 |
# ý tưởng:
# đọc vào mảng, add thêm 90 vào cuối mảng, xong duyệt qua các phần tử.
# kiểm nêu hiệu của a[i] với a[i-1] >= 15 thì kết qua bằng a[i-1]+15self
# Nếu a[0]>15 thì ket qua là 15
# nếu chậy het mang mà hieu a[i] với a[i-1] < 15 ket qua la 90
n = int(input())
moment = list(map(int, input().split()))
def stupid_bear (a):
ans = 0
for i in range (len(a)):
if i == 0 and a[i] > 15:
ans = 15
break;
elif a[i]- a[i-1] > 15:
ans = a[i-1]+15
break;
else:
ans = a[i]
return ans
moment.append(90)
print (stupid_bear(moment)) | 7 | PYTHON3 |
n=int(input())
a=[int(i) for i in input().split(' ')]
a.insert(0,0)
for i in range(1,n+1):
if a[i]-a[i-1]>15:
print(a[i-1]+15)
break
else:
print(min(a[n]+15,90)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 100;
const int mod = 1e9 + 7;
const int inf = 1e9;
int a[1000];
int main() {
ios ::sync_with_stdio(false);
memset(a, 0, sizeof(a));
int n, x;
cin >> n;
for (long long i = (1); i <= (n); i++) cin >> x, a[x] = 1;
int dem = 0;
for (long long i = (1); i <= (90); i++) {
if (a[i] == 1)
dem = 0;
else
dem++;
if (dem == 15) {
cout << i;
return 0;
}
}
cout << 90;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
bool f[99];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
f[a] = 1;
}
int nj = 0, i = 0;
for (i = 1; i < 90; i++) {
if (f[i])
nj = 0;
else {
nj++;
if (nj == 15) break;
}
}
printf("%d", i);
}
| 7 | CPP |
x=int(input())
o=0
p=list(map(int,input().split()))
for i in range(x):
if p[i]-o>15:
if o==0:print(15)
else : print(o+15)
exit()
o=p[i]
if 90-p[x-1]<=15:print(90)
else:print(p[x-1]+15)
| 7 | PYTHON3 |
n=int(input())
L=input().split(' ')
L=list(map(int,L))
L.append(90)
def test(L):
if L[0]>15:
return 15
for i in range(1,len(L)) :
if L[i]-L[i-1]>15 :
return L[i-1]+15
return 90
print(test(L)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i, r, flag = 0;
scanf("%d", &n);
int a[n + 2];
a[0] = 0;
for (i = 1; i < n + 1; i++) {
scanf("%d", &a[i]);
}
a[n + 1] = 90;
for (i = 0; i < n + 1; i++) {
if (a[i + 1] - a[i] > 15) {
r = a[i] + 15;
printf("%d", r);
flag = 1;
break;
}
}
if (flag == 0) printf("90");
return 0;
}
| 7 | CPP |
n =int( input())
a = list(map(int, input().split()))
if a[0] > 15:
print(15)
exit()
s = a[0] + 15
for i in range(n - 1):
if ((a[i+1] - a[i]) > 15):
s = a[i] + 15
break
elif i == n - 2:
s = a[i + 1] + 15
if s > 90:
print(90)
else:
print(s)
| 7 | PYTHON3 |
n = int(input())
t = list(map(int, input().split()))
t.append(90)
m = 0
for i in t:
if i - m > 15:
m += 15
break
else:
m = i
print(m)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MX = 2 * 1e5 + 10;
const double PI = acos(-1.0), EPS = 1e-9;
int N, M;
int main() {
cin >> N;
int arr[222];
for (int i = 0; i < N; i++) cin >> arr[i];
sort(arr, arr + N);
int cur = 15;
for (int i = 0; i < N; i++) {
if (arr[i] > cur) break;
cur = min(90, arr[i] + 15);
}
cout << cur;
return 0;
}
| 7 | CPP |
x = int(input())
t = 0
a = list(map(int,input().split()))
i = 0
if x == 1 and a[0]<15:
print(a[0]+15)
else:
while True:
k = 0
if i == x:
k = 1
if k == 0 and a[i]>t+15:
# print(i)
print(t+15)
break
elif k == 0:
t = a[i]
if t + 15 <= 90 and k == 1:
print(t+15)
break
elif k == 1:
print(90)
break
i = i + 1 | 7 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
def minWatchingGame(arr):
if (arr[0] > 15):
return 15
for i in range(len(arr) - 1):
if (arr[i] + 15 < arr[i+1]):
return arr[i] + 15
return min(90, arr[n-1] + 15)
print(minWatchingGame(arr)) | 7 | PYTHON3 |
input();s=0
for i in map(int,input().split()):
if i-s>15:break
else:s=i
print(min(s+15,90)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
cin >> n;
int a[n];
for (i = 0; i < n; i++) cin >> a[i];
int time = 0;
if (a[0] >= 16) {
time = 15;
} else {
for (i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > 15) {
time = a[i] + 15;
break;
}
}
}
if (time == 0) {
time = a[i] + 15;
if (time <= 90)
cout << time;
else
cout << 90;
} else
cout << time;
return 0;
}
| 7 | CPP |
n = int(input())
t = list(map(int, input().split()))
t.append(0)
t = sorted(t)
output = 0
for i in range(len(t) - 1):
output = t[i] + 15
if t[i + 1] - t[i] > 15:
break
else:
output = t[i + 1] + 15
print(min(output, 90)) | 7 | PYTHON3 |
from sys import stdin, stdout
def main():
number_of_moment = stdin.readline().rstrip()
moments = [int(i) for i in stdin.readline().rstrip().split()]
watching_minutes = 0
for moment in moments:
if (watching_minutes + 15) < moment:
break
else:
watching_minutes = moment
if watching_minutes + 15 > 90:
return 90
else:
return watching_minutes + 15
print(main()) | 7 | PYTHON3 |
n = int(input())
val = [0] + list(map(int, input().split()))
for i in range(1, n + 1):
if val[i] > val[i - 1] + 15:
print(val[i - 1] + 15)
exit()
print(min(val[-1] + 15, 90))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
if a[0] > 15:
print('15')
exit()
for i in range(1, n):
if a[i] - a[i - 1] > 15:
print(a[i - 1] + 15 )
exit()
if 90 - a[n - 1] > 15:
print(a[n - 1] + 15)
else:
print('90')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int v[92];
int main() {
int k = 0;
int k2 = 0;
int t;
cin >> t;
int a;
while (t--) {
cin >> a;
v[a] = 1;
}
for (int i = 1; i <= 90; i++) {
k2++;
if (v[i] == 0) {
k++;
} else
k = 0;
if (k >= 15) {
break;
}
}
cout << k2 << endl;
}
| 7 | CPP |
from sys import stdin
n = int(input())
arr = list(map(int,stdin.readline().split()))
cnt = 0
for i in range(n):
if(i == 0 and arr[i] <= 15):
cnt = arr[i] + 15
elif(i==0 and arr[i] > 15):
cnt = 15
break
elif(arr[i] <= cnt):
cnt = arr[i]+15
if(cnt > 90):
cnt = 90
else:
break
print(cnt) | 7 | PYTHON3 |
n=int(input())
m=list(map(int,input().split()))
m.append(90)
m.insert(0,0)
a=90
for i in range(n+1):
if m[i+1]-m[i]>15:
a=m[i]+15
break
print(a) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int L01P08(vector<int>& arr, int n) {
bool check = true;
if (arr[0] - 15 > 0) {
return 15;
} else {
for (int i = 0; i < n - 1; i++) {
for (int j = 1; j < n; j++) {
if (arr[i] + 15 < arr[i + 1]) {
return arr[i] + 15;
break;
}
}
}
if (arr[arr.size() - 1] + 15 < 90) {
return arr[arr.size() - 1] + 15;
} else {
return 90;
}
}
}
int main() {
int n, val;
cin >> n;
vector<int> arr;
for (int i = 0; i < n; i++) {
cin >> val;
arr.push_back(val);
}
int res = L01P08(arr, n);
cout << res;
return 0;
}
| 7 | CPP |
n = int(input())
t = list(map(int, input().split()))
pre = 0
ans = 0
for i in range(n):
if (t[i] - pre <= 15):
ans = t[i] + 15
pre = t[i]
else:
ans = pre + 15
break
print(min(90,ans)) | 7 | PYTHON3 |
input()
*a, = map(int, input().split())
ans = 0
for i in a:
if i - ans > 15:
break
ans = i
print(ans + 15 if ans <= 75 else 90) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 14 16:30:15 2018
@author: Quang Huy
"""
n= int(input())
x= input()
list1 = x.split()
d=0
list1.append(90)
for i in range(n+1):
if (int(list1[i])-d<=15):
d= int(list1[i])
else:
d+=15
break
if (d>90): d=90
print(d) | 7 | PYTHON3 |
input()
mins = map(int, input().split(' '))
max_min = 15
for minute in mins:
if minute <= max_min:
max_min = minute + 15
else:
break
print(min(max_min, 90)) | 7 | PYTHON3 |
n = int(input())
g = list(map(int, input().split()))
t = 0
for i in range(n):
if i == 0 :
if g[i] - 1 < 15:
if n ==1:
t = g[i] +15
continue
else:
t = 15
break
if g[i]-g[i-1]-1 <15:
if i ==(n-1) and (g[i]<75):
t =g[i]+15
break
continue
else:
t = g[i-1]+15
break
if t == 0:
t = 90
print(t) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, n, m = 0, b = 0, v, arr[100000];
cin >> x;
for (int i = 0; i < x; i++) {
cin >> arr[i];
}
for (int i = 0; i < x; i++) {
if (i == x - 1)
break;
else if (arr[i] < arr[i + 1] - 15) {
b++;
m = arr[i];
n = arr[i + 1];
break;
} else
v = arr[i + 1];
}
if (arr[0] > 15)
cout << 15;
else if (x == 1 && arr[0] <= 15)
cout << arr[0] + 15;
else if (b == 0) {
if (v + 15 > 90)
cout << 90;
else
cout << v + 15;
} else if (b > 0)
cout << m + 15;
return 0;
}
| 7 | CPP |
n=int(input())
l=list(map(int,input().split()))
s=0
for i in range(n):
if l[i]-s>15:
break
s=l[i]
print(min(90,s+15)) | 7 | PYTHON3 |
N=int(input())
mas=[False]*90
li=list(map(int, input().split()))
for i in li:
mas[i-1]=True
i=0
sk=0
while (sk<15) and (i<90):
if (not mas[i]):
sk+=1
else:
sk=0
i+=1
print(i) | 7 | PYTHON3 |
n=int(input())
li=list(map(int, input().split()))
x=0
for i in range(n):
if li[i]-x>15:
x+=15
print(x)
break
else:
x=li[i]
else:
x=li[n-1]
if x+15>=90:x=90
else: x+=15
print(x)
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
t=0
for i in range(n):
if(t+15<a[i]):
break
else:
t=a[i]
print(min(t+15,90))
| 7 | PYTHON3 |
TIME_TO_SLEEP = 15
number_of_interesting_moments = int(input())
intersting_moments = list(map(int, input().split()))
counting_point = 0
counting_point = 0
for moment in intersting_moments:
period = moment - counting_point
if period > TIME_TO_SLEEP:
break
else:
counting_point = moment
print(counting_point+15) if counting_point+15 < 90 else print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, x, res = 0;
scanf("%ld", &n);
for (long i = 1; i <= n; ++i) {
scanf("%ld", &x);
if (x - res > 15) {
printf("%ld", res + 15);
return 0;
}
res = x;
}
printf("%ld", min(res + 15, 90L));
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 1000000007;
int main() {
long long n, i;
cin >> n;
long long A = 90, t, p = 0;
for (i = 0; i < n; i++) {
cin >> t;
if ((t - p) > 15) {
A = p + 15;
break;
}
p = t;
}
if (i == n && t < 76) A = t + 15;
cout << min(A, (long long)90) << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, f, i, j, k, n, time = 15;
int x[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a);
b = time - a;
if (b >= 0) {
time = a + 15;
} else
break;
}
if (time > 90) {
printf("90");
} else {
printf("%d", time);
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[105];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
int sum = a[1];
if (a[1] > 15)
printf("15\n");
else {
for (int i = 2; i <= n; i++) {
if (a[i] - a[i - 1] <= 15)
sum = a[i];
else
break;
}
printf("%d\n", min(sum + 15, 90));
}
return 0;
}
| 7 | CPP |
n = int(input())
ti = map(int,input().split())
t2 = [0]*91
for i in ti:
t2[i] = 1
num = 0
ans = 0
for i in range(1,91):
if t2[i] == 0:
num += 1
else:
num = 0
ans = i
if num >= 15:
break
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long power(long long aa, long long pp) {
long long xx = 1, yy = aa % 1000000007;
while (pp > 0) {
if (pp & 1) xx = (xx * yy) % 1000000007;
yy = (yy * yy) % 1000000007;
pp = pp >> 1;
}
return xx % 1000000007;
}
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first)
return a.first < b.first;
else
return a.second < b.second;
}
int xc[4] = {0, 1, 0, -1};
int yc[4] = {1, 0, -1, 0};
int A[200];
int main() {
ios_base::sync_with_stdio(false);
int i, n, k = 0;
cin >> n;
for (i = 1; i <= n; i++) cin >> A[i];
A[n + 1] = 90;
for (i = 1; i <= n + 1; i++) {
if ((A[i] - A[i - 1] - 1) >= 15) {
k += 15;
break;
} else {
k += A[i] - A[i - 1];
}
}
cout << k;
return 0;
}
| 7 | CPP |
interesting = int(input())
list = [int(x) for x in input().split()]
index = 0
boring = 0
boring_temp = 15
while boring_temp <= 90:
if boring_temp >= list[index]:
boring_temp = list[index]
else:
break
# print("bor: " + str(boring_temp))
index += 1
boring_temp += 15
if index >= len(list):
break
if boring_temp >= 90:
print(90)
else:
print(boring_temp) | 7 | PYTHON3 |
n = int(input())
l = input().split()
if 90 - int(l[-1]) > 15:
rs = int(l[-1]) + 15
else:
rs = 90
if int(l[0]) > 15:
rs = 15
else:
for i in range(1, n):
if int(l[i]) - int(l[i-1]) > 15:
rs = int(l[i-1]) + 15
break
print(rs)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int array[n];
int i;
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
int a = 0;
for (i = 0; i < n; i++) {
if ((i == 0) && (i + 1) != n) {
if ((array[i]) > 15) {
a = 15;
break;
}
}
if ((i == 0) && (i + 1) == n) {
if ((array[i]) > 15) {
a = 15;
break;
} else {
a = array[i] + 15;
break;
}
}
if ((i + 1) == n) {
if ((90 - array[i]) > 15)
a = array[i] + 15;
else
a = 90;
break;
} else if ((array[i + 1] - array[i]) > 15) {
a = array[i] + 15;
break;
}
}
printf("%d\n", a);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, ans = 0;
cin >> x;
for (int i = 0; i < x; i++) {
cin >> y;
if (y - ans > 15)
break;
else
ans = y;
}
if (ans + 15 >= 90)
cout << 90;
else
cout << ans + 15;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MX = (int)1e6 + 17;
const int MOD = (int)1e9 + 7;
const long long oo = (long long)1e18 + 7;
const int INF = (int)INT_MAX;
const int N = (int)1e5 + 17;
const int di[4] = {-1, 0, 1, 0};
const int dj[4] = {0, 1, 0, -1};
inline long long IN() {
long long x = 0, ch = getchar(), f = 1;
while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
if (ch == '-') {
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x * f;
}
inline void OUT(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10)
OUT(x / 10), putchar(x % 10 + '0');
else
putchar(x + '0');
}
int n;
int a[100];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i <= n; i++) {
if (a[i] + 15 < a[i + 1]) {
cout << min(a[i] + 15, 90);
return 0;
}
}
cout << min(a[n] + 15, 90);
return 0;
}
| 7 | CPP |
#define
interesting = 0
upcoming = 15
minutes = []
#input
number = int(input())
minutes= list(map(int, input().split()))
#code
for i in range (number):
if minutes[i] <= upcoming:
interesting = minutes[i]
upcoming = interesting + 15
else:
print(upcoming)
exit()
if upcoming > 90:
print("90")
exit()
#output
print(upcoming) | 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
l.insert(0,0)
l.append(90)
t = 0
for i in range (1, len(l)):
if (l[i] - l[i-1]) <= 15:
t += (l[i] - l[i-1])
else:
t = l[i-1] + 15
break
print(t) | 7 | PYTHON3 |
n=int(input())
l=list(map(int, input().split()))
l.insert(0,0)
for i in range(n):
if l[i+1]-l[i]>15:
print(l[i]+15)
n=0
break
if n!=0: print(min(90,l[-1]+15)) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
view = 0
pre = 0
for i in range(len(a)):
cur = a[i]
if (cur - pre) > 15 :
view += 15
break
else :
view += ( cur - pre )
pre = cur
if i == n-1:
if (90 - a[n-1]) <= 15 :
view += 90 - a[n-1]
else:
view += 15
print(view) | 7 | PYTHON3 |
n = int(input())
array = [int(i) for i in input().split()]
#if a0 > 15, print 15
if array[0] > 15:
print(15)
#if a0 <= 15, consider the difference between consecutive "interesting minutes"
else:
sum_min = array[0]
i = 0
while i < (n - 1):
if (array[i + 1] - array[i]) <= 15:
sum_min = array[i + 1]
i += 1
else:
sum_min += 15
break
if (i == n - 1):
sum_min = min(sum_min + 15, 90)
print(sum_min)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void boost() { ios_base::sync_with_stdio(0); }
int n, t;
int x[101];
int main() {
boost();
cin >> n;
for (int i = 0; i < n; i++) cin >> x[i];
x[n] = 90;
for (int i = 0; i <= n; i++) {
if (x[i] - t > 15) {
t = t + 15;
break;
}
t = x[i];
}
cout << t;
}
| 7 | CPP |
from math import *
l = int(input())
arr = map(int, input().split())
s = 15
for i in arr:
if i > s:
break
else:
s = i + 15
else:
s = min(s, 90)
print(s) | 7 | PYTHON3 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.