problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02584 | s330472226 | Wrong Answer | x,k,d = input().split()
x = int(x)
k = int(k)
d = int(d)
ans = 0
if abs(x) > abs(k*d):
ans = abs(x) - abs(k*d)
else:
kaisuu = abs(x)/d
k_2 = k - kaisuu
if k_2/2 == 2:
ans = abs(x) - d*kaisuu
else:
ans = (abs(x) - d*kaisuu) - d
print(ans)
|
p02743 | s841946868 | Accepted | if __name__ == '__main__':
a, b, c = tuple([int(n) for n in input().split()])
if c - a - b < 0:
print('No')
elif (c - a - b) * (c - a - b) > 4 * a * b:
print('Yes')
else:
print('No') |
p03494 | s100069887 | Accepted | N = int(input())
A = list(map(int, input().split()))
j = 0
l = len(A)
while 1:
count = 0
for i in A:
if i % 2 == 0:
count += 1
if count == l:
j += 1
for i in range(l):
A[i] = A[i] // 2
else:
break
print(j)
|
p02953 | s274680533 | Accepted | n=int(input())
t = list(map(int,input().split()))
for i in range(n-1, 0, -1):
#print(t)
if t[i] < t[i-1]-1:
print('No')
exit()
elif t[i] == t[i-1]-1:
t[i-1] -= 1
print('Yes') |
p03778 | s374177288 | Accepted | w, a, b = map(int, input().split())
if (a <= b and b <= a + w) or (a <= b + w and b + w <= a + w):
print(0)
else:
print(min(abs(a + w - b), abs(b + w - a)))
|
p03150 | s881816451 | Accepted | S = input()
search = "keyence"
for i in range(len(search)):
if S[:i] + S[len(S) - (len(search) - i):] == search:
print("YES")
break
else:
print("NO") |
p02696 | s433965452 | Accepted | a, b, n = map(int, input().split())
syou = n // b
if syou >= 1:
n = b * 1 - 1
print(int((a * n) / b) - a * int(n / b)) |
p02854 | s840257604 | Accepted | def main():
n = int(input())
a = list(map(int, input().split()))
s = sum(a)
minx = s
sum_a = 0
for i in range(n):
sum_a += a[i]
minx = min(minx, abs(sum_a - (s - sum_a)))
print(minx)
if __name__ == "__main__":
main() |
p03437 | s890789301 | Wrong Answer | import collections
import math
def main():
x, y = map(int, input().split())
if x % y == 0 or y % x == 0:
print(-1)
return
print(x)
if __name__ == '__main__':
main()
|
p02842 | s444747327 | Accepted | n = int(input())
x = n/1.08
if x != int(x):
x = int(x) + 1
else:
x = int(x)
if n == int(x*1.08):
print(x)
else:
print(":(") |
p03146 | s242226885 | Accepted | a=int(input())
ct=1
if a==1:
print(4)
exit()
elif a==2:
print(4)
exit()
while a!=1:
ct+=1
if a%2==0:
a=a//2
else:
a=3*a+1
else:
ct+=1
print(ct)
|
p03105 | s738446297 | Accepted | a,b,c=map(int,input().split())
if b//a <= c:
print(b//a)
else:
print(c) |
p03071 | s278701316 | Wrong Answer | A,B = map(int, input().split())
print(max(2*A-1,2*B-1)) |
p03779 | s335789851 | Accepted | n = int(input())
for i in range(1, 2*10**5):
score = (i*(i+1))//2
if score >= n:
print(i)
exit()
|
p02684 | s826892119 | Wrong Answer | #D - Teleporter
N,K = map(int, input().split())
A = list(map(int, input().split()))
DP = []
DP.append(A[0])
for i in range(N):
DP.append(A[DP[i]-1])
print(DP[K%len(DP)-1]) |
p02771 | s319382133 | Wrong Answer | data = list(map(int, input().split()))
if len(set(data)) == 1:
print('No')
else:
print('Yes')
|
p02814 | s303056874 | Wrong Answer | from fractions import gcd
from functools import reduce
def lcm(n1, n2):
return n1 * n2 // gcd(n1, n2)
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
A[i] //= 2
lcmA = reduce(lcm, A)
if lcmA % 2 == 1:
all_num = M // lcmA
if all_num % 2 == 0:
print(all_num // 2)
else:
print(all_num // 2 + 1)
else:
print(M // lcmA)
|
p02684 | s278011581 | Accepted | N, K = map(int ,input().split())
A = [int(x) for x in input().split()]
checked = [False] * N
root=[0]
idx = 0
checked[0]=True
for k in range(K):
root.append(A[idx]-1)
idx = A[idx]-1
if (checked[idx]):
break
checked[idx]=True
else:
print(idx+1)
exit(0)
for i, r in enumerate(root):
if r == root[-1]:
break
root2=root[i:]
l = len(root2)-1
idx = root2[(K-i)%(l)]
print(idx+1)
|
p02584 | s223979174 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
k = X // D
print(abs(X - D * (k + (1 if (K - k) % 2 == 1 else 0))) if k <= K else X - D * K) |
p02640 | s527164997 | Accepted | x, y = map(int, input().split())
a = 0
b = 0
det = 2
a = (4 * x - y) / det
b = (-2 * x + y) / det
if a < 0 or b < 0 or y % 2 == 1:
print('No')
else:
print('Yes')
|
p03352 | s984533926 | Accepted | X=int(input())
ans=0
for i in range(1,40):
for j in range(2,100):
n=pow(i,j)
if n>X:
break
ans=max(ans,n)
print(ans) |
p03644 | s806348048 | Accepted | n = int(input())
ans = 0
out = 1
for i in range(1, n + 1):
cnt = 0
while i % 2 == 0:
i //= 2
cnt += 1
if cnt > ans:
ans = cnt
out = i * 2 ** ans
print(out) |
p02641 | s354380392 | Accepted | x,n=list(map(int,input().split()))
import sys
if n==0:
print(x)
sys.exit()
p=list(map(int,input().split()))
for i in range(x,110):
if 2*x-i not in p:
print(2*x-i)
sys.exit()
if i not in p:
print(i)
sys.exit()
|
p03241 | s595454793 | Accepted | n,m = map(int,input().split())
ans = 1
for i in range(1,int(m**0.5)+1):
if m%i!=0:continue
if m//i>=n:
ans = max(i,ans)
if i>=n:
ans = max(m//i,ans)
print(ans)
|
p02766 | s041733173 | Accepted | n, k = map(int, input().split())
ans = 0
t = k**(ans)
while n >= t:
ans += 1
t=k**(ans)
if n == 0:
print(1)
else:
print(ans) |
p03623 | s550252702 | Accepted | x,a,b = map(int,input().split())
if abs(x-a)>abs(x-b):
print('B')
else:
print('A') |
p03433 | s618929320 | Accepted | print('YNeos'[(int(input())%500)>int(input())::2]) |
p02724 | s568708562 | Wrong Answer | x = int(input())
print(1000*(x//500) + 5*((x%500)%5))
|
p02754 | s896451842 | Wrong Answer | n,a,b = map(int,input().split())
if a == 0:
print(0)
elif b == 0:
print(n)
elif a >= n:
print(n)
elif a+b >= n:
print(a)
else:
c = a*n//(a+b) + min(n%(a+b),a)
print(c)
|
p02720 | s661245264 | Accepted | K = int(input())
r = [[] for _ in range(10)]
r[0] = list(range(1,10))
for i in range(9):
for a in r[i]:
s = str(a)
d = a%10
for j in range(d-1, d+2):
if not 0 <= j <= 9: continue
r[i+1].append(int(s+str(j)))
for i in range(10):
if K >= len(r[i]):
K -= len(r[i])
else:
print(r[i][K-1])
break
|
p02755 | s892503719 | Accepted | import math
a, b = [int(i) for i in input().split()]
a_min = math.ceil(a * 12.5)
a_max = int((a+1) * 12.5 - 10e-10)
b_min = math.ceil(b * 10 )
b_max = int((b+1)*10 - 10e-10)
if a_max < b_min:
print(-1)
exit()
if b_max < a_min:
print(-1)
exit()
if a_min <= b_min:
print(b_min)
exit()
print(a_min)
|
p03150 | s268735253 | Wrong Answer | s=input()
word='keyence'
flag=0
if s[:6]==word:
flag=1
if s[-7:]==word:
flag=1
for i in range(7):
if s[:i]+s[-(6-i):]==word:
flag=1
print('YES' if flag else 'NO') |
p03544 | s445240695 | Accepted | lst=[2,1]
n=int(input())
for i in range(n-1):
lst.append(lst[-1]+lst[-2])
print(lst[-1]) |
p02628 | s171580672 | Accepted | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
# import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
n, k = ns()
p = na()
p.sort()
ans = sum(p[:k])
print(ans)
if __name__ == '__main__':
main()
|
p02596 | s661266013 | Accepted | def main():
k = int(input())
a = [0] * (10 ** 6 + 1)
a[0] = 7 % k
if a[0] == 0:
print(1)
exit()
for i in range(1, k + 1):
a[i] = (a[i - 1] * 10 + 7) % k
if a[i] == 0:
print(i + 1)
exit()
print(-1)
if __name__ == '__main__':
main() |
p02606 | s715888210 | Accepted | a, b, d = list(map(int ,input().split()))
ans = 0
for i in range(a, b+1):
if(i%d ==0):
ans+=1
print(ans)
|
p03612 | s894033675 | Accepted | n = int(input())
p = list(map(int, input().split()))
cnt = 0
ans = 0
for i in range(1, n + 1):
if p[i - 1] == i:
cnt += 1
if p[i - 1] != i or i == n:
ans += (cnt + 1) // 2
cnt = 0
print(ans)
|
p02577 | s301250468 | Wrong Answer | N = int(input())
if N % 9 == 0:
print('Yes')
else:
print('Mo') |
p02987 | s622245551 | Wrong Answer | S = sorted(input())
print('Yes') if S[0] == S[1] and S[0] != S[2] and S[0] != S[3] else print('No') |
p02658 | s196935826 | Accepted | N = input()
listed = input().split()
mul = 1
for num in listed:
num = int(num)
if num == 0:
mul = 0
break
if mul != -1:
mul *= num
if mul > 10**18:
mul = -1
print(mul) |
p03693 | s878251698 | Accepted | n = int(input().replace(" ",""))
if n%4 == 0:
print("YES")
else:
print("NO") |
p02765 | s194395180 | Accepted | import os
def main():
a=[int(x) for x in input().split()]
if a[0] >= 10:
print(a[1])
else:
num = 100*(10-a[0])
print(num + a[1])
if __name__ == "__main__":
main() |
p02582 | s143371875 | Wrong Answer | s = input()
if s == 'RRR':
print(3)
elif s == 'RRS' or 'SRR':
print(2)
elif s == 'SSS':
print(0)
else:
print(1)
|
p02723 | s721805312 | Wrong Answer | s = str(input())
if(s[2] == s[3] and s[4] == s[5]):
print("yes")
else:
print("no") |
p02754 | s166976288 | Accepted | n, a, b = map(int, input().split())
print((n // (a + b)) * a + min(n % (a + b), a)) |
p02796 | s442896519 | Accepted | import math
N = int(input())
li = []
for i in range(N):
x, l = map(int, input().split())
li.append([x-l,x+l])
li.sort(key=lambda x:x[0])
li.sort(key=lambda x:x[1])
ans = 0
t = 0 - 10**9 + 99
for i in range(N):
if t <= li[i][0]:
ans += 1
t = li[i][1]
print(ans) |
p03838 | s409509994 | Accepted | x, y = map(int, input().split())
if x * y > 0:
if x < y:
ans = abs(x - y)
else:
ans = abs(x - y) + 2
elif x * y < 0:
ans = abs(abs(x) - abs(y)) + 1
else:
if x < y:
ans = abs(x - y)
else:
ans = abs(x - y) + 1
print(ans) |
p02817 | s633839369 | Accepted | S, T = input().split()
print(T+S) |
p02866 | s219609642 | Accepted | import collections
N = int(input())
D = list(map(int,input().split()))
if D[0] != 0 or 0 in D[1:]:
print(0)
exit()
A = collections.Counter(D)
A = list(A.items())
A.sort()
if len(A) != max(D) + 1:
print(0)
exit()
ans = 1
for i in range(max(D)):
ans *= A[i][1]**A[i+1][1]
if ans >= 998244353:
ans %= 998244353
print(ans) |
p02695 | s092187278 | Wrong Answer | from itertools import combinations_with_replacement
N,M,Q = map(int,input().split())
A = []
for i in range(Q):
b = list(map(int,input().split()))
A.append(b)
K = list(combinations_with_replacement([1,2,3,4,5,6,7,8,9],N))
ans = 0
for line in K:
total = 0
for combi in A:
if line[combi[1]-1] - line[combi[0]-1] == combi[2]:
total += combi[3]
ans = max(total,ans)
print(ans) |
p02578 | s604920988 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(1, len(A)):
height = max(0, A[i-1] - A[i])
A[i] += height
ans += height
print(ans)
|
p02759 | s534323900 | Accepted | print(-(-int(input())//2)) |
p02613 | s406043898 | Accepted | n = int(input())
ac_cnt = 0
wa_cnt = 0
tle_cnt = 0
re_cnt = 0
for i in range(n):
s = input()
if s == 'AC':
ac_cnt += 1
elif s == 'WA':
wa_cnt += 1
elif s == 'TLE':
tle_cnt += 1
elif s == 'RE':
re_cnt += 1
print('AC x ' + str(ac_cnt))
print('WA x ' + str(wa_cnt))
print('TLE x ' + str(tle_cnt))
print('RE x ' + str(re_cnt))
|
p02783 | s831928982 | Accepted | import math
h, a = map(int, input().split())
print(math.ceil(h/a)) |
p03994 | s614887791 | Wrong Answer | def main():
S = list(input())
K = int(input())
N = len(S)
k = K
for i,c in enumerate(S):
distance = ord('z') + 1 - ord(c)
if distance <= k:
k -= distance
S[i] = 'a'
S[-1] = chr((ord(S[-1]) - ord('a') + k) % 26 + ord('a'))
print(''.join(S))
main() |
p02854 | s620025356 | Wrong Answer | x=int(input())
a=list(map(int, input().split()))
suma=sum(a)
ans=0
for i in range(len(a)):
ans+=a[i]
if ans>=suma/2:
chuou=i
break
print(abs(2*sum(a[:chuou+1])-suma))
|
p02813 | s839937812 | Wrong Answer | import math
def count_index(list, k):
count = 0
for i in range(k):
if (list[i] < list[k]):
count = count + 1
return list[k]-count-1
n = int(input())-1
p = list(map(int,input().split()))
q = list(map(int,input().split()))
a = (p[0]-1) * math.factorial(n)+1
b = (q[0]-1) * math.factorial(n)+1
print(a)
print(b)
for i in range(1,n):
a = a + count_index(p, i) * math.factorial(n-i)
b = b + count_index(q, i) * math.factorial(n-i)
ans = a-b
print(abs(ans)) |
p02836 | s172286815 | Accepted | S=input()
cnt=0
for i in range(len(S)//2):
if S[i]!=S[-i-1]:
cnt+=1
print(cnt) |
p03241 | s728774553 | Accepted | # https://atcoder.jp/contests/abc112/tasks/abc112_d
# 答えansの満たす条件
# ans<=M//Nである
# M%ans==0である
# 仮説:M//Nからansを--して、M%ans==0となるansが答え
# でももしN=2, M=10*9+7とかだったらTLE思想
N, M = list(map(int, input().split()))
ans = M // N
for a in range(ans, 0, -1):
if M % a == 0:
print(a)
exit()
|
p03745 | s100494276 | Wrong Answer | n=int(input())
a=iter(map(int,input().split()))
p=1
i,j=next(a),next(a,0)
while j!=0:
k=next(a,0)
#print(j,k)
if 0 not in (i,j,k) and (i<j>k or i>j<k):
p+=1
i,j=j,k
k=next(a,0)
i,j=j,k
print(p)
|
p03038 | s933039600 | Accepted | import heapq
N, M = tuple(map(int, input().split()))
A = list(map(int, input().split()))
BC = []
for _ in range(M):
BC.append(tuple(map(int, input().split())))
BC.sort(key=lambda x: x[1], reverse=True)
heapq.heapify(A)
for (b, c) in BC:
for _ in range(b):
min_val = A[0]
if min_val < c:
heapq.heappop(A)
heapq.heappush(A, c)
else:
break
print(sum(A)) |
p03206 | s631260783 | Wrong Answer | d = int(input())
if d == 25:
print('Christmas')
elif d == 24:
print('Christmas Eve')
elif d == 23:
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve')
|
p03659 | s830632430 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
s=sum(a)
for i in range(n):
if i == 0:
memo=a[0]
d=abs(s-memo)
else:
memo += a[i]
d_ = abs(s-memo)
d=min(d,d_)
print(d) |
p02659 | s470663430 | Accepted | # w/o decimal module
a, b = map(str, input().split())
b = b[:-3] + b[-2:]
# print(int(int(a)*int(b) / 100)) # WA
print(int(a)*int(b) // 100) |
p03075 | s246264137 | Accepted | li = []
for i in range(5):
li.append(int(input()))
k = int(input())
if li[-1] - li[0] <= k:
print("Yay!")
else:
print(":(")
|
p02572 | s183816103 | Accepted | n = int(input())
arr = list(map(int,input().split()))
ans = 0
tmp = 0
for i in range(n-1):
tmp += arr[i]%1000000007
ans += tmp*arr[i+1] % 1000000007
print(ans%1000000007)
|
p03943 | s678602056 | Accepted | a,b,c=[int(x) for x in input().split(" ")]
if (a+b)==c or (a+c)==b or (b+c)==a:
print("Yes")
else:
print("No")
|
p02701 | s038660615 | Accepted | n = int(input());
dict = {}
for i in range(n):
s = input();
if not s in dict:
dict[s] = 1
sum = 0
for i in dict:
sum += 1
print(sum)
|
p02831 | s080915696 | Accepted | a,b=map(int,input().split())
#a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
print(lcm(a,b)) |
p03380 | s960731803 | Accepted | n=int(input())
a=list(map(int,input().split()))
a.sort()
maxa=max(a)
ans=0
ch=0
for i in range(n-1):
b=maxa-a[i]
c=min(b,a[i])
if c>=ch:
ans=a[i]
ch=c
print(str(maxa)+' '+str(ans)) |
p02761 | s654888912 | Accepted | n, m = map(int, input().split())
sc = [list(map(int, input().split())) for _ in range(m)]
if m == 0:
if n == 1:
print(0)
else:
print(10 ** (n - 1))
exit()
if n == 1:
left = 0
else:
left = 10 ** (n - 1)
right = 10 ** n
ans = -1
for i in range(left, right):
i = str(i)
for s, c in sc:
if int(i[s - 1]) != c:
break
else:
ans = i
break
print(ans)
|
p03035 | s772372301 | Accepted | A,B = map(int, input().split())
if A >= 13:
print(B)
elif 6 <= A <= 12:
print(int(B/2))
else:
print(0) |
p03910 | s596461328 | Accepted | N=int(input())
ans=0
reject=0
A=[]
for i in range(1,N+1):
ans+=i
if ans>=N:
reject=ans-N
for j in range(1,i+1):
if j!=reject:
print(j)
break |
p03211 | s584635806 | Accepted | def main():
s = list(input())
#s = input().split()
#a,b = list(map(int,input().split()))
#a = [input() for i in range(n)]
#a = [int(input()) for i in range(n)]
#a = [input().split() for i in range(n)]
#a = [list(map(int,input().split())) for i in range(n)]
ans = 753
count = 0
lis = []
for i in range(len(s)-2):
a = abs(753 - (int(s[i])*100+int(s[i+1])*10+int(s[i+2])))
ans = min(a,ans)
print(ans)
if __name__ == '__main__':
main() |
p02700 | s658026697 | Accepted | a, b, c, d = map(int, input().split())
while True:
c -= b
if c <= 0:
print('Yes')
break
a -= d
if a <= 0:
print('No')
break |
p02882 | s724591094 | Accepted | import math
a,b,x=map(float,input().split())
volume=a**2*b
if volume<x*2:
sub=volume-x
sub=sub/a*2/a
ans=math.degrees(math.atan(sub/a))
else:
x=x/a*2/b
ans=90.0-math.degrees((math.atan(x/b)))
print(ans) |
p02773 | s552600983 | Accepted | import collections
N = int(input())
words=[]
for i in range(N):
words.append(input())
c = collections.Counter(words)
l=c.most_common()
max_num = l[0][1]
max_words =[]
for i in l:
if i[1] == max_num:
max_words.append(i[0])
else:
break
max_words.sort()
for word in max_words:
print(word)
|
p03319 | s830184359 | Accepted | #!/usr/bin/env python3
import math
n, k = map(int, input().split())
a = list(map(int, input().split()))
if n == k:
ans = 1
elif (n-1)%(k-1)==0:
ans = (n-1)//(k-1)
else:
ans = (n-1)//(k-1) + 1
print(ans)
|
p03633 | s135168842 | Accepted | n = int(input())
t = [int(input()) for i in range(n)]
#最大公約数
def gcd(a, b):
while b!=0:
a,b=b,a%b
return a
#最小公倍数
def lcm(a,b):
return a * b // gcd(a, b)
ans = t[0]
for i in range(1,n):
ans = lcm(ans, t[i])
print(ans) |
p03803 | s504150344 | Wrong Answer | A, B = map(int, input().split())
if A == 1:
A += 13
elif B == 1:
B += 13
if A > B :
print("Alice")
elif A < B:
print("Bob")
else:
print("Draw")
|
p03103 | s862885250 | Accepted | # ABC121C - Energy Drink Collector
def main():
N, M, *AB = map(int, open(0).read().split())
AB = list(zip(*[iter(AB)] * 2))
AB.sort()
ans = 0
for a, b in AB:
while b > 0 and M > 0:
ans += a
b -= 1
M -= 1
print(ans)
if __name__ == "__main__":
main()
|
p03637 | s902298894 | Accepted | n, *a = map(int, open(0).read().split())
f = 0
t = 0
o = 0
for i in a:
if i % 4 == 0:
f += 1
elif i % 2 == 0:
t += 1
else:
o += 1
if f >= o - 1 and t == 0:
print('Yes')
elif f >= o:
print('Yes')
else:
print('No') |
p02642 | s563728451 | Wrong Answer | import math
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
cnt = 0
for j in reversed(range(n)):
if i != j:
if a[i] % a[j] != 0:
cnt += 1
if cnt == n-1:
ans += 1
else:
break
print(ans) |
p02897 | s617341573 | Accepted | n = int(input())
print("0.5" if n%2==0 else ((n//2)+1)/n) |
p03146 | s228869226 | Wrong Answer | s = int(input())
lis = [s]
def func(n):
if n%2 == 0:
return n//2
else:
return 3*n+1
while func(s) !=1:
s = func(s)
lis.append(s)
print(len(lis)+2) |
p03030 | s453821852 | Wrong Answer | n = int(input())
keep=[]
ans=[0]*n
for i in range(n):
lis = list(input().split())
keep.append(lis)
for j in range(len(keep)):
num=1
for k in (keep[0:j]+keep[j+1:n]):
if keep[j][0]>k[0]:
num+=1
elif keep[j][0]==k[0] and keep[j][1]<k[1]:
num+=1
ans[j]=num
for l in range(n):
print(ans.index(l+1)+1) |
p02797 | s293376639 | Accepted | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, K, S = lr()
INF = 10 ** 9
if S < INF:
answer = [S] * K + [S+1] * (N-K)
else:
answer = [S] * K + [1] * (N-K)
print(*answer)
|
p02584 | s490026734 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
k = X // D
if abs(X - k * D) <= abs(X - (k + 1) * D):
best_k = k
else:
best_k = k + 1
if K < best_k:
print(abs(X - K * D))
elif (K - best_k) % 2 == 0:
print(abs(X - best_k * D))
else:
print(min(abs(X - best_k * D + D), abs(X - best_k * D - D)))
|
p03433 | s944343165 | Accepted | n=int(input())
x=int(input())
d=n%500
if(d<=x):
print("Yes")
else:
print("No")
|
p02582 | s280594582 | Wrong Answer | S = list(map(str, input()[0:3]))
res = 0
for i in S:
if i == "R":
res += 1
print(res) |
p03699 | s907205357 | Wrong Answer | N = int(input())
S = []
for i in range(N):
S.append(int(input()))
S.sort()
ans = sum(S)
if ans % 10 != 0:
print(ans)
for i in range(N):
if S[i] % 10 != 0:
ans -= S[i]
print(ans)
exit()
print(0)
|
p03385 | s528610202 | Wrong Answer | li = list(input())
for i in li:
if i != 'b' or i != 'a' or i != 'c':
print('No')
exit()
print('Yes')
|
p03073 | s067238687 | Accepted | count = 0
S = [int(i) for i in list(input())]
for i in range(len(S)-1):
if S[i] == S[i+1]:
if S[i] == 0:
S[i+1] = 1
elif S[i] == 1:
S[i+1] = 0
count += 1
print(count) |
p02628 | s630116772 | Accepted | n,k=map(int,input().split())
ps=list(map(int,input().split()))
ps.sort()
print(sum(ps[:k])) |
p03785 | s978285121 | Accepted | n, c, k = list(map(int, input().split()))
t = [int(input()) for i in range(n)]
t.sort()
limit = t[0] + k
num = 1
cnt = 1
for i in range(1, n):
if limit < t[i] or num == c:
num = 1
limit = t[i] + k
cnt += 1
else:
num += 1
print(cnt) |
p02603 | s661881849 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
wallet = 1000
stock = 0
for i in range(len(a)-1):
if a[i+1] > a[i]:
stock = wallet // a[i]
wallet -= stock * a[i]
elif a[i+1] <= a[i]:
wallet += stock * a[i]
stock = 0
wallet += stock * a[-1]
print(wallet) |
p02983 | s418246514 | Wrong Answer | l, r = map(int, input().split())
res = 2018
if r-l > 2019:
print(0)
else:
for i in range(l, r):
for j in range(i+1, r+1):
res = min(res, (i*j)%2019)
print(res) |
p02813 | s141681243 | Accepted | n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
from bisect import bisect
from math import factorial
def rank(l):
r = 0
nums = [_ for _ in range(1,n+1)]
for i in range(n):
r += bisect(nums, l[i]) * factorial(len(nums)-1)
nums.remove(l[i])
return r
print(abs(rank(p)-rank(q))) |
p03106 | s849347786 | Wrong Answer | a,b,k = map(int,input().split())
ans = 0
for i in range(1,min(a,b)):
if(a%i==0)and(b%i==0):
ans += 1
if(ans==k):
print(i)
break
|
p02713 | s479249088 | Accepted | import math
k=int(input())
l=[]
s=0
for x in range(1,k+1):
for y in range(1,k+1):
l.append(math.gcd(x,y))
for x in range(len(l)):
for y in range(1,k+1):
s+=math.gcd(l[x],y)
print(s) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.