problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02917 | s070608025 | Wrong Answer | n = int(input())
b = list(map(int, input().split()))
a = [b[0]]
for num, i in enumerate(b[:]):
if num == 0:
a.append(i)
elif num == n-2:
a.append(i)
elif i <= b[num + 1]:
a.append(i)
elif i > b[num + 1]:
a.append(b[num + 1])
print(sum(a))
print(a)
|
p02833 | s978269030 | Wrong Answer | N = int(input())
if N % 2 == 0:
p = 10
ret = 0
while p < N:
ret += N // p
p *= 5
print(ret)
else:
print(0)
|
p02683 | s744392500 | Wrong Answer | import itertools
n,m,x=list(map(int,input().split()))
ans=10**5
A=[list(map(int,input().split())) for i in range(n)]
B=sorted(A, key=lambda x: x[0])
#print(B)
D=[0]*(m+1)
for i, _ in enumerate(B, 1):
for j in itertools.combinations(B,r=i):
C=list(zip(*j))
# print(C)
for m in range(m+1):
D[m]=sum(C[m])
# print(D)
E=[i for i in D[1:] if i>=x ]
if len(E)==m:
ans=min(ans,D[0])
print(ans) if ans!=10**5 else print(-1) |
p03262 | s340302386 | Accepted | from fractions import gcd
n, X = map(int, input().split())
x = list(map(int, input().split()))
ans = abs(x[0]-X)
for el in x[1:]:
ans = gcd(ans, abs(el - X))
print(ans)
|
p03862 | s020075820 | Accepted | n, x = map(int,input().split())
cList = list(map(int,input().split()))
count = 0
if cList[0] > x:
count += cList[0]- x
cList[0] = x
for i in range(1,n):
tmp = cList[i-1]+cList[i]-x
if tmp > 0:
cList[i] -= tmp
count += tmp
print(count)
|
p02861 | s580279106 | Accepted | n = int(input())
x = []
for i in range(n):
a = list(map(int,input().split()))
x.append(a)
#print(x)
path_length = 0
cnt = 0
import itertools
for p in itertools.permutations(x):
#print(p, p[1:])
cnt += 1
for (x1,y1), (x2,y2) in zip(p, p[1:]):
path_length += ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** .5
#print(cnt)
print(path_length/(cnt)) |
p02554 | s468991321 | Accepted | n = int(input())
MOD = 1000000007
print((pow(10,n)- 2*(pow(9,n)) + pow(8,n))%MOD) |
p04031 | s826299258 | Accepted | N = int(input())
l = list(map(int, input().split()))
cal = []
for i in range(-100,101):
a = 0
for j in l:
a += (i - j)**2
cal.append(a)
ans = min(cal)
print(ans) |
p02918 | s170700418 | Accepted | n,k = [int(x) for x in input().split()]
s = input()
count = 1
for i in range(n-1):
if s[i]!=s[i+1]:
count += 1
print(n-max(1,count-2*k)) |
p03069 | s444117206 | Wrong Answer | # TLEkuraisou
n=int(input())
s=input()
cnt=0
for i in range(n):
a=s.count(".#")
if a==0:
break
cnt+=a
s=s.replace(".#","..")
print(s,cnt) |
p03075 | s344185329 | Accepted | import sys
a=[0]*5
a[0]=int(input())
a[1]=int(input())
a[2]=int(input())
a[3]=int(input())
a[4]=int(input())
k=int(input())
for i in range(5):
for j in range(i+1,5):
if a[j]-a[i]>k :
print(":(")
sys.exit()
print("Yay!") |
p02879 | s835680200 | Wrong Answer | A, B = map(int, raw_input() .split())
if A and B < 10:
print A * B
else:
print -1
|
p02699 | s665929300 | Accepted | #https://atcoder.jp/contests/abc164/tasks/abc164_a
S,W= map(int,input().split())
if S > W:
print("safe")
else:
print("unsafe")
|
p03854 | s365408755 | Wrong Answer | import sys
input = sys.stdin.readline
S = input().rstrip()
while S:
if S[-5:] == "dream":
S = S[:-5]
elif S[-5] == "erase":
S = S[:-5]
elif S[-6:] == "eraser":
S = S[:-6]
elif S[-7:] == "dreamer":
S = S[:-7]
else:
print("NO")
sys.exit()
print("YES")
|
p03705 | s648558623 | Accepted | N,A,B = map(int, input().split())
if B < A:
print(0)
else:
print(max(0, 1+(N-2)*(B-A))) |
p02993 | s850287983 | Wrong Answer | S = input()
for i in range(3):
if S[i] == S[i+1]:
print('Bad')
else:
print('Good') |
p03623 | s130504221 | Wrong Answer | x, a, b = map(int, input().split())
i = a-x
j = b-x
if i < 0:
if i > j:
print('A')
if i < j:
print('B')
elif j < 0:
if i > j:
print('A')
if i < j:
print('B')
else:
if i < j:
print('A')
if i > j:
print('B')
|
p02623 | s456356589 | Accepted | N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0]
b = [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans = 0
j = M
for i in range(N+1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans,i+j)
print(ans) |
p03286 | s270169358 | Accepted | if __name__ == '__main__':
N = int(input())
if N == 0:
print(0)
exit()
ans = []
cnt = 0
while abs(N) >= 1:
mod_val = N % ((-2) ** (cnt + 1))
if mod_val == 0:
ans.append(0)
else:
ans.append(1)
N -= (-2) ** cnt
cnt += 1
print(''.join([str(val) for val in ans[::-1]]))
|
p03416 | s759289687 | Accepted | A,B = map(int,input().split())
print([str(x) == str(x)[::-1] for x in range(A,B+1)].count(True)) |
p02713 | s024890367 | Accepted | K=int(input())
import math
ans=0
for a in range(1,K+1):
for b in range(1,K+1):
g=math.gcd(a,b)
if g==1:
ans += K
continue
for c in range(1,K+1):
ans += math.gcd(g,c)
print(ans)
|
p03221 | s455438184 | Wrong Answer | n,m = map(int,input().split())
py = sorted([list(map(int,input().split()))+[i] for i in range(m)])
cnt = 1
ans_list = [['0'*(6 - len(str(m)))+str(py[0][0])+'000001',py[0][2]]]
for i in range(1,m):
ans = '0'*(6 - len(str(m)))
ans += str(py[i][0])
if py[i-1][0] == py[i][0]:
cnt += 1
else:
cnt = 1
ans += '0'*(6 - len(str(cnt)))
ans += str(cnt)
ans_list.append([ans,py[i][2]])
ans_list = sorted(ans_list,key=lambda x:x[1])
for i in ans_list:
print(i[0]) |
p03069 | s895925158 | Accepted | from itertools import accumulate
n = int(input())
s = list(input())
for i in range(n):
if s[i] == "#":
s[i] = 1
else:
s[i] = 0
cs = [0] + list(accumulate(s))
m = n
for i in range(n+1):
num = cs[i] + (n-i)-(cs[n]-cs[i])
m = min(m,num)
print(m) |
p02829 | s972670172 | Accepted | import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9
def main():
a = int(input())
b = int(input())
print(6-a-b)
if __name__ == '__main__':
main()
|
p02694 | s527439223 | Wrong Answer | X=int(input())
ans=0
yokin=100
for i in range(1,X+1):
yokin=int(yokin*i/100)
if yokin <= X:
ans+=1
else:
break
print(ans) |
p03035 | s515712622 | Accepted | A,B = map(int,input().split())
if A > 12:
print(B)
elif A > 5:
print(B//2)
else:
print(0) |
p03721 | s443808750 | Wrong Answer | li = [0]*(10**5+10)
n,k = map(int, input().split())
for i in range(n):
a,b = map(int, input().split())
li[a] += b
cnt = 0
ans = 0
for i in range(10**5):
cnt += li[i]
ans = i
if cnt >= k:
break
print(ans) |
p02546 | s419517486 | Accepted | from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)
INF = int(1e10)
MOD = int(1e9 + 7)
def main():
from builtins import int, map
s = input()
if s[-1] != 's':
print(s + "s")
else:
print(s + "es")
if __name__ == '__main__':
main()
|
p02732 | s208467722 | Accepted | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
counter = Counter(A)
ans = 0
for k, v in counter.items():
if 2 <= v:
ans += v * (v - 1) // 2
for a in A:
if a in counter and 2 <= counter[a]:
v = counter[a]
diff = v * (v - 1) // 2 - ((v- 1) * (v - 2) // 2)
print(ans - diff)
else:
print(ans) |
p03698 | s779053842 | Accepted | s = list(input())
if len(s) == len(set(s)):
print('yes')
else:
print('no') |
p02811 | s748193962 | Accepted | K, X = [int(i) for i in input().split()]
print('Yes' if 500 * K >= X else 'No') |
p03545 | s900837546 | Wrong Answer | X = list(map(int,list(input())))
for i in range(2**4+1):
ans =[]
for j in range(4):
d = X[j]*(-1)**((i >>j)&1)
ans.append(d)
if sum(ans) == 7:
for i,a in enumerate(ans):
if a>=0 and i>0:
print("+",end="")
print(a,end="")
print("=7")
exit() |
p03680 | s910308461 | Accepted | import sys
from io import StringIO
import unittest
sys.setrecursionlimit(10**6)
def rec(n, a, seen):
if seen[n-1]:
return -1
if a[n-1] == 2:
return seen.count(True) + 1
seen[n-1] = True
return rec(a[n-1], a, seen)
def resolve():
n = int(input())
a = []
seen = [False]*n
for _ in range(n):
a.append(int(input()))
print(rec(1, a, seen))
resolve() |
p03721 | s341092919 | Wrong Answer | def main():
N, K = map(int,input().split())
S = []
for _ in range(N):
a,b = map(int,input().split())
S += [a]*b
print(S[K-1])
if __name__ == '__main__':
main()
|
p02946 | s345699565 | Accepted | k, x = map(int, input().split())
z = x - k
for i in range(k*2-1):
z += 1
print(z, end=" ")
|
p02823 | s786480798 | Wrong Answer | N,A,B=map(int,input().split())
if (B-A)%2==0:
print(int((B-A)/2))
else:
print(min(B-1,N-A)) |
p02676 | s458140326 | Wrong Answer | K = int(input())
S = input()
if len(S) <= K:
print(S)
else:
print(S[:7] + "...") |
p02548 | s600785724 | Wrong Answer | n = int(input())
a = 1
ans = 0
# while a < n/2:
# b = 2
# while a * b < n:
# ans += 1
# b += 1
# a += 1
# print(ans+2*(n-2)+1)
while a < n:
if n % a == 0:
ans += 1
a += 1
print(ans) |
p02640 | s753195006 | Accepted | import sys
input = sys.stdin.readline
def main():
X, Y = map(int, input().split())
tmp = X * 4 - Y
if tmp%2 != 0:
print("No")
return
turu = tmp // 2
kame = X - turu
if turu >= 0 and kame >= 0:
print("Yes")
return
print("No")
if __name__ == "__main__":
main() |
p03998 | s996393907 | Accepted | first = input()
second = input()
third = input()
d = {}
d["a"]=first
d["b"]=second
d["c"]=third
flag = False
run = "a"
while flag != True:
if d[run] == "":
flag = True
print(run.upper())
else:
l = len(d[run])
temp = d[run][0]
d[run] = d[run][1:l]
run = temp |
p03345 | s219521983 | Wrong Answer | A,B,C,K = map(int,input().split())
if K % 2 == 0:
m = A-B
else:
m = B-A
if abs(m)<=10^18:
print(m)
else:
print('Unfair') |
p02882 | s503503236 | Accepted | import math
a, b, x = map(int, input().split())
if ((a ** 2) * b) / 2 <= x:
print(math.degrees(math.atan((a ** 2 * b - x) / (a ** 2) / a * 2)))
else:
print(90 - math.degrees(math.atan(x / (a * b) / b * 2))) |
p02879 | s234293032 | Accepted | A, B = map(int, input().split())
if A <= 9 and B <= 9 : print(A*B)
else : print(-1) |
p03796 | s931733305 | Accepted | n = int(input())
power = 1
for i in range(1,n+1):
power = power*i
power = power%(10**9+7)
print(power%(10**9+7)) |
p03679 | s344062428 | Accepted | X, A, B = map(int, input().split())
S = B - A
if S <= 0:
print("delicious")
elif S <= X:
print("safe")
else:
print("dangerous") |
p03475 | s916221361 | Accepted | n = int(input())
csf=[]
for _ in range(n-1):
c,s,f=map(int,input().split())
csf.append((c,s,f))
ans=[0]*n
for i,(c,s,f) in enumerate(csf):
for j in range(0,i+1):
if ans[j]<=s:
ans[j]=s+c
else:
ans[j]=(ans[j]+f-1)//f*f+c
for x in ans:
print(x) |
p03761 | s469460004 | Wrong Answer | from collections import Counter
n=int(input())
s=[input() for i in range(n)]
ans=''
l='abcdefghijklmnopqrstuvwxyz'
for i in range(len(l)):
c=10**9
for j in range(n):
c=min(c,s.count(l[i]))
for j in range(c):
ans+=l[i]
print(ans) |
p02946 | s940374361 | Wrong Answer | K,X = map(int, input().split())
a, b = 0,0
A = []
if X - K+1 < -1000000:
a = -1000000
else:
a = X - K+1
if X + K-1 > 1000000:
b = 1000000
else:
b = X + K-1
for _ in range(a,b+1):
A.append(_)
print(A) |
p03838 | s718507144 | Accepted | #editorial
x,y=map(int, input().split())
ans=10**12
#00
if y-x>0:
ans=min(ans,y-x)
#10
if y+x>=0:
ans=min(ans,y+x+1)
#01
if -y-x>=0:
ans=min(ans,-y-x+1)
if x-y>0:
ans=min(ans,x-y+2)
print(ans) |
p03803 | s467560298 | Accepted | a, b = map(int, input().split())
if a == b:
print('Draw')
elif a == 1 or (b != 1 and a > b):
print('Alice')
else:
print('Bob') |
p03137 | s417448831 | Accepted | def INT():
return int(input())
def LI():
return list(map(int, input().split()))
def MI():
return map(int, input().split())
N, M = MI()
X = LI()
X.sort()
if N >= M:
print(0)
exit()
dist = []
for i in range(M - 1):
d = X[i + 1] - X[i]
dist.append(d)
dist.sort()
print(sum(dist[ : M - N])) |
p02702 | s003639823 | Wrong Answer | S = input()
S_l = len(S)
MOD = 2019
l = [0]*200000
ans = 0
for k in range(0,4):
for start,end in zip(range(0,S_l-3-k), range(3+k,S_l)):
s = S[start:end+1]
if int(s)%MOD==0:
ans+=1
l[end]+=1
if start>=4:
ans+=l[start-1]
l[end]+=l[start-1]
print(ans) |
p03221 | s930322306 | Accepted |
n,m = map(int,input().split())
data = [[0,0,0] for i in range(m)]
ans = ['']*m
city = [0]*n
for i in range(m):
data[i] = list(map(int,input().split()))+[i]
data[i][0] -= 1
for d in sorted(data,key=lambda x:x[1]):
city[d[0]] += 1
ans[d[2]] = str(d[0]+1).zfill(6)+str(city[d[0]]).zfill(6)
for i in ans:
print(i) |
p03759 | s620304604 | Accepted | a,b,c = map(int,input().split())
if 2*b == a + c:
print('YES')
else:
print('NO') |
p02916 | s886523079 | Accepted | N = int(input())
A = [int(i)-1 for i in input().split()]
B = [int(i) for i in input().split()]
C = [int(i) for i in input().split()]
v = 0
for i in range(N):
v += B[A[i]]
if i >= 1:
if A[i]-A[i-1]==1:
v += C[A[i]-1]
print(v) |
p02597 | s074164130 | Accepted | def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
n = I()
c = list(input())
r = c.count('R')
print(c[:r].count("W"))
|
p02699 | s593594794 | Accepted | s,w=map(int,input().split())
if w>=s:
print("unsafe")
else:
print("safe") |
p02900 | s253346334 | Wrong Answer | a,b = map(int, input().split())
def gcd(a, b):
while b:
a, b = b, a % b
return a
def factorization(n):
arr = {1}
tmp = n
for i in range(2,int(10**0.5)+1):
while tmp % i == 0:
tmp //= i
arr.add(i)
if tmp != 1:
arr.add(tmp)
return arr
g = gcd(a,b)
arr = factorization(g)
print(len(arr))
|
p03698 | s086556816 | Accepted | S = input()
s_list = [s for s in S]
s_set = set(s_list)
if len(s_list)==len(s_set):
print('yes')
else:
print('no') |
p02718 | s755206188 | Accepted | def resolve():
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
all = sum(a)
c = a[m-1]
if c >= all / (4*m):
print('Yes')
else:
print('No')
if __name__ == "__main__":
resolve() |
p02720 | s507739302 | Accepted | import queue
k = int(input())
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
if i == k-1:
break
else:
if not x % 10 == 0:
q.put(10*x + (x % 10) -1)
q.put(10*x + (x % 10))
if not x % 10 == 9:
q.put(10*x + (x % 10) +1)
print(x) |
p02854 | s073489197 | Accepted | from itertools import accumulate
N, *A = map(int, open(0).read().split())
A_acc = list(accumulate(A, initial=0))
min_diff = float("inf")
for i in range(1, N):
left, right = A_acc[i], A_acc[N] - A_acc[i]
min_diff = min(min_diff, abs(right - left))
print(min_diff)
|
p04029 | s446022211 | Accepted | N=input()
N=int(N)
print(sum(range(1,N+1))) |
p02888 | s318302481 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))
from bisect import bisect_left
def main():
N = int(input())
L = sorted(input_nums())
count = 0
for i in range(N-2):
a = L[i]
for j in range(i+1, N-1):
count += bisect_left(L, a+L[j]) - j - 1
print(count)
if __name__ == '__main__':
main() |
p03317 | s979711357 | Accepted | # import bisect
# from collections import Counter, deque
# import copy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
def resolve():
N,K=map(int,input().split())
A=list(map(int,input().split()))
if N==K:
print(1)
else:
N=N-K
print(1+-(-N//(K-1)))
resolve() |
p03262 | s646193701 | Accepted | import math
N, X = map(int, input().split())
arr = list(map(int, input().split()))
kyori = []
for i in arr:
kyori.append(abs(X-i))
c =math.gcd(kyori[0],kyori[0])
for i in kyori:
c =math.gcd(c,i)
print(c)
|
p03679 | s053367030 | Accepted | x, a, b = map(int,input().split())
if a + x >= b and a >= b:
print('delicious')
elif a + x >= b:
print('safe')
else:
print('dangerous') |
p02790 | s585064602 | Accepted | a,b=map(int,input().split())
if a<=b:
a=str(a)
print(b*a)
else:
b=str(b)
print(b*a) |
p03759 | s297099587 | Wrong Answer | a,b,c=input().split()
if(abs(int(b)-int(a)) == abs(int(c)-int(b))):
print("YES")
else:
print("NO") |
p03030 | s237885559 | Accepted | N = int(input())
restaurants = []
for i in range(N):
name, score = map(str, input().split())
restaurants.append([name, int(score), i+1])
sorted_restaurants = restaurants.copy()
sorted_restaurants = sorted(sorted_restaurants, key=lambda x: (x[0], -x[1]))
for i in range(N):
print(sorted_restaurants[i][2])
|
p02933 | s737528768 | Wrong Answer | #a>=3200 のとき 出力s
#a<3200 のとき 出力’red'
#標準入力
#aは数字でユーザーが入力する
a = int (input())
s = input()
if a >= 3200:
print('s')
else:
print('red') |
p03449 | s755025695 | Accepted | n = int(input())
ls1 = list(map(int, input().split()))
ls2 = list(map(int, input().split()))
ans = 0
for i in range(n):
wa = sum(ls1[:i+1]) + sum(ls2[i:])
if wa > ans:
ans = wa
print(ans) |
p03838 | s645588244 | Wrong Answer | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
x,y = map(int,readline().split())
if x >= 0 and y >= 0:
if x > y:
print(x-y+2)
else:
print(y-x)
elif x >= 0 and y < 0:
print(abs(abs(x)-abs(y))+1)
elif x < 0 and y >= 0:
print(abs(abs(x)-abs(y))+1)
else:
if x > y:
print(x-y+2)
else:
print(y-x)
|
p03997 | s864318579 | Wrong Answer | a=int(input())
b=int(input())
h=int(input())
print((a+b)*h/2) |
p02694 | s544539018 | Accepted | def LI():return list(map(int,input().split()))
# for i in range(10):
# print(i&1^0)
x=int(input())
m=100
for i in range(5000):
m=int(m*1.01)
if m>=x:
print(i+1)
exit() |
p02773 | s577513834 | Accepted | n=int(input())
dic={}
for i in range(n):
a=input()
if a not in dic.keys():dic[a]=1
else:dic[a]+=1
max_value=max(dic.values())
dic_max=[k for k, v in dic.items() if v==max_value]
dic_s=sorted(dic_max)
[print(i) for i in dic_s] |
p03042 | s732699766 | Wrong Answer | S = input()
if S[:2] == '00' or S[2:] == '00':
print('NA')
elif int(S[:2]) <= 12 and int(S[2:]) <= 12:
print('AMBIGUOUS')
elif int(S[:2]) <= 12:
print('MMYY')
elif int(S[2:]) <= 12:
print('YYMM')
else:
print('NA') |
p02948 | s817478612 | Accepted | import sys
from heapq import heapify, heappop, heappush
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
jobs = [[] for _ in range(M+1)]
for _ in range(N):
a, b = lr()
if a > M:
continue
jobs[a].append(b)
answer = 0
candidate = []
for i in range(1, M+1):
for job in jobs[i]:
heappush(candidate, -job)
if candidate:
answer += heappop(candidate)
answer *= -1
print(answer)
# 31 |
p02917 | s906683171 | Accepted | N = int(input())
B = list(map(int,input().split()))
A = [0]*N
for i in range(N):
if i == 0:
A[i] = B[i]
elif i < N-1:
A[i] = min(B[i],B[i-1])
elif i == N-1:
A[i] = B[i-1]
# print("i:",i,", A[i]:",A[i])
print(sum(A))
|
p02675 | s160594708 | Accepted | s = input()
k = int(s[-1])
if k == 3:
print('bon')
elif k in [0, 1, 6, 8]:
print('pon')
else:
print('hon') |
p02784 | s523694753 | Accepted | print("Yes" if list(map(int,input().split()))[0] <= sum(map(int,input().split())) else "No") |
p03073 | s274981564 | Accepted | s=list(input())
mn=len(s)
for x in ['0','1']:
bef=x
ret=0
for c in s:
if bef==c:
if bef=='1':
bef="0"
elif bef=='0':
bef="1"
ret+=1
else:
bef=c
if ret<mn:
mn=ret
print(mn)
|
p02916 | s851189053 | Accepted | N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
C = list(map(int,input().split()))
ans = sum(B)
for i in range(0,N-1):
if A[i]+1 == A[i+1]:
ans += C[A[i]-1]
print(ans)
|
p03679 | s197621653 | Accepted | x, a, b = list(map(int, input().split()))
if b <= a:
print('delicious')
elif a < b <= x + a:
print('safe')
else:
print('dangerous') |
p02664 | s335654748 | Accepted | T = input()
ans = []
for i in range(len(T)):
if T[i] == "?":
ans.append("D")
else:
ans.append(T[i])
print(*ans,sep="")
|
p02695 | s179273944 | Wrong Answer | import itertools as it
n,m,q = map(int, input().split())
l = [list(map(int, input().split())) for i in range(q)]
ans = 0
for v in list(it.product(range(1,m+1),repeat=n)):
num = 0
for w in l:
x,y,z = w[0]-1,w[1]-1,w[2]
if v[y] - v[x] == z:
num += w[3]
if num > ans:
ans = num
print(ans) |
p02909 | s224335045 | Wrong Answer | s = input()
if s == 'Sunny':
print('Cloudy')
elif s == 'Cloudy':
print('Rainy')
else:
print('sunny') |
p02598 | s387843940 | Accepted | N,K=map(int,input().split())
A=list(map(int,input().split()))
l,r=1,10**9+1
while r-l>1:
t=(l+r)//2
k=sum([(a+t-2)//(t-1)-1 for a in A])
if K<k:
l=t
else:
r=t
print(l) |
p02681 | s982893136 | Accepted | s = input()
t = input()
if t[:len(t)-1] == s:
print("Yes")
else:
print("No") |
p03644 | s991869131 | Accepted | import sys
n = int(sys.stdin.readline().rstrip("\n"))
i = 0
while 2**i <= n:
i += 1
print(2**(i-1)) |
p02918 | s171006622 | Accepted | import numpy as np
n,k = map(int,input().split())
s = input()
lr_cnt = 0
rl_cnt = 0
mnt = 0
for i in range(len(s)-1):
if s[i] == 'L' and s[i+1] == 'R':
lr_cnt += 1
if s[i] == 'R' and s[i+1] == 'L':
rl_cnt += 1
mnt = rl_cnt + lr_cnt+1
mnt = np.max([1,mnt-2*k])
if mnt == 1:
print(n-1)
else:
print(n-rl_cnt-lr_cnt+2*k-1) |
p02702 | s901244654 | Accepted | def main():
n ,mods = 0, [1]+[0]*2019
for i, j in enumerate(reversed(input())):
n = (n+int(j)*pow(10, i, 2019))%2019
mods[n] += 1
print(sum([i*(i-1)//2 for i in mods]))
main() |
p03625 | s008797780 | Wrong Answer | n=int(input())
a=sorted(list(map(int,input().split())))
c=1
x=[]
for i in range(n-1):
if a[i]!=a[i+1]:
if c>=2:
x.append(a[i])
c=1
else:
c+=1
if c>=2:
x.append(a[n-1])
if len(x)<=1:
print(0)
else:
print(x[-1]*x[-2])
|
p02546 | s465644480 | Wrong Answer | s =input()
if s[-1] == s:
print('es')
else:
print('s') |
p03803 | s926827680 | Accepted | a, b = map(int,input().split())
if a == 1:
a = 14
if b == 1:
b = 14
ans = "Draw" if a == b else "Alice" if a > b else "Bob"
print(ans) |
p03860 | s958101664 | Accepted | _,s,_=input().split()
print("A"+s[0]+"C") |
p02860 | s299160285 | Accepted | n = int(input())
s = input()
if n % 2 != 0:
print('No')
else:
if s[:n // 2] == s[n // 2:]:
print('Yes')
else:
print('No') |
p02899 | s431703905 | Accepted | n = int(input())
a = list(map(int, input().split()))
res = [0] * n
for i,val in enumerate(a):
res[val-1] = i+1
print(*res) |
p02661 | s622345055 | Wrong Answer | # ABC169 E
N=int(input())
AB=[tuple(map(int,input().split())) for _ in [0]*N]
def med(A):
N=len(A)
if N%2:
return A[(N+1)//2-1]
else:
return (A[N//2-1]+A[N//2])//2
A=[i[0] for i in AB]
B=[i[1] for i in AB]
medA=med(sorted(A))
medB=med(sorted(B))
if N%2:
print(medB-medA+1)
else:
print(2*medB-2*medA+1) |
p03243 | s002818293 | Accepted | N=int(input())
for i in range(N,1112):
str_i=str(i)
if all(str_i[i]==str_i[0] for i in range(1,len(str_i))):
print(i)
break |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.