problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03437
|
s783655645
|
Accepted
|
x, y = map(int, input().split())
if x % y == 0:
print(-1)
else:
print(x)
|
p02881
|
s346747579
|
Wrong Answer
|
N = int(input())
min_value=float('inf')
value=0
check=True
for i in range(2,10^6):
if((N%i)==0):
value=(N/i)+i-2
if(min_value>value):
min_value=value
check=False
if(check):
print(N-1)
else:
print(int(min_value))
|
p02866
|
s555883635
|
Accepted
|
from collections import Counter
import sys
MOD = 998244353
def main():
n, *d = map(int, sys.stdin.buffer.read().split())
e = [0]*n
for i in d:
e[i] += 1
ans = e[0]
for i in d[1:]:
ans *= e[i-1]
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
|
p03379
|
s488493113
|
Wrong Answer
|
N = int(input())
X = sorted(list(map(int,(input().split()))))
a = int(N/2)
b = a-1
for i in range(a):
print(X[a])
for i in range(a):
print(X[b])
|
p03474
|
s590805721
|
Accepted
|
A, B = map(int, input().split())
S = input()
X = {str(i) for i in range(0, 10)}
f = 0
for i in range(A+B+1):
if i != A and S[i] not in X:
f = 1
break
if i == A and S[i] != "-":
f = 1
break
if f == 0:
print("Yes")
else:
print("No")
|
p02613
|
s652362384
|
Accepted
|
N = int(input())
d = {'AC':0,'WA':0,'TLE':0,'RE':0}
for i in range(N):
wrk = input()
d[wrk] = d[wrk]+1
print('AC x ',d['AC'])
print('WA x ',d['WA'])
print('TLE x ',d['TLE'])
print('RE x ',d['RE'])
|
p03998
|
s426648870
|
Accepted
|
sa = list(input())
sb = list(input())
sc = list(input())
tmp = sa.pop(0)
while True:
if tmp == "a":
if len(sa) == 0:
print("A")
exit()
else:
tmp = sa.pop(0)
elif tmp == "b":
if len(sb) == 0:
print("B")
exit()
else:
tmp = sb.pop(0)
elif tmp == "c":
if len(sc) == 0:
print("C")
exit()
else:
tmp = sc.pop(0)
|
p02989
|
s764109961
|
Accepted
|
n=int(input())
d=[int(x) for x in input().split()]
d=sorted(d)
l=d[int(len(d)/2)-1]
r=d[int(len(d)/2)]
print(r-l)
|
p03038
|
s649948054
|
Accepted
|
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
bc = []
for _ in range(m): bc.append([int(i) for i in input().split()])
a.sort()
bc.sort(key=lambda x:x[1])
bc = bc[::-1]
idx = 0
for b, c in bc:
for bi in range(b):
if idx + bi == n or a[idx+bi] >= c:
idx = "e"
break
else: a[idx+bi] = c
if idx == "e": break
else: idx += b
print(sum(a))
|
p02553
|
s326440492
|
Accepted
|
a,b,c,d = map(int,input().split())
print(max(max(a*c,b*d),max(a*d,b*c)))
|
p03309
|
s332151855
|
Accepted
|
import collections
n = int(input())
a = list(map(int, input().split()))
if (n==1):
print(0)
exit()
for i in range(n):
a[i] -= i+1
a.sort()
ans1 = 0
ans2 = 0
x = a[n//2]
y = a[n//2-1]
for i in range(n):
ans1 += abs(a[i]-x)
ans2 += abs(a[i]-y)
print(min(ans1,ans2))
|
p03059
|
s415782961
|
Accepted
|
a, b, t = map(int, input().split())
print(b * (t//a))
|
p02607
|
s959402381
|
Wrong Answer
|
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(1, n, 2):
if a_list[i] % 2 == 1:
count += 1
print(count)
|
p03761
|
s727921096
|
Accepted
|
from collections import Counter
N=int(input())
d={chr(i):100 for i in range(ord("a"),ord("z")+1)}
for i in range(N):
A={chr(i):0 for i in range(ord("a"),ord("z")+1)}
A.update(Counter(list(input())))
for i in A:
if d[i]>A[i]:
d[i]=A[i]
for i in d:
if d[i]==100:
d[i]=0
ans=""
key=sorted(d.keys())
for i in key:
ans+=i*d[i]
print(ans)
|
p03219
|
s944907485
|
Wrong Answer
|
X, Y = map(int, input().split())
print(X+(Y/2))
|
p02784
|
s705398470
|
Wrong Answer
|
h,n = (int(x) for x in input().split())
a_list = [int(x) for x in input().split()]
a_list.sort(reverse=True)
if h <= sum(a_list[:2]):
print("Yes")
else:
print("No")
|
p02664
|
s899183412
|
Wrong Answer
|
T=input()
ans=T.count("PD")+T.count("P?")+T.count("D")+T.count("?")
print(ans)
|
p02708
|
s056741432
|
Accepted
|
n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
ans += i*n-i**2+i+1
mod = 10**9+7
print(ans%mod)
|
p02994
|
s891408142
|
Accepted
|
n, l = map(int, input().split())
apple = []
diff = 1001001001
minus = False
for i in range(1, n+1):
apple.append(l+i-1)
if abs(l+i-1) < diff:
diff = abs(l+i-1)
if l+i-1 < 0:
minus = True
else:
minus = False
if minus:
print(sum(apple) + diff)
else:
print(sum(apple) - diff)
|
p02594
|
s193844972
|
Accepted
|
x = int(input())
if x >= 30:
print('Yes')
else:
print('No')
|
p03131
|
s482075162
|
Accepted
|
k, a, b = map(int, input().split())
diff = b - a
if diff <= 2:
print(1 + k)
exit()
times = a - 1
print(a + (k-times) // 2 * diff + (k-times) % 2)
|
p03471
|
s492391129
|
Accepted
|
n,y=map(int,input().split())
Y=y//1000
a,b,c=0,0,0
for i in range(Y//10+1):
rest=n-i
for j in range(rest+1):
k=rest-j
if 10*i+5*j+k==Y:
print(i,j,k)
exit()
print('-1 '*3)
|
p02847
|
s119399852
|
Accepted
|
A = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = input()
print(7-A.index(S))
|
p03555
|
s977504107
|
Accepted
|
nim = input()
sam = input()
print('YES' if nim[::-1] == sam else'NO' )
|
p03017
|
s341522582
|
Accepted
|
import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
n, a, b, c, d = inintm()
s = input()
if c < d:
if "##" not in s[a-1:d-1]:
print("Yes")
else:
print("No")
else:
if ("..." in s[b-2:d+1]) and ("##" not in s[a-1:c-1]):
print("Yes")
else:
print("No")
|
p03827
|
s422773749
|
Wrong Answer
|
s = input()
s = input()
x = 0
l_x = []
for c in s:
x += 1 if c == 'I' else -1
l_x.append(x)
print(l_x)
print(max(l_x))
|
p03767
|
s539952394
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
m1 = n // 3
m2 = 2 * m1
print(sum(a[m1:m2]))
|
p02748
|
s009604824
|
Accepted
|
A, B, M = map(int, input().split())
a = [int(e) for e in input().split()]
b = [int(e) for e in input().split()]
c = {}
m = 2000000
for i in range(M):
x, y, c2 = map(int, input().split())
c[(x, y)] = c2
value = a[x-1] + b[y-1] - c2
if m > value:
m = value
if (min(a), min(b)) in c:
print(m)
else:
if m > min(a) + min(b):
print(min(a) + min(b))
else:
print(m)
|
p04031
|
s723165307
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
ave = round(sum(a) / n)
result = 0
for i in a:
result += (i-ave) ** 2
print(result)
|
p02717
|
s120977180
|
Wrong Answer
|
ls = list(map(int,input().split()))
temp = ls[0]
ls[0] = ls[1]
ls[1] = temp
temp = ls[0]
ls[0] = ls[2]
ls[2] = temp
print(ls)
|
p02796
|
s437266927
|
Accepted
|
n=int(input())
r=[]
cnt=1
for _ in range(n):
x,l=map(int,input().split())
s=x-l
t=x+l
r.append([s,t])
r=sorted(r,key=lambda x: x[1])
t0=r[0][1]
for s,t in r[1:]:
if t0<=s:
cnt+=1
t0=t
print(cnt)
|
p02987
|
s221377823
|
Accepted
|
s = input()
ans = 'No'
index = s.find(s[0], 1)
if index >= 1:
s = s.replace(s[0], '')
if (len(s) == 2):
if (s[0] == s[1]):
ans ='Yes'
print(ans)
|
p03284
|
s829017320
|
Wrong Answer
|
n, k = map(int, input().split())
print(n%k)
|
p03862
|
s900878472
|
Accepted
|
n, x = map(int, input().split())
*a, = map(int, input().split())
b = a[:]
if b[0] > x:
b[0] = x
for i in range(n-1):
if b[i]+b[i+1] > x:
b[i+1] = abs(b[i]-x)
print(sum(map(lambda x: abs(x[0] - x[1]), zip(a, b))))
|
p03417
|
s833536511
|
Accepted
|
n, m = map(int, input().split())
if n == 1 and m == 1:
print("1")
elif m == 1:
print(n - 2)
elif n == 1 and m != 1:
print(m - 2)
else:
print((n - 2) * (m - 2))
|
p02683
|
s594660855
|
Accepted
|
# C - Skill Up
N, M, X = map(int, input().split())
C, A = [], []
for _ in range(N):
c, *a = map(int, input().split())
C.append(c)
A.append(a)
costs = []
def f(i, cost, points):
if X <= min(points):
costs.append(cost)
return
if N <= i:
return
f(i + 1, cost, points)
tmp = [p for p in points]
for j in range(M):
tmp[j] += A[i][j]
f(i + 1, cost + C[i], tmp)
f(0, 0, [0] * M)
print(min(costs) if len(costs) != 0 else -1)
|
p02817
|
s304930096
|
Wrong Answer
|
S,T=input().split()
print(S+T)
|
p02675
|
s827090496
|
Wrong Answer
|
n=int(input())
l=n%10
if l==0 or l==1 or l==6 or l==8:
print("hon")
elif l==3:
print('bon')
else:
print("hon")
|
p02916
|
s574347070
|
Accepted
|
n=int(input())
a=[0]+[int(x) for x in input().split()]
b=[0]+[int(x) for x in input().split()]
c=[0]+[int(x) for x in input().split()]
ans=0
for i in range(n+1):
ans+=b[a[i]]
if i>0:
if a[i-1]+1==a[i]:
ans+=c[a[i-1]]
print(ans)
|
p02718
|
s263192617
|
Wrong Answer
|
def actual(n, m, a_list):
threshold = sum(a_list) / (4 * m)
count_can_be_popular = 0
for vote in a_list:
if vote >= threshold:
count_can_be_popular += 1
if count_can_be_popular >= m:
return 'Yes'
return 'No'
n, m = map(int, input().split())
a_list = map(int, input().split())
print(actual(n, m, a_list))
|
p03011
|
s883820880
|
Wrong Answer
|
P,Q,R=map(int,input().split())
a=[P,Q,R]
b=sorted(a)
print(a[0]+a[1])
|
p03951
|
s214171015
|
Wrong Answer
|
N = int(input())
s = input().strip()
t = input().strip()
k = 0
for i in range(1,N+1):
if s[-i:]==t[:i]:
k = i
continue
break
print(2*N-k)
|
p03760
|
s475031859
|
Accepted
|
o = input()
e = input()
ans = ""
i = 0
while i < len(o):
ans += o[i]
if i < len(e):
ans += e[i]
i += 1
print(ans)
|
p02700
|
s375869055
|
Wrong Answer
|
a,b,c,d = map(int,input().split())
if c%b < a%d:
print("Yes")
else:
print("No")
|
p02987
|
s214514155
|
Wrong Answer
|
s = sorted(input())
print("Yes" if s[0] == s[1] and s[2] == s[3] else "No")
|
p03030
|
s206735956
|
Accepted
|
from operator import itemgetter
N = int(input())
T = list()
for i in range(N):
S, P = map(str, input().split())
T.append((S, int(P), str(i+1)))
T = sorted(T, key=itemgetter(1), reverse=True)
T = sorted(T, key=itemgetter(0))
for t in T:
print(t[2])
|
p02923
|
s511649410
|
Accepted
|
N=int(input())
H=[int(x) for x in input().split()]
cur=[0]*N
for i in range(1,N):
if H[i]<=H[i-1]:
cur[i]=cur[i-1]+1
print(max(cur))
|
p03317
|
s739317721
|
Accepted
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K, *A = map(int, read().split())
print((N - 2) // (K - 1) + 1)
return
if __name__ == '__main__':
main()
|
p03557
|
s074638081
|
Accepted
|
from bisect import bisect_left, bisect_right
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
C.sort()
cnt = 0
for b in B:
cnt += bisect_left(A, b) * (N - bisect_right(C, b))
print(cnt)
|
p02729
|
s409727115
|
Accepted
|
n, m =map(int, input().split())
s = (n*(n-1)/2 + m*(m-1)/2)
s= int(s)
print(s)
|
p02832
|
s351202643
|
Wrong Answer
|
n=int(input())
a=list(map(int,input().split()))
if n==1:
if a[0]==1:
print(0)
else: print(-1)
if n>=2:
if 1 not in a:
print(-1)
exit()
else:
for i in range(2,n+1):
if i in a and a.index(i-1)<a.index(i):
continue
else:
print(n-i)
exit()
|
p03544
|
s486725427
|
Wrong Answer
|
n = int(input())
x = 2
y = 1
if n == 1:
ans = 2
if n == 2:
ans = 1
for i in range(n-1):
ans = x + y
x = y
y = ans
print(ans)
|
p02818
|
s011714497
|
Wrong Answer
|
A, B, K = map(int, input().split())
if A >= K:
print(A-K, B)
else:
print(0, B-(K-A))
|
p03309
|
s430938814
|
Accepted
|
n=int(input())
l=list(map(int,input().split()))
for i in range(n):
l[i]=l[i]-(i+1)
l.sort()
if n%2==0:
b=(l[n//2-1]+l[n//2])//2
else:
b=l[n//2]
ans=0
for i in range(n):
ans+=abs(l[i]-b)
print(ans)
|
p03137
|
s711227380
|
Wrong Answer
|
N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
d = []
for i in range(M-1):
d.append(X[i+1]-X[i])
d.sort()
print(sum(d[0:M-N]))
|
p02697
|
s192932150
|
Wrong Answer
|
def main():
N, M = list(map(int, input().split()))
if N % 2 == 1:
for i in range(M):
print(i + 1, N - i - 1)
else:
for i in range(M // 2):
print(i + 1, N - i - 1)
for i in range(M // 2, M):
print(i + 1, N - i - 2)
main()
|
p02597
|
s830583150
|
Accepted
|
n = int(input())
c = list(input())
ramount = c.count('R')
ans = c[: ramount].count('W')
print(ans)
|
p03804
|
s373779561
|
Accepted
|
a,b=map(int,input().split())
ListA = []
for i in range (a):
ListA.append(input())
ListB = []
for i in range (b):
ListB.append(input())
flag = False
def checkAB(List1,List2,aa,bb):
for k in range(b):
if List1[aa+k][bb:bb+b] != List2[k]:
return False
return True
for i in range(a-b+1):
for j in range(a-b+1):
if checkAB(ListA,ListB,i,j):
flag = True
if flag:
print("Yes")
else:
print("No")
|
p02888
|
s050060971
|
Accepted
|
import bisect
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N-2):
for j in range(i+1, N-1):
k = bisect.bisect_left(L, L[i]+L[j])
ans += max(0, k-j-1)
print(ans)
|
p02646
|
s138115840
|
Wrong Answer
|
a, v = [int(a) for a in input().split()]
b, w = [int(a) for a in input().split()]
t = int(input())
ret = w-v
ans = ""
if (ret*t) <= (b-a):
ans = "NO"
else:
ans = "YES"
print(ans)
|
p03797
|
s447906517
|
Accepted
|
n, m = map(int, input().split())
ans = 0
if n >= m:
ans = m // 2
else:
ans = n + (m - 2 * n) // 4
print(ans)
|
p03067
|
s428018862
|
Accepted
|
a,b,c=map(int,input().split())
l=sorted([a,b,c])
print("Yes" if l[1]==c else "No")
|
p03434
|
s451709224
|
Accepted
|
N = int(input())
s = list(map(int, input().split()))
s2 = sorted(s, reverse=True)
print(sum(s2[0::2]) - sum(s2[1::2]))
|
p02946
|
s866983748
|
Wrong Answer
|
k,x = map(int,input().split())
print([i for i in range(x-k+1,x+k)])
|
p02554
|
s773911091
|
Accepted
|
n=int(input())
x=(10**9)+7
a=pow(10,n,x)+pow(8,n,x)-2*pow(9,n,x)
print(a%x)
|
p02553
|
s592478018
|
Accepted
|
a, b, c, d = map(int, input().split())
ac = a * c
ad = a * d
bc = b * c
bd = b * d
l = [ac, ad, bc, bd]
print(max(l))
|
p03637
|
s104500062
|
Accepted
|
n = int(input())
a_ls = list(map(int, input().split()))
num_mul4 = 0
num_even_not4 = 0
num_odd = 0
for i in range(n):
if a_ls[i] % 4 == 0:
num_mul4 += 1
elif a_ls[i] % 2 == 0:
num_even_not4 += 1
else:
num_odd += 1
res = 'No'
if num_even_not4 == 0:
if num_odd <= num_mul4 + 1:
res = 'Yes'
else:
num_odd += 1
if num_odd <= num_mul4 + 1:
res = 'Yes'
print(res)
|
p02972
|
s720756269
|
Accepted
|
n = int(input())
a = [0] + list(map(int, input().split()))
b = [0]*(n+1)
for i in range(1, n+1)[::-1]:
if a[i] == 1:
if sum(b[i::i]) % 2 == 0:
b[i] = 1
else:
b[i] = 0
else:
if sum(b[i::i]) % 2 == 0:
b[i] = 0
else:
b[i] = 1
print(b.count(1))
for i in range(n+1):
if b[i] == 1:
print(i)
|
p02836
|
s835272689
|
Accepted
|
#!/usr/bin/env python
def main():
S = input()
ans = 0
for i in range(len(S) // 2):
if S[i] != S[::-1][i]:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p03161
|
s433881626
|
Accepted
|
#!/usr/bin/env python3
def main():
N, K = map(int, input().split())
h = list(map(int, input().split()))
INF = 1 << 60
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
for j in range(1, K + 1):
if i + j < N:
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print(dp[N - 1])
if __name__ == "__main__":
main()
|
p02862
|
s534444161
|
Accepted
|
X, Y = map(int, input().split())
mod = 10**9+7
N = 1333334
fac = [1]*(N+1)
rev = [1]*(N+1)
for i in range(1,N+1):
fac[i] = i*fac[i-1]%mod
rev[i] = pow(fac[i], mod-2, mod)
comb = lambda a,b:(fac[a]*rev[a-b]*rev[b])%mod
a, b = (2*X-Y)//3, (2*Y-X)//3
if a<0 or b<0 or (2*X-Y)%3 or (2*Y-X)%3:
print(0)
else:
print(comb(a+b, a))
|
p02767
|
s726802515
|
Wrong Answer
|
n = int(input())
x = [int(x) for x in input().split()]
sum = 0
list = [] * n
for i in range(n):
sum = 0
for j in range(n):
sum = sum + (x[j] - (i+1))**2
list.append(sum)
print(min(list))
|
p02773
|
s284009452
|
Accepted
|
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop
def main():
n = int(input())
dic = defaultdict(lambda: 0)
count = 0
for _ in range(n):
s = input()
dic[s] += 1
count = max(count, dic[s])
candidates = []
for key in dic.keys():
if dic[key] == count:
candidates.append(key)
candidates.sort()
for c in candidates:
print(c)
if __name__ == '__main__':
main()
|
p03860
|
s819534872
|
Accepted
|
a,s,c = input().split(" ")
print("A{}C".format(s[0]))
|
p03860
|
s115627161
|
Wrong Answer
|
x="AtCoder"+input().capitalize()+"Contest"
print("A"+x[8]+"C")
|
p02813
|
s272053247
|
Accepted
|
N = int(input())
P = input().replace(" ","")
Q = input().replace(" ","")
def add_up(string, left):
string_set = set()
if len(left) == 0:
return {string}
for number in left:
string_set |= add_up(string+str(number), left-{number})
return string_set
l = sorted(list(add_up("",set([i+1 for i in range(N)]))))
print(abs(l.index(Q)-l.index(P)))
|
p02623
|
s563144964
|
Accepted
|
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = [0]*(N+1)
b = [0]*(M+1)
for i in range(1, N+1):
a[i] = a[i-1] + A[i-1]
for j in range(1, M+1):
b[j] = b[j-1] + B[j-1]
ans = 0
j = M
for i in range(N+1):
if K - a[i] < 0:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i+j)
print(ans)
|
p04012
|
s560519580
|
Accepted
|
alphabet = "abcdefghijklmnopqrstuvwxyz"
w = list(input())
for alpha in alphabet:
if w.count(alpha) % 2 == 1:
print("No")
break
else:
print("Yes")
|
p03779
|
s727758779
|
Accepted
|
x = int(input())
s = 1
i = 1
while s < x:
i += 1
s += i
print(i)
|
p03494
|
s043101318
|
Accepted
|
import sys
input = sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
cnt=0
flg=True
while flg:
for i in range(n):
if a[i]%2==0:
a[i]//=2
else:
flg=False
break
cnt+=1
print(cnt-1)
|
p03474
|
s672518867
|
Accepted
|
A,B=map(int,input().split())
S=input()
L=list(S)
l=L.count('-')
if l==1:
SS,T=S.split('-')
if len(str(SS))==A and len(str(T))==B:
print('Yes')
else:
print('No')
else:
print('No')
|
p03854
|
s755577703
|
Wrong Answer
|
import re
S = input()
print("YES" if re.match("dream|dreamer|erase|eraser", S) else "NO")
|
p03103
|
s851858344
|
Wrong Answer
|
N, M = map(int, input().split())
AB = {}
for i in range(N):
a, b = map(int, input().split())
AB[a] = b
ans = 0
for ab in sorted(AB.keys()):
if M <= 0:
break
if M >= AB[ab]:
ans += ab * AB[ab]
M -= AB[ab]
else:
ans += ab * M
M = 0
print(ans)
|
p03035
|
s894166436
|
Accepted
|
A, B = map(int, input().split())
if A>=13:
print(B)
elif A>=6:
print(B//2)
else:
print(0)
|
p02612
|
s953662143
|
Accepted
|
import math
import collections
import bisect
from copy import copy
def main():
N = int(input())
print((1000 - N % 1000) % 1000)
if __name__ == '__main__':
main()
|
p03323
|
s684092264
|
Accepted
|
A, B = map(int, input().split())
print("Yay!") if A <= 8 and B <= 8 else print(":(")
|
p03163
|
s856281091
|
Accepted
|
import sys
sys.setrecursionlimit(10**8)
N,W=map(int,input().split())
wv=[list(map(int,input().split())) for i in range(N)]
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(0,W+1):
if (j-wv[i][0])>=0:
dp[i+1][j] = max([dp[i][j],dp[i][j-wv[i][0]] + wv[i][1]])
else:
dp[i+1][j] = dp[i][j]
print(dp[N][W])
|
p02711
|
s913697273
|
Accepted
|
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(10**7)
N = input()
if "7" in N:
print("Yes")
else:
print("No")
|
p02848
|
s611332925
|
Accepted
|
N = int(input())
S = input()
ans = ""
for i in range(len(S)):
if ord(S[i]) + N > ord("Z"):
ans += chr(ord(S[i]) + N - (ord("Z") - ord("A") + 1))
else:
ans += chr(ord(S[i]) + N)
print(ans)
|
p03073
|
s010913435
|
Accepted
|
s = input()
o1 = s[::2].count('1')
o0 = s[::2].count('0')
e1 = s[1::2].count('1')
e0 = s[1::2].count('0')
print(min(o0 + e1, o1 + e0))
|
p03282
|
s092126540
|
Wrong Answer
|
s = input()
k = int(input())
for i in range(len(s)):
if s[i] != "1":
print(s[i])
exit()
if i == len(s):
print(1)
|
p03555
|
s742601487
|
Wrong Answer
|
a = input()
b = input()
print("Yes" if a==b[::-1] else "No")
|
p04030
|
s964735855
|
Accepted
|
s = input()
ans = ""
for i in s:
if i == "0" or i == "1":
ans += i
else:
ans = ans[:-1]
print(ans)
|
p02881
|
s012376659
|
Wrong Answer
|
def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
import bisect
N=int(input())
list1=divisor(N)
value1=(N**0.5)//1
num=bisect.bisect_left(list1,value1)
x=list1[num]
print(int(x+N/x-2))
|
p02912
|
s705772882
|
Accepted
|
# ABC-141-D
# https://qiita.com/ellio08/items/fe52a9eb9499b7060ed6
import heapq
N, M = map(int, input().split())
A = [i * (-1) for i in list(map(int, input().split()))]
heapq.heapify(A)
for _ in range(M):
tmp = heapq.heappop(A) * (-1)
heapq.heappush(A, (tmp//2)*-1)
# これだとTLEになる。
# for _ in range(M):
# A[A.index(max(A))] //= 2
print(sum(A)*-1)
|
p02684
|
s933653115
|
Wrong Answer
|
import sys
N, K = map(int, input().split())
#print(N)
#print(K)
A = sys.stdin.readlines()
#改行コード削除
A = [b.strip() for b in A][0].split()
#print(A)
print(A[int(A[(K % N) - 1]) - 1])
|
p04045
|
s406184881
|
Accepted
|
n, k = map(int, input().split())
D = set(map(int, input().split()))
from itertools import count
for ans in count(n,1):
for c in str(ans):
if int(c) in D:
break
else:
print(ans)
break
|
p02832
|
s064507519
|
Accepted
|
from collections import deque
N = int(input())
A = deque(list(map(int, input().split())))
ans = 0
cnt = 1
while A:
a = A.popleft()
if cnt == a:
cnt += 1
continue
else:
ans += 1
if ans == N:
print(-1)
else:
print(ans)
|
p03252
|
s382584682
|
Accepted
|
s=input()
t=input()
S=sorted(map(s.count,set(s)))
T=sorted(map(t.count,set(t)))
print("Yes" if S==T else "No")
|
p03254
|
s653902453
|
Wrong Answer
|
N,x = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a, reverse = False)
count = 0
if sum(a) < x:
count = N -1
else:
for i in a:
A = x - i
if A < 0:
count -=1
break
elif A == 0:
count += 1
break
count+=1
if count == -1:
count = 0
print(count)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.