buggy stringlengths 1 618k | fixed stringlengths 16 618k | buggy_submission_id stringlengths 10 10 | fixed_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | lang stringclasses 1
value | buggy_verdict stringclasses 2
values |
|---|---|---|---|---|---|---|
import itertools
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
AB = [a + b for (a, b) in list(itertools.product(A, B))]
AB = sorted(AB)[::-1]
ans = [ab + c for (ab, c) in list(itertools.product(AB[:3000], C))]
... | import itertools
X, Y, Z, K = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
AB = [a + b for (a, b) in list(itertools.product(A, B))]
AB.sort(reverse=True)
ans = [ab + c for (ab, c) in list(itertools.product(AB[:min(3000, X*... | s547374040 | s328919151 | p03078 | python | Time Limit Exceeded |
S = input()
N = len(S)
alp = 'ACGT'
cnt = []
for i in range(0, N):
for j in range(i, N+1):
tmp = S[i:j]
flg = 0
for a in alp:
if a in tmp:
flg = 1
if flg:
cnt.append(len(tmp))
print(max(cnt))
| S = input()
N = len(S)
alp = 'BDEFHIJKLMNOPQRSUVWXYZ'
ans = []
cnt = []
for i in range(0, N):
for j in range(i, N+1):
tmp = S[i:j]
flg = 1
for a in alp:
if a in tmp:
flg = 0
if flg:
cnt.append(len(tmp))
print(max(cnt))
| s383403391 | s087246261 | p03086 | python | Runtime Error |
N, Q = list(map(int, input().split()))
S = input()
A = [list(map(int, input().split())) for i in range(Q)]
flg = []
for i in range(N-2):
tmp_S = S[i:i+2]
if tmp_S == 'AC':
flg.append(1)
else:
flg.append(0)
for a in A:
tmp_f = flg[a[0]-1:a[1]-1]
print(sum(tmp_f))
| from itertools import accumulate
N, Q = list(map(int, input().split()))
S = input()
A = [list(map(int, input().split())) for i in range(Q)]
flg = []
for i in range(N-1):
tmp_S = S[i:i+2]
if tmp_S == 'AC':
flg.append(1)
else:
flg.append(0)
# print(flg)
flg2 = [0] + flg
flg2 = list(accumul... | s624417332 | s702941009 | p03087 | python | Time Limit Exceeded |
N, Q = list(map(int, input().split()))
S = input()
A = [list(map(int, input().split())) for i in range(Q)]
for a in A:
tmp = S[a[0]-1:a[1]]
print(tmp.count('AC'))
| from itertools import accumulate
N, Q = list(map(int, input().split()))
S = input()
A = [list(map(int, input().split())) for i in range(Q)]
flg = []
for i in range(N-1):
tmp_S = S[i:i+2]
if tmp_S == 'AC':
flg.append(1)
else:
flg.append(0)
# print(flg)
flg2 = [0] + flg
flg2 = list(accumul... | s689570238 | s702941009 | p03087 | python | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
long long N, ans, M, cnt[26];
char S;
int main() {
M = 1e9 + 7;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S;
cnt[S - 'a']++;
}
ans = 1;
for (int i = 0; i < 26; i++) {
ans *= (cnt[i] + 1);
ans %= M;
}
cout << ans - 1 << '\n';
retu... | N = int(input())
S = input()
M = 10**9 + 7
cnt = [0] * 26
for i in range(N):
cnt[ord(S[i]) - ord('a')] += 1
ans = 1
for i in range(26):
ans *= (cnt[i] + 1)
ans %= M
print(ans - 1) | s284080603 | s597947504 | p03095 | python | Runtime Error |
import itertools
N = int(input())
S = input()
ptn = [i for i in range(N)]
cnt = 0
for i in range(1, N+1):
c = list(itertools.combinations(ptn, i))
for v in c:
tmp = ''
for _ in v:
tmp += S[_]
if (len(tmp) == len(set(tmp))):
cnt += 1
print(cnt)
| N = int(input())
S = input()
M = 10**9 + 7
cnt = [0] * 26
for i in range(N):
cnt[ord(S[i]) - ord('a')] += 1
ans = 1
for i in range(26):
ans *= (cnt[i] + 1)
ans %= M
print(ans - 1) | s251694000 | s597947504 | p03095 | python | Time Limit Exceeded |
import itertools
N = int(input())
S = input()
ptn = [i for i in range(N)]
ans = []
for i in range(1, N+1):
c = list(itertools.combinations(ptn, i))
for v in c:
tmp = ''
for _ in v:
tmp += S[_]
ans.append(tmp)
cnt = 0
for _ in (ans):
if (len(_) == len(set(_))):
... | N = int(input())
S = input()
M = 10**9 + 7
cnt = [0] * 26
for i in range(N):
cnt[ord(S[i]) - ord('a')] += 1
ans = 1
for i in range(26):
ans *= (cnt[i] + 1)
ans %= M
print(ans - 1) | s005719238 | s597947504 | p03095 | python | Time Limit Exceeded |
from functools import reduce
from operator import xor
A, B = list(map(int, input().split()))
def main():
val = []
for i in range(A, B+1):
val.append(i)
ans = reduce(xor, val)
return ans
print(main())
| A, B = list(map(int, input().split()))
def get(x):
return [x, 1, x + 1, 0][x % 4]
def main():
return get(B) ^ get(A - 1)
print(main())
| s443314218 | s526307239 | p03104 | python | Time Limit Exceeded |
class UnionFindTree():
def __init__(self, N):
self.parent = [-1]*(N+1)
self.size = [1]*(N+1)
self.hubensa = N*(N-1)//2
def find(self, i):
if self.parent[i] == -1:
group = i
else:
group = self.find(self.parent[i])
self.parent[i] = gr... | class UnionFindTree():
def __init__(self, N):
self.parent = [-1]*(N+1)
self.rank = [1]*(N+1)
self.size = [1]*(N+1)
self.hubensa = N*(N-1)//2
def find(self, i):
if self.parent[i] == -1:
group = i
else:
group = self.find(self.parent[i])
... | s123791548 | s529718697 | p03108 | python | Runtime Error |
import itertools
import numpy as np
import copy
ansl = []
N, A, B, C = list(map(int, input().split()))
a = []
for i in range(N):
a.append(int(input()))
def get_ptn(la):
ptn = []
for i in range(1, len(la) + 1):
ptn.append(list(itertools.combinations(la, i)))
return ptn
takes = list(itertools... | import itertools
import numpy as np
import copy
ansl = []
N, A, B, C = list(map(int, input().split()))
a = []
for i in range(N):
a.append(int(input()))
def get_ptn(la):
ptn = []
for i in range(1, len(la) + 1):
ptn.append(list(itertools.combinations(la, i)))
return ptn
takes = list(itertools... | s718611897 | s335848215 | p03111 | python | Runtime Error |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N == 1:
ans = max(X) - min(X)
print(ans)
exit()
if M == 1:
ans = 0
print(ans)
exit()
Xs = sorted(X)
diff = []
for i in range(M - 1):
tmp = Xs[i + 1] - Xs[i]
diff.append(tmp)
rest = N - 2
for _ in range(res... | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N == 1:
ans = max(X) - min(X)
print(ans)
exit()
if ((M == 1) or (N >= M)):
ans = 0
print(ans)
exit()
Xs = sorted(X)
diff = []
for i in range(M - 1):
tmp = Xs[i + 1] - Xs[i]
diff.append(tmp)
diffs = sorted(... | s521885044 | s184992269 | p03137 | python | Runtime Error |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if M == 1:
ans = max(X) - min(X)
print(ans)
exit()
Xs = sorted(X)
diff = []
for i in range(M - 1):
tmp = Xs[i + 1] - Xs[i]
diff.append(tmp)
rest = N - 2
for _ in range(rest):
if diff[0] > diff[len(diff) - 1]:
... | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N == 1:
ans = max(X) - min(X)
print(ans)
exit()
if ((M == 1) or (N >= M)):
ans = 0
print(ans)
exit()
Xs = sorted(X)
diff = []
for i in range(M - 1):
tmp = Xs[i + 1] - Xs[i]
diff.append(tmp)
diffs = sorted(... | s735834804 | s184992269 | p03137 | python | Runtime Error |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def xor(n):
c = 0
for a in A:
c += (n^a)
return c
ans = []
for i in range(K + 1):
ans.append(xor(i))
print(max(ans))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
"""
方針 各桁を0にするか1にするかは独立に考えてよい
K = 10101 の時
0か1か好きに選べる桁をfとして
* X = 10101
* X = 10100
* X = 100ff
* X = 0ffff
を試し、最大になるものを選ぶ
2**39 < 10**12 < 2**40 なので40桁について考え
fのときどっちを選ぶとよいかを前計算しておく
"""
L = [0]*40 # (i桁目が1である数)
for i in range(N):
fo... | s891690903 | s070510421 | p03138 | python | Time Limit Exceeded |
S = input()
cnt = 0
for i in range(len(S)):
if (i != 0):
if S[i] == 'W':
for _ in range(i):
if S[_] == 'B':
cnt += 1
print(cnt) | S = input()
cnt = 0
cnt_B = 0
for i in range(len(S)):
if S[i] == 'W':
cnt += cnt_B
else:
cnt_B += 1
print(cnt) | s043963141 | s547601342 | p03200 | python | Time Limit Exceeded |
N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
h_sort = sorted(h)
aa = h_sort[1:]
bb = h_sort[:-1]
diff = [a - b for a, b in zip(aa, bb)]
ans = []
for i in range(len(diff) - (K - 2)):
tmp = 0
for j in range(K - 1):
tmp += diff[i + j]
ans.append(tmp)... | N,K = map(int,input().split())
h = []
for _ in range(N):
h.append(int(input()))
h.sort()
minimum = h[N - 1]- h[0]
for i in range(N - K + 1):
minimum = min(minimum, h[i + K - 1] - h[i])
print(minimum) | s013458771 | s901024473 | p03208 | python | Time Limit Exceeded |
import pandas as pd
N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
h_sort = sorted(h)
df = pd.DataFrame(h_sort)
df2 = df.diff()
df3 = df2.rolling(K - 1).sum()
df4 = df3.dropna(how='all')
print(int(min(df4[0]))) | N,K = map(int,input().split())
h = []
for _ in range(N):
h.append(int(input()))
h.sort()
minimum = h[N - 1]- h[0]
for i in range(N - K + 1):
minimum = min(minimum, h[i + K - 1] - h[i])
print(minimum) | s917286337 | s901024473 | p03208 | python | Runtime Error |
N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
h_sort = sorted(h)
h_sort_diff = []
for i in range(len(h_sort) - 1):
tmp = h_sort[i + 1] - h_sort[i]
h_sort_diff.append(tmp)
ans = []
for i in range(len(h_sort_diff) - (K - 2)):
tmp = 0
for j in range(K - 1)... | N,K = map(int,input().split())
h = []
for _ in range(N):
h.append(int(input()))
h.sort()
minimum = h[N - 1]- h[0]
for i in range(N - K + 1):
minimum = min(minimum, h[i + K - 1] - h[i])
print(minimum) | s243506234 | s901024473 | p03208 | python | Time Limit Exceeded |
N, K = list(map(int, input().split()))
h = []
for i in range(N):
h.append(int(input()))
h_sort = sorted(h)
h_sort_diff = []
for i in range(len(h_sort) - 1):
tmp = h_sort[i + 1] - h_sort[i]
h_sort_diff.append(tmp)
ans = []
for i in range(len(h_sort_diff) - 1):
tmp = 0
for j in range(K - 1):
... | N,K = map(int,input().split())
h = []
for _ in range(N):
h.append(int(input()))
h.sort()
minimum = h[N - 1]- h[0]
for i in range(N - K + 1):
minimum = min(minimum, h[i + K - 1] - h[i])
print(minimum) | s955496877 | s901024473 | p03208 | python | Runtime Error |
import fractions
N, M = list(map(int, input().split()))
S = input()
T = input()
def lcm(a, b):
return a * b // fractions.gcd (a, b)
ans = lcm(N, M)
i = 0
res = [0 for i in range(ans)]
for i in range(N):
tmp_s = int(ans/N) * i
res[tmp_s] = S[i]
for j in range(M):
tmp_t = int(ans/M) * j
if res[tmp_... | import fractions
def lcm(x, y):
return int((x * y) // fractions.gcd(x, y))
n, m = [int(i) for i in input().split()]
s = input()
t = input()
span = fractions.gcd(n, m)
for i in range(span):
if s[int(n/span)*i] != t[int(m/span)*i]:
print("-1")
exit()
print(lcm(n, m))
| s295917978 | s362818372 | p03231 | python | Time Limit Exceeded |
N, M = list(map(int, input().split()))
S = input()
T = input()
def gcd(x, y):
if y == 0:
return x
else:
return gcd(y, x%y)
def lcm(a, b):
return a * b // gcd (a, b)
ans = lcm(N, M)
i = 0
res = [0 for i in range(ans)]
for i in range(N):
tmp_s = int(ans/N) * i
res[tmp_s] = S[i]
for ... | import fractions
def lcm(x, y):
return int((x * y) // fractions.gcd(x, y))
n, m = [int(i) for i in input().split()]
s = input()
t = input()
span = fractions.gcd(n, m)
for i in range(span):
if s[int(n/span)*i] != t[int(m/span)*i]:
print("-1")
exit()
print(lcm(n, m))
| s997649334 | s362818372 | p03231 | python | Time Limit Exceeded |
N, M = list(map(int, input().split()))
S = input()
T = input()
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd (a, b)
ans = lcm(N, M)
i = 0
res = [0 for i in range(ans)]
for i in range(N):
tmp_s = int(ans/N) * i
res[tmp_s] = S[i]
for j in range(M):
tmp_t = int(... | import fractions
def lcm(x, y):
return int((x * y) // fractions.gcd(x, y))
n, m = [int(i) for i in input().split()]
s = input()
t = input()
span = fractions.gcd(n, m)
for i in range(span):
if s[int(n/span)*i] != t[int(m/span)*i]:
print("-1")
exit()
print(lcm(n, m))
| s136684045 | s362818372 | p03231 | python | Time Limit Exceeded |
N = int(input())
A = list(map(int, input().split()))
cnt = 0
for i in range(0, N):
for j in range(i + 1, N + 1):
if sum(A[i:j]) == 0:
cnt += 1
print(cnt)
| from collections import Counter
N = int(input())
A = list(map(int, input().split()))
S = [0]
for i, a in enumerate(A):
S.append(S[i] + a)
S = sorted(S)
a = Counter(S).most_common()
cnt = 0
for i in range(len(a)):
cnt += ((a[i][1]-1)*a[i][1])//2
print(cnt)
| s929726825 | s972325738 | p03363 | python | Time Limit Exceeded |
A, B, K = list(map(int, input().split()))
for i in range(A, B + 1):
if (i < A + K) or (i > B - K):
print(i) | A, B, K = list(map(int, input().split()))
x = []
for i in range(A, A + K):
if (i <= B):
x.append(i)
for i in range(B - K + 1, B + 1):
if (i >= A):
x.append(i)
y = set(x)
for i in range(len(y)):
print(sorted(list(y))[i]) | s827146857 | s485066689 | p03386 | python | Time Limit Exceeded |
s = input()
t = input()
s_dash = ''.join(sorted(s))
t_dash = ''.join(sorted(t)[::-1])
test = [s_dash, t_dash]
if s_dash == t_dash:
print("No")
else:
if sorted(test)[0] != s_dash:
print("No")
else:
print("Yes")
| import math
a, b = list(map(int, input().split()))
ans =math.ceil(((a + b) / 2))
print(ans) | s630905509 | s162512700 | p03485 | python | Runtime Error |
N = int(input())
def Lucas(n):
if n == 0:
return 2
elif n == 1:
return 1
else:
return Lucas(n - 2) + Lucas(n - 1)
print(Lucas(N)) | N = int(input())
Lucas = []
Lucas.append(2)
Lucas.append(1)
for i in range(2, 90):
Lucas.append(Lucas[i - 2] + Lucas[i - 1])
print(Lucas[N]) | s018801344 | s023127107 | p03544 | python | Time Limit Exceeded |
A, B = list(map(int, input().split()))
if A < B:
print("<")
elif A > B:
print(">")
else:
print("=") | A, B = input().split()
if A < B:
print("<")
elif A > B:
print(">")
else:
print("=") | s058089509 | s672686600 | p03547 | python | Runtime Error |
A, B, C = list(map(int, input().split()))
if A == B:
print(C)
elif A == C
print(B)
else:
print(A) | A, B, C = list(map(int, input().split()))
if A == B:
print(C)
elif A == C:
print(B)
else:
print(A) | s133738235 | s952389582 | p03573 | python | Runtime Error |
N = int(input())
a = list(map(int, input().split()))
X = sum(a)
b = [a[0]]
for i in range(1, N):
b.append(b[i-1] + a[i])
ans = []
for i in range(1, N):
ans.append(abs(X - 2*b[i]))
print(min(ans))
| A, B = list(map(int, input().split()))
if A*B*(A+B) %3 == 0:
print('Possible')
else:
print('Impossible')
| s760620082 | s667083074 | p03657 | python | Runtime Error |
N = int(input())
a = list(map(int, input().split()))
X = sum(a)
ans = []
for i in range(1, N):
ans.append(abs(X - 2*sum(a[:i])))
print(min(ans))
| N = int(input())
a = list(map(int, input().split()))
X = sum(a)
b = [a[0]]
for i in range(1, N - 1):
b.append(b[i-1] + a[i])
ans = []
for i in range(0, N - 1):
ans.append(abs(X - 2*b[i]))
print(min(ans))
| s083698158 | s223084316 | p03659 | python | Time Limit Exceeded |
N = int(input())
a = list(map(int, input().split()))
a = sorted(a)
X = sum(a)
ans = []
for i in range(1, N - 1):
ans.append(X - 2*sum(a[:i]))
print(min(ans))
| N = int(input())
a = list(map(int, input().split()))
X = sum(a)
b = [a[0]]
for i in range(1, N - 1):
b.append(b[i-1] + a[i])
ans = []
for i in range(0, N - 1):
ans.append(abs(X - 2*b[i]))
print(min(ans))
| s829310519 | s223084316 | p03659 | python | Runtime Error |
N = int(input())
A = [int(input()) for i in range(N)]
print(max(A) - min(A))
| N = int(input())
A = list(map(int, input().split()))
print(max(A) - min(A))
| s043066443 | s102152728 | p03694 | python | Runtime Error |
a, b, c = input().split()
if (a[-1] == B[0]) and (B[-1] == C[0]):
print("YES")
else:
print("NO")
| a, b, c = input().split()
if (a[-1] == b[0]) and (b[-1] == c[0]):
print("YES")
else:
print("NO") | s246682035 | s616608510 | p03729 | python | Runtime Error |
S = input()
N = len(S)
for s, i in enumerate(S):
if s == 'A':
a_index = i
break
for s, i in enumerate(S[::-1]):
if s == 'A':
z_index = i
break
print(N - z_index - a_index)
| S = input()
N = len(S)
for i, s in enumerate(S):
if s == 'A':
a_index = i
break
for i, s in enumerate(S[::-1]):
if s == 'Z':
z_index = i
break
print(N - z_index - a_index)
| s895900367 | s390631987 | p03814 | python | Runtime Error |
S = input()
N = len(S)
for i in range(N):
if S[i] == 'A':
a_index = i
break
for i in range(N):
if S[::-1][i] == 'Z':
z_index = i
break
print(N - z_index - a_index)
| S = input()
N = len(S)
for i, s in enumerate(S):
if s == 'A':
a_index = i
break
for i, s in enumerate(S[::-1]):
if s == 'Z':
z_index = i
break
print(N - z_index - a_index)
| s864629304 | s390631987 | p03814 | python | Time Limit Exceeded |
a, b, c = list(map(float, input().split()))
if (b == '+'):
print(a + c)
else:
print(a - c)
| a, b, c = input().split()
if (b == '+'):
print(int(a) + int(c))
else:
print(int(a) - int(c))
| s162146820 | s619441328 | p03844 | python | Runtime Error |
a, b, c = input().split()
if (b == '+'):
print(a + c)
else:
print(a - c)
| a, b, c = input().split()
if (b == '+'):
print(int(a) + int(c))
else:
print(int(a) - int(c))
| s004017926 | s619441328 | p03844 | python | Runtime Error |
A, B, M = [int(num) for num in input().split()]
a = [int(num) for num in input().split()]
b = [int(num) for num in input().split()]
minimum = -1
for i in range(M):
xi, yi, ci = [int(num) for num in input().split()]
ai = a[xi]
bi = b[yi]
sum = ai + bi - ci
if minimum == -1 or sum < minimum:
... | A, B, M = [int(num) for num in input().split()]
a = [int(num) for num in input().split()]
b = [int(num) for num in input().split()]
minimum = -1
for i in range(M):
xi, yi, ci = [int(num) for num in input().split()]
ai = a[xi-1]
bi = b[yi-1]
sum = ai + bi - ci
if minimum == -1 or sum < minimum:
... | s402716989 | s498728264 | p02748 | python | Runtime Error |
N = int(input())
S = {}
for i in range(N):
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
sorted_S = sorted(S.items(), key=lambda x: x[1], reverse=True)
a = []
count = -1
for s in sorted_S:
if count == -1:
a.append(s)
count = sorted_S[s]
elif count == sorted_S[s]:
... | N = int(input())
S = {}
for i in range(N):
s = input()
if s in S:
S[s] += 1
else:
S[s] = 1
sorted_S = sorted(S.items(), key=lambda x: x[1], reverse=True)
a = []
count = -1
for s in sorted_S:
if count == -1:
a.append(s[0])
count = s[1]
elif count == s[1]:
a.app... | s675689257 | s095780158 | p02773 | python | Runtime Error |
H , A = input().split()
H , A = int(H), int(A)
answer = H // A
if H % A == 0:
print(answer)
else:
print(anser + 1) | H , A = input().split()
H , A = int(H), int(A)
answer = H // A
if H % A == 0:
print(answer)
else:
print(answer + 1) | s956809919 | s296948921 | p02783 | python | Runtime Error |
N = input()
S, T = input().split()
A = String()
for s, t in zip(S, T):
A += s
A += t
print(A) | N = input()
S, T = input().split()
A = ""
for s, t in zip(S, T):
A += s
A += t
print(A) | s150239768 | s678290692 | p02830 | python | Runtime Error |
A, B = input().split
print(math.gcd(int(A), int(B))) | def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
A, B = input().split()
print(lcm(int(A), int(B))) | s692930239 | s185541496 | p02831 | python | Runtime Error |
A, B = input().split()
print(math.gcd(A,B)) | def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
A, B = input().split()
print(lcm(int(A), int(B))) | s487538724 | s185541496 | p02831 | python | Runtime Error |
all = input()
all = [int(num) for num in all]
if sum(all) >= 22:
print('bust')
else:
print('win') | all = input()
all = all.split(' ')
all = [int(num) for num in all]
if sum(all) >= 22:
print('bust')
else:
print('win') | s737240866 | s948861454 | p02835 | python | Runtime Error |
all = input()
all = all.split(' ')
all = [int(num) for num in all]
if sum(all) >= 22:
return'bust'
else:
return 'win' | all = input()
all = all.split(' ')
all = [int(num) for num in all]
if sum(all) >= 22:
print('bust')
else:
print('win') | s841812469 | s948861454 | p02835 | python | Runtime Error |
all = input()
if sum(all) >=22:
return 'bust'
else:
return 'win' | all = input()
all = all.split(' ')
all = [int(num) for num in all]
if sum(all) >= 22:
print('bust')
else:
print('win') | s508804428 | s948861454 | p02835 | python | Runtime Error |
{
"cells": [
{
"cell_type": "code",
"execution_count": 14,
"metadata": {},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"13 7 2\n"
]
}
],
"source": [
"all = input()"
]
},
{
"cell_type": "code",
"execution_count": 15,
"meta... | S = input()
count = 0
for i in range(len(S)//2):
if S[i] is not S[len(S)-1-i]:
count += 1
print(count) | s761287503 | s234927250 | p02836 | python | Runtime Error |
n = int(input())
s = input()
ans = ''
i = 0
prev = ''
while i < n - 1:
if prev != s[i]:
ans += s[i]
prev = s[i]
if s[i] == s[i+1]:
i += 2
else:
i += 1
if prev != s[i]:
ans += s[i]
print(len(ans)) | n = int(input())
s = input()
ans = ''
i = 0
prev = ''
while i < n - 1:
if prev != s[i]:
ans += s[i]
prev = s[i]
if s[i] == s[i+1]:
i += 2
else:
i += 1
if not(i > n - 1):
if prev != s[i]:
ans += s[i]
print(len(ans)) | s269934471 | s446603872 | p02887 | python | Runtime Error |
a, b = (int(_) for _ in input().split())
total = 1
ans = 0
if b == 1:
print(1)
else:
while total < b:
total -= 1
total += a
ans += 1
print(ans) | a, b = (int(_) for _ in input().split())
total = 1
ans = 0
while total < b:
total -= 1
total += a
ans += 1
print(ans)
| s617313297 | s520118501 | p02922 | python | Runtime Error |
l, r = (int(_) for _ in input().split())
if abs(l - r) == 1:
print(l * r % 2019)
else:
lower = l // 2019
upper = r // 2019
start = l % 2019
stop = r % 2019
if 2019 * (lower + 1) < r:
print(0)
else:
if start == 0:
print(0)
elif stop == 0:
print... | l, r = (int(_) for _ in input().split())
if abs(l - r) == 1:
print(l * r % 2019)
else:
lower = l // 2019
upper = r // 2019
start = l % 2019
stop = r % 2019
if 2019 * (lower + 1) < r:
print(0)
else:
ans = 1000000
if start == 0:
print(0)
elif stop =... | s474280522 | s678982908 | p02983 | python | Runtime Error |
#b
r, g, b, n = (int(_) for _ in input().split())
red = n // r
sets = []
ans = 0
for i in range(red + 1):
remainder = n - (r*i)
green = remainder // g
if remainder == 0:
ans += 1
else:
for j in range(green+1):
nremainder = remainder - j*g
if nremainder == 0:
... | #b
r, g, b, n = (int(_) for _ in input().split())
red = n // r
sets = []
ans = 0
for i in range(red + 1):
remainder = n - (r*i)
green = remainder // g
if remainder == 0:
ans += 1
else:
for j in range(green+1):
nremainder = remainder - j*g
if nremainder == 0:
... | s489868119 | s063763280 | p03048 | python | Time Limit Exceeded |
n = int(input())
A = [int(_) for _ in input().split()]
total = sum(A)
neg = 0
neno = []
pono = []
for a in A:
if a < 0:
neg += 1
neno.append(a)
else:
pono.append(a)
neno.sort()
pono.sort()
noneg = -sum(neno) + sum(pono)
if n == 2:
print(max(-total, total))
else:
if neg % 2 == 0:
... | n = int(input())
A = [int(_) for _ in input().split()]
total = sum(A)
neg = 0
pos = 0
neno = []
pono = []
for a in A:
if a < 0:
neg += 1
neno.append(a)
else:
pos += 1
pono.append(a)
neno.sort()
pono.sort()
noneg = -sum(neno) + sum(pono)
if n == 2:
print(max(-total, total))
el... | s710159033 | s082286336 | p03062 | python | Runtime Error |
n = int(input())
s = input()
start = s[0]
pattern = []
prev = ''
b = 0
w = 0
for i in s:
if (i == '#' and prev == '#') or (i == '#' and prev ==''):
b += 1
elif (i == '.' and prev == '.') or (i == '.' and prev == ''):
w += 1
elif i == '#':
b += 1
pattern.append(w)
w =... | a, b, c = (int(_) for _ in input().split())
if a > b:
if b < c < a:
print("Yes")
else:
print("No")
else:
if a < c < b:
print("Yes")
else:
print("No") | s318864343 | s642281395 | p03067 | python | Runtime Error |
a, b = int(_) for _ in input().split()
if a - 2 > b:
print(a*2)
elif b - 2 > a:
print(b*2)
else:
print(a+b) | a, b = (int(_) for _ in input().split())
if a - 2 >= b:
print(a*2 -1)
elif b - 2 >= a:
print(b*2 -1)
else:
print(a+b) | s736671662 | s232018463 | p03071 | python | Runtime Error |
b = input()
let = 'ATGC'
prev = b[0]
high = 0
if prev in let:
leng = 1
high = 1
for i in range(1,len(b)):
if leng == 0 and b[i] in let:
leng = 1
if b[i] in let and prev in let:
print(b[i])
leng += 1
else:
if leng > high:
high = leng
prev = b[i]
print(... | b = input()
let = 'ATGC'
prev = b[0]
high = 0
leng = 0
stop = False
if prev in let:
leng = 1
high = 1
for i in range(1,len(b)):
if leng == 0 and b[i] in let:
leng = 1
if b[i] in let and prev in let:
leng += 1
stop = False
else:
stop = True
if leng > high... | s747325152 | s885081578 | p03086 | python | Runtime Error |
b = input()
let = 'ATGC'
prev = b[0]
if prev in let:
leng = 1
lens = []
for i in range(1,len(b)):
if leng == 0 and b[i] in let:
leng = 1
if b[i] in let and prev in let:
print(b[i])
leng += 1
else:
lens.append(leng)
leng = 0
prev = b[i]
print(max(lens)) | b = input()
let = 'ATGC'
prev = b[0]
high = 0
leng = 0
stop = False
if prev in let:
leng = 1
high = 1
for i in range(1,len(b)):
if leng == 0 and b[i] in let:
leng = 1
if b[i] in let and prev in let:
leng += 1
stop = False
else:
stop = True
if leng > high... | s592540151 | s885081578 | p03086 | python | Runtime Error |
#0120
a, b, k = (int(_) for _ in input().split())
num = []
if a > b:
for i in range(1, a):
if a % i == 0 and b % i == 0:
num.append(i)
else:
for i in range(1, b):
if a % i == 0 and b % i == 0:
num.append(i)
if a == 1 and b == 1:
num.append(1)
print(num[-k]) | #0120
a, b, k = (int(_) for _ in input().split())
num = []
if a > b:
for i in range(1, a + 1):
if a % i == 0 and b % i == 0:
num.append(i)
else:
for i in range(1, b + 1):
if a % i == 0 and b % i == 0:
num.append(i)
if a == 1 and b == 1:
num.append(1)
print(num[-k]) | s894111873 | s424469289 | p03106 | python | Runtime Error |
a,b,c = int(input().split())
z = [int(input().split())]
if a == 1:
sco = abs(z-c)
else:
if abs(z[-1] - c) > abs(z[-2] - z[-1]):
sco = abs(z[-1] - c)
else:
sco = abs(z[-2] - z[-1])
print(sco) | a,b,c = map(int, input().split())
z = [int(_) for _ in input().split()]
if a == 1:
sco = abs(z[0]-c)
else:
if abs(z[-1] - c) > abs(z[-2] - z[-1]):
sco = abs(z[-1] - c)
else:
sco = abs(z[-2] - z[-1])
print(sco) | s581522844 | s986575567 | p03550 | python | Runtime Error |
n = int(input())
time = []
for i in range(n):
time.append(int(input()))
def gcd(a,b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a,b):
return (a*b) / gcd(a,b)
ans = time[0]
for i in range(0, n):
ans = lcm(ans, time[i])
print(int(ans)) | n = int(input())
time = []
for i in range(n):
time.append(int(input()))
def gcd(a,b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a,b):
return (a*b) // gcd(a,b)
ans = time[0]
for i in range(0, n):
ans = lcm(ans, time[i])
print(ans) | s363000533 | s919115239 | p03633 | python | Runtime Error |
S = input()
found = False
pprev, prev = S[0],S[1]
t = {pprev, prev}
for i in range(2,len(S)):
t.add(S[i])
if len(t) == 2:
print(i - 1, i + 1)
found = True
else:
t.remove(pprev)
pprev = prev
prev = S[i]
t = {pprev, prev}
if found:
break
if not found:
... | n = int(input())
L = [int(_) for _ in input().split()]
L.sort()
total = 100000000000000000
num = 0
if L[0] == L[-1]:
print(0)
else:
for l in range(L[0], L[-1]):
tot = 0
for j in range(n):
tot += abs(L[j] - l)**2
if tot < total:
num = l
total = tot
... | s580528949 | s680510095 | p04031 | python | Runtime Error |
n, k = (int(_) for _ in input().split())
a = [int(_) for _ in input().split()]
like = [i for i in range(10)]
pay = []
for i in str(n):
while int(i)%10 in a:
i = int(i) + 1
pay.append(str(i%10))
total = ''
for i in pay:
total += i
if n > int(total):
total += str(like[0])
print(int(tota... | n, k = (int(_) for _ in input().split())
a = [int(_) for _ in input().split()]
found = False
bad = False
while not found:
for i in str(n):
if int(i) in a:
bad = True
if not bad:
found = True
bad = False
n += 1
print(n - 1) | s461079728 | s177331854 | p04045 | python | Runtime Error |
n, k = (int(_) for _ in input().split())
a = [int(_) for _ in input().split()]
like = [i for i in range(10)]
pay = []
for i in a:
like.remove(i)
print(like)
for i in str(n):
while int(i)%10 in a:
i = int(i) + 1
pay.append(str(i%10))
total = ''
for i in pay:
total += i
if n > int(tot... | n, k = (int(_) for _ in input().split())
a = [int(_) for _ in input().split()]
found = False
bad = False
while not found:
for i in str(n):
if int(i) in a:
bad = True
if not bad:
found = True
bad = False
n += 1
print(n - 1) | s326719303 | s177331854 | p04045 | python | Runtime Error |
import sys
s = input()
q = int(input())
is_reverse = False
for _ in range(q):
tf = sys.stdin.readline().split()
if tf[0] == '1':
is_reverse = False if is_reverse else True
else:
if tf[1] == '1':
if is_reverse:
s += tf[2]
else:
s = tf[2] + s
else:
if is_reverse:
... | import sys
from collections import deque
s = input()
q = int(input())
is_reverse = False
ds = deque(s)
for _ in range(q):
tf = sys.stdin.readline().split()
if len(tf) == 1:
is_reverse = False if is_reverse else True
else:
if tf[1] == '1':
if is_reverse:
ds.append(tf[2])
else:
... | s182389994 | s019735523 | p02756 | python | Time Limit Exceeded |
import sys
s = input()
q = int(input())
is_reverse = False
for _ in range(q):
tf = sys.stdin.readline().split()
if tf[0] == '1':
is_reverse = False if is_reverse else True
else:
if tf[1] == '1':
if is_reverse:
s += tf[2]
else:
s = tf[2] + s
else:
if is_reverse:
... | import sys
from collections import deque
s = input()
q = int(input())
is_reverse = False
ds = deque(s)
for _ in range(q):
tf = sys.stdin.readline().split()
if len(tf) == 1:
is_reverse = False if is_reverse else True
else:
if tf[1] == '1':
if is_reverse:
ds.append(tf[2])
else:
... | s482637982 | s019735523 | p02756 | python | Time Limit Exceeded |
n, m = map(int, input().split())
s_list = []
c_list = []
for _ in range(m):
s, c = map(int, input().split())
s_list.append(s)
c_list.append(c)
ans = ["1"]
ans.extend(["0"]*(n-1))
if m == 1:
if s_list[0] == 1:
ans = [str(c_list[0])]
else:
ans[s_list[0]-1] = str(c_list[0])
elif c_list[0] == "0":
ans... | n, m = map(int, input().split())
nums = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
is_ok = True
num_str = str(i)
if len(num_str) != n:
continue
for s, c in nums:
if num_str[s-1] != str(c):
is_ok = False
break
if is_ok:
print(num_str)
exit(0)
print(-1... | s967351203 | s052437316 | p02761 | python | Runtime Error |
n, m = map(int, input().split())
s_list = []
c_list = []
for _ in range(m):
s, c = map(int, input().split())
s_list.append(s)
c_list.append(c)
ans = ["0"]*n
if m == 1:
if s_list[0] == 1:
ans = [str(c_list[0])]
else:
ans = ["-1"]
elif c_list[0] == 0:
ans = ["-1"]
else:
for i, s in enumerate(s_list... | n, m = map(int, input().split())
nums = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
is_ok = True
num_str = str(i)
if len(num_str) != n:
continue
for s, c in nums:
if num_str[s-1] != str(c):
is_ok = False
break
if is_ok:
print(num_str)
exit(0)
print(-1... | s497171832 | s052437316 | p02761 | python | Runtime Error |
n, m = map(int, input().split())
s_list = []
c_list = []
for _ in range(m):
s, c = map(int, input().split())
s_list.append(s)
c_list.append(c)
ans = ["0"]*n
if c_list[0] == 0:
ans = ["-1"]
else:
for i, s in enumerate(s_list):
x = c_list[i]
if ans[s-1] != "0" and ans[s-1] != str(x):
ans = ["-1"]... | n, m = map(int, input().split())
nums = [list(map(int, input().split())) for _ in range(m)]
for i in range(1000):
is_ok = True
num_str = str(i)
if len(num_str) != n:
continue
for s, c in nums:
if num_str[s-1] != str(c):
is_ok = False
break
if is_ok:
print(num_str)
exit(0)
print(-1... | s150643342 | s052437316 | p02761 | python | Runtime Error |
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
e_list = [(p+1)/2 for p in p_list]
max_nums = 0
max_targets = []
for j in range(0, len(e_list)-k+1):
targets = [e_list[j+m] for m in range(k)]
t_sum = sum(targets)
if t_sum >= max_nums:
max_nums = t_sum
max_targets = targets
print(s... | n, k = map(int, input().split())
p_list = list(map(int, input().split()))
tmp = sum(p_list[:k])
max_num = sum(p_list[:k])
for i in range(len(p_list)-k):
tmp = tmp - p_list[i] + p_list[i+k]
if tmp >= max_num:
max_num = tmp
print((max_num+k)/2) | s099468802 | s076295367 | p02780 | python | Time Limit Exceeded |
def culc_expected_value(num):
output = 0
if num != 1:
for i in range(1, num+1):
output = output + i/num
else:
output = 1
return output
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
max_nums = 0
max_targets = []
for j in range(0, len(p_list)-k+1):
targets = [p_list[j... | n, k = map(int, input().split())
p_list = list(map(int, input().split()))
tmp = sum(p_list[:k])
max_num = sum(p_list[:k])
for i in range(len(p_list)-k):
tmp = tmp - p_list[i] + p_list[i+k]
if tmp >= max_num:
max_num = tmp
print((max_num+k)/2) | s130072753 | s076295367 | p02780 | python | Time Limit Exceeded |
def culc_expected_value(num):
output = 0
if num != 1:
for i in range(1, num+1):
output = output + i/num
else:
output = 1
return output
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
max_nums = 0
max_targets = []
for j in range(0, len(p_list)-k+1):
targets = [p_list[j... | n, k = map(int, input().split())
p_list = list(map(int, input().split()))
tmp = sum(p_list[:k])
max_num = sum(p_list[:k])
for i in range(len(p_list)-k):
tmp = tmp - p_list[i] + p_list[i+k]
if tmp >= max_num:
max_num = tmp
print((max_num+k)/2) | s732096109 | s076295367 | p02780 | python | Time Limit Exceeded |
def culc_expected_value(num):
output = 0
if num != 1:
for i in range(1, num+1):
output += i/num
else:
output = 1
return output
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
max_nums = 0
max_targets = []
for j in range(0, len(p_list)-k-1):
targets = [p_list[j+m] for ... | n, k = map(int, input().split())
p_list = list(map(int, input().split()))
tmp = sum(p_list[:k])
max_num = sum(p_list[:k])
for i in range(len(p_list)-k):
tmp = tmp - p_list[i] + p_list[i+k]
if tmp >= max_num:
max_num = tmp
print((max_num+k)/2) | s826845371 | s076295367 | p02780 | python | Runtime Error |
from fractions import gcd
d = int(input())
nums = list(map(int, input().split(' ')))
def lcm_base(x, y):
return (x * y) // gcd(x, y)
lcm_num = 1
for i in range(len(nums)):
lcm_num = lcm_base(lcm_num, nums[i])
ans = 0
for n in nums:
ans += int(lcm_num / n)
print(ans % (10**9 + 7)) | from fractions import gcd
def lcm_base(x, y):
return x * y // gcd(x, y)
d = int(input())
nums = list(map(int, input().split(' ')))
lcm_num = 1
for n in nums:
lcm_num = lcm_base(lcm_num, n)
ans = 0
mod = 10**9 + 7
for n in nums:
ans += lcm_num//n
print(ans % mod) | s181361106 | s351810239 | p02793 | python | Runtime Error |
from fractions import gcd
d = int(input())
nums = list(map(int, input().split(' ')))
def lcm_base(x, y):
return (x * y) // gcd(x, y)
if d == 1:
print(1)
else:
lcm_num = nums[0]
for i in range(len(nums)-1):
lcm_num = lcm_base(lcm_num, nums[i+1])
min_nums = []
for n in nums:
min_nums.append(int(... | from fractions import gcd
def lcm_base(x, y):
return x * y // gcd(x, y)
d = int(input())
nums = list(map(int, input().split(' ')))
lcm_num = 1
for n in nums:
lcm_num = lcm_base(lcm_num, n)
ans = 0
mod = 10**9 + 7
for n in nums:
ans += lcm_num//n
print(ans % mod) | s126682278 | s351810239 | p02793 | python | Runtime Error |
from fractions import gcd
d = int(input())
nums = list(map(int, input().split(' ')))
def lcm_base(x, y):
return (x * y) // gcd(x, y)
if d == 1:
print(1)
else:
lcm_num = nums[0]
for i in range(len(nums)-1):
lcm_num = lcm_base(lcm_num, nums[i+1])
min_nums = []
for n in nums:
min_nums.append(int(lcm_nu... | from fractions import gcd
def lcm_base(x, y):
return x * y // gcd(x, y)
d = int(input())
nums = list(map(int, input().split(' ')))
lcm_num = 1
for n in nums:
lcm_num = lcm_base(lcm_num, n)
ans = 0
mod = 10**9 + 7
for n in nums:
ans += lcm_num//n
print(ans % mod) | s058329567 | s351810239 | p02793 | python | Runtime Error |
a, b = input().split(' ')
print(b + a) | a, b = input().split(' ')
print(b + a) | s272335007 | s893632274 | p02817 | python | Runtime Error |
s = int(input())
a_list = list(input())
def get_key(d, value):
for k, v in d.items():
if v == value:
return k
output = []
a_dict = {1: 'A', 2: 'B', 3: 'C', 4: 'D', 5: 'E', 6: 'F', 7: 'G', 8: 'H', 9: 'I', 10: 'J', 11: 'K', 12: 'L', 13: 'M',
14: 'N', 15: 'O', 16: 'P', 17: 'Q', 18: 'R... | s = int(input())
a_list = list(input())
def get_key(d, value):
for k, v in d.items():
if v == value:
return k
output = []
a_dict = {1: 'A', 2: 'B', 3: 'C', 4: 'D', 5: 'E', 6: 'F', 7: 'G', 8: 'H', 9: 'I', 10: 'J', 11: 'K', 12: 'L', 13: 'M',
14: 'N', 15: 'O', 16: 'P', 17: 'Q', 18: 'R... | s980070338 | s523271813 | p02848 | python | Runtime Error |
from fractions import gcd
import math
def get_prime_numbers(n):
prime_nums = {}
for i in range(2, math.ceil(math.sqrt(n)) + 1):
while n % i == 0:
if i in prime_nums:
prime_nums[i] += 1
else:
prime_nums[i] = 1
n //= i
if n != 1:
if n in prime_nums:
prime_nums[n] += ... | from fractions import gcd
import math
A, B = map(int, input().split())
N = gcd(A, B)
def prime(n):
factor = {}
tmp = int(math.sqrt(n)) + 1
for num in range(2, tmp):
while n % num == 0:
n //= num
if not num in factor.keys():
factor[num] = 1
el... | s336865317 | s838420765 | p02900 | python | Runtime Error |
n, m = map(int, input().split())
a_list = list(map(int, input().split()))
for _ in range(m):
max_i = a_list.index(max(a_list))
a_list[max_i] = a_list[max_i] // 2
print(sum(a_list)) | import heapq
n, m = map(int, input().split())
a_list = [a*(-1) for a in list(map(int, input().split()))]
heapq.heapify(a_list)
for _ in range(m):
min_n = heapq.heappop(a_list)
heapq.heappush(a_list, (min_n//2 if min_n%2 == 0 else min_n//2+1))
print(sum(a_list) * (-1)) | s445893430 | s028871219 | p02912 | python | Time Limit Exceeded |
n, m = map(int, input().split())
a_list = list(map(int, input().split()))
for _ in range(m):
max_i = a_list.index(max(a_list))
a_list[max_i] = a_list[max_i] // 2
print(sum(a_list)) | import heapq
n, m = map(int, input().split())
a_list = [a*(-1) for a in list(map(int, input().split()))]
heapq.heapify(a_list)
for _ in range(m):
min_n = heapq.heappop(a_list)
heapq.heappush(a_list, (min_n//2 if min_n%2 == 0 else min_n//2+1))
print(sum(a_list) * (-1)) | s622793892 | s028871219 | p02912 | python | Time Limit Exceeded |
import heapq
num = int(input())
nums = [int(input()) for _ in range(num)]
for n in nums:
maxs = heapq.nlargest(2, nums)
if maxs[0] > n:
print(maxs[0])
else:
print(maxs[1])
| import heapq
num = int(input())
nums = [int(input()) for _ in range(num)]
maxs = heapq.nlargest(2, nums)
for n in nums:
if n == maxs[0]:
print(maxs[1])
else:
print(maxs[0])
| s682313396 | s853226091 | p02971 | python | Time Limit Exceeded |
num = int(input())
nums = [int(input()) for _ in range(num)]
for i in range(len(nums)):
n = nums[i]
del nums[i]
print(max(nums))
nums.insert(i, n) | import heapq
num = int(input())
nums = [int(input()) for _ in range(num)]
maxs = heapq.nlargest(2, nums)
for n in nums:
if n == maxs[0]:
print(maxs[1])
else:
print(maxs[0])
| s068634565 | s853226091 | p02971 | python | Time Limit Exceeded |
l, r = map(int, input().split())
ans_list = []
for i in range(2 * 10**9):
if l + 1 > r:
break
ans = (l * (l + 1)) % 2019
ans_list.append(ans)
if ans == 0:
break
print(min(ans_list)) | l, r = map(int, input().split())
ans_list = []
for i in range(l, min(l+2019, r)):
for j in range(i + 1, min(i + 2019, r + 1)):
ans = (i * j) % 2019
ans_list.append(ans)
if ans == 0:
break
print(min(ans_list)) | s847256165 | s603867585 | p02983 | python | Time Limit Exceeded |
n = int(input())
sorted_nums = sorted(list(map(int, input().split())))
center = len(sorted_nums // 2)
ans = sorted_nums[center] - sorted_nums[center-1]
print(ans) | n = int(input())
sorted_nums = sorted(list(map(int, input().split())))
center = len(sorted_nums) // 2
ans = sorted_nums[center] - sorted_nums[center-1]
print(ans) | s164053085 | s976590218 | p02989 | python | Runtime Error |
n, m = map(int, input().split())
if m == 1:
l, r = map(int, input().split())
print(r-l+1)
else:
l, r = map(int, input().split())
ans = list(range(l, r+1))
for _ in range(m-1):
l, r = map(int, input().split())
lr_list = list(range(l, r+1))
ans = [a for a in ans if lr_list.count(a) == 1]
if len... | n, m = map(int, input().split())
if m == 1:
l, r = map(int, input().split())
print(r-l+1)
else:
ls, rs = [], []
for _ in range(m):
l, r = map(int, input().split())
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0:
print(ans)
else:
print(0) | s650214928 | s641938817 | p03037 | python | Time Limit Exceeded |
n, m = map(int, input().split())
if m == 1:
l, r = map(int, input().split())
print(r-l+1)
else:
l, r = map(int, input().split())
ans = list(range(l, r+1))
for _ in range(m-1):
l, r = map(int, input().split())
lr_list = list(range(l, r+1))
removes = []
for a in ans:
if a not in lr_list:
... | n, m = map(int, input().split())
if m == 1:
l, r = map(int, input().split())
print(r-l+1)
else:
ls, rs = [], []
for _ in range(m):
l, r = map(int, input().split())
ls.append(l)
rs.append(r)
ans = min(rs) - max(ls) + 1
if ans > 0:
print(ans)
else:
print(0) | s191055648 | s641938817 | p03037 | python | Time Limit Exceeded |
N, K = map(int, input().split())
H = sorted([int(x) for x in input().split()])
#print(H)
for i in range(K):
H.pop((N-1)-i)
#print(H)
print(sum(H)) | N, K = map(int, input().split())
H = sorted([int(x) for x in input().split()])
#print(H)
if N<K:
K=N
for i in range(K):
H.pop((N-1)-i)
#print(H)
print(sum(H)) | s321777719 | s284379309 | p02785 | python | Runtime Error |
N, M = map(int, input().split())
If N==M :
print("Yes")
else :
print("No") | N, M = map(int, input().split())
if N == M :
print("Yes")
else :
print("No") | s243540992 | s024276793 | p02789 | python | Runtime Error |
import math
a,b,x=map(int,input().split())
theta=0
if x<=a**2*b/2:
theta=math.degrees(math.atan(2*x/(a*b**2)))
else:
theta=math.degrees(math.atan(a**3/(2*(a**2*b-x))))
print(90-theta) | import math
a,b,x=map(int,input().split())
theta=0
if x<=a**2*b/2:
theta=math.degrees(math.atan(a*b**2/(2*x)))
else:
theta=math.degrees(math.atan(2*(a**2*b-x)/a**3))
print(theta) | s595865424 | s667137851 | p02882 | python | Runtime Error |
import copy
N=int(input())
L=[int(x) for x in input().split()]
L0=copy.copy(L)
L.sort()
Ans=[]
for i in range(N):
for j in range(N):
if L[i]==L0[j]:
Ans.append(j+1)
print(' '.join(map(str, Ans))) | import copy
N=int(input())
L=[int(x) for x in input().split()]
Ans=[0]*N
for i in range(N):
Ans[L[i]-1]=i+1
print(' '.join(map(str, Ans))) | s620144487 | s104290536 | p02899 | python | Time Limit Exceeded |
N=int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
ans=0
j=0
for i in range(N):
ans+=B[A[i]-1]
if A[i]-j==1 and i>=1:
ans+=C[j-1]
j=A[i]
print(ans) | n=int(input())
print(n**3) | s254963557 | s460345815 | p02915 | python | Runtime Error |
N=int(input())
a=[0]*N
b=[0]*N
c=[0]*N
for i in range(N):
a[i],b[i],c[i]=map(int,input().split())
dp=[[0 for j in range(3)] for k in range(N)]
for l in range(N):
if l==0:
dp[0][l]=a[l]
dp[1][l]=b[l]
dp[2][l]=c[l]
else:
dp[0][l]=max(dp[1][l-1],dp[2][l-1])+a[l]
dp[1][l]=max(dp[0][l-1],dp[2][l-1])+b[l]
d... | N=int(input())
a=[0]*N
b=[0]*N
c=[0]*N
for i in range(N):
a[i],b[i],c[i]=map(int,input().split())
dp=[[0 for j in range(N)] for k in range(3)]
for l in range(N):
if l==0:
dp[0][l]=a[l]
dp[1][l]=b[l]
dp[2][l]=c[l]
else:
dp[0][l]=max(dp[1][l-1],dp[2][l-1])+a[l]
dp[1][l]=max(dp[0][l-1],dp[2][l-1])+b[l]
d... | s386977245 | s545316297 | p03162 | python | Runtime Error |
import numpy as np
from numpy.fft import rfft, irfft
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
X = np.zeros(10**5+1)
l = 2*(10**5)+10
for i in range(N):
X[A[i]] += 1
data = irfft(rfft(X, l)**2 )
num = 0
ans = 0
for i in range(len(data) -1 ,0,-1):
if int(round(data[i])) != 0:
... | import bisect
N, M = list(map(int,input().split()))
data = list(map(int,input().split()))
data.sort()
def cost(x):
re = 0
for i in range(N):
idx = bisect.bisect_left(data,x - data[i])
re += N - idx
return re
#binery_search
lb = 0
ub = 2*max(data) + 1
while ub - lb > 1:
mid = (ub+lb)//2
... | s371715540 | s812674057 | p02821 | python | Time Limit Exceeded |
import numpy as np
from numpy.fft import rfft, irfft
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
X = np.zeros(10**5+1)
l = 2*(10**5)+10
for i in range(N):
X[A[i]] += 1
data = irfft(rfft(X, l) * rfft(X, l))
num = 0
ans = 0
for i in range(len(data) -1 ,0,-1):
if int(round(data[i])) != ... | import bisect
N, M = list(map(int,input().split()))
data = list(map(int,input().split()))
data.sort()
def cost(x):
re = 0
for i in range(N):
idx = bisect.bisect_left(data,x - data[i])
re += N - idx
return re
#binery_search
lb = 0
ub = 2*max(data) + 1
while ub - lb > 1:
mid = (ub+lb)//2
... | s011422870 | s812674057 | p02821 | python | Time Limit Exceeded |
import numpy as np
N = int(input())
data_xy = []
for i in range(N):
A = int(input())
xy = []
for i in range(A):
[x,y] = list(map(int,input().split()))
xy.append([x-1, y])
data_xy.append(xy)
data_xy = np.array(data_xy,dtype=np.int64)
ans = 0
for i in range(2**N):
p_list = [0]*N
fo... | A = list(map(int,input().split()))
if sum(A) >= 22:
print('bust')
else:
print('win') | s248924384 | s876543555 | p02835 | python | Runtime Error |
import numpy as np
N = int(input())
data_xy = []
for i in range(N):
A = int(input())
xy = []
for i in range(A):
[x,y] = list(map(int,input().split()))
xy.append([x-1, y])
data_xy.append(xy)
ans = 0
for i in range(2**N):
p_list = [0]*N
for j in range(N):
if (i>>j) & 1 == 1... | A = list(map(int,input().split()))
if sum(A) >= 22:
print('bust')
else:
print('win') | s219305519 | s876543555 | p02835 | python | Runtime Error |
import numpy as np
N = int(input())
data_xy = []
for i in range(N):
A = int(input())
xy = []
for i in range(A):
[x,y] = list(map(int,input().split()))
xy.append([x-1, y])
data_xy.append(xy)
data_xy = np.array(data_xy,dtype=np.int64)
ans = 0
for i in range(2**N):
p_list = np.zeros(N,d... | N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a_tmp = int(input())
for j in range(a_tmp):
[x, y] = list(map(int,input().split()))
syougen[i].append([x-1,y])
ans = 0
for i in range(2**N):
data = [0]*N
for j in range(N):
if ((i >> j) & 1):
data[j]... | s554381810 | s277204911 | p02837 | python | Runtime Error |
import numpy as np
N = int(input())
data_xy = []
for i in range(N):
A = int(input())
xy = []
for i in range(A):
[x,y] = list(map(int,input().split()))
xy.append([x-1, y])
data_xy.append(xy)
data_xy = np.array(data_xy,dtype=np.int64)
ans = 0
for i in range(2**N):
p_list = np.zeros(N,d... | N = int(input())
syougen = [[] for i in range(N)]
for i in range(N):
a_tmp = int(input())
for j in range(a_tmp):
[x, y] = list(map(int,input().split()))
syougen[i].append([x-1,y])
ans = 0
for i in range(2**N):
data = [0]*N
for j in range(N):
if ((i >> j) & 1):
data[j]... | s350204318 | s277204911 | p02837 | python | Runtime Error |
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | s435025898 | s606565937 | p02838 | python | Runtime Error |
import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_0 = 0
for j in range(N):
if ((A[j] >> i) & 1) == 0:
tmp_0 += 1
tmp += ((tmp_0)*(N - tmp_0)*(2**i)) % mod
print(tmp % mod) | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | s987453506 | s606565937 | p02838 | python | Time Limit Exceeded |
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
tmp = 0
for i in range(61):
tmp_0 = 0
for j in range(N):
if ((A[j] >> i) & 1) == 0:
tmp_0 += 1
tmp += ((tmp_0)*(N - tmp_0)*(2**i)) % mod
print(tmp % mod) | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | s344284393 | s606565937 | p02838 | python | Time Limit Exceeded |
mod = 10**9 + 7
def pow_k(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = (K * x) % mod
x = (x ** 2) % mod
n = (n - 1) // 2
else:
x = (x ** 2) % mod
n = n // 2
return (K *... | import numpy as np
mod = 10**9+7
N = int(input())
A = list(map(int,input().split()))
A = np.array(A, dtype = np.int64)
tmp = 0
for i in range(61):
tmp_1 = np.count_nonzero(A & 1)
tmp += ((tmp_1)*(N - tmp_1)*(2**i)) % mod
A = A >> 1
print(tmp % mod) | s756998441 | s606565937 | p02838 | python | Time Limit Exceeded |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.