solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
def main():
input()
a = 0
for b in list(map(int, input().split())) + [90]:
if b > a + 15:
b = a + 15
break
a = b
print(b)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 90;
bool a[N];
int main() {
int n;
cin >> n;
for (int i = 0, t; i < n; i++) {
cin >> t;
t--;
a[t] = true;
}
int cnt = 0, time = 0;
for (int i = 0; i < N && cnt < 15; i++) {
if (a[i]) {
time++;
cnt = 0;
} else {
time++;
cnt++;
}
}
cout << time << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int buf = 0;
for (int i = 0; i < (int)n; i++) {
int a;
cin >> a;
if (buf + 15 < a) {
cout << buf + 15 << endl;
return 0;
} else {
buf = a;
}
}
if (buf + 15 > 90) {
cout << 90 << endl;
} else {
cout << buf + 15 << endl;
}
return 0;
}
| 7 | CPP |
def main():
t1=0
t2=0
input()
n=[int(i) for i in input().split()]
if len(n)==0:
print (15)
return
for i in n:
t1=t2
t2=i
if (t2-t1) > 15 :
if(t1+15)<91:
print (t1+15)
else:
print (90)
return
if(t2+15)<91:
print (t2+15)
else:
print (90)
return
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v, a, b;
map<int, int> mp;
int n, m;
int cnt = 15;
cin >> n;
while (n--) {
cin >> m;
if (m <= cnt) {
cnt = m + 15;
}
}
if (cnt > 90) cnt = 90;
cout << cnt << endl;
}
| 7 | CPP |
f=lambda:map(int,input().split())
n=int(input())
l=[0]+list(f())
for i,j in zip(l,l[1:]+[90]):
if j-i>15:
exit(print(i+15))
print(90)
| 7 | PYTHON3 |
#Bear and the game
n = int(input())
list = []
string = input()
list1 = string.split(" ")
for str in list1:
list.append(int(str))
if list[0] > 15:
print(15)
exit()
else:
result = list[0]
i = 1
while i < n:
if list[i] - list[i-1] > 15:
print(result + 15)
exit()
else:
result += list[i] - list[i-1]
i += 1
if list[n - 1] > 74:
print(90)
exit()
else:
print(list[n-1] + 15)
exit() | 7 | PYTHON3 |
n = int(input())
a = map(int, input().split())
b = [False for i in range(90)]
for i in a:
b[i - 1] = True
ans = 0
cnt = 0
for i in range(90):
ans += 1
if b[i] == False:
cnt += 1
if cnt == 15:
break
else:
cnt = 0
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int time = 90;
int N;
scanf("%d", &N);
int A[N];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
int diff[N + 1];
diff[0] = A[0];
for (i = 1; i < N; i++) {
diff[i] = A[i] - A[i - 1];
}
diff[N] = 90 - A[N - 1];
for (i = 0; i < N + 1; i++) {
if (diff[i] > 15) {
if (i == 0)
time = 15;
else
time = A[i - 1] + 15;
break;
}
}
printf("%d\n", time);
}
| 7 | CPP |
n=int(input())
a=[0]
b=list(map(int,input().split()))
a.extend(b)
a.append(90)
for i in range(1,n+2):
if a[i]-a[i-1]>15:
print(a[i-1]+15)
break
else:
print(a[n+1]) | 7 | PYTHON3 |
import math
from collections import Counter
def solve():
n = int(input())
T = [int(x) for x in input().split()]
time = 0
for t in T:
if t > min(time + 15, 90):
return min(time + 15, 90)
else:
time = t
return min(time + 15, 90)
print(solve())
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[95], i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
if (a[0] > 15) {
printf("%d", 15);
return 0;
} else {
for (i = 1; i < n; i++) {
if ((a[i] - a[i - 1]) > 15) {
printf("%d", a[i - 1] + 15);
return 0;
}
}
if ((90 - a[n - 1]) > 15) {
printf("%d", a[n - 1] + 15);
return 0;
} else {
printf("90");
return 0;
}
}
}
| 7 | CPP |
'''
INPUT SHORTCUTS
N, K = map(int,input().split())
N ,A,B = map(int,input().split())
string = str(input())
arr = list(map(int,input().split()))
N = int(input())
'''
def main():
N = int(input())
arr = list(map(int,input().split()))
start = 0
flag = True
index = -1
for i in range(len(arr)):
if arr[i]-start>15:
flag = False
index = i
break
start= arr[i]
# print(flag)
# print(index)
if flag:
if 90-arr[-1]>=15:
print(arr[-1]+15)
else:
print(90)
else:
if index-1>=0:
print(arr[index-1]+15)
else:
print(15)
main() | 7 | PYTHON3 |
n = input()
n = int(n)
arr = input()
# arr = arr.replace(' ', '')
arr = list (arr.split(' '))
for idx, val in enumerate(arr):
arr[idx] = int(val)
b = 15
i = 0
while i < n:
if arr[i] > b:
print(b)
break
else:
b = arr[i] + 15
if i == (n - 1):
if b >= 90:
print(90)
break
else:
print(b)
break
if b < arr[i+1] or b >= 90:
if b >= 90:
print(90)
break
print(b)
break
else:
i = i + 1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t[90];
bool ans = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t[i];
}
if (t[0] > 15) {
cout << 15;
ans = true;
}
for (int i = 0; i < n - 1 && ans == false; i++) {
t[i] += 15;
if (t[i] < t[i + 1]) {
cout << t[i];
ans = true;
}
}
t[n - 1] += 15;
if (t[n - 1] >= 90 && ans == false) {
cout << 90;
}
if (t[n - 1] < 90 && ans == false) {
cout << t[n - 1];
}
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int n, i, time = 0;
scanf("%d", &n);
int arr[n];
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
arr[i] = 90;
if (arr[0] > 15) {
time = 15;
printf("\n%d", time);
} else {
time = arr[0];
for (i = 0; i < n; i++) {
if ((arr[i + 1] - arr[i]) > 15) {
time = time + 15;
break;
} else {
time = time + arr[i + 1] - arr[i];
}
}
printf("\n%d", time);
}
}
| 7 | CPP |
n = int(input())
t = list(map(int, input().split()))
a = 15
for i in range(n):
if a<t[i]:
break
else:
a=t[i]+15
if a>=90:
print(90)
else:
print(a) | 7 | PYTHON3 |
n = int(input())
last = 0
for t in (int(x) for x in input().split()):
if t-last > 15:
break
last = t
print(min(last+15, 90))
| 7 | PYTHON3 |
def main():
n = int(input())
t = [int(i) for i in input().strip().split()]
t.insert(0, 0)
t.append(90)
n += 2
for i in range(0, n - 1):
if t[i] + 15 < t[i + 1]:
print(t[i] + 15)
return
print(90)
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void solve() {}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, cnt = 0, i;
cin >> n;
vector<int> t(90, 0);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
t[x] = 1;
}
for (i = 1; i <= 90; i++) {
if (t[i])
cnt = 0;
else {
cnt++;
}
if (cnt >= 15) break;
}
cout << min(i, 90) << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
string sto(int n) {
string s = "";
if (n >= 1000) {
s += (n / 1000) + '0';
n %= 1000;
}
if (n >= 100) {
s += (n / 100) + '0';
n %= 100;
}
if (n >= 10) {
s += (n / 10) + '0';
n %= 10;
}
s += n + '0';
return s;
}
double des(long long x, long long y, long long x1, long long y1) {
long long xx = abs(x - x1);
long long yy = abs(y - y1);
xx = xx * xx;
yy = yy * yy;
return (sqrt(xx + yy));
}
int main() {
long long n, ans, x;
int m[92];
while (cin >> n) {
ans = 0;
for (int i = 1; i <= 90; i++) m[i] = 0;
for (int i = 1; i <= n; i++) {
cin >> x;
m[x] = 1;
}
int c = 15;
int j = 1;
while (c--) {
if (m[j] == 1) c = 15;
if (j == 90) {
ans++;
break;
}
j++;
ans++;
}
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
cout << n << endl;
return 0;
}
int cur1 = 0, cur2;
for (int i = 0; i < n; ++i) {
cur2 = cur1;
cin >> cur1;
if (cur1 - cur2 > 15) {
cout << min(cur2 + 15, 90) << endl;
return 0;
}
}
cout << min(cur1 + 15, 90) << endl;
return 0;
}
| 7 | CPP |
n=int(input())
a=[int(i) for i in input().split()]
ch=0
for f in a:
if f-ch>15:
break
else:
ch=f
if ch>=90-15:
ch=90
else:
ch+=15
print(ch)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, num, ans = 15;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> num;
if (num <= ans) ans = num + 15;
}
cout << min(ans, 90) << '\n';
}
| 7 | CPP |
n = int (input());
min = [int(i) for i in input().split()];
time = 0;
index = 0;
for i in min:
if time + 15 >= i:
time = i;
else:
time += 15;
break;
index += 1;
if index == n:
time += 15;
if time > 90:
time = 90;
print (time); | 7 | PYTHON3 |
n = int(input())
x = list(map(int, input().split()))
x.insert(0, 0)
for i in range(1, len(x)):
if x[i] - x[i - 1] > 15:
print(x[i - 1] + 15)
break
elif i == len(x) - 1:
print(min(x[i] + 15, 90))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
void test_case() {
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
int l = 0;
for (int i = 0; i < n; i++) {
if (abs(l - a[i]) > 15) {
cout << l + 15;
return;
}
l = a[i];
}
if (l > 75)
cout << 90;
else
cout << l + 15;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
while (t--) test_case();
}
| 7 | CPP |
if __name__ == '__main__':
n = int(input())
line = map(int, input().split())
rest = 0
for it in line:
if rest + 15 < it:
break
else:
rest = it
print(min(rest + 15, 90))
| 7 | PYTHON3 |
def will_watch_minutes(minutes_list: list) -> int:
if minutes_list[0] > 15:
return 15
will_watch_minutes = minutes_list[0]
for i in range(len(minutes_list) - 1):
amount = (minutes_list[i + 1] - minutes_list[i])
if amount <= 15:
will_watch_minutes += amount
else:
will_watch_minutes += 15
break
if i + 1 == len(minutes_list) - 1:
final_minutes = 90 - minutes_list[i+1]
if final_minutes <= 15:
will_watch_minutes += final_minutes
else:
will_watch_minutes += 15
return will_watch_minutes + (15 if len(minutes_list) == 1 else 0)
num_interesting_minutes = input()
minutes_list = [int(i) for i in input().split()]
print(will_watch_minutes(minutes_list)) | 7 | PYTHON3 |
n = int(input())
l = [int(x) for x in input().split()]
l.insert(0,0)
l.append(90)
flag = 0
for i in range(len(l)-1):
if l[i+1] - l[i] > 15 :
print(l[i]+15)
flag = 1
break
if flag == 0:
print(90) | 7 | PYTHON3 |
# 673A
# θ(n) time
# θ(n) space
__author__ = 'artyom'
# SOLUTION
def main():
n = read()
a = [0] + read(3) + [91]
for i in range(n + 1):
if a[i + 1] - a[i] > 15:
return a[i] + 15
return 90
# HELPERS
def read(mode=1, size=None):
# 0: String
# 1: Integer
# 2: List of strings
# 3: List of integers
# 4: Matrix of integers
if mode == 0: return input().strip()
if mode == 1: return int(input().strip())
if mode == 2: return input().strip().split()
if mode == 3: return list(map(int, input().strip().split()))
a = []
for _ in range(size):
a.append(read(3))
return a
def write(s="\n"):
if s is None: s = ''
if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))
s = str(s)
print(s, end="\n")
write(main()) | 7 | PYTHON3 |
n = int(input())
lst = list(map(int, input().split()))
ans = 0
cnt = 0
if n == 1:
if lst[0] > 15:
ans = 15
else:
ans = lst[0] + 15
else:
for i in range(0, len(lst)-1):
if lst[0] > 15:
ans = 15
break
else:
dura = lst[i+1] - lst[i]
#print(dura)
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)
else:
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int a[100005];
bool vis[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
vis[a[i]] = 1;
}
int now = 15;
for (int i = 1; i <= 90; i++) {
if (vis[i])
now = 15;
else
now--;
if (now == 0) {
cout << i << "\n";
return 0;
}
}
cout << "90\n";
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100], sum = 0, k = 15;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (i == 1) {
if (a[i] <= 15)
sum += a[i];
else {
cout << 15;
return 0;
}
} else {
if (a[i] - sum <= 15)
sum = a[i];
else {
cout << a[i - 1] + 15;
return 0;
}
}
}
sum += 15;
if (sum >= 90)
cout << 90;
else
cout << sum;
return 0;
}
| 7 | CPP |
n = int(input())
g = list(map(int, input().split()))
t = 0
g.append(90)
if g[0] <= 15:
t = g[0]
for i in range(1, n):
if g[i] - g[i - 1] <= 15:
t = g[i]
else:
break
else:
t = 0
t = min(t + 15, 90)
print(t) | 7 | PYTHON3 |
TIME_TO_SLEEP = 15
number_of_interesting_moments = int(input())
intersting_moments = list(map(int, input().split()))
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 |
#nhap du lieu vao, tao bien time = 0, t = 15, them vao vi tri a[0] so 0
#dung vong for duyet tu vi tri 1 den n+1 trong mang, if a[i] - a[i-1] < 15 thi time += a[i] -a[i-1], else thi time += t va print(time) sau do exit.
#tiep den la nhung truong hop khong nam trong vong for, if 90 - a[n] <= 15 thi time += 90 - a[n] else thi time += 15, sau do print(time)
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())
a=[int(x) for x in input().split()]
rez=0
for e in range(n):
if a[e]-rez<=15:
if e==0:
rez+=a[e]
else:
rez+=a[e]-rez
if 90-rez<=15:
print(90)
else:
print(rez+15) | 7 | PYTHON3 |
n = int(input())+1
t = [int (x) for x in input().split()]
t.append(90)
res = 0
if(t[0]>15):
res = 15
else:
for x in range(1, n):
if(t[x] - t[x-1] > 15):
res = t[x-1] + 15
break
if(res == 0):
print(90)
else:
print(res) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
ans=0
flag=0
ind=0
if a[0]>15:
ans=15
print(ans)
else:
for i in range(1,n):
if a[i]-a[i-1]>15:
ind=i-1
flag=1
break
if flag==1:
ans=a[ind]+15
else:
ans=a[n-1]+15
if ans>90:
print(90)
else:
print(ans)
| 7 | PYTHON3 |
from sys import stdin
from sys import stdout
sprint = stdout.write
sinput = stdin.readline
#[int(x) for x in sinput().split()]
#int(sinput())
def func():
sprint("F")
if __name__ == "__main__":
n = int(sinput())
t = [int(x) for x in sinput().split()]
t.append(90)
t_0 = 0
while len(t) != 0:
if t[0]-t_0 > 15:
t_0 += 15
break
else:
t_0 += t[0]-t_0
t.pop(0)
print(min(t_0,90))
| 7 | PYTHON3 |
n = input()
minutes = list(map(int,input().split()))
total_time = 0
mark = 0
for i in minutes:
watching = min(i-mark,15)
total_time += watching
if i-mark>=16:
break
mark = i
if mark == minutes[-1]:
total_time += min(90-minutes[-1],15)
print(total_time) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n, i, j;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
if (n == 1) {
if (a[0] < 16)
printf("%d\n", a[0] + 15);
else
printf("15\n");
} else {
int c = 0, b[n];
for (i = 0; i < n; i++) {
b[i] = a[i] - c;
c = a[i];
}
int d = n - 1;
for (i = 0; i < n; i++) {
if (b[i] > 15) {
d = i - 1;
break;
}
}
if (d >= 0) {
if (a[d] + 15 <= 90)
printf("%d\n", a[d] + 15);
else
printf("90\n");
} else
printf("15\n");
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, p = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> m;
if (m - p > 15 && p + 15 <= 90) {
cout << p + 15 << endl;
return 0;
}
p = m;
}
if (p < 75) {
cout << p + 15 << endl;
return 0;
}
cout << 90 << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v, v1, v2, v3;
vector<pair<long long int, long long int> > vec;
vector<long long int> adj[200005];
map<long long int, long long int> Mp;
set<long long int> st, st1;
queue<long long int> Q;
stack<long long int> Stk;
multiset<pair<long long int, long long int> > S;
long long int t, T, n, m, a, b, q;
string s;
void Reset() {}
void Input() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
v.push_back(a);
}
}
void Calculation() {
sort(v.begin(), v.end());
long long int cnt = 1, j = 0, sum = 0;
for (int i = 1; i <= 90; i++) {
if (cnt > 15) {
break;
} else {
sum++;
}
if (v[j] == i) {
j++;
cnt = 1;
} else {
cnt++;
}
}
cout << sum << endl;
}
void solve() {
Reset();
Input();
Calculation();
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
t = 1;
while (t--) {
T++;
solve();
}
return 0;
}
| 7 | CPP |
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 |
x = int(input())
y = list(map(int, input().split(' ')))
offset = 0
watched = 0
base = 15
for t in y:
duration = t - offset
if duration <= base:
total = offset + duration + base
watched = total if total < 90 else 90
else:
watched = offset + base
break
offset = t
print(watched) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int n, a, b;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &b);
if (b - a > 15) {
printf("%d\n", a + 15);
return 0;
}
a = b;
}
if (b + 15 > 90)
b = 90;
else
b += 15;
printf("%d\n", b);
}
| 7 | CPP |
#!/usr/bin/python3
n = input()
v = list(map(int, input().split()))
v = v[::-1]
v.append(0)
v = v[::-1]
v.append(91)
sol = 90
for i in range(0, len(v)-1):
if v[i] + 15 < v[i+1]:
sol = v[i]+15
break
sol = min(sol, 90)
print(sol)
| 7 | PYTHON3 |
n = int(input())
a = [int(k) for k in input().split()]
st = 15
m = 0
for i in range(n):
if a[i] <= st:
st = a[i] + 15
if st <= 90:
print(st)
else:
print(90)
| 7 | PYTHON3 |
n = int(input())
T = [0]+list(map(int, input().split()))+[90]
ok = 1
for i in range(1,n+2):
if T[i]-T[i-1]>15:
print(T[i-1]+15)
ok = 0
break
if ok:
print(90)
| 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
prev = 0
for i in l :
if i - prev > 15 :
break
prev = i
print(min(90 , prev + 15))
| 7 | PYTHON3 |
n = int(input())
a = list(map(int,input().split()))
ans = 15 if a[0] > 15 else 0
if ans != 15:
for i in range(1, n):
if a[i] - a[i-1] > 15 :
ans = a[i-1] + 15
break;
if 90 - a[n-1] > 15 and ans == 0: ans = a[n-1]+15
if ans == 0: ans = 90
print(ans) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
p=0
c=0
for i in range(n) :
if p+15<l[i] :
p=p+15
break
else :
p=l[i]
if i==n-1 :
c=1
if c==1 :
p=p+15
if p>90 :
p=90
print(p)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, i, pre = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> t;
if (t - pre - 1 >= 15) {
cout << pre + 15 << "\n";
return 0;
}
pre = t;
}
if (90 - pre > 15)
cout << pre + 15 << "\n";
else
cout << 90 << "\n";
}
| 7 | CPP |
#import sys
#sys.stdin = open('D:/code/ALgo_math/Bear and Game/INP.txt', 'r')
def time_boring(n, T):
ttime = 0
for i in range(n):
if (T[i] - ttime) > 15:
return ttime + 15
else:
ttime = T[i]
if ( ttime + 15 ) > 90:
return 90
return ttime + 15
n = int(input())
T = list(map(int, input().split()))
print(time_boring(n,T))
| 7 | PYTHON3 |
n = int(input())
b = list(map(int, input().split()))
a = [False] * 107
for x in b:
a[x] = True
s = 1
no = 1
if(a[1]):
no = 0
loop = True
while(s <= 90 and loop):
s += 1
if(a[s]):
no = 0
else:
no += 1
if(no >= 15):
break
print(min(s, 90)) | 7 | PYTHON3 |
from sys import stdin
n = int(input())
arr = list( map(int, stdin.readline().split()) )
arr.sort()
lst = 0
flag = True
for x in arr:
if( x-lst > 15 ):
lst += 15
flag = False
break
lst = x
if( flag ):
lst = min( 90, lst+15 )
print(lst) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, arr[100];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", arr + i);
sort(arr, arr + n);
int t = 15;
for (int i = 0; i < n; i++) {
if (arr[i] > t) break;
t = max(t, arr[i] + 15);
}
printf("%d\n", min(t, 90));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream in("input.txt");
ofstream out("output.txt");
int n, k, t[100], a;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &t[i]);
if (t[1] > 15) {
printf("%d\n", 15);
return 0;
}
for (int i = 2; i <= 75; i++) {
if (t[i] - t[i - 1] > 15) {
printf("%d\n", t[i - 1] + 15);
return 0;
}
if (t[i] >= 75) break;
}
printf("%d\n", 90);
in.close();
out.close();
return 0;
}
| 7 | CPP |
def calc_mins(_t, _n):
if _t[0] > 15:
return 15
for i in range(1, _n):
if _t[i] - _t[i - 1] > 15:
return t[i - 1] + 15
if 90 - _t[_n - 1] > 15:
return _t[n - 1] + 15
return 90
n = int(input())
t = list(map(int, input().split()))
print(calc_mins(t, n))
| 7 | PYTHON3 |
#!/usr/bin/python3
from itertools import *
from collections import Counter
from operator import *
from functools import reduce
import re
import math
from pprint import pprint
from fractions import gcd
def sqr(x):
return x*x
def inputarray(func=int):
return [func(elem) for elem in input().split()]
# --------------------------------------
# --------------------------------------
N = int(input())
A = sorted(list(set(range(1, 91)) - set(inputarray())))
k = 0
p = 0
for i in A:
if i == p + 1:
k += 1
else:
k = 1
p = i
if k == 15:
print(i)
quit()
print(90)
| 7 | PYTHON3 |
input();s=0
for i in map(int,input().split()):
if i-s>15:break
else:s=i
print([s+15,90][(s+15)>90]) | 7 | PYTHON3 |
n = int(input())
l = list(map(int,input().split()))
count= 0
for i in l :
if i - count > 15 :
break
count = i
print(min(90 , count + 15))
| 7 | PYTHON3 |
read = lambda: map(int, input().split())
n = int(input())
t = list(read())
ans = 15
for i in range(n):
if t[i] > ans:
break
ans = t[i] + 15
ans = min(ans, 90)
print(ans)
| 7 | PYTHON3 |
n=int(input())
t=list(map(int,input().split()))
flag=0
if t[0]>15:
flag=1
print(15)
elif len(t)==1 and t[0]<=15:
flag=1
print(t[0]+15)
else:
for i in range(1,n):
if t[i]-t[i-1]>15:
flag=1
print(t[i-1]+15)
break
if flag==0:
print(min(90,t[-1]+15)) | 7 | PYTHON3 |
n = int(input())
t = list(map(int, input().split()))
if(n==1 or t[0]>15):
if(t[0] > 15):
print(15)
else:
print(t[0]+15)
else:
watchtime = 0
for i in range(1,n):
if(t[i]-t[i-1] >15):
watchtime=t[i-1]+15
break
if watchtime == 0:
watchtime = t[-1]+15
if watchtime > 90:
print(90)
else:
print(watchtime)
| 7 | PYTHON3 |
n=int(input())
a=[0]
f=1
a=a+(list(map(int,input().split())))
a=a+[90]
for i in range (n+1):
if a[i+1]-a[i]>15:
print(a[i]+15)
f=0
break
if f==1:
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, t, ans, res, sum, mn = 1e9, cnt, mx, k, z, mnn = 1e9, mxx,
b = 1, i;
string s1, s3, s2, s;
set<long long> st;
pair<long long, long long> p[1000001];
vector<int> v, v1, v3, v4, v2;
map<char, long long> mp, mpp;
char c, d, e, a;
bool tr = false, fl = false;
int used[10001];
int main() {
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
if (n == 1) {
if (a[0] <= 15) {
cout << a[0] + 15;
return 0;
} else {
cout << 15;
return 0;
}
} else if (a[0] > 15) {
cout << 15;
return 0;
} else {
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] - a[i] > 15) {
sum = a[i] + 15;
break;
}
}
if (sum == 0 and 90 - a[n - 1] > 15) {
cout << a[n - 1] + 15;
return 0;
}
if (sum == 0)
cout << 90;
else
cout << sum;
}
}
| 7 | CPP |
n = int(input())
m = list(map(int,input().split()))
if len(m)==1:
if m[0] > 15 :
print(15)
else:
print(m[0]+15)
for i in range(n-1):
if m[0]>15:
print(15)
break
elif m[i]+15 < m[i+1]:
print(m[i]+15)
break
elif i==n-2 and m[n-1] <= 74:
print(m[n-1]+15)
break
elif i==n-2 and m[n-1] > 74:
print(90)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N;
int T[100];
void Main() {
scanf("%d", &N);
for (int i = 0; i < (N); i++) scanf("%d", T + i);
sort(T, T + N);
int la = 0;
for (int i = 0; i < (N); i++) {
int t = T[i];
if (t - la > 15) {
(void)printf("%d\n", la + 15);
return;
}
la = t;
}
if (la + 15 < 90) {
(void)printf("%d\n", la + 15);
} else {
puts("90");
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Main();
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
int main() {
int N, a, b = 0, f = 0;
scanf("%d", &N);
while (N--) {
scanf("%d", &a);
if (a - b > 15) {
f = 1;
break;
} else {
b = a;
}
}
if (b >= 75)
printf("90");
else
printf("%d", b + 15);
}
| 7 | CPP |
n = int(input())
a = list(map(int, input().split()))
if a[0] > 15:
t = 15
elif n == 1:
t = a[0] + 15
else:
for i in range(n):
if i == n - 1:
if a[i] + 15 > 90:
t = 90
else:
t = a[i] + 15
elif a[i + 1] - a[i] > 15:
t = a[i]+15
break
print(t) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int l = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x - l > 15) {
cout << l + 15;
return 0;
}
l = x;
}
if (l > 75)
cout << 90;
else
cout << l + 15;
return 0;
}
| 7 | CPP |
# http://codeforces.com/problemset/problem/673/A?fbclid=IwAR3ndneMJwCqpj4yUXBpW4RfF__5v3mu6WgA01XSk_h70FDCkkS-Y8Udh_E
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>
using namespace std;
int main() {
int n, t, x(0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> t;
if (t - x <= 15) x = t;
}
if (x + 15 <= 90)
cout << x + 15;
else
cout << 90;
return 0;
}
| 7 | CPP |
n = input()
m = str(input()).split()
for i,s in enumerate (m):
if i==0:
if int(s)>15:
k = 15
break
elif len(m)>=2:
if (int (m[i+1])-int(s))>15:
k = int(s)+15
break
else:
k = int(s)+15
break
else:
if i<(len(m)-1):
if (int (m[i+1])-int(s))>15:
k = int(s)+15
break
elif i == (len(m)-1):
if int(s)+15>=90:
k = 90
else:
k = int(s)+15
print (k) | 7 | PYTHON3 |
def p3():
#A. Bear and Game
n = int(input())
l = [int(i) for i in input().split()]
i = 0
t = 0
f = 1
while t < 90 and f == 1 and i < n:
t = t+15
if l[i] > t:
f = 0
else:
t = l[i]
i = i+1
if f == 1:
t = t+15
print(min(90,t))
p3()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, arr[100005], b, c, d, i, j, k, l, m, f = 1;
cin >> n;
for (i = 1; i <= n; i++) cin >> arr[i];
if (n == 1) {
if (arr[1] > 15) {
cout << 15 << endl;
return 0;
} else if (arr[1] + 15 >= 90) {
cout << 90 << endl;
return 0;
} else {
cout << (arr[1] + 15) << endl;
return 0;
}
}
arr[0] = 0;
for (i = 0; i <= n; i++) {
if (arr[i] - arr[i - 1] > 15) {
f = 0;
break;
}
}
if (f) {
if (arr[n] + 15 >= 90)
cout << 90 << endl;
else
cout << arr[n] + 15 << endl;
return 0;
}
for (i = 0; i <= n; i++) {
if (arr[i] - arr[i - 1] > 15) {
cout << arr[i - 1] + 15 << endl;
break;
}
}
return 0;
}
| 7 | CPP |
# ý 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:
if a[i] > 15:
ans = 15
break;
else:
if a[i]- a[i-1] > 15:
ans = a[i-1]+15
break;
if a[i]- a[i-1] <= 15:
ans = a[i]
return ans
moment.append(90)
print (stupid_bear(moment))
| 7 | PYTHON3 |
n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
if a[i]>c+15:
break
else:
c=a[i]
c+=15
if c>90:
c=90
print(c) | 7 | PYTHON3 |
def game_watched(interesting_list,n):
time = 0
for i in range(n):
if interesting_list[i+1] - 15 <= interesting_list[i]:
time = interesting_list[i + 1]
else:
break
return time + 15
n = int(input())
lista = [0]
input_list = list(map(int,input().split()))
lista = lista + input_list
time = game_watched(lista,n)
if time > 90:
print(90)
else:
print(time)
| 7 | PYTHON3 |
#Codeforce 673A
n = int(input())
list1=[0] + [int(v) for v in input().split()] + [1000]
ans=0
for i in range(1,n+2):
if list1[i] - list1[i-1] <= 15:
ans = list1[i]
else:
print(min(ans+15,90))
break | 7 | PYTHON3 |
b = int(input()) +1
inn = list(map(int,input().split(" ")))
inn.append(90)
def ff():
if(inn[0]>15):
return 15
for a in range(1,b):
if (inn[a] - inn[a-1]) >15:
return(inn[a-1] + 15)
return(90)
print(ff())
| 7 | PYTHON3 |
n = int(input())
l = input().split()
l.insert(0, 0)
l.append(90)
rs = 90
for i in range(1, n + 2):
if int(l[i]) - int(l[i-1]) > 15:
rs = int(l[i-1]) + 15
break
print(rs)
| 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
l.append(90)
l.insert(0,0)
min=0
for i in range(n+1):
if l[i+1]-l[i]>15:
min+=15
break
else:
min=l[i+1]
print(min) | 7 | PYTHON3 |
def main():
n=int(input())
arr=input().split(' ')
result=0
time=0
for i in range(n):
time=int(arr[i])-time
result+=min((time,15))
if time>15:
break
if i==n-1:
result+=min((90-int(arr[n-1]),15))
time=int(arr[i])
print(result)
if __name__ == "__main__":
main() | 7 | PYTHON3 |
def main():
n = int(input())
m = list(map(int, input().split()))
res = 0
count = 0
for i in range(1, 91):
if count == 15:
return res
break
res += 1
count += 1
if i in m:
count = 0
return res
print(main()) | 7 | PYTHON3 |
mins_count = int(input())
mins_string = str(input())
mins_array = mins_string.split(" ")
mins_array.append(90)
count=0
while count<=mins_count-1:
if count == 0 and int(mins_array[count]) - 0 > 15:
print('15')
break
elif int(mins_array[count+1]) - int(mins_array[count]) > 15:
print(str(int(mins_array[count])+15))
break
elif count == mins_count-1:
print('90')
count+=1 | 7 | PYTHON3 |
numberOfMoment = input()
listOfMoment = input().split()
sleepAt = 0
for index, moment in enumerate(listOfMoment):
if int(moment) - sleepAt > 15:
sleepAt += 15
break
else:
sleepAt = int(moment)
if index == len(listOfMoment) -1:
sleepAt = min(sleepAt + 15, 90)
print(sleepAt) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, A[1001] = {0}, k, res = 0, cnt = 0;
cin >> n;
for (i = 1; i <= n; i++) {
cin >> k;
A[k] = 1;
}
for (i = 1; i <= 90; i++) {
if (A[i] == 0) {
cnt++;
} else {
cnt = 0;
}
res = i;
if (cnt == 15) {
break;
}
}
cout << res << endl;
return 0;
}
| 7 | CPP |
n = int(input())
x=list(map(int,input().split()))
temp=0
if n==1 and x[0]<=15:
print(x[0]+15)
else:
for i in range(n):
if (x[i]-temp)>15:
print(temp+15)
break
temp=x[i]
else:
print(x[i]+15 if (x[i]+15)<90 else 90) | 7 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
l.insert(0,0)
c=0
for i in range(n):
if l[i+1]<=(l[i]+15):
continue
elif l[i+1]>(l[i]+15):
if (l[i]+15)<=90:
c+=1
print(l[i]+15)
break
if c==0:
if l[-1]+15<=90:
print(l[-1]+15)
else:
print("90") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t, p = 0, k = 0;
cin >> n;
for (int i = 0; i <= n; i++) {
if (i < n)
cin >> t;
else
t = 90;
if (t - p > 15 && k == 0) {
k = p + 15;
} else
p = t;
}
if (k == 0) k = p;
cout << k;
return 0;
}
| 7 | CPP |
n = int(input())
arr = list(map(int, input().split()))
cnt = 0
i = 1
t = 0
while i <= 90:
if t < n and arr[t] == i:
t += 1
cnt = 0
else:
cnt += 1
if cnt == 15:
print(i)
break
i += 1
else:
print(90) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[100];
int main() {
int n, x;
cin >> n;
for (int i = 0; i < n; ++i) cin >> x, a[x] = 1;
int res = 0, total = 0;
for (int i = 1; i <= 90; ++i) {
if (a[i] == 1)
total++, res = 0;
else
res++, total++;
if (res >= 15) {
cout << total << endl;
return 0;
}
}
cout << total << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, t, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &t);
if (t - ans > 15) break;
ans = t;
}
if (ans + 15 >= 90)
ans = 90;
else
ans += 15;
printf("%d\n", ans);
return 0;
}
| 7 | CPP |
# Input
n = int(input())
minute = list(map(int,input().rstrip().split()))
sum = 0
# Print 15 if the first interesting mintute > 15
if minute[0] > 15:
sum = 15
# Else, calculate the sum and break when range between 2 interesting minute >15
else:
minute.insert(0,0)
for i in range(len(minute)-1):
if minute[i+1] - minute[i] <= 15:
sum += minute[i+1] - minute[i]
else: break
if sum <75:
sum +=15
else: sum = 90
print(sum)
| 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) | 7 | PYTHON3 |
n=int(input())
l=[]
l.extend(map(int,input().split()))
x=0
for i in l:
if x+15>=i:
x=i
else:
break
print(min(90,x+15)) | 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.