solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
def function(arr):
mx,t=0,0
arr=arr+[90]
for m in arr:
if m-t>15:
return mx+15
mx=mx+m-t
t=m
return mx
if __name__=='__main__':
n=int(input())
arr=list(map(int,input().split()))
print(function(arr)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n;
cin >> n;
a[0] = 0;
for (int i = 1; i <= n; i++) scanf("%i", &a[i]);
a[n + 1] = 90;
a[n + 2] = 120;
int k = 0;
while (a[k + 1] - a[k] <= 15) k++;
if (k != n + 1)
printf("%i\n", a[k] + 15);
else
printf("90\n");
return 0;
}
| 7 | CPP |
import sys
length = int(input())
fun = list(map(int, input().split(" ")))
x = 0
for i in fun:
if x + 15 < i:
print(x + 15)
sys.exit()
x = i
if x + 15 < 90:
print(x + 15)
else:
print(90) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=True
for i in range(n):
if i==0:
if l[i]-15>0:
print(15)
m=False
break
else:
if l[i]-l[i-1]>15:
k=l[i-1]+15
if k>=90:
print(90)
m=False
break
else:
print(k)
m=False
break
if m:
k=l[n-1]+15
if k>=90:
print(90)
else:
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) cin >> arr[i];
if (arr[0] > 15) {
cout << "15";
return 0;
}
for (int i = 0; i < n; i++) {
if (arr[i + 1] - arr[i] > 15 && i < n && arr[i] + 15 <= 90) {
cout << arr[i] + 15;
return 0;
}
}
cout << "90";
return 0;
}
| 7 | CPP |
def check(n, a):
a.insert(0, 0)
a.append(90)
for i in range(1, len(a)):
if (a[i] - a[i-1]) > 15:
return a[i-1]+15
return 90
n = int(input())
a = list(map(int, input().strip().split()))
print(check(n, a)) | 7 | PYTHON3 |
n = int(input())
t = [x for x in map(int, input().split())]
t.insert(0, 0)
#print(t)
ans = 0
for i in range(len(t)):
if t[i] - t[i-1] > 15:
ans = t[i-1] + 15
break
if ans == 0:
ans = t[-1]+15
ans = min(90, ans)
print(ans) | 7 | PYTHON3 |
n = int(input())
a = [int(i) for i in 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 |
def solution(l1):
i=0
if l1[0]>15:
return 15
while i<len(l1)-1:
if l1[i+1]-l1[i]>15:
return l1[i]+15
i+=1
return min(l1[-1]+15,90)
def answer():
n = int(input())
l1 = [int(x) for x in input().split()]
print(solution(l1))
answer() | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
ans = 0
check = False
for i in range(n):
if a[i] - ans > 15:
ans += 15
check = True
break
else:
ans = a[i]
if not check:
if 90 - ans <= 15:
ans = 90
else:
ans += 15
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[93], b[93];
scanf("%d", &n);
int ans = 0;
a[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i - 1] = a[i] - a[i - 1];
}
b[n] = 90 - a[n];
for (int i = 0; i <= n; i++) {
if (b[i] > 15) {
ans = a[i] + 15;
break;
}
}
if (!ans) ans = 90;
printf("%d\n", ans);
return 0;
}
| 7 | CPP |
n = int(input().strip())
minutes = map(int,input().strip().split(' '))
minutes = list(minutes)
start = 0
duration = 0
flag = 0
for i in minutes:
if (i - start > 15):
duration += 15
print(duration)
flag = 1
break
elif (i == 90) or (90 -i <= 15):
print(90)
flag = 1
break
elif i - start <= 15 and len(minutes) == 1:
i = i + 15
print(i)
flag =1
break
else:
start = i
duration = i
if (flag == 0):
print(min(90, duration + 15)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tests, temp1(0), temp2(0);
cin >> tests;
bool flag = false;
while (tests-- > 0) {
cin >> temp2;
if (temp2 - temp1 > 15) {
temp1 += 15;
flag = true;
break;
}
temp1 = temp2;
}
if (!flag) {
if (temp1 >= 85)
temp1 = 90;
else {
temp1 += 15;
if (temp1 > 90) temp1 = 90;
}
}
cout << temp1 << endl;
}
| 7 | CPP |
n = int(input())
b= list(map(int, input().split()))
a = [0]
status = True
a.extend(b)
a.append(90)
for i in range(len(a)-1):
if a[i+1]-a[i] >15:
print(a[i]+15)
status = False
break
elif a[i+1] == 90:
print(90)
status = False
break
if status == True:
print(90)
| 7 | PYTHON3 |
def countTotalWatchingTime(ar):
totalMin = 0
for time in ar:
if time - totalMin > 15:
return min(totalMin + 15, 90)
else:
totalMin = time
if 90 - totalMin < 15:
return 90
else:
return totalMin + 15
n = int(input())
ar = list(map(int, input().split()))
print(countTotalWatchingTime(ar)) | 7 | PYTHON3 |
n = int(input())
li = [int(x) for x in input().split()]
def run(li):
if li[0] > 15:
print(15)
else:
for i in range(len(li)-1):
if li[i+1] - li[i] > 15 :
print(li[i]+15)
break
else:
print(min(li[-1]+15,90))
run(li)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, num, sum, prev, flag;
cin >> n;
sum = prev = flag = 0;
for (int i = 0; i < n; i++) {
cin >> num;
if (num - prev > 15 && flag == 0) {
flag = 1;
sum = prev + 15;
}
if (flag == 0) {
sum = num;
prev = num;
}
}
if (90 - prev > 15)
sum = prev + 15;
else
sum = 90;
cout << sum << "\n";
return 0;
}
| 7 | CPP |
n = int(input().strip())
minutes = map(int,input().strip().split(' '))
minutes = list(minutes)
start = 0
duration = 0
flag = 0
for i in minutes:
if (i - start > 15):
duration += 15
print(duration)
flag = 1
break
elif (i == 90) or (90 -i <= 15):
print(90)
flag =1
break
elif i - start <= 15 and len(minutes) == 1:
i = i + 15
print(i)
flag = 1
break
else:
start = i
duration = i
if flag == 0:
print(min(90, duration + 15))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[100], sum;
while (scanf("%d", &n) == 1) {
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
if (n >= 2) {
if (arr[0] <= 15) {
sum = arr[0];
int flag = 0;
for (int i = 1; i < n; i++) {
if ((arr[i] - arr[i - 1]) <= 15) {
sum += (arr[i] - arr[i - 1]);
} else {
sum += 15;
flag = 1;
break;
}
}
if (flag == 0) {
if ((90 - sum) <= 15)
printf("90\n");
else
printf("%d\n", sum + 15);
} else
printf("%d\n", sum);
} else
printf("15\n");
} else {
if (arr[0] > 15)
printf("15\n");
else
printf("%d\n", arr[0] + 15);
}
}
return (0);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> t(n);
for (int i = 0; i < n; i++) {
cin >> t[i];
}
if (t[0] > 15) {
cout << 15 << '\n';
return 0;
}
for (int i = 0; i < n - 1; i++) {
if (t[i + 1] - t[i] > 15) {
cout << t[i] + 15 << '\n';
return 0;
}
}
cout << (90 - t[n - 1] > 15 ? t[n - 1] + 15 : 90) << '\n';
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool ok[99];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int foo;
cin >> foo;
ok[foo] = true;
}
int cnt = ok[1] ? 0 : 1;
int ans = 1;
for (int i = 2; i <= 90; ++i) {
if (!ok[i])
++cnt;
else
cnt = 0;
ans++;
if (cnt == 15) break;
}
cout << ans;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char** argv) {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int last = 0, in;
while (n--) {
cin >> in;
if (in - last > 15) break;
last = in;
}
int ans = min(last + 15, 90);
cout << ans << endl;
return 0;
}
| 7 | CPP |
n=int(input())
start=0
end=-1
times=list(map(int,input().split()))+[90]
#print(times)
for t in times:
d=t-start
if d>15:
end=start
break
start=t
if end>=0:
print(min(end+15,times[n]))
else:
print(times[n])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int aux = 0;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x - aux > 15) {
cout << min(90, 15 + aux) << '\n';
return 0;
} else
ans += x;
aux = x;
}
cout << min(90, 15 + aux) << '\n';
}
| 7 | CPP |
i=input
i()
l=0
for x in map(int,input().split()):
if x>l+15:break
l=x
print(min(90,l+15)) | 7 | PYTHON3 |
n = int(input())
t = list(map(int, input().split()))
b = 0
for i in range(n):
if t[i] - b > 15:
print(min(90, b + 15))
exit()
else:
b = t[i]
print(min(90, b + 15))
| 7 | PYTHON3 |
# http://codeforces.com/problemset/problem/673/A
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
# second way , we need to think the way of more general
"""
Start to use 0 for the start and the end
loop from the second to end , if i - (i-1) >15 => prin (i-1) +15
if result > 90 => print 90
"""
def get_interested_time_second_way():
interested_times.insert(0, 0)
for index in range(len(interested_times)):
if index == 0:
continue
if interested_times[index] - interested_times[index - 1] > 15:
return interested_times[index - 1]
return interested_times[-1]
result = (get_interested_time_second_way() + 15)
if result > 90:
result = 90
print(result)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int, input().split()))
# if l[0] > 15:
# print(15)
# else:
# for i in range(1, len(l)):
# if l[i] > l[i-1] + 15:
# print(l[i-1] + 15)
# break
# if i == len(l) - 1:
# print(90)
l = [0] + l + [90]
for i in range(1, len(l)):
if l[i] > l[i-1] + 15:
print(l[i-1] + 15)
break
if i == len(l) - 1:
print(90)
| 7 | PYTHON3 |
n = int(input())
if (n == 0):
print(15)
else:
num_input = input()
a = [0]
if (n == 1):
a.append(int(num_input))
else:
num_input = num_input.split(" ")
for i in range(n):
a.append(int(num_input[i]))
a.append(90)
timeWatch = 90
for i in range(n+1):
if (a[i + 1] - a[i] > 15):
timeWatch = a[i] + 15
break
print(timeWatch) | 7 | PYTHON3 |
from typing import List
def solve(interesting_minutes: List[int], n: int) -> int:
"""
Ref: https://codeforces.com/contest/691/problem/A
"""
max_time = 90
boring_time = 15
watched_time = 0
for i in interesting_minutes:
if i - watched_time <= boring_time:
watched_time = i
return min(max_time, watched_time + boring_time)
n = int(input())
minutes = list(map(int, input().split(' ')))
print(solve(minutes, n))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
ans = 0
a = [0] + a + [90]
for i in range(n-1+2):
if (a[i+1] - a[i] > 15):
ans = a[i] + 15
break
ans = a[i + 1]
print(ans) | 7 | PYTHON3 |
n = int(input())
a = []
a.append(0)
b = list(map(int, input().split()))
for i in range(n):
x = b[i]
a.append(x)
a.append(90)
n = int(len(a))
for i in range(1, n):
if a[i] - a[i - 1] > 15:
print(a[i - 1] + 15)
exit(0)
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long bgm(long long a, long long b, long long m) {
a %= m;
long long rem = 1;
while (b) {
if (b & 1) rem = (rem * a) % m;
a = (a * a) % m;
b >>= 1;
}
return rem;
}
long long inv(long long a, long long mod) { return bgm(a, mod - 2, mod); }
long long in() {
long long a;
assert(scanf("%lld", &a) != EOF);
return a;
}
double dl() {
double a;
assert(scanf("%lf", &a) != EOF);
return a;
}
const int MAX = 100005;
const long long MOD = 1000000007;
int n;
int ara[100];
int f = 1;
int ans = 90;
int main() {
n = in();
for (int i = 1; i <= n; i++) ara[i] = in();
ara[++n] = 90;
for (int i = 1; f and i <= n; i++)
if (ara[i] > ara[i - 1] + 15) ans = ara[i - 1] + 15, f = 0;
printf("%lld", (long long)(ans)), puts("");
return 0;
}
| 7 | CPP |
import string
def reversed_list(l, start, end):
if start >= end:
return l
l[start], l[end] = l[end], l[start]
return reversed_list(l, start + 1, end - 1)
def main_function():
n = input()
l = [int(i) for i in input().split(" ")]
l = [0] + l
l.append(90)
init = l[0]
for i in range(1, len(l)):
if l[i] - init > 15:
return init + 15
init = l[i]
return 90
print(main_function()) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, a[95], pre, cur;
bool f;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
if (a[i] - a[i - 1] > 15) {
cur = i - 1;
f = true;
break;
}
}
if (!f) cur = n;
(a[cur] + 15 <= 90) ? printf("%d\n", a[cur] + 15) : puts("90");
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp = 0, result, flag = 1;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (a[i] - temp > 15) {
result = temp + 15;
cout << result;
flag = 0;
break;
} else {
temp = a[i];
}
}
if (flag == 1) {
result = a[n - 1] + 15;
if (result > 90)
cout << "90";
else
cout << result;
}
}
| 7 | CPP |
# Bear and Game
# https://codeforces.com/problemset/problem/673/A
n = int(input())
t = list(map(int, input().split()))
cnt = 0
if (n == 1):
if (t[0] > 15):
cnt = 15
else:
cnt = t[0] + 15
else:
middle = False
if (t[0] > 15):
cnt = 15
middle = True
else:
cnt = t[0]
for i in range(1,n):
if (t[i] - t[i-1] <= 15):
cnt += t[i] - t[i-1]
else:
cnt += 15
middle = True
break
if not middle:
cnt = min(90,cnt + 15)
print(cnt) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 0;
int main() {
int ans = 15;
int n, x;
cin >> n;
while (n--) {
cin >> x;
if (x > ans)
break;
else
ans = min(90, x + 15);
}
cout << ans << endl;
return 0;
}
| 7 | CPP |
def time_off(list_int):
result = 15
must_off = 90
for item in list_int:
if item > result:
return result
result = item + 15
if result > must_off:
return must_off
return result
n = input()
list_int = list(map(int, input().split()))
print(time_off(list_int))
| 7 | PYTHON3 |
input()
ts = map(int, input().split())
time = 15
for t in ts:
if t <= time:
time = t + 15
else:
break
print(min(90, time)) | 7 | PYTHON3 |
def bear_and_game_solution(mins):
count = 0
boring_step = 15
i = 0
while i < len(mins):
if count + boring_step < mins[i]:
return count + boring_step
else:
count = mins[i]
i += 1
return min(count + boring_step, 90)
def main():
n = input()
minutes = [int(min) for min in input().split()]
print(bear_and_game_solution(minutes))
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int i, n, a = 0;
scanf("%d", &n);
int t[n];
for (i = 0; i < n; i++) {
scanf("%d", &t[i]);
}
for (i = 0; i < n; i++) {
if (t[i] - a <= 15)
a = t[i];
else
break;
}
if (90 - a <= 15) {
a = 90;
} else
a = a + 15;
printf("%d", a);
return 0;
}
| 7 | CPP |
def f(l):
for i in range(len(l)):
if l[i]-l[i-1]>15:
return l[i-1]+15
return 90
n=int(input())
l=list(map(int,input().split()))
l.append(0)
if 90 not in l:
l.append(90)
l.sort()
print(f(l)) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
last = 0
cnt = 0
for i in range(1, 91):
if i - last > 15:
break
cnt += 1
if i in a:
last = i
print(cnt) | 7 | PYTHON3 |
input()
# read line2 in, split into elements, cast to integers, stored at interesting minutes
interesting_minutes = list(map(int, input().split()))
# check the first element to see if it is greater than 15, print 15, break out of the loop
if interesting_minutes[0] > 15:
print (15)
else:
for index in range(len(interesting_minutes)):
# check the last element to see if 90 - (this element) greater than 15
if index == len(interesting_minutes) - 1:
if 90 - interesting_minutes[index] > 15:
print (interesting_minutes[index] + 15)
else:
print (90)
break
# for all elements which is not the first and the last, calculate the distance between the next element and current
else:
distance = interesting_minutes[index + 1] - interesting_minutes[index]
if distance > 15:
print (interesting_minutes[index] + 15)
break
| 7 | PYTHON3 |
n = int(input())
t = list(map(int, input().split()))
t = [0] + t + [200]
res = 0
for i in range(n + 1):
if t[i + 1] - t[i] > 15:
res = t[i] + 15
break
print(min(res, 90)) | 7 | PYTHON3 |
def solution():
n = int(input().strip())
t = [0 for _ in range(n+3)]
t[0] = 0
tmp = list(map(int,input().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)
solution()
| 7 | PYTHON3 |
n=int(input())
a=[0];p=False
a+=list(map(int, input().split()))
a+=[90]
for i in range(1,n+2):
if i==n+1:
if a[i]-a[i-1]>15:
print(a[i-1]+15)
break
else:
print(a[i])
else:
if a[i]-a[i-1]>15:
print(a[i-1]+15)
break | 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
time = 0
t = 15
a.insert(0, 0)
for i in range(1,n+1):
if a[i] - a[i-1] <= 15:
time += a[i] - a[i-1]
else:
time += t
print(time)
exit()
if 90 - a[n] <= 15:
time += 90 - a[n]
else:
time += 15
print(time)
| 7 | PYTHON3 |
n = int(input())
v = list(map(int, input().split()))
t = 0
for i in range(n):
if t + 15 < v[i]:
print(t + 15)
exit()
else:
t = v[i]
print(min(90, t + 15)) | 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):
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;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (a[n - 1] != 90) {
n++;
a[n - 1] = 90;
}
int current = 0;
int d = -1;
while (d < n - 1 && a[d + 1] - current <= 15) {
if (d < n - 1) {
current = a[d + 1];
}
d++;
}
cout << (d == n - 1 ? a[n - 1] : current + 15) << endl;
return 0;
}
| 7 | CPP |
x=int(input())
s=list(map(int,input().split()))
e=0
c=0
for n in range(x):
if n==0:
if s[n]>15:
e=e+15
c=1
break
if s[n]<=15:
e=e+s[n]
c=c
elif n!=0:
if s[n]-s[n-1]<=15:
e=e+ (s[n]-s[n-1])
c=c
elif s[n]-s[n-1]>15:
e=e+15
c=1
break
if s[x-1]!=90 and c==0:
if 90-s[x-1]<=15:
e=e+90-s[x-1]
print(e)
elif 90-s[x-1]>15:
e=e+15
print(e)
else:
print(e) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, ar[10000], a, ans;
while (scanf("%lld", &n) != EOF) {
for (i = 1; i <= n; i++) {
scanf("%lld", &ar[i]);
}
if (ar[1] > 15)
printf("15\n");
else {
int flg = 0, a;
for (i = 2; i <= n; i++) {
a = abs(ar[i] - ar[i - 1]);
if (a > 15) {
ans = ar[i - 1] + 15;
flg = 1;
break;
}
}
if (flg == 0) {
ans = ar[n];
if (ans != 90) ans += 15;
if (ans > 90) ans = 90;
printf("%lld\n", ans);
} else {
printf("%lld\n", ans);
}
}
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[10000], i, s;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
if (a[0] >= 16)
cout << "15" << endl;
else {
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] - 1 >= 15) {
s = a[i - 1];
break;
} else
s = a[i];
}
if (s + 15 >= 90)
cout << "90" << endl;
else
cout << s + 15 << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n, x;
while (cin >> n) {
vector<int> vec(91, 0);
for (int i = 0; i < n; i++) {
cin >> x;
vec[x] = 1;
}
int tot = 0, cnt = 0;
for (int i = 1; i <= 90; i++) {
tot++;
if (vec[i]) {
cnt = 0;
} else {
cnt++;
if (cnt == 15) break;
}
}
printf("%d\n", tot);
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long powmod(long long a, long long b) {
long long res = 1;
if (a >= mod) a %= mod;
for (; b; b >>= 1) {
if (b & 1) res = res * a;
if (res >= mod) res %= mod;
a = a * a;
if (a >= mod) a %= mod;
}
return res;
}
int a[100];
int main() {
ios_base::sync_with_stdio(false);
;
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (long long i = (long long)(1); i <= (long long)(n); i++) {
cin >> a[i];
}
bool flag = false;
for (long long i = (long long)(1); i <= (long long)(n); i++) {
int temp = a[i] - a[i - 1];
if (temp > 15) {
flag = true;
cout << a[i - 1] + 15;
break;
}
}
if (!flag) {
int temp = 90 - a[n];
if (temp > 15)
cout << (a[n] + 15);
else
cout << "90";
}
return 0;
}
| 7 | CPP |
n = int(input())
a = map(int, input().split())
cur = 0
prev = 0
for t in a:
if t - prev > 15:
break
cur = t
prev = t
cur = min(cur + 15, 90)
print(cur)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, f = 0;
int ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (!f) {
if (ans + 15 < x) {
f = 1;
} else
ans = x;
}
}
ans = min(ans + 15, 90);
cout << ans;
return 0;
}
| 7 | CPP |
n=int(input())
s=[int(i) for i in input().split()]
m=s[0]+15
if s[0]>15:
print(15)
else:
c=1
for i in range(1,n):
if s[i]-s[i-1]<=15 and c==1:
m=s[i]+15
else:
c=0
if m>90:
print(90)
else:
print(m)
| 7 | PYTHON3 |
# coding: utf-8
from __future__ import print_function
from __future__ import unicode_literals
from __future__ import division
from __future__ import absolute_import
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
n = int(input())
ml = tuple(map(int, input().split(" ")))
d = 15
for t in ml:
if d < t:
print(d)
break
else:
d = t + 15
else:
print(min(d, 90))
| 7 | PYTHON3 |
input()
t0 = 0
for t in map(int, input().split()):
if t-t0 > 15:
print(t0+15)
break
t0 = t
else:
print(min(90, t0+15)) | 7 | PYTHON3 |
n = input()
s = input()
a = s.split(" ")
last = 0
res = 0
a.append(90)
for i in a:
i = int(i)
res += min(15, i - last)
if i - last > 15: break
last = i
print(res) | 7 | PYTHON3 |
#include <bits/stdc++.h>
const int OO = 1e9;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
bool b[95] = {0};
for (int i = (0); i < (int)(n); ++i) {
int t;
cin >> t;
b[t] = 1;
}
int i = 1, res, it = 1;
while (1) {
if (i > 90) break;
if (b[i])
it = 1;
else
it++;
res = i;
if (it > 15) break;
i++;
}
cout << res;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, last;
string line;
while (cin >> n) {
last = 0;
cin.ignore(0x7fffffff, '\n');
getline(cin, line);
istringstream intIn(line);
while (n--) {
intIn >> m;
if (last + 15 < m) break;
last = m;
}
if (last + 15 >= 90)
cout << 90 << endl;
else
cout << last + 15 << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int time, cnt, num, i, j;
scanf("%d", &num);
int *interesting = (int *)malloc(sizeof(int) * num);
for (i = 0; i < num; i++) {
scanf("%d", &interesting[i]);
}
time = 0;
cnt = 0;
j = 0;
for (i = 0; i < 90; i++) {
time++;
cnt++;
if (time == interesting[j]) {
j++;
cnt = 0;
}
if (cnt == 15) break;
}
printf("%d\n", time);
free(interesting);
return 0;
}
| 7 | CPP |
input()
t=0
for i in map(int, input().split()):
if i - t > 15: break
else: t = i
print(min(90, t + 15))
# Made By Mostafa_Khaled | 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().split()]
# a = [15, 30, 45, 60, 75]
# n = len(a)
def test():
a.append(90)
if (a[0] > 15):
print(15)
return
# if (len(a) == 1):
# print(90)
# return
else:
for i in range(n):
if (a[i+1] - a[i] > 15):
print(a[i] + 15)
return
print(90)
test()
| 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:
print(90 if x[i] + 15 > 90 else x[i] + 15)
| 7 | PYTHON3 |
IL = lambda: list(map(int, input().split()))
IS = lambda: input().split()
I = lambda: int(input())
S = lambda: input()
n = I()
a = IL()
interesting = set(range(15))
for aa in a:
interesting = interesting.union(range(aa, aa+15))
print(min(min([i for i in range(110) if i not in interesting]), 90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int vis[1000];
int n, x, ans, last;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
vis[x]++;
}
for (int i = 1; i <= 90; i++) {
if (vis[i] == 0)
last++;
else
last = 0;
ans++;
if (last >= 15) break;
}
cout << ans;
return 0;
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
if a[0] > 15:
print(15)
exit(0)
for i in range(n - 1):
if a[i + 1] - a[i] - 1 >= 15:
print(a[i] + 15)
exit(0)
if 90 - a[n - 1] >= 15:
print(a[n - 1] + 15)
exit(0)
print(90) | 7 | PYTHON3 |
def cal_inter_minu(num_minutes_inter, n_minutes_inter):
if num_minutes_inter == 1:
if n_minutes_inter[0] > 15:
return 15
else:
return n_minutes_inter[0] + 15
for index in range(len(n_minutes_inter) - 1):
if index == 0:
if n_minutes_inter[index] > 15:
return 15
distance = n_minutes_inter[index + 1] - n_minutes_inter[index]
if distance > 15:
return n_minutes_inter[index] + 15
if 90 - n_minutes_inter[-1] > 15:
return n_minutes_inter[-1] + 15 #90 - (90 - n_minutes_inter[-1] - 15)
return 90
if __name__ == '__main__':
num_minutes_inter = int(input())
n_minutes_inter = list(map(int, input().split()))
print(cal_inter_minu(num_minutes_inter, n_minutes_inter)) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
cur_time = 0
for i in range(0, n):
if (a[i] > cur_time + 15):
print(min(cur_time + 15, 90))
break
else:
cur_time = a[i]
if (i == n - 1):
print(min(cur_time + 15, 90))
| 7 | PYTHON3 |
number_of_good = int(input())
good_mins = input()
good_mins = good_mins.split(" ")
good_mins.append("90")
if int(good_mins[0]) > 15:
print(15)
exit()
for i in range(1, len(good_mins)):
if int(good_mins[i]) - int(good_mins[i - 1]) > 15:
print(int(good_mins[i - 1]) + 15)
exit()
print(90) | 7 | PYTHON3 |
# http://codeforces.com/problemset/problem/572/A
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 |
'''
'''
number_of_interesting_min = int(input())
l = list(map(int,input().split()))
min = 0
max = 90
interesting_min = 15
l[0] != min and l.insert(0,min)
l[len(l) - 1] != max and l.append(max)
minitues = 0
for i in range(0,len(l) -1):
minitues = l[i]
if (l[i + 1] - l[i] > interesting_min):
break
minitues = minitues + interesting_min > max and max or minitues + interesting_min
print(minitues) | 7 | PYTHON3 |
n = int(input())
nums = list(map(int, input().split()))
end = 15
for x in nums:
if x > end:
print(end)
exit(0)
else:
end = x + 15
print(90 if end > 90 else end) | 7 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
ans = 0
if (a[0] > 15):
print(15)
exit()
a.append(200)
for i in range(1, n + 1):
if (a[i] - a[i - 1] > 15):
ans = a[i - 1] + 15
break
print(min(ans, 90)) | 7 | PYTHON3 |
n = input()
t = list(map(int, input().split()))
n = [0 for _ in range(90)]
for i in t:
n[i - 1] = 1
s = 0
ni = 0
for i in n:
if ni == 15:
break
if i == 1:
ni = 0
elif i == 0:
ni += 1
s += 1
print(s)
| 7 | PYTHON3 |
n = int(input())
last = 0
for t in map(int, input().split()):
if last + 15 < t:
break
else:
last = t
print(min(90, last + 15)) | 7 | PYTHON3 |
n = int(input())
a = []
a.append(0)
suma = 110
a = a + list(map(int, input().split()))
a.append(90)
n += 1
for i in range (n):
if a[i] + 15 < a[i + 1]:
suma = a[i] + 15
break
print(min(suma, 90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i;
scanf("%d", &n);
n++;
int a[n];
a[0] = 0;
for (i = 1; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] > 15) {
printf("%d", a[i - 1] + 15);
break;
} else if (i == n - 1 && a[i] - a[i - 1] <= 15) {
if (90 - a[i] <= 15) {
printf("90");
} else
printf("%d", a[i] + 15);
}
}
}
| 7 | CPP |
#!/usr/bin/python
# http://codeforces.com/problemset/problem/673/A
# define function
def watching_minute(n, a):
if a[0] > 15:
return 15
elif len(a) == 1:
return a[0] + 15
else:
for i in range(len(a) - 1):
if a[i+1] - a[i] > 15:
return a[i] + 15
if a[i+1] >= 75 or a[i] >= 75:
return 90
# check last number
if i + 1 == len(a) - 1 and a[i+1] < 75:
return a[i + 1] + 15
# call function
n = int(input())
a = [int(i) for i in input().split()]
print(watching_minute(n, a))
| 7 | PYTHON3 |
def calTime():
n = int(input())
a = [0]
a = a + list(map(int, input().split()))
a.append(1000)
for i in range(len(a) - 1):
if a[i + 1] - a[i] > 15:
return min(a[i] + 15, 90)
print(calTime())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int arr[100];
int main() {
int n;
cin >> n;
vector<int> items(n);
for (int i = 1; i <= n; i++) {
int item;
cin >> item;
arr[item] = 1;
}
int lastTime = 0;
int time = 90;
for (int i = 1; i <= 90; i++) {
if (i - lastTime > 15) {
time = i - 1;
break;
}
if (arr[i] == 1) {
lastTime = i;
}
}
cout << time << endl;
int pause;
cin >> pause;
return 0;
}
| 7 | CPP |
'''
روزی روزگاری
'''
c = 0
ans=[False]*90
n=int(input())
a = [*map(int,input().split())]
for i in a:
ans[i-1]=True
y=range(90)
for i in y:
if ans[i]==False:
c+=1
else:
c=0
if c==15:
print(i+1)
break
if c!=15:
print(90)
| 7 | PYTHON3 |
#coding:utf-8
def main():
input()
num=[int(i) for i in input().split()]
now=0
last=0
for i in num:
last=now
now=i
if last+15<now :
if last+15 < 90:
print(last+15)
else:
print(90)
return
if now+15<90:
print(now+15)
else:
print(90)
return
main() | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
free = [False] * 91
for x in lst:
free[x] = True
not_false = 0
for i in range(1, len(free)):
if free[i]:
not_false = i
else:
if abs(i - not_false) >= 15:
print(i)
exit()
print(90) | 7 | PYTHON3 |
n = int(input())
minutes=[]
for i in range(91):
minutes.append(False)
for x in input().split():
x = int(x)
minutes[x] = True
l = 0
i = 1;
while i < 90:
if minutes[i] == False:
l += 1;
else:
l = 0
if (l == 15): break;
i += 1;
print(i)
| 7 | PYTHON3 |
n = int(input())
t = input().split()
current_time = 0
total_time = 0
for idx, i in enumerate(t):
i = int(i)
if i-current_time > 15:
total_time += 15
break
else:
total_time += i-current_time
current_time = i
if idx == n-1:
if i + 15 <= 90:
total_time += 15
else:
total_time = 90
print(total_time) | 7 | PYTHON3 |
n = int(input())
l = [int(x) for x in input().split()]
l.insert(0,0)
min = 0;
for i in range(0,n,1):
sub = l[i+1]-l[i]
if sub > 15:
min=l[i]
break;
else:
min = l[i+1]
if(min<75):
print(min+15)
else:
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int i, arr[n], brr[n];
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
brr[0] = arr[0];
for (i = 1; i < n; i++) {
brr[i] = arr[i] - arr[i - 1];
}
if (n == 1) {
if (arr[0] > 15) {
printf("15");
} else
printf("%d", arr[0] + 15);
} else {
int count = 0;
for (i = 0; i < n; i++) {
if (brr[i] > 15) {
count = 1;
break;
}
}
int sum = 0;
if (count == 1 && i == 0) {
printf("15");
} else if (count == 1 && i != 0) {
sum = arr[i - 1] + 15;
if (sum > 90) {
printf("90");
} else
printf("%d", sum);
} else if (count == 0 && (90 - arr[n - 1] <= 15)) {
printf("90");
} else if (count == 0 && (90 - arr[n - 1] > 15)) {
printf("%d", arr[n - 1] + 15);
}
}
return 0;
}
| 7 | CPP |
def minutes(lst, n):
res = 15
end = len(lst)-1
if n == 1:
if lst[0] <= 15:
return lst[0]+15
if lst[0] > 15:
return res
for i in range(len(lst)-1):
if (lst[i] + 15 < lst[i+1]):
res = lst[i] + 15
if res > 90:
res = 90
break
elif lst[end] + 15 <= 90:
res = lst[end] + 15
else:
res = 90
return res
n = int(input())
lst = list(map(int, input().split()))
print(minutes(lst,n)) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
l.insert(0,0)
l.append(90)
flag = 0
for i in range(1,n+2):
if l[i]-l[i-1]>15:
flag = 1
print(l[i-1]+15)
break
if flag==0:
print(90) | 7 | PYTHON3 |
'''
@Name: Bear And Game
'''
def main():
n = int(input())
timer = list(map(int, input().split()))
if timer[0] > 15:
print(15)
elif timer[0] <= 15 and n == 1:
print(15 + timer[0])
else:
if timer[0] != 1:
timer.insert(0, 0)
for i in range(1, len(timer)):
if timer[i] - timer[i - 1] > 15:
stop = timer[i - 1] + 15
break
else:
stop = timer[i] + 15
if stop >= 90:
print(90)
else:
print(stop)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
times = input()
interestMins = list(map(int,input().split()))
watched = 0
for min in interestMins:
if(min - watched> 15):
break
watched = min
watched = watched + 15
if(watched> 90):
watched = 90
print(watched) | 7 | PYTHON3 |
#Day 1 Exercise 3
#Bear and Game
n = int(input())
ls = list(map(int,input().split()))
timeoff = 0
if n == 1:
if ls[0] - 1 >= 15:
timeoff = 15
else:
timeoff = ls[0] + 15
else:
for i in range(n):
#print(i,timeoff,ls[i],ls[i+1])
if i == 0:
if ls[i] >= 16:
timeoff = 15
break
else:
timeoff = ls[i] + 15
else:
if ls[i] > timeoff:
break
else:
timeoff = ls[i] + 15
if timeoff > 90:
timeoff = 90
print(timeoff)
| 7 | PYTHON3 |
n = input()
A = input()
A = list(map(int, A.split()))
A.insert(0, 0)
A.append(90)
result = 0
for idx, item in enumerate(A):
x = item + 15
if x >= 90:
result = 90
break
if x < A[idx+1]:
result = x
break
print(result)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
m=0
s=0
for i in range(n):
if(l[i]-m<=15):
m=l[i]
else:
m+=15
s=1
break
if(s==0):
if(90-m<=15):
m=90
else:
m+=15
print(m)
| 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.