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 |
|---|---|---|---|---|---|---|
N = int(input())
A = input().split()
R = []
for i in range(1,N+1):
dx = A.index(str(i))
R.append(str(dx+1))
out = ' '.join(R)
print(out) | N = int(input())
odd = 0
same = 0
for x in range(1,N+1,1):
if x % 2 == 0:
same += 1
else:
odd += 1
print(odd / (odd + same))
| s474853221 | s637395919 | p02897 | python | Runtime Error |
N = int(input())
A = input().split()
R = []
for i in range(1,N+1):
dx = A.index(str(i))
R.append(str(dx+1))
out = ' '.join(R)
print(out) | N = int(input())
odd = 0
same = 0
for x in range(1,N+1,1):
if x % 2 == 0:
same += 1
else:
odd += 1
print(odd / (odd + same))
| s491468882 | s637395919 | p02897 | python | Runtime Error |
import copy
def main():
n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
for i in range(len(a)):
b = copy.deepcopy(a)
b.pop(i)
print(max(b))
if __name__ == "__main__":
main()
| def main():
n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
b = sorted(a)
for i in range(len(a)):
if a[i] == b[-1]:
print(b[-2])
else:
print(b[-1])
if __name__ == "__main__":
main() | s228251231 | s384087133 | p02971 | python | Time Limit Exceeded |
count = 0
out = 0
for i in range(len(S_list)-1):
#print(i)
if S_list[i]=='h':
if S_list[i+1]=='i':
if i+2 > len(S_list)-1:
count += 1
else:
if S_list[i+2]=='i':
out += 1
if count >0 and out ==0:
print('Y... | S = input()
List = ['hihi', 'hi', 'hihihi', 'hihihihi', 'hihihihihi']
if S in List:
print('Yes')
else:
print('No') | s828581824 | s825480665 | p02747 | python | Runtime Error |
S = input()
S_list = list(S)
for i in range(len(S_list)-1):
if S_list[i]=='h':
if S_list[i+1]=='i':
try:
letter = S_list[i+2]
except IndexError:
pass
if letter!='i':
print('Yes')
... | S = input()
List = ['hihi', 'hi', 'hihihi', 'hihihihi', 'hihihihihi']
if S in List:
print('Yes')
else:
print('No') | s868519459 | s825480665 | p02747 | python | Runtime Error |
S = input()
S_list=list(S)
for i in range(S_list):
if S_list[i]=='h':
if S_list[i+1] == 'i':
if S_list[i+1] != 'i':
print('Yes')
else:
print('No') | S = input()
List = ['hihi', 'hi', 'hihihi', 'hihihihi', 'hihihihihi']
if S in List:
print('Yes')
else:
print('No') | s154114472 | s825480665 | p02747 | python | Runtime Error |
s = input()
if s.search("hi") != -1:
print("Yes")
else:
print("No") | import re
s = input()
if s == "hi" or s=="hihi" or s=="hihihi" or s=="hihihihi" or s== "hihihihihi":
print("Yes")
else:
print("No") | s690221907 | s181519038 | p02747 | python | Runtime Error |
X,n = map(int,input().split(" "))
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
print(Base_10_to_n(X, n)) | X,n = map(int,input().split(" "))
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
a=Base_10_to_n(X, n)
print(len(str(a))) | s382643841 | s241686191 | p02766 | python | Runtime Error |
_, _, M = map(int, input().split())
# price list
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# min price
min_price = min(a_list) + min(b_list)
for _ in range(M):
x, y, c = map(int, input().split())
discount_price = a_list[x] + b_list[y] - c
if discount_price < min_price:
... | _, _, M = map(int, input().split())
# price list
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# min price
min_price = min(a_list) + min(b_list)
for _ in range(M):
x, y, c = map(int, input().split())
discount_price = a_list[x-1] + b_list[y-1] - c
min_price = min(min_price, disc... | s950371544 | s538126381 | p02748 | python | Runtime Error |
A, B, M = map(int, input().split())
# price list
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# min price
min_price = min(a_list) + min(b_list)
for m in range(M):
x, y, c = map(int, input().split())
discount_price = a_list[x] + b_list[y] - c
if discount_price < min_price:
... | _, _, M = map(int, input().split())
# price list
a_list = list(map(int, input().split()))
b_list = list(map(int, input().split()))
# min price
min_price = min(a_list) + min(b_list)
for _ in range(M):
x, y, c = map(int, input().split())
discount_price = a_list[x-1] + b_list[y-1] - c
min_price = min(min_price, disc... | s894006328 | s538126381 | p02748 | python | Runtime Error |
# coding: utf-8
def divisors(n):
for i in range(2, n+1):
if n % i == 0:
yield i
def main():
a, b = input().split()
a, b = int(a), int(b)
if a == 1 or b == 1:
print(1)
exit()
if b > a:
a, b = b, a
relative_primes = []
for div in divisors(b):
... | # coding: utf-8
def greatest_common_divisor(N, M):
assert N >= M
while M != 0:
N, M = M, N%M
return N
def prime_divisor(N):
temp = N
for n in range(2, int(-(-N**0.5//1))+1):
if temp % n == 0:
while temp % n == 0:
temp //= n
yield n
if tem... | s175430475 | s785495483 | p02900 | python | Time Limit Exceeded |
# coding: utf-8
def greatest_common_divisor(a, b):
assert a >= b
while b != 0:
a, b = b, a%b
return a
def main():
a, b = input().split()
a, b = int(a), int(b)
if a == 1 or b == 1:
print(1)
exit()
if b > a:
a, b = b, a
relative_primes = []
gcd = gr... | # coding: utf-8
def greatest_common_divisor(N, M):
assert N >= M
while M != 0:
N, M = M, N%M
return N
def prime_divisor(N):
temp = N
for n in range(2, int(-(-N**0.5//1))+1):
if temp % n == 0:
while temp % n == 0:
temp //= n
yield n
if tem... | s179867251 | s785495483 | p02900 | python | Time Limit Exceeded |
# coding: utf-8
def greatest_common_divisor(a, b):
assert a > b
while b != 0:
a, b = b, a%b
return a
def main():
a, b = input().split()
a, b = int(a), int(b)
if b > a:
a, b = b, a
relative_primes = []
gcd = greatest_common_divisor(a, b)
for i in range(2, gcd+1):
... | # coding: utf-8
def greatest_common_divisor(N, M):
assert N >= M
while M != 0:
N, M = M, N%M
return N
def prime_divisor(N):
temp = N
for n in range(2, int(-(-N**0.5//1))+1):
if temp % n == 0:
while temp % n == 0:
temp //= n
yield n
if tem... | s621351136 | s785495483 | p02900 | python | Runtime Error |
# coding: utf-8
from math import gcd
import math
def main():
a, b = input().split()
a, b = int(a), int(b)
if b > a:
a, b = b, a
relative_primes = []
greatest_cd = gcd(a, b)
for i in range(2, greatest_cd+1):
if greatest_cd % i > 0:
continue
flg ... | # coding: utf-8
def greatest_common_divisor(N, M):
assert N >= M
while M != 0:
N, M = M, N%M
return N
def prime_divisor(N):
temp = N
for n in range(2, int(-(-N**0.5//1))+1):
if temp % n == 0:
while temp % n == 0:
temp //= n
yield n
if tem... | s128894352 | s785495483 | p02900 | python | Runtime Error |
# coding: utf-8
import math
def main():
a, b = input().split()
a, b = int(a), int(b)
if b > a:
a, b = b, a
gcd = math.gcd(a, b)
relative_primes = []
for i in range(2, gcd+1):
if gcd % i > 0:
continue
flg = True
for rp in relative_primes... | # coding: utf-8
def greatest_common_divisor(N, M):
assert N >= M
while M != 0:
N, M = M, N%M
return N
def prime_divisor(N):
temp = N
for n in range(2, int(-(-N**0.5//1))+1):
if temp % n == 0:
while temp % n == 0:
temp //= n
yield n
if tem... | s286397490 | s785495483 | p02900 | python | Runtime Error |
# coding: utf-8
def is_easy(steps):
for i, step in enumerate(steps):
if i % 2 == 0 and step == 'L':
return 'No'
elif i % 2 == 1 and step == 'R':
return 'No'
return 'Yes'
steps = input()
print(is_easy(steps)) | # coding: utf-8
def is_easy(steps):
for i, step in enumerate(steps):
if i % 2 == 0 and step == 'L':
return 'No'
elif i % 2 == 1 and step == 'R':
return 'No'
return 'Yes'
steps = input()
print(is_easy(steps)) | s613769804 | s647487041 | p02910 | python | Runtime Error |
# coding: utf-8
import numpy as np
step_strings = {'L': 0, 'U': 1, 'D': 2, 'R': 3}
steps = input()
steps = np.array([step_strings[s] for s in steps])
steps_index = (np.arange(steps.size) + 1) % 2
if steps[steps_index == 0].max() < 3 and steps[steps_index == 1].min() > 0:
print('Yes')
else:
print('No') | # coding: utf-8
def is_easy(steps):
for i, step in enumerate(steps):
if i % 2 == 0 and step == 'L':
return 'No'
elif i % 2 == 1 and step == 'R':
return 'No'
return 'Yes'
steps = input()
print(is_easy(steps)) | s470423463 | s647487041 | p02910 | python | Runtime Error |
import math
N = int(input())
S_lists = [input() for i in range(N)]
S_dict = {}
for S in S_lists:
S_list = list(S)
S_list.sort()
S_str = "".join(S_list)
if S_str in S_dict.keys():
S_dict[S_str] = S_dict[S_str] + 1
else:
S_dict[S_str] = 1
answer = 0
for v in S_dict.values():
i... | N = int(input())
S_lists = [input() for i in range(N)]
S_dict = {}
for S in S_lists:
S_list = list(S)
S_list.sort()
S_str = "".join(S_list)
if S_str in S_dict.keys():
S_dict[S_str] = S_dict[S_str] + 1
else:
S_dict[S_str] = 1
answer = 0
for v in S_dict.values():
if v > 1:
... | s274508045 | s054897817 | p02947 | python | Runtime Error |
A, B, M = [int(x) for x in input().split()]
A_price_list = [int(x) for x in input().split()]
B_price_list = [int(x) for x in input().split()]
discount_list = [[0 for j in range(B)] for i in range(A)]
for i in range(M):
x, y, c = ([int(x) for x in input().split()])
discount_list[x-1][y-1] = max(discount_list[x... | A, B, M = [int(x) for x in input().split()]
A_price_list = [int(x) for x in input().split()]
B_price_list = [int(x) for x in input().split()]
discount_list = []
for i in range(M):
x, y, c = [int(x) for x in input().split()]
discount_list.append([x-1, y-1, c])
amount = min(A_price_list) + min(B_price_list)
... | s540258206 | s798716370 | p02748 | python | Time Limit Exceeded |
N = input()
S = input()
N = int(N)
if N % 2 == 1:
print("No")
elif list(S)[0:N//2] == list(S)[N//2:N]:
print("Yes")
else:
print("No")
| r = input()
r = int(r) ** 2
print(r) | s752440109 | s388822412 | p02859 | python | Runtime Error |
N,K = map(int, input().split())
c = []
for i in range(N):
c.append(input().split())
d = []
e = []
for j in range(N):
e.append(c[j][0])
e = e * int(c[j][1])
d = d + e
e = []
d.sort()
print(d[K-1]) | #N,Kの取得
N,K = list(map(int,input().split()))
#[(a_1,b_1),(a_2,b_2),...]の形でリストを作成
numList = []
for a,b in [ map(int,input().split()) for _ in range(N) ]:
numList.append((a,b))
#作成したリストを、aの大きさで昇順ソート
numList = sorted(numList,key=lambda x:x[0])
#小さい順に要素数bを足していき、Kを超えた段階で出力、終了
count = 0
for a,b in numList:
count += b
i... | s392223525 | s386272888 | p03721 | python | Time Limit Exceeded |
N,K = map(int, input().split())
c = []
for i in range(N):
c.append(input().split())
d = []
e = []
for j in range(N):
e.append(c[j][0])
e = e * c[j][1]
d = d + e
e = []
d.sort()
print(d[K-1]) | #N,Kの取得
N,K = list(map(int,input().split()))
#[(a_1,b_1),(a_2,b_2),...]の形でリストを作成
numList = []
for a,b in [ map(int,input().split()) for _ in range(N) ]:
numList.append((a,b))
#作成したリストを、aの大きさで昇順ソート
numList = sorted(numList,key=lambda x:x[0])
#小さい順に要素数bを足していき、Kを超えた段階で出力、終了
count = 0
for a,b in numList:
count += b
i... | s194069581 | s386272888 | p03721 | python | Runtime Error |
#N,Kの取得
N,K = list(map(int,input().split()))
#[(a_1,b_1),(a_2,b_2),...]の形でリストを作成
numList = [ map(int,input().split()) for _ in range(N) ]
#作成したリストを、aの大きさで昇順ソート
numList = sorted(numList,key=lambda x:x[0])
#小さい順に要素数bを足していき、Kを超えた段階で出力、終了
count = 0
for a,b in numList:
count += b
if count>=K:
print(a)
quit() | #N,Kの取得
N,K = list(map(int,input().split()))
#[(a_1,b_1),(a_2,b_2),...]の形でリストを作成
numList = []
for a,b in [ map(int,input().split()) for _ in range(N) ]:
numList.append((a,b))
#作成したリストを、aの大きさで昇順ソート
numList = sorted(numList,key=lambda x:x[0])
#小さい順に要素数bを足していき、Kを超えた段階で出力、終了
count = 0
for a,b in numList:
count += b
i... | s216062886 | s386272888 | p03721 | python | Runtime Error |
N = list(map(int,input().split()))[0]
lis = [[] for i in range(N)]
for a_i,b_i in [ map(int,input().split()) for _ in range(N-1) ]:
lis[a_i-1].append(b_i-1)
lis[b_i-1].append(a_i-1)
flag = False
while True:
flag = False
sumsum = 0
for x in lis:
sumsum += sum(x)
if sumsum == 0:
print("Second")
quit()
fo... | N = list(map(int,input().split()))[0]
lis = [[] for i in range(N)]
for a_i,b_i in [ map(int,input().split()) for _ in range(N-1) ]:
lis[a_i-1].append(b_i-1)
lis[b_i-1].append(a_i-1)
while True:
sumsum = 0
for x in lis:
sumsum += sum(x)
if sumsum == 0:
print("Second")
quit()
for i in range(len(lis)):
... | s963711784 | s691397614 | p03726 | python | Time Limit Exceeded |
import numpy as np
import math
n = int(input())
a = list(map(int,input().split()))
maenogoukei = a[0]
goukei = a[0]
kaisuu = 0
if goukei == 0:
kaisuu += 1
maenogoukei = -1
goukei = maenogoukei
for a_i in a[1:]:
goukei += a_i
if maenogoukei > 0 and goukei >= 0:
kaisuu += goukei + 1
goukei = -1
maenogou... | import numpy as np
import math
n = int(input())
a = list(map(int,input().split()))
maenogoukei = a[0]
goukei = a[0]
kaisuu = 0
if goukei == 0:
kaisuu += 1
maenogoukei = -1
goukei = maenogoukei
for a_i in a[1:]:
goukei += a_i
if maenogoukei > 0 and goukei >= 0:
kaisuu += goukei + 1
goukei = -1
maenogou... | s645926008 | s860998750 | p03741 | python | Runtime Error |
n = int(input())
n = int(log2(n))+1
print(2**n-1) | import math
n = int(input())
n = int(math.log2(n))+1
print(2**n-1) | s678157010 | s068931455 | p02786 | python | Runtime Error |
S=input()
if len(S)%2 != 0:
print("No")
exit()
for i in range(int(len(S)/2)):
if S[i*2]!="h":
print("No")
exit()
if S[i*2+1]!="i":
Print("No")
exit()
print("Yes") | S=str(input())
if len(S)%2 != 0:
print("No")
exit()
for i in range(int(len(S)/2)):
if S[i*2]!="h":
print("No")
exit()
if S[i*2+1]!="i":
print("No")
exit()
print("Yes") | s812614499 | s086695404 | p02747 | python | Runtime Error |
n=int(input())
i=0
JPY=0
while n > i:
i=i+1
a,b=map(str,input().split())
a = float(a)
if b == "JPY":
JPY=JPY+a
else:
JPY=JPY+a*380000
print(JPY) | input=input()
if input < "2019/04/31":
print("Heisei")
else:
print("TBD") | s871080931 | s200097617 | p03109 | python | Runtime Error |
S = input()
N,A,B = S.split(' ')
N = int(N)
A = int(A)
B = int(B)
ans = N //(A+B) * A
left = N % (A+B)
if left > A:
ans += A
else:
ans += left
print(ans) | S = str(input())
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | s072194659 | s841881986 | p02753 | python | Runtime Error |
S = str(Input())
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | S = str(input())
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | s085826056 | s841881986 | p02753 | python | Runtime Error |
S = Input()
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | S = str(input())
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | s729716637 | s841881986 | p02753 | python | Runtime Error |
S = Input()
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | S = str(input())
if S.count('AB') is 0 and S.count('BA') is 0:
print('No')
else:
print('Yes') | s168853118 | s841881986 | p02753 | python | Runtime Error |
S = Input()
N,A,B = S.split(' ')
N = int(N)
A = int(A)
B = int(B)
ans = N //(A+B) * A
left = N % (A+B)
if left > A:
ans += A
else:
ans += left
print(ans) | S = input()
N,A,B = S.split(' ')
N = int(N)
A = int(A)
B = int(B)
ans = N //(A+B) * A
left = N % (A+B)
if left > A:
ans += A
else:
ans += left
print(ans) | s354800980 | s804432524 | p02754 | python | Runtime Error |
S = input()
N,A,B = S.split(' ')
N = int(N)
A = int(A)
B = int(B)
till = int(N/(A+B))*(A+B)
left = N - till
leftover = ('b'*A + 'r'*B)[:left]
leftcount = leftover.count('b')
print(int(N/(A+B))*A + leftcount) | S = input()
N,A,B = S.split(' ')
N = int(N)
A = int(A)
B = int(B)
ans = N //(A+B) * A
left = N % (A+B)
if left > A:
ans += A
else:
ans += left
print(ans) | s207172068 | s804432524 | p02754 | python | Runtime Error |
S = Input().split(' ')
A = int(S[0])
B = int(S[1])
A_t = A/0.08
B_t = B/0.1
if A_t == B_t:
print(A_t)
else:
print(-1) | import math
S = input().split(' ')
A = int(S[0])
B = int(S[1])
p = -1
for x in range(2100):
if math.floor(x*0.08) == A and math.floor(x*0.1) == B:
p = x
break
print(p) | s334683366 | s903339898 | p02755 | python | Runtime Error |
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
dump = []
res = 'YES'
for x in range(int(a[0])):
if arra[x] in dump:
res = 'NO'
break
dump.append(arra[x])
print(res)
| import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if len(arra) == len(set(arra)):
print('YES')
else:
print('NO') | s394303959 | s261936511 | p02779 | python | Time Limit Exceeded |
import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
dump = []
res = 'YES'
for x in range(int(a[0])):
if arra[x] in dump:
res = 'NO'
dump.append(arra[x])
print(res)
| import sys
msg = sys.stdin.readlines()
a = []
for x in msg:
a.append(x.replace('\n', ''))
arra = a[1].split(' ')
arra = [int(x) for x in arra]
if len(arra) == len(set(arra)):
print('YES')
else:
print('NO') | s119426814 | s261936511 | p02779 | python | Time Limit Exceeded |
N, A, B =map(int(), input().split())
ans = 0
for i in range(1, N+1):
if A <= sum(list(map(int, list(str(i))))) <= B:
ans += i
print(ans) | n, a, b = map(int, input().split())
ans = 0
for i in range(n+1):
if a <= sum(list(map(int, list(str(i))))) <= b:
ans += i
print(ans) | s951480579 | s053801735 | p03478 | python | Runtime Error |
A = [int(x) for x in input().split()]
N = int(input())
flag = True
count=0
while(flag):
for i in range(N):
if A[i]%2 == 1 :
flag=False
break
else:
A[i] /= 2
if flag:
count += 1
print(count)
| N = int(input())
A = [int(x) for x in input().split()]
flag = True
count=0
while(flag):
for i in range(N):
if A[i]%2 == 1 :
flag=False
break
else:
A[i] /= 2
if flag:
count += 1
print(count) | s575232183 | s488393186 | p03494 | python | Runtime Error |
lines = []
line = input()
s = line.split(' ')
entries = int(s[2]) + 2
for i in range(entries+1):
lines.append(line.split(' '))
if i < entries:
line = input()
discounts = []
for idx, line in enumerate(lines):
if idx == 0:
A = line[0]
B = line[1]
M = line[2]
elif idx == 1:... | s = input()
num = len(s)
if num % 2 != 0:
print('No')
else:
hitachi = 'hi' * int(num / 2)
if hitachi == s:
print('Yes')
else:
print('No')
| s392693887 | s270094513 | p02747 | python | Runtime Error |
impotr re
s = input()
pattern = 'hi'
m = re.search(pattern, s)
if m:
print('Yes')
else:
print('No') | s = input()
num = len(s)
if num % 2 != 0:
print('No')
else:
hitachi = 'hi' * int(num / 2)
if hitachi == s:
print('Yes')
else:
print('No')
| s748118631 | s270094513 | p02747 | python | Runtime Error |
from copy import deepcopy
string_in = input("input : ")
check_str = "hi"
max_count = string_in.count(check_str)
check_obj = ["hi"*i for i in range(1,max_count+1)][::-1]
string_in4 = deepcopy(string_in)
count = 0
for i in range(len(check_obj)):
i_str = str(check_obj[i])
string_in4 = string_in4.replace(i_str, '%d'%... |
string_in = input()
n_str = len(string_in)
string_in = string_in.replace("hi", '%d'%(1))
if n_str == string_in.count('%d'%(1))*2:
print("Yes")
else:
print("No") | s712512114 | s880434837 | p02747 | python | Runtime Error |
A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
x = [0 for i in range(M)]
y = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
non_coupon_val = min(a) + min(b)
coupon_val_arr = [0 for i in ra... | A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
x = [0 for i in range(M)]
y = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
non_coupon_val = min(a) + min(b)
coupon_val_arr = [0 for i in ra... | s634157555 | s156497889 | p02748 | python | Runtime Error |
A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
x = [0 for i in range(M)]
y = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
non_coupon_val = min(a) + min(b)
coupon_val_arr = [0 for i in r... | A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
x = [0 for i in range(M)]
y = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
non_coupon_val = min(a) + min(b)
coupon_val_arr = [0 for i in ra... | s821778403 | s156497889 | p02748 | python | Runtime Error |
import numpy as np
A, B, M = map(int, input().split())
a = np.array([int(i) for i in input().split()], dtype=int)
b = np.array([int(i) for i in input().split()], dtype=int)
x = np.zeros(M, dtype=int)
y = np.zeros(M, dtype=int)
c = np.zeros(M, dtype=int)
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())... | A, B, M = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
x = [0 for i in range(M)]
y = [0 for i in range(M)]
c = [0 for i in range(M)]
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
non_coupon_val = min(a) + min(b)
coupon_val_arr = [0 for i in ra... | s516072589 | s156497889 | p02748 | python | Runtime Error |
N,A,B = map(int, input().split())
adds = A + B
times = (N-1) // (adds + 1)
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tm... | N,A,B = map(int, input().split())
adds = A + B
times = N // adds
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
... | s811920872 | s953362536 | p02754 | python | Time Limit Exceeded |
N,A,B = map(int, input().split())
boalsLen = 0
count = 0
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
boalsLen += B
count += A
print(count) | N,A,B = map(int, input().split())
adds = A + B
times = N // adds
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
... | s980019454 | s953362536 | p02754 | python | Time Limit Exceeded |
N,A,B = map(int, input().split())
addBlue = 'b'*A
addRed = 'r'*B
count = 0
boals = ''
while len(boals) < N:
boals += addBlue
boals += addRed
count += A
print(count - boals[N:len(boals)].count('b')) | N,A,B = map(int, input().split())
adds = A + B
times = N // adds
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
... | s017759062 | s953362536 | p02754 | python | Runtime Error |
N,A,B = map(int, input().split())
addBlue = 'b'*A
addRed = 'r'*B
boals = ''
while len(boals) < N:
boals += addBlue
boals += addRed
print(boals[:N].count('b')) | N,A,B = map(int, input().split())
adds = A + B
times = N // adds
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
... | s179317435 | s953362536 | p02754 | python | Runtime Error |
N,A,B = map(int, input().split())
boals = ''
while len(boals) < N:
for i in range(A):
boals += 'b'
for i in range(B):
boals += 'r'
print(boals[:N].count('b'))
| N,A,B = map(int, input().split())
adds = A + B
times = N // adds
boalsLen = adds * times
count = A * times
while True:
if boalsLen > N:
break
tmpBoalsLen = boalsLen + A
if tmpBoalsLen > N:
addBoals = N - boalsLen
count += addBoals
break
boalsLen = tmpBoalsLen
... | s238752656 | s953362536 | p02754 | python | Time Limit Exceeded |
N = int(input())
A = list(map(int, input().split()))
count = 0
ans = -1
i = 0
while len(A) != 0:
if A[i] != i + 1:
A.remove(A[i])
count += 1
elif i < len(A) -1:
i += 1
else:
ans = count
break
print(ans) | N = int(input())
A = list(map(int, input().split()))
count = 0
i = 1
for a in A:
if a != i:
count += 1
else:
i += 1
if count == len(A):
print(-1)
else:
print(count) | s703433418 | s856866992 | p02832 | python | Runtime Error |
N = int(input())
S = input()
minimum = 300000
for i in range(N):
leftWestNum = S[:i].count('W')
rightEstNum = S[i+1:N].count('E')
tmpMin = leftWestNum + rightEstNum
if tmpMin < minimum:
minimum = tmpMin
print(minimum)
| N = int(input())
S = input()
#------------------------------
#########タイムオーバー########
#------------------------------
# minimum = 300000
# for i in range(N):
# leftWestNum = S[:i].count('W')
# rightEstNum = S[i+1:N].count('E')
# tmpMin = leftWestNum + rightEstNum
# if tmpMin < minimum:
# minimum... | s755504787 | s132878717 | p03339 | python | Time Limit Exceeded |
N = int(input())
S = [input() for i in range(N)]
M = int(input())
T = [input() for i in range(N)]
sCount = {}
for s in S:
sCount[s] = S.count(s)
tCount = {}
for t in T:
tCount[t] = T.count(t)
union = sCount.keys() & tCount.keys()
ans = sCount;
for i in union:
ans[i] = sCount[i] - tCount[i]
print(max... | N = int(input())
S = [input() for i in range(N)]
M = int(input())
T = [input() for i in range(M)]
sCount = {}
for s in S:
sCount[s] = S.count(s)
tCount = {}
for t in T:
tCount[t] = T.count(t)
union = sCount.keys() & tCount.keys()
ans = sCount;
for i in union:
ans[i] = sCount[i] - tCount[i]
if max(an... | s412114578 | s138371131 | p03408 | python | Runtime Error |
print(list(map(int, input().split())))
if a*b % 2 == 0:
print("Even")
else:
print("Odd") | x = list(map(int, input().split()))
a = x[0]
b=x[1]
if a*b % 2 == 0:
print("Even")
else:
print("Odd") | s853651914 | s941114966 | p03455 | python | Runtime Error |
N = int(input())
nums = [int(input()) for i in range(N)]
ans = []
count = 0
for num in nums:
try:
idx = ans.index(num)
except ValueError:
idx = -1
if idx == -1:
ans.append(num)
count += 1
else:
ans[idx] = 0
count -= 1
print(count)
| N = int(input())
nums = [int(input()) for i in range(N)]
idxs = set(nums)
ans = {idxs.pop() : 0 for i in range(len(idxs))}
count = 0
for num in nums:
ans[num] += 1
for i in ans.keys():
ans[i] = (ans[i] % 2)
print(sum(ans.values()))
| s310017589 | s058503457 | p03607 | python | Time Limit Exceeded |
N = int(input())
nums = [int(input()) for i in range(N)]
ans = []
count = 0
for num in nums:
if ans.count(num) == 0:
ans.append(num)
count += 1
else:
ans.remove(num)
count -= 1
print(count)
| N = int(input())
nums = [int(input()) for i in range(N)]
idxs = set(nums)
ans = {idxs.pop() : 0 for i in range(len(idxs))}
count = 0
for num in nums:
ans[num] += 1
for i in ans.keys():
ans[i] = (ans[i] % 2)
print(sum(ans.values()))
| s181617047 | s058503457 | p03607 | python | Time Limit Exceeded |
N = int(input())
nums = [int(input()) for i in range(N)]
ans = []
for num in nums:
if ans.count(num) == 0:
ans.append(num)
else:
ans.remove(num)
print(len(ans)) | N = int(input())
nums = [int(input()) for i in range(N)]
idxs = set(nums)
ans = {idxs.pop() : 0 for i in range(len(idxs))}
count = 0
for num in nums:
ans[num] += 1
for i in ans.keys():
ans[i] = (ans[i] % 2)
print(sum(ans.values()))
| s811292073 | s058503457 | p03607 | python | Time Limit Exceeded |
s = input()
initial = s[0]
final = s[len(s) - 1]
print(initial + str(len(s - 2)) + final) | s = input()
initial = s[0]
final = s[len(s) - 1]
print(initial + str(len(s)-2) + final)
| s091422289 | s618259377 | p03636 | python | Runtime Error |
N = int(input())
A = list(map(int, input().split()))
currentSum = 0
count3 = 0
count4 = 0
currentSum = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count3 += abs(currentSum) + 1
currentSum = 1
elif currentSum >= 0 and restSum > 0:
... | N = int(input())
A = list(map(int, input().split()))
currentSum = 0
count1 = 0
count2 = 0
count3 = 0
count4 = 0
for i in range(N):
restSum = currentSum
currentSum += A[i]
if currentSum <= 0 and restSum < 0:
count1 += abs(currentSum) + 1
currentSum = 1
elif currentSum >= 0 and restSum > ... | s294893245 | s919392380 | p03739 | python | Runtime Error |
K,S = map(int,input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
sumn = x + y + z
if sumn == S:
ans += 1
print(ans)
| K,S = map(int,input().split())
ans = 0
for x in range(K+1):
for y in range(K+1):
sumn = S - (x + y)
if sumn >= 0 and sumn <= K:
ans += 1
print(ans) | s178100476 | s955247489 | p03835 | python | Time Limit Exceeded |
N,A,B = map(int,input().split())
count = 0
Bs = "b"*A
Rs = "r"*B
ballset = Bs+Rs
#print(Bs)
#print(Rs)
n = (N//len(ballset)+1)
#print(len(ballset))
#print(n)
allball = ballset*n
print(allball)
print(allball[:N].count("b"))
| N,A,B = map(int,input().split())
count = 0
a = N//(A+B)
#print(a)
count += a*A
#print(count)
b = N%(A+B)
if b > A:
count +=A
else:
count +=b
print(count)
| s627355227 | s133281896 | p02754 | python | Runtime Error |
N,A,B = map(int,input().split())
count = 0
Bs = "b"*A
Rs = "r"*B
ballset = Bs+Rs
#print(Bs)
#print(Rs)
n = (N//len(ballset)+1)
#print(len(ballset))
#print(n)
allball = ballset*n
print(allball[:N].count("b"))
| N,A,B = map(int,input().split())
count = 0
a = N//(A+B)
#print(a)
count += a*A
#print(count)
b = N%(A+B)
if b > A:
count +=A
else:
count +=b
print(count)
| s988114716 | s133281896 | p02754 | python | Runtime Error |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
ans = []
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
ans.append(a)
ans.sort(reverse=True)
print(ans[0]/2)
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s377736807 | s316964741 | p02780 | python | Time Limit Exceeded |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = (1+P)/2
kitaichi.append(kitai)
ans = []
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
ans.append(a)
ans.sort(reverse=True)
print(ans[0])
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s157205932 | s316964741 | p02780 | python | Time Limit Exceeded |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = (((P*(P+1)/2))/P)
kitaichi.append(kitai)
ans = []
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
ans.append(a)
print(max(ans))
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s941106290 | s316964741 | p02780 | python | Time Limit Exceeded |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = (((P*(P+1)/2))/P)
kitaichi.append(kitai)
ans = []
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
ans.append(a)
ans.sort(reverse=True)
print(ans[0])
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s006397863 | s316964741 | p02780 | python | Time Limit Exceeded |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = (((P*(P+1)/2))/P)
kitaichi.append(kitai)
ans = 0
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
if a > ans:
ans = a
print(ans)
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s629723023 | s316964741 | p02780 | python | Time Limit Exceeded |
n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = (((P*(P+1)/2))/P)
kitaichi.append(kitai)
ans = 0
for j in range((n-k)+1):
a = sum(kitaichi[j:j+k])
if a > ans:
ans = a
print(ans)
| n,k = map(int,input().split())
p = list(map(int,input().split()))
kitaichi = []
for i in range(n):
P = p[i]
kitai = 1+P
kitaichi.append(kitai)
m = [0,]
a = 0
for j in range(n):
a += kitaichi[j]
m.append(a)
ans = 0
for l in range(n-k+1):
temp = m[l+k]-m[l]
if temp> ans:
ans = temp
print... | s228071502 | s316964741 | p02780 | python | Time Limit Exceeded |
H,N = map(int,input().split())
Alist = []
for i in range(N):
A = int(input())
Alist.append(A)
print(Alist) | H,N = map(int,input().split())
A = list(map(int,input().split()))
if sum(A) < H:
print("No")
else:
print("Yes")
| s844951307 | s972123956 | p02784 | python | Runtime Error |
N,K = map(int,input().split())
H = list(map(int,input().split()))
if K == 0:
print(sum(H))
else:
H.sort(reverse = True)
if N>K:
for i in range(K):
del H[i]
print(sum(H))
else:
print(0)
| N,K = map(int,input().split())
H = list(map(int,input().split()))
if K == 0:
print(sum(H))
else:
H.sort(reverse = True)
if N>K:
h = H[K:N]
print(sum(h))
# for i in range(K):
# del H[i]
# print(sum(H))
else:
print(0)
| s425067435 | s160140676 | p02785 | python | Runtime Error |
N = int(input())
if N%2==1:
print(N-1)
else:
ans = []
for i in range(1,N):
for j in range(1,N):
cnt=0
if i*j==N:
cnt +=i-1
cnt +=j-1
ans.append(str(cnt))
ans=min(ans)
print(ans)
| A,B = map(int,input().split())
if A<10 and B<10:
print(A*B)
else:
print(-1)
| s643699504 | s484117499 | p02879 | python | Runtime Error |
A,B=map(int,input().split())
set = 0
for i in range(1,20):
if B==1:
set -=1
break
elif A == B:
set +=1
break
elif ((A-1)*i)+A >= B:
set +=1
break
else:
set +=1
print(set+1)
| s = input ()
t = input ()
count = 0
for i in range(3):
if s[i]==t[i]:
count += 1
print (count) | s401307140 | s019207242 | p02921 | python | Runtime Error |
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
dis=list[a,b,c,d,e,k]
if max(dis)-min(dis)>=K:
print(":(")
else("Yay!") | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
dis =[]
dis.append(a)
dis.append(b)
dis.append(c)
dis.append(d)
dis.append(e)
if max(dis)-min(dis)>k:
print(":(")
else:
print("Yay!") | s655531843 | s680293032 | p03075 | python | Runtime Error |
S = input()
l = len(S)
count=0
ans=[]
for i in range(l):
if S[i]=="A" or S[i]=="C" or S[i]=="G" or S[i]=="T":
count +=1
else:
ans.append(count)
count=0
print(max(ans))
| S = input()
l = len(S)
count=0
ans= 0
for i in range(l):
if S[i] in ["A" ,"C" ,"G","T"]:
count +=1
else:
count=0
ans = max(count,ans)
print(ans) | s945700648 | s057101613 | p03086 | python | Runtime Error |
S = input()
if len(S) == 1:
print('No')
elif len(S) == 2:
if S[0] == 'h' and S[1] == 'i':
print('Yes')
else:
print('No')
else:
for i in range(len(S)-2):
if S[i] == 'h' and S[i + 1] == 'i' and S[i + 2] != 'i':
print('Yes')
exit(1)
print('No')
| S = input()
ans = ''
flag = False
for i in range(5):
ans += 'hi'
if ans == S:
flag = True
print('Yes' if flag else 'No') | s917686958 | s326027848 | p02747 | python | Runtime Error |
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + a[y-1] - c)
print(ans)
| A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + b[y-1] - c)
print(ans)
| s221666359 | s533019994 | p02748 | python | Runtime Error |
A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + a[y-1] - c)
print(ans)
| A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a) + min(b)
for i in range(M):
x, y, c = map(int, input().split())
ans = min(ans, a[x-1] + b[y-1] - c)
print(ans)
| s164427615 | s533019994 | p02748 | python | Runtime Error |
N, M = map(int, input().split())
P = [input().split() for i in range(M)]
k3, k2, k1 = 0, 0, 0
if N == 3:
for i in range(M):
if P[i][0] == '1':
if k3 != 0:
k3 = min(k3, int(P[i][1]))
else:
k3 = int(P[i][1])
elif P[i][0] == '2':
if k... |
def solve(x):
x = str(x)
if len(x) != N:
return False
for s, c in P:
if x[s - 1] != str(c):
return False
return True
if __name__ == "__main__":
N, M = map(int, input().split())
P = [list(map(int, input().split())) for i in range(M)]
ans = 10**N
for i in rang... | s721732773 | s327083364 | p02761 | python | Runtime Error |
N = int(input())
l = []
for i in map(int, input().split()):
if i in l:
print("NO")
exit(0)
l.append(i)
print("YES") | N = int(input())
A = set(map(int, input().split()))
print("YES" if len(A) == N else "NO") | s345441403 | s950942302 | p02779 | python | Time Limit Exceeded |
N = int(input())
l = []
for i in map(int, input().split()):
if i in l:
print("NO")
exit()
l.append(i)
print("YES") | N = int(input())
A = set(map(int, input().split()))
print("YES" if len(A) == N else "NO") | s808149312 | s950942302 | p02779 | python | Time Limit Exceeded |
N = int(input())
l = []
for i in range(N):
A = int(input())
if A in l:
print("NO")
exit()
l.append(i)
print("YES") | N = int(input())
A = set(map(int, input().split()))
print("YES" if len(A) == N else "NO") | s542803376 | s950942302 | p02779 | python | Runtime Error |
N = int(input())
A = list(map(int, input().split()))
l = []
for i in A:
if i in l:
print("NO")
exit()
l.append(i)
print("YES") | N = int(input())
A = set(map(int, input().split()))
print("YES" if len(A) == N else "NO") | s277478084 | s950942302 | p02779 | python | Time Limit Exceeded |
from math import ceil
N, K = map(int, input().split())
P = list(map(int, input().split()))
E = [0]
E.append(sum([i for i in range(1, P[0] + 1)])/P[0])
for i in range(1,N):
p = P[i]
SUM = sum([i for i in range(1, p + 1)])
E.append(E[i] + SUM / p)
r = K
ans = 0
while r < N + 1:
ans = max(ans, E[r] - E[r -... | from math import ceil
N, K = map(int, input().split())
P = list(map(int, input().split()))
E = [0]
E.append(sum([i for i in range(1, P[0] + 1)])/P[0])
for i in range(1,N):
p = P[i]
E.append(E[i] + ((1+p) / 2))
r = K
ans = 0
while r < N + 1:
ans = max(ans, E[r] - E[r - K])
r += 1
print(ans) | s096051870 | s516213972 | p02780 | python | Time Limit Exceeded |
from math import ceil
N, K = map(int, input().split())
P = list(map(int, input().split()))
E = []
for i in range(N):
p = P[i]
SUM = sum([i for i in range(1, p + 1)])
E.append(SUM/p)
l = 0
r = K - 1
ans = 0
while r < N:
ans = max(ans, sum(E[l:r+1]))
l += 1
r += 1
print(ans) | from math import ceil
N, K = map(int, input().split())
P = list(map(int, input().split()))
E = [0]
E.append(sum([i for i in range(1, P[0] + 1)])/P[0])
for i in range(1,N):
p = P[i]
E.append(E[i] + ((1+p) / 2))
r = K
ans = 0
while r < N + 1:
ans = max(ans, E[r] - E[r - K])
r += 1
print(ans) | s255778049 | s516213972 | p02780 | python | Time Limit Exceeded |
import math
A, B, K = map(int, input().split())
if A > K:
A = A - K
print(A, end=" ")
print(B)
exit(0)
if K > A:
K = K - A
A = 0
if K >= B:
K = K - B
B = 0
if B > K:
B = B - K
print(A, end=" ")
print(B)
exit(0)
for i in range(K)... | import math
A, B, K = map(int, input().split())
if A >= K:
A = A - K
print(A, end=" ")
print(B)
exit(0)
if K > A:
K = K - A
A = 0
if K >= B:
B = 0
print(A, end=" ")
print(B)
exit(0)
if B > K:
B = B - K
print(A, end=" ")
print(B)
... | s512651772 | s254905546 | p02818 | python | Time Limit Exceeded |
import math
A, B, K = map(int, input().split())
if A > K:
A = A - K
print(A, end=" ")
print(B)
exit(0)
if K > A:
K = K - A
A = 0
if K >= B:
K = K - B
B = 0
for i in range(K):
if A >= 1:
A -= 1
elif B >= 1:
B -= 1
if A == 0 and B == 0:
... | import math
A, B, K = map(int, input().split())
if A >= K:
A = A - K
print(A, end=" ")
print(B)
exit(0)
if K > A:
K = K - A
A = 0
if K >= B:
B = 0
print(A, end=" ")
print(B)
exit(0)
if B > K:
B = B - K
print(A, end=" ")
print(B)
... | s755726757 | s254905546 | p02818 | python | Time Limit Exceeded |
import math
A, B, K = map(int, input().split())
gcd = math.gcd(A, B)
A = A // gcd
B = B // gcd
for i in range(K):
if A >= 1:
A -= 1
elif B >= 1:
B -= 1
if A == 0 and B == 0:
break
print(A, end=" ")
print(B) | import math
A, B, K = map(int, input().split())
if A >= K:
A = A - K
print(A, end=" ")
print(B)
exit(0)
if K > A:
K = K - A
A = 0
if K >= B:
B = 0
print(A, end=" ")
print(B)
exit(0)
if B > K:
B = B - K
print(A, end=" ")
print(B)
... | s976379654 | s254905546 | p02818 | python | Runtime Error |
from math import sqrt
N = int(input())
k = [list(map(int, input().split())) for _ in range(N)]
result = 0
for i in range(N):
for j in range(N):
if i != j:
result += sqrt((k[i][0] - k[j][0]) * (k[i][0] - k[j][0]) + (k[i][1] - k[j][1]) * (k[i][1] - k[j][1]))
print(result / N) | r = int(input())
print(r**2) | s218044663 | s312409588 | p02859 | python | Runtime Error |
N = int(input())
S = input()
S1 = []
for i in range(N // 2):
S1.append(S[i])
S = S[N // 2 :]
S1 = ''.join(S1)
if S1 == S:
print('Yes')
else:
print('No') | r = int(input())
print(r**2) | s835460629 | s312409588 | p02859 | python | Runtime Error |
from math import sqrt
N = int(input())
k = [[int(i) for i in input().split()] for i in range(N)]
result = 0
for i in range(N):
for j in range(N):
if i != j:
result += sqrt((k[i][0] - k[j][0]) * (k[i][0] - k[j][0]) + k[i][1] - k[j][1]) * (k[i][1] - k[j][1]))
print(result / N) |
from math import sqrt
N = int(input())
k = [list(map(int, input().split())) for _ in range(N)]
result = 0
for i in range(N):
for j in range(N):
if i != j:
result += sqrt((k[i][0] - k[j][0]) * (k[i][0] - k[j][0]) + (k[i][1] - k[j][1]) * (k[i][1] - k[j][1]))
print(result / N) | s783744643 | s469542360 | p02861 | python | Runtime Error |
N = int(input())
ans = 10*10
#N<10**12より√N<10**6]
for i in range(1, i*i <=N):
if (N % i != 0): continue
j = N / i
ans = min(ans, i + j - 2)
print(ans) | from math import sqrt
from sys import exit
N = int(input())
for i in range(int(sqrt(N)) + 1, -1, -1):
if N % i == 0:
print((i - 1) + (N // i - 1))
exit() | s558600202 | s882297835 | p02881 | python | Runtime Error |
N = int(input())
ans = 10*18
for i in range(1, i*i <=N):
if (N % i != 0): continue
j = N / i
ans = min(ans, i + j - 2)
print(ans) | from math import sqrt
from sys import exit
N = int(input())
for i in range(int(sqrt(N)) + 1, -1, -1):
if N % i == 0:
print((i - 1) + (N // i - 1))
exit() | s024983533 | s882297835 | p02881 | python | Runtime Error |
N = int(input())
A = list(map(int, input().split()))
for i in range(1,N+1):
for j in range(0,N):
if i == A[j]:
print(j+1,end=" ")
| N = int(input())
A = list(map(int, input().split()))
target = []
for i in range(0, N):
target.append([A[i], i + 1])
target.sort()
for i in range(0, N):
print(target[i][1],end=" ") | s220926622 | s374677583 | p02899 | python | Time Limit Exceeded |
N, K, Q = map(int, input().split())
point = [K for i in range(N)]
A = [int(input()) for j in range(Q)]
for num in A:
for j in range(1,N+1):
if not j == num:
point[j-1] -= 1
for num in point:
if num > 0:
print('Yes')
continue
print('No')
| N, K, Q = map(int, input().split())
point = [K - Q for i in range(N)]
A = [int(input()) for j in range(Q)]
for num in A:
point[num-1] += 1
for num in point:
if num > 0:
print('Yes')
continue
print('No')
| s260952723 | s262616015 | p02911 | python | Time Limit Exceeded |
N = int(input())
H = list(map(int, input().split()))
count = []
c = 0
H.reverse()
for i in range(1, len(H)):
if H[i] >= H[i - 1]:
c += 1
continue
count.append(c)
c = 0
print(max(count)) | N = int(input())
H = list(map(int, input().split()))
ans = 0
c = 0
H.reverse()
for i in range(1, len(H)):
if H[i] >= H[i - 1]:
c += 1
else:
c = 0
ans = max(c, ans)
print(ans) | s048300069 | s062806297 | p02923 | python | Runtime Error |
N = int(input())
H = list(map(int, input().split()))
if H[1] == H[0] + 1:
print("Yes")
elif H[0] - 1 == H[1]:
print("Yes")
else:
print("No")
| N = int(input())
H = list(map(int, input().split()))
H[0] -= 1
count = 0
for i in range(1, N):
if H[i] > H[i - 1]:
H[i] -= 1
for i in range(1, N):
if H[i] <H[i - 1]:
print("No")
exit()
print("Yes") | s822048595 | s168704841 | p02953 | python | Runtime Error |
#N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
fenum = sum(A)
if B[0] >= A[0]:
B[0] -= A[0]
A[0] = 0
if B[0] > A[1]:
A[1] = 0
else:
A[1] -= B[0]
B[0] = 0
else:
A[0] -= B[0]
B[0] = 0
for i in range(1, len(B)):
if B... | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
fenum = sum(A)
if B[0] >= A[0]:
B[0] -= A[0]
A[0] = 0
if B[0] > A[1]:
A[1] = 0
else:
A[1] -= B[0]
B[0] = 0
else:
A[0] -= B[0]
B[0] = 0
for i in range(1, N):
if B[i] >=... | s861931797 | s984269162 | p02959 | python | Runtime Error |
W, H ,x, y = map(int, input().split())
if W % x == 0 and H % y == 0:
print((W * H) /2, 1)
else:
if x > y:
print(min(W * y, W * (H - y)), 0)
else:
print(min(H * x, H * (W - x)), 0)
| W, H ,x, y = map(int, input().split())
print(W * H / 2, end=" ")
if 2 * x == W and 2 * y == H:
print(1)
else:
print(0)
| s311832752 | s793733483 | p03001 | python | Runtime Error |
W, H ,x, y = map(int, input().split())
difx = W - x
dify = H - y
if W % x == 0 and H % y == 0:
print(W * dify, 1)
else:
if difx >= dify:
print(difx* H, 0)
else:
print(dify * W,0)
| W, H ,x, y = map(int, input().split())
print(W * H / 2, end=" ")
if 2 * x == W and 2 * y == H:
print(1)
else:
print(0)
| s927699903 | s793733483 | p03001 | python | Runtime Error |
W, H, x, y = map(int, input().split())
c = 0
if W == H or (x == W and y == H) or (x == 0 and y == H) or (x == W or y == 0) or (y == 0 and x == 0):
c = 1
if x > W // 2:
min1 = H * (W - x)
if y > H // 2:
mini2 = (H - y) * W
else:
mini2 = y * W
print(max(mini1, mini2),c)
else:
... | W, H ,x, y = map(int, input().split())
print(W * H / 2, end=" ")
if 2 * x == W and 2 * y == H:
print(1)
else:
print(0)
| s018815151 | s793733483 | p03001 | python | Runtime Error |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.