problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02556 | s049258127 | Accepted | n=int(input())
tens=[]
for i in range(n):
x,y=map(int,input().split())
tens.append([x,y])
tasu=[]
hiku=[]
for i in range(n):
tasu.append(tens[i][0]+tens[i][1])
hiku.append(tens[i][0]-tens[i][1])
#print(tasu,hiku)
a=max(tasu)-min(tasu)
b=max(hiku)-min(hiku)
print(max(a,b)) |
p03637 | s013185472 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
x = 0
y = 0
for i in a:
if i %2 != 0:
x+=1
elif i%4 == 0:
y+=1
if y >=x:
print('Yes')
else:
if x+y == len(a):
if y == x-1:
print('Yes')
print('No') |
p03087 | s061612435 | Accepted | N, Q = map(int, input().split())
S = input()
A = [0, 0]
for i in range(1, N):
if S[i - 1] == 'A' and S[i] == 'C':
A.append(A[i] + 1)
else:
A.append(A[i])
for i in range(Q):
l, r = map(int, input().split())
print(A[r] - A[l])
|
p02731 | s130924994 | Accepted | import math
import numpy as np
L = int(input())
a0 = L/3
print(a0*a0*a0)
|
p03069 | s791014284 | Accepted | n = int(input())
s = input()
s_list = []
for item in s:
if item == '.':
s_list.append(0)
else:
s_list.append(1)
min_val = s_list.count(0)
left_val = 0
right_val = s_list.count(0)
for i in range(len(s_list)):
if s_list[i] == 0:
right_val -= 1
min_val = min(left_val + right_val, min_val)
else:
left_val += 1
print(min_val)
|
p02554 | s342273208 | Accepted | import sys
input = sys.stdin.readline
N = int(input())
if N == 1:
print(0)
exit(0)
mod = 10 ** 9 + 7
res = pow(10, N, mod) - pow(9, N, mod) * 2 + pow(8, N, mod)
print(res % mod) |
p03345 | s658020586 | Accepted | #A - Fairness
A,B,C,K = map(int, input().split())
if K % 2 == 0:
ans = A - B
else:
ans = B - A
if abs(ans) >= 10**18:
print("Unfair")
else:
print(ans)
|
p03327 | s092963762 | Accepted | n = int(input())
if n < 1000:
print("ABC")
else:
print("ABD") |
p03861 | s611050257 | Accepted | a,b,x=map(int,input().split())
print(b//x-(a-1)//x) |
p02743 | s445595312 | Accepted | a,b,c = map(int,input().split())
if c - b - a <= 0:
print("No")
elif 4*a*b < (c-b-a)**2:
print("Yes")
else:
print("No") |
p02971 | s748012593 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
A = []
for _ in range(N):
A.append(int(input()))
first = max(A)
idx = A.index(first)
second = max(A[:idx]+A[idx+1:])
for i in range(N):
if i == idx:
print(second)
else:
print(first)
if __name__ == "__main__":
main()
|
p02627 | s923378400 | Accepted | input_line = input()
if input_line.isupper() == True:
print("A")
else:
print("a") |
p02772 | s332281585 | Accepted | N = int(input())
A = list(map(int,input().split()))
A_guu = [i for i in A if i % 2 == 0]
A_ans = [i for i in A_guu if i % 3 == 0 or i % 5 == 0]
# print(A_guu)
# print(A_ans)
if A_ans == A_guu:
print("APPROVED")
else:
print("DENIED")
|
p03095 | s745069011 | Accepted | from collections import Counter
MOD = 10**9 + 7
N = int(input())
S = input()
c = Counter(S)
ans = 1
for k in c.keys():
ans *= c[k]+1
ans %= MOD
ans -= 1
print(ans)
|
p02729 | s082077921 | Accepted | N, M = map(int, input().split())
print(M*(M-1)//2+N*(N-1)//2) |
p02939 | s010005565 | Wrong Answer | s = input()
n = len(s)
ans = 1
kar = s[0]
for i in range(n-1):
if kar == s[i+1]:
kar = kar + s[i+1]
elif kar != s[i+1]:
kar = s[i+1]
ans += 1
print(ans) |
p03730 | s000201692 | Accepted | # -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
for i in range(1, b + 1):
if (a * i) % b == c:
print("YES")
exit()
print("NO")
|
p04029 | s758751034 | Accepted | def resolve():
n = int(input())
print(n*(n+1)//2)
resolve() |
p02695 | s911565079 | Accepted | N,M,Q=map(int, input().split())
X=[list(map(int, input().split())) for i in range(Q)]
import itertools
a=[]
for i in range(1,M+1):
a.append(i)
A=list(itertools.combinations_with_replacement(a,N))
ans=0
for i in range(len(A)):
K=A[i]
p=0
for a,b,c,d in X:
if K[b-1]-K[a-1]==c:
p+=d
ans=max(p,ans)
print(ans) |
p02819 | s719314434 | Wrong Answer | x = int(input())
ans = x
while True:
for i in range(2, ans):
if ans % i == 0:
continue
else:
print(ans)
exit()
ans += 1 |
p02947 | s917555090 | Accepted | N = int(input())
s = ["".join(sorted(input())) for i in range(N)]
D = dict()
for st in s:
if st in D:
D[st] += 1
else:
D[st] = 1
ans = 0
for i in D:
k = D[i]
ans += (k*(k-1))//2
print(ans)
|
p02657 | s189946788 | Accepted | a,b = map(int,input().split())
print(a*b) |
p03210 | s858375791 | Accepted | n=int(input())
if n==3 or n==5 or n==7:
print("YES")
else:
print("NO") |
p03309 | s889451833 | Accepted | n=int(input())
Ai=[int(i) for i in input().split()]
Bi=[]
for i in range(n):
Bi.append(Ai[i]-(i+1))
Bi.sort()
b=Bi[n//2]
ans=0
for i in range(n):
ans+=abs(Bi[i]-b)
print(ans) |
p03208 | s791762700 | Accepted | n,k=map(int,input().split())
hs=sorted([int(input()) for _ in range(n)])
m=float('inf')
for l,h in zip(hs,hs[k-1:]):
m=min(m,h-l)
print(m)
|
p04005 | s053255584 | Accepted | a, b, c = map(int,input().split())
print(min(abs(a*b*((c-c//2)-c//2)), abs(a*c*((b-b//2)-b//2)), abs(c*b*((a-a//2)-a//2)))) |
p03625 | s439444497 | Wrong Answer | def find_max_rectangle(pair):
"""
Args:
pair (list)
Returns:
area (int)
"""
if pair:
M = max(pair)
second_max = -1
for num in pair:
if num != M and second_max < num:
second_max = num
return M * second_max
else:
return 0
n = int(input())
L = list(map(int, input().split()))
L.sort()
pair = []
prev = None
while L:
popped = L.pop()
if prev == popped:
pair.append(prev)
prev = None
else:
prev = popped
print(find_max_rectangle(pair))
|
p03286 | s561726652 | Accepted | N = int(input())
tmp = []
if(N == 0):
print('0')
else:
while(abs(N)!=0):
tmp.append(N%2)
N = (N - N % 2) // -2
tmp.reverse()
print(''.join([str(n) for n in tmp]))
|
p02801 | s526350840 | Wrong Answer | str1 = input()
asc = ord(str1) + 1
print(asc)
ans = chr(asc)
print(ans)
|
p03637 | s232662199 | Accepted | n=int(input())
a=list(map(int,input().split()))
b4=0
b2=0
b1=0
for i in range(n):
if a[i]%4==0:
b4+=1
elif a[i]%2==0:
b2+=1
else:
b1+=1
if b2==0:
if b1<=b4+1:
print("Yes")
else:
print("No")
else:
if b1<=b4:
print("Yes")
else:
print("No")
|
p03324 | s893495856 | Wrong Answer | a, b = map(int, input().split())
if a == 0:
if b == 100:
print(b + 1)
else:
print(b)
else:
cand = 100 **a
if b == 100**2 or 100**3:
print(cand * b + 1)
else:
print(cand * b) |
p02779 | s327017140 | Accepted | n = int(input())
s = [int(i) for i in input().split()]
s.sort()
flag = False
for i in range (0,n-1):
if s[i] == s[i+1]:
flag = True
break
if flag == True:
print("NO")
else: print("YES") |
p02640 | s224371465 | Wrong Answer | a = input()
b = a.split(" ")
x, y = int(b[0]), int(b[1])
if x * 2 <= y <= x * 4:
print("yes")
else:
print("no")
|
p03962 | s447023939 | Wrong Answer | x=list(map(int,input().split()))
x.sort()
if (x[0]==x[1])or(x[1]==x[2]):
print(2)
elif x[0] == x[1] == x[2]:
print(1)
else:
print(3) |
p03126 | s346371806 | Accepted | #!/usr/bin/env python3
N,M = map(int,input().split())
lst = [i+1 for i in range(M)]
for _ in range(N):
tmp = list(map(int,input().split()))
K = tmp[0]
A = tmp[1:]
lst = list(filter(lambda x: x in A,lst))
print(len(lst)) |
p02983 | s498778356 | Accepted | L, R = map(int, input().split())
if R - L >= 2019:
mn = 0
else:
l, r = L % 2019, R % 2019
mn = 2018 ** 2
for i in range(l, r + 1):
for j in range(i + 1, r + 1):
mn = min(mn, i * j % 2019)
print(mn) |
p04044 | s944928391 | Accepted | N, L = map(int, input().split())
S = [input() for _ in range(N)]
S.sort()
print(''.join(S)) |
p03455 | s312345520 | Wrong Answer | a,b=map(int,input().split())
if a*b%2==0:
print("Even")
else:
print("odd") |
p02678 | s684161288 | Wrong Answer | import collections
N, M = map(int, input().split())
graph = [[] for _ in range(N)]
t = [10**18] * N
last = [-1] * N
for _ in range(M):
A, B = map(int, input().split())
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
q = collections.deque([[0, 0]])
count = 0
while q:
tmp = q.pop()
pos, time = tmp[0], tmp[1]
for next_pos in graph[pos]:
if time+1 < t[next_pos]:
last[next_pos] = pos
t[next_pos] = time+1
q.append([next_pos, time])
print('Yes')
for n in last[1:]:
print(n+1)
|
p02996 | s405776700 | Accepted | import heapq
n = int(raw_input())
heap = [map(int, raw_input().split(' '))[::-1] for _ in range(n)]
heapq.heapify(heap)
#(deadline, duration)
def f(heap):
t = 0
while(heap):
nd,d = heapq.heappop(heap)
gap = nd - t
gap -= d
t += d
while(heap and heap[0][0] == nd):
_,v = heapq.heappop(heap)
t += v
gap -= v
if gap < 0: return False
return True
print 'Yes' if f(heap) else 'No' |
p02583 | s508168175 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.sort()
counter = 0
print(A)
for i in A:
print('i:'+str(i))
second = [m for m in A if i < m]
for j in second:
print('j:'+str(j))
third = [n for n in second if j < n]
if len(third) > 0:
for k in third:
counter += 1
print(i,j,third[0])
print(counter) |
p03360 | s851440920 | Accepted | L = list(map(int,input().split()))
K = int(input())
print(sum(L) - max(L) + max(L) * 2 ** K) |
p04043 | s091095249 | Wrong Answer | num_list = list(map(int, input().split()))
if num_list.count(5) == 2 and num_list.count(7) == 1:
print("Yes")
else:
print("No") |
p02743 | s216404010 | Wrong Answer | a, b, c = list(map(int, input().split()))
l = a + b + 2 * ((a*b)**(1/2))
r = c
if l < r:
print("Yes")
else:
print("No") |
p03665 | s764988417 | Wrong Answer | n, p = map(int, input().split())
A = list(map(int, input().split()))
if n>=2:
print(pow(2, n)//2)
else:
print(1 if A[0]%2==p else 0) |
p04031 | s411993958 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = 0
if sum(A)%N == 0:
x = sum(A)//N
for i in range(N):
ans += (x-A[i])**2
print(ans)
else:
x = sum(A)//N
b = sum(A)//N+1
if sum(A)/N - x > b - sum(A)/N:
x = b
for i in range(N):
ans += (x-A[i])**2
print(ans)
|
p02909 | s698733452 | Wrong Answer | t= ["Sunny", "Cloudy", "Rainy"]
print(t[t.index(input())]) |
p02879 | s203176743 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
a,b = map(int, input().split())
if a >= 1 and a <= 9 and b >= 1 and b <= 9:
print(a*b)
else:
print(-1)
|
p03544 | s091260975 | Accepted | import math
import copy
neko = 0
nuko = 0
n = int(input())
a = [0] * 100
a[0] = 2
a[1] = 1
for i in range(2,n+1):
a[i] = a[i-1] + a[i-2]
print(a[n]) |
p02627 | s146959397 | Wrong Answer | s=input()
if s.islower()==True:
print(s.upper())
else:
print(s.lower()) |
p02973 | s070783741 | Accepted | def LIS(A):
dp = [-A[0]]
for a in A[1:]:
if -a >= dp[-1]:
dp.append(-a)
else:
dp[bisect_right(dp, -a)] = -a
return len(dp)
##################################################################################################################
import sys
input = sys.stdin.readline
from bisect import bisect_right
N = int(input())
A = list(map(int, sys.stdin.readlines()))
print(LIS(A)) |
p02631 | s266233327 | Wrong Answer | import numpy as np
def main():
n = int(input())
a = [int(i) for i in input().split()]
k = max(a).bit_length()
c = np.zeros(n, dtype=np.int)
for i in range(k):
b = np.array([ai // 2**i % 2 for ai in a], dtype=np.int)
if b.sum() % 2:
b = 1 - b
print(b)
c += b * 2**i
print(*c)
if __name__ == '__main__':
main()
|
p02718 | s505645065 | Accepted | # -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
import math
# stdin = open("sample.txt")
N,M = [int(x) for x in stdin.readline().rstrip().split()]
hyo = list(map(int,[int(x) for x in stdin.readline().rstrip().split()]))
sort_hyo = sorted(hyo, reverse=True)
point = sum(hyo)
target = math.ceil(point / (4*M))
for i in range(len(hyo)):
if sort_hyo[i] >= target:
sort_hyo[i] = "Yes"
else:
sort_hyo[i] = "No"
print(sort_hyo[M-1]) |
p02681 | s134485220 | Accepted | s = input()
t = input()
if s == t[:-1]:
print("Yes")
else:
print("No")
|
p03434 | s746969288 | Wrong Answer | n = int(input())
a = sorted(list(map(int,input().split())),reverse=True)
A = sum(a[::2])
B = sum(a[::2])
print(A - B) |
p02988 | s322821796 | Accepted | import itertools
def triple(iterable):
a, b, c = itertools.tee(iterable, 3)
next(b, None), next(c, None), next(c, None)
return zip(a, b, c)
n = int(input())
P = list(map(int, input().split()))
ans = 0
for x, y, z in triple(P):
sorted_tuple = sorted([x, y, z])
if sorted_tuple[1] == y:
ans += 1
print(ans)
|
p02627 | s784047472 | Accepted | A = input()
if A.islower():
print('a')
else:
print('A')
|
p03329 | s971424054 | Accepted | N = int(input())
INF = 10 ** 6
dp = [INF] * (N + 1)
MONEY = []
i = 1
while i <= N:
MONEY.append(i)
i *= 6
i = 1
while i <= N:
MONEY.append(i)
i *= 9
MONEY.sort()
# print(MONEY)
for init in MONEY:
dp[init] = 1
for i in range(1, N + 1):
for plus in MONEY:
if i + plus <= N:
dp[i + plus] = min(dp[i] + 1, dp[i + plus])
# print(dp)
print(dp[N])
|
p03475 | s799920919 | Wrong Answer | import math
n = int(input())
cL = []
sL = []
fL = []
for i in range(n - 1):
c, s, f = map(int, input().split(" "))
cL.append(c)
sL.append(s)
fL.append(f)
ans = 0
for i in range(n - 1):
sm = 0
for j in range(i, n - 1):
c = cL[j]
s = sL[j]
f = fL[j]
if sm < s:
sm = s
sm += c + (f - ((sm - s) % f) % f)
print(sm)
print(0) |
p02873 | s357061796 | Accepted | if __name__ == '__main__':
s = list(input())
ans = [0] * (len(s) + 1)
for i in range(len(s)):
if s[i] == "<":
ans[i + 1] += ans[i] + 1
for i in range(len(s) - 1, -1, -1):
if s[i] == ">":
ans[i] = max(ans[i], ans[i + 1] + 1)
print(sum(ans))
|
p02811 | s742057880 | Accepted | K,X= map(int,input().split())
if 500 * K >= X:
print("Yes")
else:
print("No")
|
p03289 | s426916479 | Accepted | import sys
import re
S = input()
array_S = list(S)
if not ( 4 <= len(S) <= 10 ):
print('WA')
sys.exit()
if len(re.findall('[A-Z]',S)) != 2:
print('WA')
sys.exit()
result = 0
if array_S[0] != 'A': result += 1
if array_S[2:-1].count('C') != 1: result += 1
array_S.pop(0)
array_S.pop(array_S.index('C'))
if not "".join(array_S).islower(): result += 1
print('WA') if result != 0 else print('AC') |
p02861 | s625009444 | Accepted | from itertools import permutations
import math
n = int(input())
x,y = [],[]
for _ in range(n):
x_, y_ =map(int,input().split())
x.append(x_)
y.append(y_)
c = list(permutations([i for i in range(1,n+1)],n))
sum = 0
for ci in (c):
tmp = 0
for i in range(len(ci)-1):
tmp += math.sqrt((x[ci[i]-1]-x[ci[i+1]-1])**2
+ (y[ci[i]-1]-y[ci[i+1]-1])**2)
sum += tmp
print(sum/len(c)) |
p02862 | s057419907 | Accepted | X, Y = map(int, input().split())
def comb(n, k, mod=10**9+7):
ret = 1
for i in range(1, k + 1):
ret = ret * (n - i + 1) % mod
ret = ret * pow(i, mod - 2, mod) % mod
return ret
a = (2 * Y - X) / 3
b = (2 * X - Y) / 3
if a != int(a) or b != int(b) or a < 0 or b < 0:
print(0)
else:
print(comb(int(a + b), int(a)))
|
p03037 | s707953472 | Accepted | n, m = map(int, input().split())
Authority = [list(map(int, input().split())) for _ in range(m)]
cards = list(range(1, n + 2))
l_list = []
r_list = []
for i in range(m):
l_list.append(Authority[i][0])
r_list.append(Authority[i][1])
print(len(cards[max(l_list):min(r_list) + 1]))
|
p03778 | s839448934 | Accepted | W,a,b=map(int,input().split())
Max=max(a,b)
Min=min(a,b)
ans=Max-(Min+W)
if ans<0:
ans=0
print(ans) |
p04029 | s953962060 | Accepted | child=int(input())
ame=0
while child!=0:
ame=ame+child
child-=1
print(ame) |
p02860 | s220729755 | Accepted | N = int(input())
S = input()
if N%2 != 0:
print("No")
else:
n = N//2
if S[:n]==S[n:]:
print("Yes")
else:
print("No") |
p02935 | s718118089 | Wrong Answer | n = int(input())
h = list(map(int,input().split(" ")))
plsl = []
plsn = 0
for i in range(n-1):
if h[i]>= h[i+1] and i == n-2:
plsn += 1
# print(plsn)
plsl.append(plsn)
# print(plsl)
elif h[i]>= h[i+1] and i < n-2:
plsn += 1
# print(plsn)
else:
plsl.append(plsn)
# print(plsl)
plsn = 0
# print(plsn)
plsl.sort(reverse = True)
print(plsl[0]) |
p03282 | s675978953 | Accepted |
if __name__ == '__main__':
S=list(input())
K=int(input())
S=[int(s) for s in S]
for i in range(K):
if S[i]!=1:
print(S[i])
break
else:
if i==K-1:
print(1) |
p02697 | s531185677 | Accepted | n,m=map(int,input().split())
if n%2==1:
x=""
for i in range(m):
x+=f"{i+1} {n-i}\n"
print(x)
else:
x=""
for i in range(m):
x+=(f"{i+1} {n-i}\n" if i<m/2 else f"{i+1} {n-i-1}\n")
print(x) |
p03681 | s579451996 | Accepted | N,M= map(int,input().split())
N,M = max(N,M),min(N,M)
mod = 10**9+7
n = 100010
frac = [1]*(n+1)
for i in range(n):
frac[i+1] = (i+1)*frac[i]%mod
if N==M+1:
print(frac[N]*frac[M]%mod)
elif N==M:
print(frac[N]*frac[M]*2%mod)
else:
print(0)
|
p03038 | s057937557 | Wrong Answer | from collections import defaultdict
N, M = map(int,input().split())
A = list(map(int,input().split()))
T = []
for _ in range(M):
a, b = map(int,input().split())
T+=[b]*a
A.sort()
T.sort(reverse = True)
|
p03105 | s800398608 | Accepted | a, b, c = map(int, input().split())
print(min(b//a, c))
|
p02951 | s249214373 | Accepted | A,B,C = map(int, input().split())
D = C-(A-B)
if D < 0:
print(0)
else:
print(D) |
p03289 | s060769758 | Accepted | s = input()
ans = 'WA'
if s[0] == 'A':
if s[2:-1].count('C') == 1:
index = s[2:-1].find('C') + 2
if s[1:index].islower() and s[index + 1:].islower():
ans = 'AC'
print(ans) |
p03071 | s652615028 | Accepted | a, b = map(int,input().split())
if a > b:
print(a*2 - 1)
elif a == b:
print(a + b)
elif a < b:
print(b*2 - 1) |
p02571 | s232053435 | Accepted | S=input().strip()
T=input().strip()
ls = len(S)
lt = len(T)
x = lt
for i in range(0,ls-lt+1):
m = 0
for j in range(lt):
if T[j] != S[i+j]:
m += 1
x = min(x,m)
print(x)
|
p02658 | s250885865 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
a=0
ans=1
if 0 in A:
ans=0
else:
for a in range(n):
ans*=A[a]
a+=1
if ans<=10**18:
continue
else:
break
print(ans)
|
p02712 | s708333701 | Accepted | def main():
n = int(input())
ans = 0
for i in range(1,n+1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
if __name__=='__main__':
main()
|
p03000 | s580670115 | Wrong Answer | def calcBoundCount(rangex, lstL):
d = 0
for i in range(0, len(lstL)):
d = d + lstL[i]
if rangex < d:
return i + 1
return len(lstL)
N, X = map(int, input().split())
lstL = list(map(int, input().split()))
count = calcBoundCount(X, lstL)
print((count if count <= N+1 else N+1)) |
p02795 | s623064872 | Accepted | H=int(input())
W=int(input())
N=int(input())
T=max(H,W)
if N%T==0:
print(N//T)
else:
print(N//T+1) |
p02627 | s606559480 | Accepted | print("A" if input().isupper() is True else "a") |
p02696 | s362576668 | Wrong Answer | import math
A,B,N= map(int,input().split())
x=[]
AB=A/B
if N<B:
#x.append(math.floor(AB*N-1)-A*(N//B)
print(math.floor(AB*N))
else:
print(math.floor(AB*B-1))
#for i in range(1,N+1): |
p02785 | s433853542 | Accepted | N, K = map(int, input().split())
Hs = map(int,input().split())
print(sum(sorted(Hs, reverse=True)[K::])) |
p03698 | s860280611 | Accepted | S = input()
if len(S) == len(set([s for s in S])):
print('yes')
else:
print('no') |
p03485 | s509625509 | Wrong Answer | import sys
input = sys.stdin.readline
a,b=map(int,input().split())
print(-((a+b)//2))
|
p03087 | s093172458 | Accepted | n,q=map(int, input().split())
s=input()
cnt=[0]*(n-1)
for i in range(n-1):
if s[i:i+2]=='AC':
cnt[i]=1
cnt2=[0]*(n)
for i in range(1,n):
cnt2[i]=cnt2[i-1]+cnt[i-1]
for i in range(q):
l,r=map(int, input().split())
print(cnt2[r-1]-cnt2[l-1]) |
p03485 | s031058080 | Accepted | a, b = map(int, input().split())
print(int((a+b)/2+0.5))
|
p03385 | s335204710 | Accepted | s = sorted(input())
print("Yes" if s==["a", "b", "c"] else "No") |
p02957 | s679934404 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
A, B = map(int, readline().split())
A, B = min(A, B), max(A, B)
if (B - A) % 2 == 1:
print("IMPOSSIBLE")
else:
print((A + B) // 2)
if __name__ == '__main__':
main()
|
p03624 | s876741185 | Wrong Answer | s = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
for i in s:
if i in alpha:
alpha = alpha.strip(i)
if alpha == '':
print('None')
else:
print(alpha[0])
|
p03862 | s244853477 | Wrong Answer | N,X=map(int,input().split())
A=list(map(int,input().split()))
if N==2:
print(max(0,A[0]+A[1]-X))
exit()
M=0
for i in range(N-1):
M+=max(A[i]+A[i+1]-X,0)
alpha=max(A[0]-X,0)
beta=max(A[-1]-X,0)
print((M+alpha+beta+1)//2) |
p02729 | s638391044 | Accepted | from itertools import *
def main():
N, M = list(map(int, input().split()))
print(len(list(combinations(range(N), 2))) + len(list(combinations(range(M), 2))))
if __name__ == '__main__':
main() |
p03469 | s810598395 | Accepted | # A - Already 2018
s=list(input())
s[3]='8'
print("".join(s))
|
p03785 | s899358428 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,c,k = iim()
time = []
for _ in range(n):
time.append(ii())
time.sort()
bus = 0
fst = time[0]
ans = 0
for item in time:
if bus <= c-1 and item <= k+fst:
bus += 1
elif bus > c-1:
bus = 1
ans += 1
fst = item
elif item-fst > k:
bus = 1
ans += 1
fst = item
print(ans if bus == 0 else ans+1) |
p03107 | s190318910 | Wrong Answer | s = input()
one = s.count("1")
zero = s.count("0")
print(min(zero,one)) |
p03013 | s543859515 | Accepted | n,m = map(int,input().split())
mod = 10**9+7
p = [0 for _ in range(n+1)]
p_ok = [True for _ in range(n+1)]
for i in range(m):
p_ok[int(input())] = False
p[0] = 1
for now in range(0,n):
for next in range(now+1,min(n,now+2)+1):
if p_ok[next]:
p[next] += p[now]
p[next] %= mod
ans = p[n]
print(ans%mod)
|
p02860 | s783028050 | Wrong Answer | n = int(input())
s = input()
if n % 2 == 0:
if s[0:int(n/2)] == s[int(n/2):]:
print("Yes")
else:
print("No") |
p03339 | s255588019 | Accepted | from collections import Counter
N = int(input())
S = list(input())
c = Counter(S)
left_facing_west = 0
right_facing_east = c['E']
ans = float('inf')
for s in S:
if s == 'W':
ans = min(ans,left_facing_west+right_facing_east)
left_facing_west += 1
else:
right_facing_east -= 1
ans = min(ans,left_facing_west+right_facing_east)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.