problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03011
|
s901657261
|
Accepted
|
ab,bc,ac=map(int,input().split())
print(min(ab+bc, ab+ac, bc+ac))
|
p03494
|
s470940323
|
Accepted
|
def howmanytimesdisible(n):
ans = 0
while n%2==0:
n/=2
ans+=1
return ans
n = int(input())
li = list(map(int,input().split()))
ans = min(map(howmanytimesdisible,li))
print(ans)
|
p04030
|
s118913136
|
Accepted
|
s = list(input())
ans = []
for i in range(len(s)):
if s[i] == "0":
ans.append("0")
elif s[i] == "1":
ans.append("1")
else:
if len(ans) == 0:
pass
else:
ans.pop(-1)
print("".join(ans))
|
p02771
|
s628347992
|
Accepted
|
A,B,C = map(int, input().split())
if A==B & B==C & C==A:
print('No')
elif A!=B & B!=C & C!=A:
print('No')
else:
print('Yes')
|
p03419
|
s406965612
|
Wrong Answer
|
n, m = map(int, input().split())
if n == 1 and m == 1:
print(1)
exit(0)
w = n - 2
h = m - 2
if w < 1 or h < 1:
print(max(w, h))
exit(0)
print(w*h)
|
p03478
|
s990543167
|
Accepted
|
s = input().split()
n = int(s[0])
a = int(s[1])
b = int(s[2])
count = 0
for i in range(1,n+1):
s = list(str(i))
g = 0
for stri in s:
g += int(stri)
if g >= a and g <= b:
count += i
print(count)
|
p02687
|
s505836483
|
Accepted
|
S=input()
if S=="ARC":
print("ABC")
else:
print("ARC")
|
p02832
|
s270786876
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
ans = 0
t = 1
s = []
for i in a:
if i != t: ans += 1
else:
t += 1
s.append(i)
if s == []:
print(-1)
else:
print(ans)
|
p03416
|
s068541604
|
Accepted
|
a,b=map(int,input().split())
cnt = 0
for i in range(a,b+1):
i = str(i)
if i == i[::-1]:
cnt +=1
print(cnt)
|
p03998
|
s474970067
|
Accepted
|
sa = input()
sb = input()
sc = input()
card = sa[0]
sa = sa[1:]
while sa or sb or sc:
if card == 'a':
if len(sa) >= 1:
card = sa[0]
sa = sa[1:]
else:
print('A')
quit()
elif card == 'b':
if len(sb) >= 1:
card = sb[0]
sb = sb[1:]
else:
print('B')
quit()
else:
if len(sc) >= 1:
card = sc[0]
sc = sc[1:]
else:
print('C')
quit()
|
p03804
|
s528180147
|
Accepted
|
N,M=map(int,input().split())
A=list(list(input()) for _ in range(N))
B=list(list(input()) for _ in range(M))
flag=False
for i in range(0,N-M+1):
for j in range(0,N-M+1):
sub=True
for x in range(0,M):
for y in range(0,M):
if A[i+x][j+y]!=B[x][y]:
sub=False
flag=flag or sub
if flag:
print("Yes")
else:
print("No")
|
p02607
|
s584529806
|
Accepted
|
#!/usr/bin/env python
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")
def main():
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if i%2 == 0 and A[i]%2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03419
|
s966740487
|
Accepted
|
n, m = list(map(int, input().split()))
nn = min(n, m)
mm = max(n, m)
if nn == mm:
if nn == 1:
print(1)
else:
print(max(nn-2, 0) * max(mm-2, 0))
else:
if n != 2:
print(max(nn-2, 1) * max(mm-2, 1))
else:
print(0)
|
p02743
|
s396125995
|
Wrong Answer
|
from math import sqrt
a, b, c = [int(i) for i in input().split()]
if sqrt(a) + sqrt(b) - sqrt(c) < 1e-21:
print("Yes")
else:
print("No")
|
p02572
|
s971123657
|
Accepted
|
def resolve():
n = int(input())
a = list(map(int, input().split()))
ans = 0
mod = (10 ** 9) + 7
csum = sum(a)
for i in range(n):
csum -= a[i]
ans += a[i] * csum
ans = int(ans % mod)
print(ans)
resolve()
|
p03250
|
s471647829
|
Wrong Answer
|
s = "".join(input().split())
print(max(int(s[0])+int(s[1:]),int(s[-1])+int(s[:2])))
|
p02772
|
s595756596
|
Accepted
|
n=int(input())
l=[int(x) for x in input().rstrip().split() if int(x)%2==0]
cnt = 0
for i in l:
if i%3 == 0 or i%5==0:
cnt += 1
else:
break
if cnt == len(l):
print("APPROVED")
else:
print("DENIED")
|
p02791
|
s349762524
|
Accepted
|
n = int(input())
p = list(map(int, input().split()))
_min = p[0]
ans = 0
for i in range(n):
if _min >= p[i]:
ans += 1
_min = min(_min, p[i])
print(ans)
|
p02882
|
s199431088
|
Accepted
|
import math
a, b, x = map(int, input().split())
V = a * a * b
if x > V/2:
c = (x / a) * 2 / a - b
print(math.degrees(math.atan((b-c)/a)))
else:
c = (x / a) * 2 / b
print(math.degrees(math.atan(b/c)))
|
p03730
|
s079905380
|
Wrong Answer
|
a, b, c = map(int, input().split())
res = False
for i in range(a, a * b + 1):
if i % b == c:
res = True
print("YES" if res == True else "NO")
|
p02848
|
s263721594
|
Accepted
|
N=int(input())
S=input()
print("".join(chr(65+(ord(s)-65+N)%26) for s in S))
|
p02797
|
s802381598
|
Wrong Answer
|
N, K, S = map(int, input().split())
A = []
for i in range(K):
A.append(S)
for i in range(K, N):
A.append(S+1)
print(*A)
|
p02983
|
s901929937
|
Accepted
|
l,r=map(int, input().split())
k=0
can=[]
while l+k<=r and k<2020:
can.append((l+k)%2019)
k+=1
ans=2020
import itertools
for seq in itertools.combinations(range(len(can)),2):
ans=min(ans,(can[seq[0]]*can[seq[1]])%2019)
print(ans)
|
p03994
|
s593169368
|
Wrong Answer
|
s = input()
K = int(input())
for i,c in enumerate(s):
x = ord('z')-ord(c)+1
if x <= K:
s = s[:i]+'a'+s[i+1:]
K -= x
print(s[:-1]+chr((ord(s[-1])+K%26-ord('a'))%26+ord('a')))
|
p02866
|
s859037383
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
if a[0]:
print(0)
exit()
a.sort()
j=0
l=list()
#print(a)
for i in range(max(a)+1):
k=0
while j<n and a[j]==i:
j+=1
k+=1
#print(l,j,k)
l.append(k)
#print(l)
p=l[0]==1
mod=998244353
for i in range(len(l)-1):
#print(p)
p=(p*pow(l[i],l[i+1],mod))%mod
print(p%mod)
|
p02970
|
s937865095
|
Accepted
|
def q2():
""" B - Golden Apple """
N, D = (int(i) for i in input().split())
d, m = divmod(N, D*2+1)
if m > 0:
d += 1
print(d)
if __name__ == '__main__':
q2()
|
p02811
|
s692466492
|
Wrong Answer
|
k, x = map(int, input().split())
if 500*k >= x:
print("yes")
else:
print("no")
|
p03524
|
s314472954
|
Accepted
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
# inputna
s = input()
d = {"a":0, "b":0, "c": 0}
for c in s:
d[c] += 1
if max(d.values()) - min(d.values())<=1:
print("YES")
else:
print("NO")
|
p03286
|
s996675148
|
Accepted
|
N=int(input())
S = ""
while N != 0:
if N%2==0:
S = "0" + S
else:
S = "1" + S
N -= 1
N /= -2
if S == "": S = "0"
print(S)
|
p02684
|
s955696040
|
Accepted
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
chk = [0]*(N+1)
town = 1
rt = []
roop = 0
while True:
if chk[town] == 1:
break
rt.append(town)
chk[town] = 1
town = A[town-1]
if K <= rt.index(town):
print(rt[K])
else:
roop = (K-rt.index(town)) % (len(rt)-rt.index(town))
print(rt[rt.index(town)+roop])
|
p03679
|
s545277953
|
Wrong Answer
|
x, a, b = map(int, input().split())
if a <= b:
print('delicious')
else:
if b - a <= x:
print('safe')
else:
print('dangerous')
|
p02729
|
s777259255
|
Wrong Answer
|
N,M = map(int,input().split())
print(int(N*(N+1)/2+M*(M+1)/2))
|
p03723
|
s914293707
|
Accepted
|
A, B, C = map(int, input().split())
res = 0
while True:
if A%2 + B%2 + C%2 > 0:
break
A, B, C = B//2 + C//2, C//2 + A//2, A//2 + B//2
if A == B and B == C:
res = -1
break
res += 1
print(res)
|
p03407
|
s836519074
|
Accepted
|
a,b,c = list(map(int,input().split()))
print(['No','Yes'][int(a+b>=c)])
|
p02607
|
s479153025
|
Wrong Answer
|
n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2!=0 and a[i]%2!=0:
cnt+=1
print(cnt)
|
p03696
|
s774119168
|
Accepted
|
N = int(input())
S = input()
hidari = 0
migi = 0
for i in range(N):
if S[i] == '(':
hidari += 1
else:
if hidari > 0:
hidari -= 1
else:
migi += 1
S = '(' * migi + S + ')' * hidari
print(S)
|
p02843
|
s412369957
|
Accepted
|
x=int(input())
num1=-((x%100)//-5)
num2=x//100
if num1>num2:
print(0)
else:
print(1)
|
p03803
|
s451669173
|
Accepted
|
i = list(map(int, input().split()))
A=i[0]
B=i[1]
if A==B:
print("Draw")
elif A>B and B!=1:
print("Alice")
elif A<B and A!=1:
print("Bob")
elif A>B and B==1:
print("Bob")
elif A<B and A==1:
print("Alice")
|
p03386
|
s985490680
|
Wrong Answer
|
a, b, k = map(int, input().split())
l = [i for i in range(a, b+1)]
if b - a < k:
for i in l:
print(i)
else:
for i in l[:k]:
print(i)
for i in l[-k:]:
print(i)
|
p03351
|
s051782070
|
Accepted
|
a, b, c, d = map(int, input().split())
print('Yes' if abs(a-c) <= d or abs(a-b) <= d and abs(b-c) <= d else 'No')
|
p03699
|
s357564981
|
Wrong Answer
|
n = int(input())
s = []
for i in range(n):
S = int(input())
s.append(S)
s.sort()
count = 0
for i in range(n):
ans = sum(s[i:])
if ans %10 ==0:
count +=1
else:
print(sum(s[i:]))
break
if count == len(s):
print(0)
|
p02899
|
s038130436
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
student_dic = {}
for i in range(N):
student_dic[A[i]] = i+1
tmp = sorted(student_dic.items())
for i in range(N):
if i == N-1:
print(tmp[i][1])
else:
print(tmp[i][1], end=" ")
|
p02556
|
s500704059
|
Wrong Answer
|
N = int(input())
hw = [[int(i) for i in input().split()] for _ in range(N)]
minD = 2 * 10**9
min = 0
maxD = 0
max = 0
for i in range(N):
if (minD > (hw[i][0] + hw[i][1])):
minD = hw[i][0] + hw[i][1]
min = i
if (maxD < hw[i][0] + hw[i][1]):
maxD = hw[i][0] + hw[i][1]
max = i
print(abs(hw[max][0] - hw[min][0]) + abs(hw[max][1] - hw[min][1]))
|
p03721
|
s487108960
|
Accepted
|
n, k = map(int, input().split())
l = [0]*100010
cnt = 0
for i in range(n):
a, b = map(int, input().split())
l[a] += b
for i in range(100010):
cnt += l[i]
if k <= cnt:
print(i)
exit()
|
p02787
|
s437224798
|
Wrong Answer
|
h, n = map(int, input().split())
l = []
for i in range(n):
a, b = map(int, input().split())
l.append((a, b))
m = max(l, key=lambda x: x[0])[0]
dp = [1]*(h+m+1)
dp[0] = 0
for i in range(1, h+m+1):
dp[i] = min([dp[i-l[j][0]]+l[j][1] for j in range(n)])
|
p02645
|
s271698587
|
Wrong Answer
|
print(input()[0:2])
|
p03105
|
s964087682
|
Accepted
|
a, b, c = map(int, input().split())
t = b // a
if t > c:
print(c)
else:
print(t)
|
p03323
|
s903330751
|
Wrong Answer
|
a, b = map(int,input().split())
c = max(a,b)
if c <= 16:
print("Yay!")
else:
print(":(")
|
p03087
|
s881757250
|
Accepted
|
n, q = map(int, input().split())
s = input().rstrip()
ns = [None] * n
ns[0] = 0
nn = 0
for i in range(n - 1):
if s[i] == 'A' and s[i + 1] == 'C':
nn += 1
ns[i + 1] = nn
for i in range(q):
l, r = map(int, input().split())
l -= 1
r -= 1
print(ns[r] - ns[l])
|
p02835
|
s624363548
|
Accepted
|
a, b, c = map(int, input().split())
print('bust') if a+b+c > 21 else print('win')
|
p03087
|
s153166357
|
Wrong Answer
|
n,q=map(int,input().split())
l=[0 for i in range(n)]
for i,v in enumerate(list(input().replace("AC","X!"))):
l[i]=l[i-1]+(v=="!")
print(l)
for c in range(q):
h,m=map(int,input().split())
print(l[m-1]-l[h-1])
|
p03679
|
s647107116
|
Wrong Answer
|
x,a,b = map(int, input().split())
if b-a < 1:
print("delicious")
elif b-a == 1:
print("safe")
else:
print("dangerous")
|
p03861
|
s764115038
|
Wrong Answer
|
a, b, x = map( int, input().split())
print( a//x - b//x +1)
|
p03785
|
s833204360
|
Wrong Answer
|
n, c, k = map(int, input().split())
t = []
for _ in range(n):
t.append(int(input()))
t.sort()
first = t[0]
wait = 1
need = 1
for i in t:
if first + k < i or wait > c:
need += 1
wait = 1
first = i
continue
wait += 1
print(need)
|
p02861
|
s236939922
|
Accepted
|
import itertools
import math
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
s = list(range(N))
sum = 0
for v in itertools.permutations(s):
for i in range(N-1):
distance = math.sqrt((xy[v[i]][0]-xy[v[i+1]][0])**2 + (xy[v[i]][1]-xy[v[i+1]][1])**2)
sum += distance
print(sum/math.factorial(N))
|
p02678
|
s527079289
|
Accepted
|
n,m = map(int,input().split())
t = []
l = [0]*(n+1)
for i in range(n+1):
t.append([])
for i in range(m):
a,b = map(int,input().split())
t[a].append(b)
t[b].append(a)
x = [1]
p = 0
while(p < n):
for i in range(len(t[x[p]])):
c = t[x[p]][i]
if(l[c] == 0):
x.append(c)
l[c] = x[p]
p += 1
print("Yes")
for i in range(2,n+1):
print(l[i])
|
p03073
|
s194773676
|
Accepted
|
S = input()
A = S[0::2].count("1") + S[1::2].count("0")
B = S[0::2].count("0") + S[1::2].count("1")
print(min(A,B))
|
p03109
|
s464963922
|
Wrong Answer
|
S = list(input().split('/'))
A = S[0]+S[1]+S[2]
print(A)
if int(A) > 20190430:
print("TBD")
else:
print("Heisei")
|
p03262
|
s931887899
|
Wrong Answer
|
import math
N, X = [int(i) for i in input().split()]
x = [int(i) for i in input().split()]
x.append(X)
x.sort()
xdst = [x[i+1] - x[i] for i in range(N)]
print(xdst)
ans = 10**10
if len(xdst) == 1:
#print(xdst[0])
exit()
for i in range(N-1):
ans = min(math.gcd(xdst[i], xdst[i+1]),ans)
print(ans)
|
p02780
|
s022012213
|
Accepted
|
from itertools import accumulate
N,K = map(int,input().split())
P = [(int(i) + 1) / 2 for i in input().split()]
ans = []
hope = [0] + list(accumulate(P))
for j in range(N-K+1):
ans.append(hope[j+K]-hope[j])
print(max(ans))
|
p02660
|
s738822853
|
Accepted
|
n = int(input())
n2 = int(n**0.5//1)
def div(n,p):
cnt = 0
a = 1
while n%p == 0:
n = n//p
cnt += 1
if cnt == a:
cnt = 0
a += 1
return [n,a-1]
ans = 0
for z in range(2,n2):
if n%z == 0:
n,cur = div(n,z)
ans += cur
if n != 1: ans += 1
print(ans)
|
p02767
|
s356159981
|
Accepted
|
n = int(input())
l = list(map(int, input().split()))
ans = 1000000
for p in range(1,101):
d = 0
for x in l:
d += (x-p)**2
ans = min(d,ans)
print(ans)
|
p02912
|
s949402667
|
Accepted
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from heapq import heapify, heappop, heappush
def main():
N, M = map(int, readline().split())
A = [-int(i) for i in readline().split()]
heapify(A)
for _ in range(M):
v = -heappop(A)
heappush(A, -(v//2))
print(sum([-i for i in A]))
if __name__ == '__main__':
main()
|
p03624
|
s371714494
|
Accepted
|
alphabet='abcdefghijklmnopqrstuvwxyz'
S=input()
ans="None"
for a in alphabet:
if S.count(a)==0:
ans=a
break
print(ans)
|
p03162
|
s553739146
|
Wrong Answer
|
n = int(input())
h = []
for _ in range(n):
a,b,c = map(int,input().split())
h.append([a,b,c])
dp=[[0 for i in range(3)] for j in range(n)]
dp[0] = h[0]
for i in range(1,n):
for j in range(3):
dp[i][j]=dp[i-1][j]+max(h[i][(j+1)%3],h[i][(j+2)%3])
print(max(dp[-1]))
|
p03545
|
s243360291
|
Accepted
|
a,b,c,d=input()
for i in range(2**3):
op=["-","-","-"]
for j in range(3):
if (i>>j&1):
op[j]="+"
if eval(a+op[0]+b+op[1]+c+op[2]+d)==7:
print(a+op[0]+b+op[1]+c+op[2]+d+"=7")
exit()
|
p03075
|
s576740854
|
Wrong Answer
|
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
x = e - a
if x < k:
print('Yey!')
else:
print(':(')
|
p02726
|
s898805346
|
Accepted
|
# -*- coding: utf-8 -*-
n, x, y = map(int, input().split())
count = [0]*(n-1)
for i in range(1, n+1):
for j in range(i+1, n+1):
dist = min(j-i, abs(x-i) + 1 + abs(y-j))
count[dist-1] += 1
for ci in count:
print(ci)
|
p03069
|
s065055181
|
Accepted
|
N=int(input())
S=input()
b=[None]*(N+1)
b[0]=0
w=[None]*(N+1)
w[N]=0
for i in range(1,N+1):
b[i]=b[i-1]+(S[i-1]=='#')
for i in range(N-1,-1,-1):
w[i]=w[i+1]+(S[i]=='.')
print(min([x+y for x,y in zip(b,w)]))
|
p03723
|
s593771283
|
Wrong Answer
|
a,b,c=map(int,input().split())
cnt=0
if a==b==c:
print(-1)
exit()
while a%2==b%2==c%2==0:
a,b,c=(b+c)//2,(a+c)//2,(a+b)//2
cnt+=1
print(cnt)
|
p02957
|
s909291693
|
Accepted
|
A,B=map(int,input().split(" "))
K=(A+B)/2
print(int(K) if int(K)==K else "IMPOSSIBLE")
|
p02972
|
s768113239
|
Accepted
|
N,*aa = map(int, open(0).read().split())
ans = [None]*(N//2) + aa[N//2:]
for i in range(N//2,0,-1):
ans[i-1] = (sum(ans[2*i-1::i])%2)^aa[i-1]
p = sum(ans)
print(p)
if p:
print(*(i+1 for i,v in enumerate(ans) if v))
|
p02748
|
s838584491
|
Accepted
|
a, b, m = map(int,input().split())
ai = list(map(int,input().split()))
bi = list(map(int,input().split()))
ans = min(ai)+min(bi)
for k in range(m):
ak, bk, mk = map(int,input().split())
ansk = ai[ak-1]+bi[bk-1]-mk
if ansk<ans:
ans = ansk
print(ans)
|
p03493
|
s380752473
|
Accepted
|
a = input()
print(a.count("1"))
|
p02615
|
s033369620
|
Accepted
|
import heapq
n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = 0
heap = []
heapq.heappush(heap, -a[0])
for i in range(1, n):
tmp = heapq.heappop(heap)
tmp *= -1
ans += tmp
heapq.heappush(heap, -a[i])
heapq.heappush(heap, -a[i])
print(ans)
|
p03041
|
s690420831
|
Accepted
|
n, k = map(int, input().split())
s = str(input())
ans = ''
if s[k-1] == 'A':
ans = s[:k-1] + 'a' + s[k:]
print(ans)
exit()
elif s[k-1] == 'B':
ans = s[:k-1] + 'b' + s[k:]
print(ans)
exit()
elif s[k-1] == 'C':
ans = s[:k-1] + 'c' + s[k:]
print(ans)
exit()
|
p02939
|
s459026576
|
Accepted
|
from sys import stdin
s = stdin.readline().rstrip()
N = len(s)
dp = [0]*N
dp[0] = 1
if s[0] == s[1]:
dp[1] = 1
else:
dp[1] = 2
for i in range(2,N):
if s[i] == s[i-1]:
dp[i] = dp[i-3] + 2
else:
dp[i] = dp[i-1] + 1
print(dp[N-1])
|
p02701
|
s843369446
|
Accepted
|
count = int(input())
strlist = set()
for i in range(count):
strlist.add(input())
print(len(strlist))
|
p04034
|
s855374136
|
Accepted
|
n, m = map(int, input().split())
r = [False] * n
r[0] = True
l = [1] * n
for _ in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
l[x] -= 1
l[y] += 1
r[y] = r[x] | r[y]
if not l[x]:
r[x] = False
c = 0
for i in range(n):
if r[i] == True and l[i] > 0:
c += 1
print(c)
|
p03286
|
s316073775
|
Wrong Answer
|
import itertools
N = int(input())
ans = []
while N !=0:
ans.append(N%2)
N = -(N-N%2)//2
print("".join(list(map(str,ans))))
|
p02693
|
s316280932
|
Accepted
|
import math
n=int(input())
a,b=map(int,input().split())
for i in range(a,b+1):
if i%n==0:
print("OK")
exit()
print("NG")
|
p03657
|
s254966898
|
Wrong Answer
|
a,b=map(int,input().split())
print(["P","Imp"][a%3==b%3 and a%3==1 or a%3==2]+"ossible")
|
p03645
|
s632470922
|
Accepted
|
N, M = map(int, input().split())
ab=[]
for _ in range(M):
ab.append(tuple(map(int, input().split())))
#print(ab)
from_1=set([el[1] for el in ab if el[0]==1])
from_N=set([el[0] for el in ab if el[1]==N])
#print(from_1, from_N)
if from_1 & from_N:
print('POSSIBLE')
else:
print('IMPOSSIBLE')
|
p03472
|
s919240456
|
Accepted
|
import sys
input = sys.stdin.readline
N, H = map(int, input().split())
a_max = 0
b = []
for _ in range(N):
ai, bi = map(int, input().split())
a_max = max(a_max, ai)
b.append(bi)
b.sort(reverse=True)
ans = 0
for bi in b:
if a_max>bi:
break
H -= bi
ans += 1
if H<=0:
print(ans)
exit()
ans += (H+a_max-1)//a_max
print(ans)
|
p03854
|
s166280766
|
Accepted
|
S = input()
a = 'dream'
b = 'dreamer'
c = 'erase'
d = 'eraser'
T = S
while len(T) > 4:
if S[len(T)-5:len(T)] == a:
T = T[0:len(T)-5]
elif S[len(T)-7:len(T)] == b:
T = T[0:len(T)-7]
elif S[len(T)-5:len(T)] == c:
T = T[0:len(T)-5]
elif S[len(T)-6:len(T)] == d:
T = T[0:len(T)-6]
else:
break
if T == '':
print('YES')
else:
print('NO')
|
p04012
|
s562932183
|
Accepted
|
w = input()
for i in w:
if w.count(i) %2 != 0:
print("No")
break
else:
print("Yes")
|
p03013
|
s220101257
|
Accepted
|
import sys
input = sys.stdin.readline
mod = 10**9+7
n, m = map(int, input().split())
l = [0]*n
for _ in range(m):
l[int(input())-1] = 1
t, s = 1, 0
for i in range(n):
if l[i]:
t, s = 0, t
else:
t, s = (s+t)%mod, t
print(t)
|
p02712
|
s372763450
|
Accepted
|
N = int(input())
c = 0
for n in range(1, N+1):
if n % 3 != 0 and n % 5 != 0:
c += n
print(c)
|
p02596
|
s577509095
|
Wrong Answer
|
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
import bisect
INF = 10**9+7
if __name__ == "__main__":
k = int(input())
if k%2 == 0:
print(-1)
sys.exit()
a = 7
p = len(str(k)) + 1
for i in range(p):
if a%k == 0:
print(i+1)
sys.exit()
a*=10
a+=7
print(k-1)
|
p03627
|
s627787930
|
Accepted
|
from collections import Counter
n = int(input())
A = list(map(int, input().split()))
ac = sorted([(i, v) for i, v in Counter(A).items() if v >= 2], reverse=True)
s = []
for k, v in ac:
for _ in range(v//2):
s.append(k)
if len(s) >= 2:
break
if len(s) >= 2:
print(s[0]*s[1])
else:
print(0)
|
p03387
|
s796627884
|
Accepted
|
a,b,c=sorted(map(int,input().split()))
#print(a,b,c)
cnt=0
if a%2==b%2==c%2:
cnt=0
elif a%2==b%2:
cnt+=1
a+=1
b+=1
elif b%2==c%2:
cnt+=1
b+=1
c+=1
elif a%2==c%2:
cnt+=1
a+=1
c+=1
#print(cnt,a,b,c)
cnt+=(c-a)//2+(c-b)//2
print(cnt)
|
p02835
|
s089699317
|
Accepted
|
a,b,c = input().split()
if int(a) + int(b) + int(c) >= 22:
print('bust')
else:
print('win')
|
p03219
|
s261277437
|
Accepted
|
x,y=map(int,input().split())
print(x+y//2)
|
p02707
|
s904884894
|
Accepted
|
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
counter = Counter(a)
for i in range(n):
print(counter[i+1])
|
p02801
|
s461628768
|
Accepted
|
print(chr(ord(input())+1))
|
p02584
|
s766469653
|
Accepted
|
x, k, d = map(int, input().split())
if x < 0:
flag = -1
else:
flag = 1
if abs(x) >= k * d:
ans = x - k * d * flag
else:
k -= abs(x) // d
x = abs(x) % d * flag
ans = x if k % 2 == 0 else x - d * flag
print(abs(ans))
|
p03487
|
s907581519
|
Accepted
|
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
d = Counter(a)
res = 0
for k, v in d.items():
if k > v:
res += v
else:
res += v - k
print(res)
|
p02995
|
s402931995
|
Accepted
|
from fractions import gcd
a, b, c, d = map(int, input().split())
div_c = b//c - a//c
if a%c == 0: div_c += 1
div_d = b//d - a//d
if a%d == 0: div_d += 1
lcm_cd = c*d//gcd(c, d)
div_cd = b//lcm_cd - a//lcm_cd
if a%lcm_cd == 0: div_cd += 1
print(b - a + 1 - div_c - div_d + div_cd)
|
p03698
|
s216923628
|
Accepted
|
s = input()
print("yes" if len(s) == len(list(set(s))) else "no")
|
p04044
|
s669648776
|
Accepted
|
def main():
N, L = map(int, input().split())
word_list = list()
for i in range(N):
word_list.append(input())
word_list.sort()
print("".join(word_list))
main()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.