problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02681 | s737133156 | Accepted | s = input()
t = input()
l = len(s)
if t[:l] == s[:l]:
print('Yes')
else:
print('No') |
p02953 | s259295986 | Accepted | n = int(input())
H = list(map(int,input().split()))
H[0] -= 1
ans = "Yes"
for i in range(1,n):
if H[i] < H[i-1]:
ans = "No"
break
if H[i]-1 >= H[i-1]:
H[i]-=1
print(ans) |
p02911 | s942608715 | Accepted | n,k,q = map(int,input().split())
point = [k-q]*n
for i in range(q):
a = int(input())
point[a-1] += 1
for j in point:
if j>0:
print('Yes')
else:
print('No') |
p03012 | s564988805 | Accepted | N = int(input())
W = list(map(int, input().split()))
ans = float("inf")
for idx in range(N):
diff = abs(sum(W[:idx]) - sum(W[idx:]))
if diff <= ans:
ans = diff
print(ans)
|
p02933 | s425220942 | Accepted | a=int(input())
s=input()
print(s if a>=3200 else "red") |
p02761 | s867706668 | Accepted | n, m = map(int, input().split())
s = []
c = []
for i in range(m):
S, C = map(int, input().split())
s.append(S-1)
c.append(str(C))
ans = -1
if n == 3:
st, ed = 100, 1000
elif n == 2:
st, ed = 10, 100
else:
st, ed = 0, 10
for i in range(st, ed):
t = list(str(i))
for j in range(m):
if t[s[j]] != c[j]:
break
else:
ans = i
break
print(ans) |
p03380 | s958127200 | Accepted | n = int(input())
a = list(map(int,input().split()))
a.sort()
N,K = a[n-1],a[0]
for i in range(1,n):
if abs((N+1)//2 - K) > abs((N+1)//2 - a[i]):
K = a[i]
print(N,K)
|
p03986 | s130596452 | Wrong Answer | x = input()
s_q = []
t_q = []
for i, v in enumerate(x):
if v == 'S':
s_q.append(v)
else:
t_q.append(v)
while len(t_q) > 0 and len(s_q) > 0:
t_q.pop()
s_q.pop()
print(len(s_q)+len(t_q))
|
p03556 | s869662346 | Accepted | import math
n=int(input())
if n==0:
print(0)
exit(0)
l1=[i*i for i in range(int(math.sqrt(n))+1)]
print(l1[-1]) |
p02993 | s872527065 | Accepted | s = input()
flg = "Good"
for i in range(4-1):
if s[i]==s[i+1]:
flg = "Bad"
print(flg) |
p02624 | s168648748 | Accepted | def f(n):
return n * (n + 1) // 2
answer = 0
n = int(input())
for i in range(1, n+1):
answer += i * f(n//i)
print(answer) |
p02814 | s687719439 | Accepted | N,M = map(int, input().split())
a_n = list(map(int, input().split()))
g = a_n.copy()
while not any(x%2 for x in g): g = [x//2 for x in g]
if not all(x%2 for x in g): print(0); exit(0)
def gcd(a,b):
while b: a,b = b,a%b
return a
lcm = lambda a,b: a*b//gcd(a,b)
tot = 1
for x in a_n: tot = lcm(tot,x//2)
print((M//tot+1)//2) |
p02702 | s249614185 | Accepted | import time
p0 = time.time()
S = input()
n = len(S)
Y = {0:1}
# print(Y)
Y[0] = 1
A = [0]
pk = 0
for i in range(1,n+1):
# print(S[-i])
k = (int(S[-i])*pow(10,i-1,2019)+pk)%2019
A.append(k)
if k not in Y:
Y[k] = 1
else:
Y[k] += 1
pk = k
# print(A)
# print(Y)
# print(time.time()-p0)
c = 0
for y in Y:
d = Y[y]
c += d*(d-1)//2
print(c) |
p02779 | s138381052 | Wrong Answer | s = int(input())
l = [int(n) for n in input().split()]
l = sorted(l)
flag = 0
print(l)
for i in range(len(l)- 1):
if l[i] == l[i+1]:
print("NO")
flag = 1
if flag == 0:
print("YES")
|
p03693 | s428807170 | Accepted | r,g,b=[int(i) for i in input().split()]
num=r*100+g*10+b
if num%4==0:
print("YES")
else:
print("NO")
|
p03435 | s904233714 | Accepted | c = []
for i in range(3):
r = list(map(int, input().split()))
c.append(r)
d1 = set([])
d2 = set([])
d3 = set([])
d4 = set([])
for i in range(3):
d1.add(c[i][1] - c[i][0])
d2.add(c[i][2] - c[i][1])
d3.add(c[1][i] - c[0][i])
d4.add(c[2][i] - c[1][i])
if len(d1) == 1 and len(d2) == 1 and len(d3) == 1 and len(d4) == 1:
print('Yes')
else:
print('No')
|
p03131 | s940395292 | Wrong Answer | arr = input().split()
K = int(arr[0])
A = int(arr[1])
B = int(arr[2])
n = 1 + K
x = B
K -= A+1
temp = int(K / 2)
x += temp * (B-A)
K -= temp * 2
while K > 0:
K -= 1
x += 1
print(max(x, n))
|
p02683 | s602443428 | Accepted | n, m, x = map(int, input().split())
a = [list(map(int, input().split())) for _i in range(n)]
result = []
for i in range(2**n):
num = i
memo = [0 for _ in range(m)]
cost = 0
for j in range(n):
if num%2==1:
cost += a[j][0]
for s in range(m):
memo[s] += a[j][s+1]
num >>= 1
if all(i >= x for i in memo):
result.append(cost)
if len(result)==0:
print(-1)
else:
print(min(result)) |
p02860 | s943683410 | Accepted | n = int(input())
s = input()
if n % 2 != 0:
print('No')
else:
a = s[:len(s)//2]
b = s[len(s)//2:]
print(['No', 'Yes'][a == b]) |
p03137 | s780353828 | Accepted | import numpy as np
N,M,*X=map(int,open(0).read().split())
X.sort()
a=np.array(X)
d=np.diff(a)
d.sort()
all=X[-1]-X[0]
left=d[-1:-N:-1].sum()
print(all-left) |
p03672 | s663276664 | Wrong Answer | S = list(input())
for i in range(len(S)-1):
del S[-1]
if len(S)%2==0 and S[0:len(S)//2] == S[len(S)//2:]:
print(len(S)) |
p02819 | s360394541 | Accepted | x = int(input())
ok = False
while ok == False:
ok = True
for i in range(2, int(x/2)):
if x%i == 0:
ok = False
x += 1
#print("####")
break
if ok == True:
print(x)
break
|
p03281 | s132124944 | Accepted | import numpy as np
n=int(input())
ans=0
for k in range(n+1):
if k%2==1:
count=0
m=int(np.sqrt(k)+1)
for i in range(m):
a=i+1
if(k%a==0):
count+=1
if count==4:
ans+=1
print(ans)
|
p03486 | s144079813 | Wrong Answer | s = input()
t = input()
if sorted(s) < sorted(t):
print('Yes')
else:
print('No') |
p02911 | s399451542 | Wrong Answer | import collections
N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
c = collections.Counter(A)
l = []
for i,v in dict(c).items():
if v > (Q-K):
l.append(i-1)
for j in range(N):
if j in l:
print('Yes')
else:
print('No') |
p03555 | s112966542 | Accepted | s1 = [i for i in input()]
s2 = [i for i in input()]
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
print("YES")
else:
print("NO") |
p03210 | s678481713 | Accepted | d = int(input())
if d == 7 or d == 5 or d == 3:
print('YES')
else:
print('NO') |
p04011 | s726411923 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
total = 0
for i in range(1,n+1):
if i <= k:
total += x
else:
total += y
print (total) |
p02660 | s751360018 | Wrong Answer | from collections import Counter
def factorize(n):
a = 2
fct = []
while a <= n:
print('-------')
while n % a == 0:
n = n // a
fct.append(a)
a += 1
if n > 1:
fct.append(n)
return fct
n = int(input())
c = Counter(factorize(n))
# print(factorize(n))
# print(c.values())
ans = 0
for v in c.values():
t = 1
while v >= t:
v -= t
t += 1
ans += 1
print(ans) |
p02719 | s313669078 | Accepted | n, k = map(int,input().split())
# print(min(abs(n - k * int(n/k)), abs(n - k * (int(n/k) + 1))))
# もっと簡単に書けばこうか でもなぜ上は通らない？
print(min(n%k, k-(n%k))) |
p02922 | s929412182 | Wrong Answer | def main():
a,b= list(map(int,input().split()))
ans=a
num=1
while ans<b:
num+=1
ans+=a-1
print(num)
main() |
p02784 | s461679269 | Wrong Answer | import math
h, n = map(int, input().split())
a = [int(i) for i in input().split()]
if sum(a) >= h:
print('yes')
else:
print('no') |
p02629 | s838232387 | Accepted | n = int(input())
cha = "abcdefghijklmnopqrstuvwxyz"
ans = []
while n >= 1:
mod = (n - 1) % 26
ans.append(mod)
n = (n - 1) // 26
ans_s = ''
for tmp in reversed(ans):
ans_s += cha[tmp]
print(ans_s) |
p03943 | s196193356 | Accepted | a = list(map(int, input().split()))
a.sort()
if a[0] + a[1] == a[2]:
print('Yes')
else: print('No') |
p03012 | s703830552 | Accepted | N = int(input())
W = list(map(int,input().split()))
m = sum(W)
for i in range(1,N):
S1 = sum(W[:i])
S2 = sum(W[i:])
if m > abs(S1-S2):
m = abs(S1-S2)
print(m) |
p03455 | s187537540 | Wrong Answer | sum_input = list(map(int, input().split(" ")))
print("Even" if (sum(sum_input) % 2) == 0 else "Odd") |
p02897 | s460264453 | Wrong Answer | n = int(input())
print(n/2) |
p02664 | s377841783 | Accepted | S=input()
S=S.replace("?","D")
print(S) |
p02623 | s006758321 | Accepted | import bisect
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = [0 for i in range(n+1)]
sb = [0 for i in range(m+1)]
c = 0
for i in range(n):
c += a[i]
sa[i+1] = c
c = 0
for i in range(m):
c += b[i]
sb[i+1] = c
ans = 0
# if k >= sum(a)+sum(b):
# print (n+m)
# exit()
for i in range(n+1):
x = k - sa[i]
if x < 0:
continue
y = bisect.bisect_right(sb,x)
y += i
ans = max(ans, y-1)
print (ans) |
p02688 | s623794459 | Wrong Answer | N_nin, K_ko = map(int, input().split())
sunuke = []
for i in range(K_ko):
d = int(input())
if (d != 1):
sunuke.append(map(int, input().split()))
else:
sunuke.append(int(input()))
ans = N_nin - len(set(sunuke))
print(ans) |
p02725 | s930103292 | Wrong Answer | k,n = map(int, input().split())
l = list(map(int, input().split()))
d = []
for i in range(n):
if i + 1 < n:
d.append(l[i+1]-l[i])
else:
d.append(k - l[i])
sum = sum(d)
a = []
for i in range(n):
a.append(sum - d[i])
print(min(a)) |
p03131 | s286717667 | Accepted | import math
def myAnswer(K:int,A:int,B:int) -> int:
if(K <= A-1): return K+1
tmp =(K - (A-1))
# print(tmp)
ans = (B - A) * math.floor(tmp//2) + tmp % 2 + A
# print(ans)
return max(ans,K+1)
def modelAnswer():
return
def main():
K,A,B = map(int,input().split())
print(myAnswer(K,A,B))
if __name__ == '__main__':
main() |
p02783 | s172443494 | Accepted | import sys
import math
ha=input().rstrip().split(" ")
h=int(ha[0])
a=int(ha[1])
i=0
hp=h
while hp>0:
hp=hp-a
i=i+1
print(i) |
p02598 | s548677434 | Wrong Answer | import math
N,K = map(int,input().split())
A = list(map(int,input().split()))
m = 0
M = max(A)
while(M-m>0.5):
mm = 0
mid = (M+m)/2
for i in range(N):
mm += math.ceil(A[i]/mid)-1
if mm>K:
m = mid
else:
M = mid
print(math.ceil(mid))
|
p02725 | s052485324 | Accepted | k,n = map(int,input().split())
a =list(map(int,input().split()))
kyori = [0]*n
# print(a)
for i in range(1,n):
# print(i)
kyori[i]=a[i]-a[i-1]
kyori[0]=a[0]+(k-a[n-1])
print(k-max(kyori)) |
p02555 | s657510811 | Wrong Answer | S=int(input())
if S<3:
ans=0
else:
ans=0
a=1
b=int((S-S%3)/3)
for x in range(1,b+1):
for i in range(1,S-2*x-2):
a*=i
ans+=a
a=1
print(ans) |
p02678 | s414768317 | Wrong Answer | from collections import deque
n, m = map(int, input().split())
graph = [[] for _ in range(n+1)]
for i in range(m):
a,b = map(int, input().split())
graph[a].append(b)
graph[b].append(a)
dist = [-1] * (n + 1)
dist[0] = 0
dist[1] = 0
d=deque()
d.append(1)
while d:
v = d.popleft()
for i in graph[v]:
if dist[i] != -1:
continue
dist[i] = dist[v] + 1
d.append(i)
ans = dist[2:]
print('Yes')
print(*ans,sep='\n')
|
p02645 | s160070972 | Accepted | print(input()[:3]) |
p03998 | s039962661 | Accepted | sa=list(input())
sb=list(input())
sc=list(input())
flg="a"
while True:
if flg=="a":
if len(sa)==0:
break
else:
flg=sa[0]
sa.pop(0)
elif flg=="b":
if len(sb)==0:
break
flg=sb[0]
sb.pop(0)
elif flg=="c":
if len(sc)==0:
break
else:
flg=sc[0]
sc.pop(0)
print("A" if flg=="a" else "B" if flg=="b" else "C") |
p02730 | s873515490 | Accepted | S = input().strip()
N = len(S)
a = S[:(N-1)//2]
if S==S[::-1] and a==a[::-1]:
print("Yes")
else:
print("No") |
p03632 | s034935798 | Wrong Answer | A, B, C, D = map(int, input().split())
if B >= C:
ans = B - C
else:
ans = 0
print(ans) |
p03243 | s665138536 | Accepted | n = int(input())
while True:
if len(set(str(n))) == 1:
break
else:
n += 1
print(n) |
p02996 | s075016241 | Accepted | def cumsum(a):
s = [0]
for i in range(len(a)):
s.append(s[i]+a[i][0])
return s
n = int(input())
a_b = [list(map(int,input().split())) for _ in range(n)]
a_b = sorted(a_b,key=lambda x: x[1])
#print(a_b)
all = cumsum(a_b)
#print(all)
flag = 1
for i in range(n):
if all[i+1] > a_b[i][1]:
flag = 0
break
if flag:
print('Yes')
else:
print('No') |
p04005 | s890549916 | Accepted | def main():
lst = list(map(int, input().split()))
lst.sort()
for l in lst:
if l % 2 == 0:
print(0)
exit()
print(lst[0] * lst[1])
if __name__ == "__main__":
main()
|
p03624 | s483962774 | Wrong Answer | s = str(input())
S = [s[i] for i in range(len(s))]
S.sort()
S = set(S)
count = [chr(i) for i in range(97, 97+26)]
for i in count:
if i in S:
pass
else:
print(i)
break |
p02702 | s187572091 | Accepted | from collections import defaultdict
s=input()
n=len(s)
N=defaultdict(int)
x=0
for i in reversed(range(n)):
x+=int(s[i])*pow(10,(n-i-1),2019)
x%=2019
N[x]+=1
ans=N[0]
for j in N.values():
ans+=j*(j-1)//2
print(ans) |
p03219 | s493975431 | Accepted | x, y = map(int, input().split())
print(x + (y//2)) |
p03161 | s408475399 | Wrong Answer | import numpy as np
import sys
n, k = map(int, input().split())
dp = np.full(n, 10005, dtype=int)
h = np.array([int(x) for x in input().split()])
if n - 1 <= k:
print(abs(h[n - 1] - h[0]))
sys.exit()
if k == 1:
s = 0
for i in range(n - 1):
s += abs(h[i + 1] - h[i])
print(s)
sys.exit()
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
for j in range(1, min(i + 1, k + 1)):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print(dp[n - 1])
|
p02818 | s740766686 | Wrong Answer | t,a,k = map(int,input().split())
t = t-k
if t<0:
a -= t
t = 0
if a<0:
a = 0
print(t,a) |
p02987 | s269100398 | Wrong Answer | s1,s2,s3,s4 = list(input())
p=0
if s1==s2:
if s3!=s4:
p=1
elif s1==s3:
if s2!=s4:
p=1
elif s1==s4:
if s3!=s2:
p=1
elif s1==s2 and s1== s3 and s1==s4:
p=1
else:
p=1
if p==0:
print("Yes")
elif p==1:
print("No")
|
p03605 | s941331805 | Wrong Answer | s = input()
if s[0] == 9 or s[1] == 9:
print('No')
else:
print('Yes') |
p02663 | s213162133 | Accepted | a,b,c,d,e=map(int,input().split())
f=c*60+d-a*60-b
if f-e>=0:
print(f-e)
else:
print(0) |
p02947 | s117243320 | Accepted | n = int(input())
s = [" ".join(sorted(input())) for _ in range(n)]
count = 0
dic = {}
for a in s:
if a in dic.keys():
count += dic[a]
dic[a] += 1
else:
dic[a] = 1
print(count) |
p03030 | s060649401 | Wrong Answer | from operator import itemgetter
n = int(input())
sp = [input().split() for i in range(n)]
for i in range(n):
sp[i].append(i+1)
sp = sorted(sp, key=itemgetter(1), reverse=True)
sp = sorted(sp, key=itemgetter(0))
for i in range(n):
print(sp[i][2]) |
p04043 | s774655158 | Accepted | l = list(map(int,input().split()))
go = 0
shichi = 0
for i in range(3):
if l[i] == 5:
go += 1
for i in range(3):
if l[i] == 7:
shichi += 1
if go == 2 and shichi ==1:
print('YES')
else:
print('NO')
|
p03352 | s140707100 | Accepted | X = int(input())
ans = 1
for x in range(1, X):
for y in range(2, X):
if x ** y <= X:
ans = max(ans, x ** y)
else:
break
print(ans)
|
p02684 | s656074531 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[1]
Flag=True
now=1
arrived=set(b)
memo=1
while Flag:
b.append(a[now-1])
if a[now-1] in arrived:
Flag=False
memo=a[now-1]
arrived.add(a[now-1])
now=a[now-1]
loop=len(b)-b.index(memo)-1
first=b.index(memo)
if k>first:
p,q=divmod(k-first,loop)
print(b[first+q])
else:
print(b[k]) |
p03043 | s939836585 | Accepted | from math import log2,ceil
n,k=[int(s) for s in input().split()]
sum=0
for t in range(1,n+1):
if t>=k:
sum+=1
else:
sum+=1/(2**ceil(log2(k/t)))
print(sum/n) |
p03371 | s493421842 | Wrong Answer | A,B,C,X,Y=map(int,input().split(' '))
price=0
if X>Y:
N_same=Y
flag='A'
else:
N_same=X
flag='B'
if A+B >2*C:
price+=2*C*N_same
else:
price+=(A+B)*N_same
if flag=='A':
if A*(X-Y)>2*C*(X-Y):
price+=2*C*(X-Y)
else:
price+=A*(X-Y)
else:
if B*(X-Y)>2*C*(X-Y):
price+=2*C*(X-Y)
else:
price+=B*(X-Y)
print(price)
|
p02646 | s464073044 | Accepted |
def main():
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a == b:
print("YES")
return
dis = abs(a - b)
s = v - w
dis -= s * t
if dis <= 0:
print("YES")
else:
print("NO")
main()
|
p03067 | s021440145 | Wrong Answer | a,b,c = map(int,input().split())
if a < c < b:
print('Yes')
else:
print('No') |
p02768 | s373293689 | Accepted | import sys
input = sys.stdin.readline
N, a, b = map(int, input().split())
mod = 10 ** 9 + 7
res = pow(2, N, mod) - 1
ta = 1
for i in range(a):
ta *= N - i
ta %= mod
for i in range(a):
ta *= pow(i + 1, mod - 2, mod)
ta %= mod
tb = 1
for i in range(b):
tb *= N - i
tb %= mod
for i in range(b):
tb *= pow(i + 1, mod - 2, mod)
tb %= mod
print((res - ta - tb) % mod) |
p03699 | s105300795 | Accepted | #!/usr/bin/env python3
N = int(input())
S = sorted([int(input()) for i in range(N)])
ans = sum(S)
if ans % 10 == 0:
for i in S:
if (ans - i) % 10 != 0:
ans -= i
break
if ans % 10 == 0:
ans = 0
print(ans)
|
p03274 | s981752508 | Wrong Answer | if __name__ == '__main__':
n,k = map(int,input().split())
A = list(map(int,input().split()))
# ans = 100000001
ans = float("inf")
for i in range(k):
if i+k > n:
break
left = A[i]
right = A[i+k-1]
tmp = abs(left) + abs(right)
tmp2 = 0
if tmp >= 0:
#1 abs(left) < abs(right) の場合
tmp2 = abs(left) + abs(right - left)
else:
#2 abs(right) > abs(left)の場合
tmp2 = abs(right) + abs(left - right)
ans = min(ans,tmp2)
print(ans) |
p02552 | s575099706 | Accepted | def solve():
x = int(input())
print(x^1)
solve() |
p02847 | s993049989 | Accepted | days = ["SUN",
"MON",
"TUE",
"WED",
"THU",
"FRI",
"SAT"]
S = input()
print(7-days.index(S)) |
p03013 | s059917310 | Wrong Answer | MOD = 10**9 + 7
N, M = map(int, input().split())
stairs = [0]*(N+1)
for _ in range(M):
stairs[int(input())] = 1
if N == 1:
if M == 1:
print(0)
exit()
else:
print(1)
exit()
ans = [0]*(N+1)
ans[1] = 1 if stairs[1] == 0 else 0
ans[2] = 1 + ans[1] if stairs[2] == 0 else ans[1]
for i in range(3,N+1):
if stairs[i] == 1:
ans[i] = 0
continue
ans[i] = (ans[i-1] + ans[i-2]) % MOD
print(ans[N]) |
p03001 | s708825307 | Accepted | w, h, x, y = (int(i) for i in input().split())
s = (w * h) / 2
met = 1 if (x == w/2 and y == h/2) else 0
print(s, met) |
p02765 | s703205165 | Accepted | n,r = (map(int, input().split()))
if n >= 10:
print(r)
else:
print(r+100*(10-n)) |
p03076 | s909084116 | Accepted | a = []
for i in range(5):
a.append(int(input()))
b = []
for i in a:
if i%10:
b.append(i)
c = min(b,key = lambda x:x%10) if len(b) else 0
ans = 0
for i in a:
ans += i+(10-i%10) if i%10 else i
print(ans-(10-c%10) if len(b) else ans) |
p03469 | s477515889 | Accepted | s = input()
print("2018"+s[4:]) |
p04045 | s248862816 | Wrong Answer | n,k=map(int,input().split())
d = list(map(int,input().split()))
for i in range(n,10000):
count=0
for j in range(k):
u = d[j]
if(str(i).count(str(u))==0):
count+=1
if(count==k):
break
print(i) |
p03556 | s834395263 | Accepted | N=int(input())
if int((N+1)**.5)**2==N:print(N)
else:print(int(N**.5)**2) |
p03250 | s195864098 | Wrong Answer | A=list(input().split())
A=sorted(A,reverse=True)
print(A)
b=A[0]+A[1]
print(int(b)+int(A[2])) |
p03495 | s217715707 | Accepted | import collections
n,k = map(int,input().split())
s = list(map(int,input().split()))
c = collections.Counter(s)
tap = c.most_common()
ans = 0
while len(tap) > k:
ans += tap[-1][1]
tap.pop(-1)
print(ans) |
p03854 | s465499957 | Accepted | S = input()
def check(t):
if len(t) >= 5 and (t[-5:] == 'dream' or t[-5:] == 'erase'):
return True,t[:-5]
elif len(t) >=6 and t[-6:] == 'eraser':
return True,t[:-6]
elif len(t) >= 7 and t[-7:] == 'dreamer':
return True,t[:-7]
else:
return False,t
while(len(S) > 0):
flag,S = check(S)
if not flag:
print('NO')
exit()
print('YES')
|
p03693 | s455726104 | Accepted | r, g, b = map(int, input().split())
num = r * 100 + g * 10 + b
if num % 4 == 0:
print('YES')
else:
print('NO')
|
p02909 | s262455812 | Wrong Answer | a=input()
b=['Sunny','Cloudy', 'Rainy']
for i in range(2):
if i==3:
print('Sunny')
break
if b[i]==a:
print(b[i+1]) |
p02994 | s015027884 | Wrong Answer | """
author : halo2halo
date : 9, Jan, 2020
"""
import sys
# import numpy as np
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, L = map(int, readline().split())
F = [L + i for i in range(N)]
ans = sum(F)
for i in itertools.combinations(F, N - 1):
if abs(sum(F) - sum(i)) < ans:
ans = sum(i)
print(ans)
|
p03435 | s398990589 | Accepted | c_lst = [[int(c) for c in input().split()] for i in range(3)]
if c_lst[0][0] + c_lst[1][1] == c_lst[0][1] + c_lst[1][0] and c_lst[1][1] + c_lst[2][2] == c_lst[1][2] + c_lst[2][1] and c_lst[0][0] + c_lst[2][2] == c_lst[0][2] + c_lst[2][0]:
print('Yes')
else:
print('No')
|
p02854 | s925513213 | Accepted | n = int(input())
a = list(map(int, input().split()))
l = 0
r = sum(a)
ans = 10**10
for i in range(n):
l += a[i]
r -= a[i]
ans = min(ans, abs(l - r))
print(ans) |
p02766 | s463523796 | Accepted | n,k = map(int,input().split())
for i in range(10**9):
if n < k**i:
print(i)
exit() |
p02640 | s287015871 | Wrong Answer | a = list(map(int, input().split()))
res = 0
s = ''
for i in range(a[0]):
if a[0] * 4 < a[1] or a[0] * 2 > a[1]:
s = 'No'
break
if (a[0] == i + 1) and (res + 2 == a[1] or res + 4 == a[1]):
s = 'Yes'
if (a[0] - i) * 4 > a[1] and ((res + 4) + ((a[0] - i + 1) * 2) > a[1]):
res += 2
continue
else:
res += 4
continue
if s == '':
s = 'No'
print(s) |
p02701 | s410556929 | Accepted | n=int(input())
dic={}
for i in range(n):
tmp=input()
if tmp not in dic.keys():
dic[tmp]=1
print(len(dic)) |
p03319 | s404421438 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n-1)//(k-1))) |
p02922 | s748054943 | Accepted | a,b=map(int,input().split())
b-=a
b=-(b//-(a-1))
print(b+1)
|
p03387 | s097865958 | Accepted | a = sorted(map(int, input().split()))
ans = 0
diff = a[1] - a[0]
if diff > 0:
ans += diff // 2
a[0] += diff // 2 * 2
diff = a[2] - a[1]
if diff > 0:
ans += diff
a[1] += diff
a[0] += diff
if a[0]+1 == a[1] and a[1]+1 == a[2]:
print(ans+3)
elif a[0]+1 == a[1] and a[1] == a[2]:
print(ans+2)
elif a[0] == a[1] and a[1]+1 == a[2]:
print(ans+1)
else:
print(ans)
|
p03720 | s281254618 | Accepted | N, M = map(int, input().split())
ans = [0] * N
for _ in range(M):
a, b = map(int, input().split())
ans[a - 1] += 1
ans[b - 1] += 1
print(*ans, sep="\n")
|
p03030 | s052784152 | Accepted | n = int(input())
a = []
for i in range(n):
s,p = input().split()
p = int(p)
a.append([s,-p,i+1])
a.sort()
for i in range(n):
print(a[i][2]) |
p02647 | s955542402 | Accepted | from itertools import accumulate
n, k = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(k):
B = [0]*(n+1)
for i, a in enumerate(A):
B[max(i-a, 0)] += 1
B[min(i+a+1, n)] -= 1
A = list(accumulate(B))[:-1]
if min(A) == n:
break
print(*A) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.