problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03377 | s454553199 | Accepted | # coding: utf-8
# Your code here!
a,b,x = map(int,input().split())
if 0<= x-a <= b:
print('YES')
else:
print('NO') |
p03730 | s587474700 | Accepted | import sys
a,b,c=map(int,input().split())
for i in range(b):
if i*a%b==c:
print("YES")
sys.exit()
print("NO") |
p03385 | s671017949 | Wrong Answer | li = list(input())
li.sort
if li[0] == 'a' and li[1] == 'b' and li[2] == 'c':
print('Yes')
else:
print('Yes')
|
p02823 | s091768736 | Accepted | n,a,b = map(int, input().split())
rs = (b-a)//2
if (b-a) % 2 == 0:
print(rs)
else:
if a==1 and b==n:
print(n//2)
elif (a-1) > (n-b):
print(rs+(n-b+1))
else:
print(rs+a) |
p03472 | s195828701 | Accepted | import sys
def input():
return sys.stdin.readline()[:-1]
N,H=map(int,input().split())
m=0
l=[None]*N
for i in range(N):
a,b=map(int,input().split())
if a>m:
m=a
l[i]=b
l.sort(reverse=1)
a=0
for i in l:
if i<=m:
a+=-(-H//m)
break
H-=i
a+=1
if H<=0:
break
else:
a+=-(-H//m)
print(a) |
p03493 | s435076055 | Accepted | s = str(input())
s_tuple = s[0:1],s[1:2],s[2:3]
i = 0
for sb in s_tuple:
if sb == '1':
i = i + 1
print(i) |
p03086 | s932227766 | Accepted | dic = ["A","T","G","C"]
S = list(input())
ans = 0
count = 0
for i in range(0,len(S),1):
if S[i] in dic:
count += 1
ans = max(ans,count)
else:
count=0
print(ans) |
p02753 | s956051668 | Accepted | s=input()
print('No' if len(set(s)) == 1 else 'Yes') |
p03699 | s169288490 | Accepted | N = int(input())
ans = 0
A0 = []
A1 = []
for _ in range(N):
s = int(input())
if s % 10 == 0:
A0.append(s)
else:
A1.append(s)
A1.sort()
if len(A1) != 0:
if sum(A1) % 10 != 0:
print(sum(A0) + sum(A1))
else:
print(sum(A0) + sum(A1[1:]))
else:
print(0) |
p03565 | s576534597 | Accepted | S = input()
T = input()
found = []
for i in range(len(S) - len(T) + 1):
for cs, ct in zip(S[i:], T):
if cs != '?' and cs != ct:
break
else:
found.append(i)
if not found:
print("UNRESTORABLE")
exit()
ans = 'z' * 51
for i in found:
tmp = S[:i] + T + S[i+len(T):]
ans = min(ans, tmp.replace("?", "a"))
print(ans) |
p02631 | s610232629 | Accepted | def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
a = readInts()
s = 0
for i in a:
s = s^i
for i in a:
print(s^i, end=" ") |
p02951 | s151576533 | Wrong Answer | A, B, C = map(int, input().split())
if A - B >= C:
print(C)
else:
print(A - B) |
p03544 | s662411300 | Accepted | n = int(input())
lucas = [2, 1]
for i in range(2, 100):
lucas.append(lucas[i - 1] + lucas[i - 2])
print(lucas[n])
|
p02687 | s626442282 | Wrong Answer | print('A%sC'%'BR'[id(id)%9%2]) |
p03679 | s325023429 | Wrong Answer | X,A,B = (int(T) for T in input().split())
['delicious','safe','dangerous'][(B-A>0)*(1+((X-(B-A))<0))] |
p03127 | s513721120 | Accepted | from fractions import gcd
n = int(input())
a = list(map(int,input().split()))
G = a[0]
for i in range(1,n):
G = gcd(G,a[i])
print(G) |
p03243 | s333284110 | Wrong Answer | import sys
N = int(input())
for i in range(0,112):
n = list(str(N+i))
print(n)
if n[0] == n[1] == n[2]:
print(N+i)
sys.exit() |
p03639 | s532477886 | Accepted | N = int(input())
a = list(map(int, input().split()))
c2=c4=0
for i in range(N):
if a[i]%4==0:
c4+=1
if a[i]%2==0:
c2+=1
nodd=N-c2
c2=c2-c4
if c2>0:
nodd+=1
if c4>=nodd-1:
print("Yes")
else:
print("No")
|
p02627 | s911775793 | Accepted | cap = input()
cap_2 = cap.lower()
if cap == cap_2:
print('a')
else:
print('A')
|
p04045 | s602090008 | Accepted | import sys
n,k = map(int,input().split())
d = list(map(int,input().split()))
for i in range(100000):
s = str(i)
n2 = len(s)
fl = 0
for j in range(len(s)):
for k in d:
if s[j] == str(k):
fl = 1
if fl == 0:
if i >= n:
print(i)
break |
p02594 | s962777856 | Accepted | N=int(input())
print("Yes" if N>=30 else "No") |
p03076 | s770822095 | Accepted | import math
abcde = [input() for i in range(5)]
flg = -1
for i in range(1,10):
if flg != -1:
break
for j in range(5):
if abcde[j][-1]==str(i):
flg = j
break
total = 0
for i in range(5):
if flg==i:
total += int(abcde[i])
else:
total += math.ceil(int(abcde[i])/10)*10
print(total) |
p02833 | s809539700 | Wrong Answer | n = int(input())
if n % 2 == 1:
print(0)
else:
n = n//10
res = n
while n > 5:
n = n//5
res += n
print(res) |
p03495 | s607792218 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
dic = {}
for i in range(N):
if A[i] in dic:
dic[A[i]] += 1
else:
dic[A[i]] = 1
ks = list(dic.keys())
vs = list(dic.values())
vs.sort()
B = (len(ks))
cnt = 0
for i in range(len(vs)):
if B > K:
B -= 1
cnt += vs[i]
else:
break
print(cnt)
|
p03455 | s323460057 | Wrong Answer | a, b = input().split(" ")
a= int(a)
b= int(b)
c = a*b
if c%2 ==0:
print("even")
else:
print("odd") |
p02795 | s877691587 | Accepted | H= int(input())
W= int(input())
N= int(input())
import math
u = N/max(H,W)
print(math.ceil(u)) |
p02873 | s095448059 | Accepted | S = str(input())
N = len(S) + 1
A = [0] * N
for i in range(N-1):
if S[i] == "<":
A[i+1] = max(A[i]+1, A[i+1])
for i in range(N-2, -1, -1):
if S[i] == ">":
A[i] = max(A[i], A[i+1]+1)
print(sum(A)) |
p03698 | s696390952 | Accepted | s = input()
print("yes") if len(set(s)) == len(s) else print("no") |
p02747 | s211512046 | Wrong Answer | S = input()
ans = "No"
for i in range(len(S) - 1):
if S[i] == "h" and S[i + 1] == "i":
if i == len(S) - 2:
ans = "Yes"
break
else:
if S[i + 2] != "i":
ans = "Yes"
break
print(ans) |
p03380 | s384494615 | Accepted | from bisect import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
x=a[-1]
if n%2==0:
mid=x//2
if mid in a:
print(x,mid)
else:
inx=bisect(a,mid)
if a[inx]-mid>=mid-a[inx-1]:
print(x,a[inx-1])
else:
print(x,a[inx])
else:
mid=x//2+1
if mid in a:
print(x,mid)
else:
inx=bisect(a,mid)
if a[inx]-mid>=mid-a[inx-1]:
print(x,a[inx-1])
else:
print(x,a[inx]) |
p02768 | s276599836 | Accepted | n,a,b=map(int,input().split())
c=max(a,b)
b=min(a,b)
a=c
MOD = pow(10,9) + 7
X=1
Y=1
for i in range(1,a+1):
X=X*(n+1-i)%MOD
Y=Y*i%MOD
if i==b:
b_X=X
b_Y=Y
a_X=X
a_Y=Y
def calc(X,Y,MOD):
return X*pow(Y,MOD-2,MOD)
ans=pow(2,n,MOD)%MOD-1-calc(a_X,a_Y,MOD)-calc(b_X,b_Y,MOD)
print(ans%MOD)
|
p02682 | s066676526 | Wrong Answer | a,b,c,k = map(int,input().split())
if a >= k:
print(a)
elif a < k and b >= k-a:
print(a)
else:
print(a-(k-a-b)) |
p03943 | s862208104 | Wrong Answer | a=list(map(int,input().split()))
a.sort()
if a[0]+a[1]>a[2]:
print('No')
else:
print('Yes')
|
p02725 | s162794281 | Accepted | K,N = map(int,input().split())
A = list(map(int,input().split()))
ans = []
for i in range(N-1):
now = i
pre = now-1
post = now +1
#nowとpreの距離を求める
if now == 0:
preDic = (K-A[N-1])+A[now]
else:
preDic = A[now]-A[pre]
postDic = A[post]-A[now]
if preDic >= postDic:#時計回りに、i-1の位置まで進む
ans.append(K-preDic)
else:
ans.append(K-postDic)
print(min(ans)) |
p02748 | s132236024 | Wrong Answer | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
discounts = {}
for _ in range(M):
x, y, c = map(int, input().split())
x -= 1
y -= 1
discounts[(x, y)] = c
ans = float('inf')
for i in range(A):
for j in range(B):
tmp = a[i] + b[j]
if (i, j) in discounts:
tmp -= discounts[(i, j)]
ans = min(ans, tmp)
print(ans)
|
p02829 | s934513800 | Accepted | A=int(input())
B=int(input())
print(6-A-B) |
p02677 | s434859351 | Wrong Answer | a,b,h,m = map(int,input().split())
import math
t =abs(30*h + 0.5*m - 6*m)
angle = min(t, 360-t)
l = a**2 + b** 2 -2*a*b*math.cos(angle*3.1415/180)
print(l**0.5) |
p03289 | s093716594 | Accepted | import sys
from collections import Counter
readline = sys.stdin.buffer.readline
MOD = 10**9+7
INF = float('inf')
def main():
S = list(readline().rstrip().decode('utf-8'))
bl = S[0] == 'A'
bl &= ('C' in S[2:-1])
if bl:
S.remove('A');
S.remove('C')
bl &= all('a' <= x <= 'z' for x in S)
answer = 'AC' if bl else 'WA'
print(answer)
if __name__ == '__main__':
main() |
p03485 | s241495921 | Accepted | import math
a , b= map(int , input().split())
print(int(math.ceil((a + b)/2)))
|
p04045 | s476142617 | Accepted | import copy
n,k=map(int,input().split())
d=list(map(int,input().split()))
ans=n
while True:
flag=True
c=copy.deepcopy(str(ans))
for i in range(len(c)):
if int(c[i]) in d:
flag=False
break
if flag:
print(ans)
exit()
ans+=1
|
p03252 | s002706412 | Accepted | S = input()
T = input()
alphabet = 'abcdefghijklmnopqrstuvwxyz'
S_list = []
T_list = []
for i in alphabet:
Scnt = S.count(i)
Tcnt = T.count(i)
if Scnt > 0:
S_list.append(Scnt)
if Tcnt > 0:
T_list.append(Tcnt)
if sorted(T_list) == sorted(S_list):
print('Yes')
else:
print('No') |
p03971 | s768153445 | Wrong Answer | import sys
input = sys.stdin.readline
n, a, b = map(int, input().split())
strings = input()
lists = ['No'] * len(strings)
remain = a + b
b_remain = b
for i in range(len(strings)):
if strings[i] == 'a':
if remain > 0:
lists[i] = 'Yes'
remain = remain - 1
elif strings[i] == 'b':
if remain > 0:
if b_remain > 0:
lists[i] = 'Yes'
remain = remain - 1
b_remain = b_remain - 1
else:
pass
for i in lists:
print(i) |
p03760 | s937425371 | Accepted | o = list(input())
e = list(input()) + ['']
for x,y in zip(o, e):
print(x+y, end='') |
p02953 | s198497850 | Accepted | n = int(input())
H = list(map(int,input().split()))
ans = "Yes"
c=0
for i in range(n-1):
if H[i]-1>H[i+1] :
ans = "No"
break
elif H[i]>H[i+1] :
c+=1
if c>=2 :
ans = "No"
break
elif H[i]<H[i+1] :
c=0
print(ans) |
p02598 | s284036333 | Wrong Answer | import math
def solve(n, k, a):
lb = 0
ub = max(a)
while abs(ub - lb) > 1:
cur = (lb + ub) / 2
cnt = sum(math.ceil(x/cur-1) for x in a)
if cnt > k:
lb = cur
else:
ub = cur
return int(math.ceil((lb+ub) / 2))
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(solve(n, k, a)) |
p03351 | s671234129 | Accepted | a,b,c,d=map(int,input().split())
if abs(c-a)<=d:
print("Yes")
elif abs(c-b)<=d and abs(b-a)<=d:
print("Yes")
else:
print("No") |
p02690 | s459025507 | Wrong Answer | x = int(input())
for a in range(-120, 121):
for b in range(-120, 121):
if a**5 - b**5 == x:
break
print(a, b)
|
p02848 | s937088602 | Accepted | def main():
n = int(input())
n = n % 26
s = input()
s_list = [d for d in s]
new_s = ""
new_ord_base = 64
for i in s_list:
new_ord = ord(i) + n
if new_ord > 90:
new_ord = new_ord % 90 + new_ord_base
new_s += chr(new_ord)
print(new_s)
if __name__ == "__main__":
main()
|
p02789 | s758514816 | Accepted | a = input().split()
print('Yes' if a[0] == a[1] else 'No')
|
p04019 | s412230993 | Accepted | st = input()
n = st.count('N')
s = st.count('S')
e = st.count('E')
w = st.count('W')
if (n>0 and s==0) or (n==0 and s>0) or (w==0 and e>0) or (e==0 and w>0):
print("No")
else:
print("Yes") |
p03680 | s225655462 | Accepted | # coding: utf-8
# Your code here!
n=int(input())
num=[0]
ans=0
count=0
k=1
for i in range(n):
a=int(input())
num.append(a)
for i in range(n+1):
k=num[k]
count+=1
if k==2:
ans=1
break
if ans==1:
print(count)
else:
print("-1")
|
p03861 | s918118072 | Wrong Answer | x, y, z = map(int,input().split())
print(y//z - x//z +1) |
p03617 | s662348051 | Wrong Answer | q, h, s, d = map(int, input().split())
n = int(input())
m = min(4 * q, 2 * h, s)
if d < 2*m:
print((n // 2) * d + m)
else:
print(n * m)
|
p02623 | s582338673 | Accepted | n, m, k = map(int, input().split(' '))
a_list = list(map(int, input().split(' ')))
b_list = list(map(int, input().split(' ')))
sa = [0] * (n+1)
sb = [0] * (m+1)
for i in range(n):
sa[i+1] = a_list[i] + sa[i]
for j in range(m):
sb[j+1] = b_list[j] + sb[j]
best=0
r = m
for i, a in enumerate(sa):
if a>k:
break
while ((a + sb[r]) > k) & (r>=0):
r-=1
best = max(best,i+r)
print(best) |
p02787 | s328801084 | Accepted | import numpy as np
h, n = map(int, input().split())
ab = np.array([np.fromstring(input(), dtype=np.int64, sep=" ") for _ in range(n)])
a = ab[:, 0]
b = ab[:, 1]
dp = np.zeros(10**6, dtype=np.int)
for i in range(1,h+1):
dp[i] = (dp[i-a]+b).min()
print(dp[h]) |
p03127 | s396937457 | Accepted | from math import gcd
n = int(input())
alst = list(map(int, input().split()))
ans = alst[0]
for a in alst:
ans = gcd(ans, a)
print(ans) |
p04031 | s449169282 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for i in range(-100,101):
s = 0
for j in range(n):
s += (a[j]-i)**2
ans = min(ans,s)
print(ans)
|
p03481 | s955291353 | Wrong Answer | from math import log
x, y = map(int, input().split())
print(int(log(y / x, 2)) + 1) |
p02711 | s334254084 | Wrong Answer | n = int(input())
k = 1
while(n != 0):
m = n % 10
n /= 10
if(m == 7):
k = 2
break
if k == 2:
print('Yes')
else:
print('No') |
p03821 | s328434522 | Wrong Answer | n=int(input())
ab=[list(map(int,input().split())) for i in range(n)]
c=[]
ans=ab[n-1][1]-(ab[n-1][0]%ab[n-1][1])
#print(ab[n-1][0],ab[n-1][1],ans)
for i in range(n-2,-1,-1):
ab[i][0]+=ans
ans+=ab[i][1]-(max(1,ab[i][0]%ab[i][1]))
# print(ab[i][0],ab[i][1],ans)
print(ans) |
p03759 | s113294586 | Wrong Answer | a, b, c= [int(i) for i in input().split()]
if (b - a) == (c - b):
print("Yes")
else:
print("No") |
p02820 | s212747915 | Wrong Answer | # d
import numpy as np
n, k = [int(i) for i in input().split()]
r, s, p = [int(i) for i in input().split()]
t = np.array(list(input()))
t = np.where(t == 'r', p, t)
t = np.where(t == 's', r, t)
t = np.where(t == 'p', s, t)
t = t.astype(dtype='int64')
tt = t
point = 0
point += np.sum(t[:k])
for i in range(k,n):
if t[i] == t[i-k]:
t[i] = 0
pass
elif t[i] != t[i-k]:
point += t[i]
print(point) |
p02694 | s362243271 | Accepted | import math
x=int(input())
ans=0
money=100
while money<x:
money=money*(1.01)
money=int(money)
ans+=1
print(ans) |
p02695 | s195275747 | Accepted | import itertools
n, m, q = map(int, input().split())
lst = [list(map(int, input().split())) for _ in range(q)]
ans = 0
for l in itertools.combinations_with_replacement(range(1, m + 1), n):
tmp_sum = 0
for a, b, c, d in lst:
if l[b - 1] - l[a - 1] == c:
tmp_sum += d
if ans < tmp_sum:
ans = tmp_sum
print(ans)
|
p03835 | s302133397 | Wrong Answer | k,s=map(int,input().split())
count=0
if k*3==s:
print(1)
exit()
for x in range(k+1):
for y in range(k+1-x):
z=s-x-y
if z>=0 and z<=k:
count+=1
print(count) |
p02831 | s992703722 | Accepted | def euclid(m, n):
while n != 0:
m, n = n, m % n
return m
# ABC148C
a, b = map(int, input().split())
print(a * b // euclid(a, b))
|
p02684 | s816781921 | Accepted | N,K = map(int,input().split())
A = list(map(lambda x: int(x) - 1, input().split()))
P = [-1] * N
cur = 0
P[cur] = 0
route = [1]
for step in range(K):
cur = A[cur]
route.append(cur + 1)
if P[cur] >= 0:
l_start = P[cur]
l_end = step + 1
l_len = l_end - l_start
break
else:
P[cur] = step + 1
else:
print(cur + 1)
quit()
print(route[l_start + ((K - l_start) % l_len)]) |
p02548 | s914020881 | Accepted | n=int(input())
jud=0
a=1
ans=0
while jud!=1:
x=n//a
if x==1:
jud=1
else:
ans+=x
if n%a==0:
ans-=1
a+=1
ans+=n-a
print(ans)
|
p03997 | s940143591 | Accepted | # -*- coding: utf-8 -*-
a = int(input())
b = int(input())
h = int(input())
S = 0
S = (a+b)*h/2
print(int(S)) |
p02789 | s389445756 | Accepted | n,m = map(int, input().split())
print('Yes' if n==m else 'No') |
p03456 | s544617082 | Accepted | a,b = map(str,input().split())
A = int(str(a+b))
B = int(A**0.5)
if A == B*B:
print("Yes")
else:
print("No") |
p03328 | s653604234 | Accepted | A, B = map(int, input().split())
H = [i * (i + 1) // 2 for i in range(1, 1001)]
for l, r in zip(H, H[1:]):
if r - l == B - A:
print(r - B)
exit() |
p03076 | s569760501 | Wrong Answer | # 10の余りの絶対値でソートできると良いのですが、今のところ検討中です。 |
p03633 | s603519756 | Accepted | def gcd(a,b):
while b:
a,b=b,a%b
return a
def lcm(a,b):
return a*b//gcd(a,b)
N=int(input())
T=[]
total=1
for i in range(N):
a=int(input())
T.append(a)
T_set=sorted(list(set(T)))
M=len(T_set)
ans=T_set[0]
if M==1:
ans=T_set[0]
else:
for i in range(1,M):
ans=lcm(ans,T_set[i])
print(ans) |
p04043 | s605170123 | Accepted | ABC=input().split()
five_count=ABC.count("5")
seven_count=ABC.count("7")
if five_count == 2 and seven_count == 1:
print("YES")
else:
print("NO") |
p03759 | s978026043 | Wrong Answer | print("Hello")
a,b,c = list(map(int, input().split()))
if((b-a) == (c-b)):
print("YES")
else:
print("NO")
|
p03286 | s460573356 | Wrong Answer | n = int(input())
ans = abs(n)
for i in range(n > 0, 30, 2):
if ans & (1 << i) == (1 << i):
ans += (1 << (i + 1))
print(f'{ans:b}')
|
p02713 | s203542875 | Accepted | import math
from functools import reduce
n=int(input())
res=0
nlist=[]
for a in range(1,n+1):
for b in range(1,n+1):
nlist.append(math.gcd(a,b))
import collections
c = collections.Counter(nlist)
ck=list(c.keys())
cv=list(c.values())
cn=len(ck)
for i in range(cn):
for c in range(1,n+1):
res+=math.gcd(c,ck[i])*cv[i]
print(res) |
p02963 | s748495978 | Wrong Answer | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
s = int(input())
ans = [0, 0, s, 0, 0, 1]
print(*ans)
if __name__ == '__main__':
main() |
p02743 | s452165723 | Wrong Answer | a,b,c = map(int, input().split())
if 4*a*b < (c-a-b)**2:
print('Yes')
else:
print('No') |
p02628 | s421371856 | Accepted | n,k=map(int,input().split())
ar=list(map(int,input().split()))
ar.sort()
pos=0
for i in range(k):
pos+=ar[i]
print(pos) |
p02598 | s653076974 | Wrong Answer | import numpy as np
def solve(n, k, a):
lb = 0
ub = np.max(a)
while ub - lb > 1:
cur = (lb + ub) / 2
cnt = np.sum(np.ceil(a/cur)) - n
if cnt > k:
lb = cur
else:
ub = cur
return int(np.ceil((lb+ub) / 2))
n, k = map(int, input().split())
a = list(map(int, input().split()))
print(solve(n, k, a)) |
p03548 | s382783015 | Wrong Answer | X,Y,Z=map(int,input().split())
X+=Z
print(X//(Z+Y)) |
p03817 | s378621216 | Accepted | def resolve():
x = int(input())
mod = x%11
div = x//11
if mod==0:
print(div*2)
elif mod <= 6:
print(div*2 + 1)
else:
print(div*2+2)
resolve() |
p03416 | s448101899 | Accepted | a,b = map(int,input().split())
ans = 0
for i in range(a,b+1):
s = str(i)
if s[0]==s[4] and s[1]==s[3]:
ans += 1
print(ans) |
p02628 | s374483279 | Accepted | n, k = (int(i) for i in input().split())
data = list(int(i) for i in input().split())
s =data.sort()
res = 0
for i in range(k):
res += int(data[i])
print(res)
|
p03693 | s927367360 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
r, g, b = input().split()
if int(r+g+b)%4==0:
print('YES')
else:
print('NO')
|
p02793 | s162207635 | Accepted | #???
n=int(input())
a=list(map(int,input().split()))
MOD=10**9+7
def gcd(x,y):
if x<y:x,y=y,x
if y==0:return x
return gcd(x%y,y)
def lcm(x,y):
return x*y//gcd(x,y)
def inv(x):
return pow(x,MOD-2,MOD)
L=1
for i in a:
L=lcm(L,i)
L=L%MOD
ans=0
for i in a:
ans=(ans+L*inv(i))%MOD
print(ans) |
p03494 | s700038058 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
s = sum(A)
while s % 2 == 0:
s /= 2
ans += 1
print(ans)
|
p02842 | s998968073 | Accepted | #!/usr/bin/env python3
x = int(input())
for i in range(50000):
if int(i * 1.08) == x:
print(i)
quit()
print(':(')
|
p03617 | s022641736 | Wrong Answer | Q, H, S, D = map(int, input().split())
N = int(input())
q = Q*4
h = H*2
s = S
d = D//2
r = min([q, h, s, d])
if r != d:
print(r*N)
else:
if N%2==0:
print(r*N)
else:
ans = (N-1)*r
ans += min([q, h, s])
print(ans) |
p03059 | s142463301 | Wrong Answer | a,b,t=map(int,input().split())
n=t//a
print(b*n*(n+1)//2) |
p02959 | s109602892 | Accepted | n=int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mosters=sum(a)
for i in range(n):
hunted1 = min(a[i],b[i])
a[i] -=hunted1
b[i] -=hunted1
hunted2 = min(a[i+1],b[i])
a[i+1] -=hunted2
b[i] -=hunted2
print(mosters-sum(a)) |
p03495 | s425054107 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
dict = {}
for a in A:
if a not in dict:
dict[a] = 1
else:
dict[a] += 1
countlist = sorted([a for a in dict.values()], reverse=True)
print(sum(countlist[K:])) |
p03379 | s714021692 | Wrong Answer | import copy
N = int(input())
X = list(map(int,input().split()))
length = len(X)
X.sort()
bef = int(length/2)-1
aft = bef
for i in range(N):
if(i<=bef):
print(X[bef])
else:
print(X[aft]) |
p03160 | s070340056 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
cost = [0] * n
cost[1] = abs(a[1]-a[0])
for i in range(2,n):
cost[i] = min(cost[i-1]+abs(a[i]-a[i-1]),cost[i-2]+abs(a[i]-a[i-2]))
print(cost)
print(cost[n-1]) |
p02784 | s806029648 | Wrong Answer | H, N = map(int, input().split())
A = list(map(int, input().split()))
c = 0
for i in range(len(A)):
c = c + A[i]
if c > H:
print('Yes')
else:
print('No') |
p03797 | s635385820 | Accepted | N, M = map(int, input().split())
if N < M // 2:
print((N + M // 2) // 2)
else:
print(M//2) |
p03673 | s077034850 | Accepted | from collections import deque
N = int(input())
As = list(map(int,input().split()))
h = deque([])
for i in range(N):
if i%2 == 0:
h.append(As[i])
else:
h.appendleft(As[i])
if N%2 == 1:
h.reverse()
print(" ".join(map(str,h))) |
p03073 | s196738116 | Accepted | S = list(input())
# min(全部０１０１０、全部１０１０１)
cnt0 = 0
cnt1 = 0
for e in S[::2]:
if e == '1':
cnt0 += 1
else:
cnt1 += 1
for e in S[1::2]:
if e == '0':
cnt0 += 1
else:
cnt1 += 1
print(min(cnt0, cnt1))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.