problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02645 | s921914195 | Wrong Answer | s=input()
print(s[:2]) |
p03524 | s526499069 | Wrong Answer | s = input()
n = len(s) // 2 + 1
a = s.count('a')
b = s.count('b')
c = s.count('c')
if a >= n or b >= n or c >= n:
print('NO')
else:
print('YES') |
p02818 | s800228860 | Wrong Answer | A, B, K= list(map(int, input().split()))
if A>= K:
print(A-K, end=" ")
print(B)
else:
print(0, end=" ")
print(B-(K-A)) |
p02615 | s878097848 | Accepted | N = int(input())
A = [int(x) for x in input().split()]
A.sort(reverse = True)
ans = A[0]
cnt = 2
for i in range(1, N):
for j in range(2):
cnt += 1
if cnt > N: break
ans += A[i]
print(ans) |
p03351 | s856906848 | Accepted | a,b,c,d = map(int, input().split())
print('Yes' if abs(a-b)<=d and abs(b-c)<=d or abs(a-c)<=d else 'No') |
p02665 | s426924734 | Accepted | p,s=print,sum;n,*a=map(int,open(0).read().split());t=s(a);p(s([w:=1]+[exit(p(-1))if(w:=min(2*(w-q),t:=t-q))<0 else w for q in a])) |
p03136 | s977420088 | Accepted | N=int(input())
L=list(map(int,input().split()))
L_max = L.pop(L.index(max(L)))
L_sum = sum(L)
if L_max < L_sum:
print('Yes')
else: print('No') |
p02608 | s830144866 | Accepted | n=int(input())
from collections import defaultdict
d=defaultdict(int)
for i in range(1,100):
for j in range(1,100):
for k in range(1,100):
d[i**2+j**2+k**2+i*j+j*k+k*i]+=1
for i in range(1,n+1):
print(d[i]) |
p02697 | s953195198 | Accepted | n, m = map(int, input().split())
if n%2 == 1:
ans = []
a = 1
b = n-1
for i in range(m):
ans.append((a, b))
a += 1
b -= 1
else:
ans = []
a = 1
b = n-1
flag = True
for i in range(m):
if flag and b-a <= n//2:
b -= 1
flag = False
ans.append((a, b))
a += 1
b -= 1
for i in range(m):
print(*ans[i])
|
p02717 | s463798782 | Wrong Answer | x, y, z = map(int, input().split())
print(z, y, x) |
p03773 | s927589078 | Accepted | a, b = map(int, input().split())
if a + b >= 24:
print( a + b - 24)
else:
print(a + b) |
p02775 | s771822218 | Wrong Answer | #
import sys
input=sys.stdin.readline
def main():
N=input().strip("\n")
ans=0
for i in range(len(N)):
d=int(N[i])
if d<=5:
ans+=d
else:
ans+=10-d
if i==0:
ans+=1
print(ans)
if __name__=="__main__":
main()
|
p02829 | s796921629 | Accepted | a=int(input())
b=int(input())
if a==1 and b==2 or a==2 and b==1:
print(3)
elif a==2 and b==3 or a==3 and b==2:
print(1)
else:
print(2) |
p02639 | s373263877 | Accepted | x=list(map(int,input().split()))
for i in enumerate(x):
if i[1]==0:
print(i[0]+1) |
p02554 | s616337953 | Accepted | M = 10**9 + 7
n = int(input())
print((pow(10, n, M) - 2 * pow(9, n, M) + 8**n) % M)
|
p04031 | s936276713 | Accepted | n=int(input())
a=list(map(int,input().split()))
s=sum(a)/n
if s-int(s)<=0.5:
s=int(s)
else:
s=int(s)+1
ans=0
for i in range(n):
ans+=(a[i]-s)**2
print(ans) |
p03817 | s369546650 | Accepted | x=int(input())
ans=0
chk=0
ans=ans+(x//11)*2
chk=x%11
if chk>6:
ans=ans+2
elif chk>0:
ans=ans+1
print(ans) |
p03030 | s687626229 | Wrong Answer |
n = int(input())
sp = [0] * n
for i in range(n):
sp[i] = list(map(str,input().split()))
sp[i].append(i+1)
sp.sort(key = lambda x: x[1],reverse = True)
sp.sort(key = lambda x: x[0])
for i in range(n):
print(sp[i][2])
|
p02691 | s693154603 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
q1=[]
q2=[]
for i in range(n):
q1.append(i+a[i])
q2.append(i-a[i])
c2=Counter(q2)
ans=0
for i in q1:
ans+=c2[i]
print(ans) |
p02939 | s121396072 | Accepted | s = input()
num = len(s)
i, ans = 0, 0
while i < num-1:
if s[i] != s[i+1]:
ans += 1
i += 1
else:
if i == num-2: ans += 1
else: ans += 2
i += 3
if num == 1: print(1)
elif i == num-1: print(ans+1)
else: print(ans)
|
p03478 | s373454833 | Wrong Answer | n, a, b = map(int, input().split())
result = 0
for i in range(n):
x = 0
#print(i)
for j in range(len(str(i+1))):
x += ((i+1)/(10**j)) % 10
if a <= int(x) and int(x) <= b:
#print(i+1)
result += i+1
print(result) |
p03472 | s095877437 | Wrong Answer | #https://atcoder.jp/contests/abc085/tasks/abc085_d
import math
N, H = map(int, input().split(' '))
A = []
B = []
for _ in range(N):
a, b = map(int, input().split(' '))
A.append(a)
B.append(b)
max_A = max(A)
B = sorted(B, reverse=True)
ans = H
for k in range(N):
H -= B[k]
if H > 0:
cnt = math.ceil(H / max_A) + (k + 1)
else:
cnt = 0
ans = min(ans, cnt)
print(ans) |
p02554 | s739096528 | Wrong Answer | import math
n = int(input())
if n == 1:
print(0)
else:
print(10**(n-2)*(math.factorial(n))%(10**9+7)) |
p03163 | s616819256 | Wrong Answer | N, W = map(int, input().split())
values = [0 for i in range(W)]
for i in range(N):
print(values)
w, v = map(int, input().split())
# values = values[:w-1] + [max(values[j], v + values[max(0, j-w)]) for j in range(w-1, W)]
print(values[-1]) |
p03719 | s500789406 | Wrong Answer | a,b,c = map(int,input().split())
if a >= c and b<=c:
print("Yes")
else:
print("No")
|
p03075 | s846684525 | Accepted | a,b,c,d,e,k = [int(input()) for _ in range(6)]
if e - a > k:
print(':(')
else:
print('Yay!')
|
p03160 | s702587535 | Accepted | N = int(input())
h = list(map(int,input().split()))
dp = [0] * N
dp[1] = abs(h[0]-h[1])
for i in range(2,N):
dp[i] = min(dp[i-1]+abs(h[i-1]-h[i]),dp[i-2]+abs(h[i-2]-h[i]))
print(dp[-1])
|
p02618 | s572818867 | Accepted | '''
Introduction to Heuristics Contest
A - AtCoder Contest Scheduling
'''
# 本番テストケースは365
D = int(input())
# コンテストタイプごとの満足度の下がりやすさ
C = list(map(int, input().split()))
# 満足度row日目にコンテストcolタイプを開催したときの満足度の増加
S = []
for _ in range(D):
sday = list(map(int, input().split()))
S.append(sday)
# とりあえず
for i in range(D):
tmp = i % 26 + 1
print(tmp) |
p03160 | s595929820 | Accepted | N = int(input())
H = list(map(int,input().split()))
dp = [float('inf') for i in range(N)]
dp[0]=0
for i in range(N):
for j in range(1,3):
if i+j<N:
dp[i+j] = min(dp[i]+abs(H[i]-H[i+j]),dp[i+j])
print(dp[N-1]) |
p02912 | s919810076 | Accepted | import heapq
ans = 0
n,m = map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
a[i] = -a[i]
heapq.heapify(a)
for i in range(m):
b = heapq.heappop(a)
b = -(-b//2)
heapq.heappush(a, b)
for i in range(n):
ans += a[i]
print(-ans) |
p03693 | s921100138 | Accepted | a,b,c = map(int, input().split())
check = a * 100 + b * 10 + c
if check % 4 == 0:
print("YES")
else:
print("NO") |
p02939 | s624908001 | Accepted | s = input()
ans = 1
tmp = ''
bs = s[0]
for i in range(1, len(s)):
tmp += s[i]
if bs != tmp:
ans += 1
bs = tmp
tmp = ''
print(ans)
|
p02767 | s162560294 | Wrong Answer | N=int(input())
X=list(map(int,input().split()))
ans = 100000000
res = 0
for j in range(1,100):
for i in range(N):
res += (X[i]-j)**2
ans=min(ans,res)
print(ans)
|
p02918 | s078394902 | Wrong Answer | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
N,K=nm()
S=list(ns())
LRc=0
hapiness=0
for i in range(N-1):
if(S[i]=='L' and S[i+1]=='R'):
LRc+=1
if((S[i]=='L' and S[i+1]=='L') or (S[i]=='R' and S[i+1]=='R')):
hapiness+=1
ans=hapiness+min(K,LRc)*2
print(ans) |
p03721 | s179896359 | Wrong Answer | N, M = map(int, input().split())
res = []
for i in range(N):
a, b = map(int, input().split())
res+=[a]*b
sorted(res)
print(res[M-1])
|
p03360 | s331424477 | Accepted | a, b, c = map(int, input().split())
k = int(input())
s = max(a,b,c) * (2**k)
print(a+b+c+s-max(a,b,c)) |
p02848 | s698136248 | Accepted | n = int(input())
s = list(input())
alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpha *= 2
for i in range(len(s)):
s[i] = alpha[alpha.index(s[i]) + n]
print("".join(s)) |
p02797 | s736680156 | Accepted | N, K, S = map(int, input().split())
l = [S]*K + [(S+1)%10**9]*(N-K) #長さKで要素が全てSの列（条件満たすK通り）と長さNーKの適当な列で長さN列を生成
print(*l) #*lは標準出力時にはいれつの[]を出力しないため
|
p03437 | s084435723 | Wrong Answer | a, b = map(int, input().split())
print(a if a != b else '=1') |
p03433 | s120889515 | Accepted | n = int(input())
a = int(input())
print('Yes' if n % 500 <= a else 'No') |
p03799 | s675986004 | Wrong Answer | # ARC069c
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n, m = map(int, input().split())
if n > m*2:
print(m//2+(n-m//2)//2)
else:
print(n)
if __name__ == '__main__':
main()
|
p02775 | s254495475 | Wrong Answer | n = list(map(int, input()))
l = [0] * (len(n)+1)
carry = 0
for i, k in enumerate(n):
if k > 5 - carry:
l[i+1] = k - 10
l[i] += 1
carry = 1
while l[i] >= 6 - (1 if l[i-1] < 0 else 0):
l[i] -= 10
i -= 1
l[i] += 1
if i == 0:
break
else:
carry = 0 |
p03861 | s009506098 | Wrong Answer | a, b, x = map(int, input().split())
if a%x ==0:
print((b - a)//x + 1)
else:
print((b - a + 1)//x) |
p03331 | s656096055 | Wrong Answer | N = int(input())
def SumDigits(num):
sum = 0
while True:
sum += num % 10
num //= 10
if num == 0:
break
return sum
infinity = float('inf')
min = infinity
for x in range(1, N//2):
if SumDigits(x) + SumDigits(N - x) < min:
min = SumDigits(x) + SumDigits(N - x)
print(min)
|
p04012 | s221902444 | Accepted | from collections import Counter
w = list(input())
C = Counter(w)
for c in C.values():
if c % 2 == 1:
print("No")
exit()
print("Yes")
|
p03745 | s114832373 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
if N==1:
print(1)
exit()
cnt = 1
for i in range(N-2):
if A[i+1]==A[i+2]:
A[i+1]= A[i]
elif (A[i]-A[i+1])*(A[i+1]-A[i+2])>0:
continue
else:
cnt+=1
print(cnt) |
p02719 | s240618908 | Accepted | n,k = map(int,input().split(" "))
a = n
if n<=k:
a = min([n,k-n])
else:
a = min([n%k,k-n%k])
print(a) |
p02766 | s177889878 | Accepted | N, K = map(int, input().split())
import math
n = math.log(N, K)
print(int(n) + 1) |
p03612 | s104265560 | Accepted | n = int(input())
p = list(map(int,input().split()))
cnt = 0
tmp = [-1,-1]
for i in range(n):
if p[i] == i+1:
if i+1 == tmp[0]+1 and p[i]==tmp[1]+1:
cnt+=0
tmp = [-1, -1]
else:
cnt+=1
tmp = [i+1,p[i]]
# print(p[i],tmp,cnt)
print(cnt) |
p03943 | s852547989 | Accepted | def resolve():
a, b, c = list(map(int, input().split()))
if ((-a + b + c == 0)
or (a - b + c == 0)
or (a + b - c == 0)):
print("Yes")
else:
print("No")
resolve() |
p03778 | s154016349 | Accepted | W, A, B = map(int, input().split())
print(max(abs(B-A)-W, 0)) |
p02918 | s055214517 | Wrong Answer | N, K = map(int, input().split())
S = input()
x = sum(S[i] == "R" and S[i + 1] == "L" for i in range(N - 1))
y = int(S[0] == "L") + int(S[-1] == "R")
res = N - 2 * x - y
ans = res + 2 * min(K, x) + max(0, min(1, K - x))
print(ans)
|
p02724 | s547282567 | Wrong Answer | X=int(input())
a=int(X//500)
X=X%500
b=int(X//5)
print(a+b) |
p02989 | s954833541 | Accepted | N = int(input())
d = list(map(int, input().split()))
d.sort()
print(d[N//2] - d[N//2 - 1])
|
p04034 | s096983343 | Accepted | n, m = map(int, input().split())
a = [[1, False] for _ in range(n+1)]
a[1] = [1, True]
for _ in range(m):
x, y = map(int, input().split())
if a[x][1]:
a[y][1] = True
a[x][0] -= 1
if a[x][0] == 0:
a[x][1] = False
a[y][0] += 1
print(sum(x[1] for x in a)) |
p03324 | s026344426 | Accepted | D,N = map(int,input().split())
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10100]
C = [int(i*10000) for i in range(1,100)] + [1010000]
if D == 0:
print(A[N-1])
elif D == 1:
print(B[N-1])
else:
print(C[N-1]) |
p04011 | s037374910 | Wrong Answer | s = input()
r = 'Yes'
for w in s:
if s.count(w) % 2 == 1:
r = 'No'
break
print(r) |
p02862 | s925226762 | Accepted | def comb(n,k,mod):
x = y = 1
for i in range(min(k,n-k)):
x = x*(n-i)%mod
y = y*(i+1)%mod
return x * pow(y, mod-2, mod) % mod
x,y = map(int,input().split())
ans = 0
mod = 10**9+7
if (x+y)%3 == 0:
a = (-x+2*y)//3
b = (2*x-y)//3
if a >= 0 and b >= 0: ans = comb(a+b,a,mod)
print(ans) |
p03495 | s025799937 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
l = [0] * n
count = 0
for i in a:
l[i-1] += 1
l.sort(reverse = True)
for i in range(k):
count += l[i]
print(n-count) |
p02694 | s883158830 | Accepted | X=int(input())
have=100
count =0
while True:
have = int(have*1.01)
count += 1
if have >= X:
print(count)
break |
p02780 | s340066086 | Wrong Answer | n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort(reverse = True)
ans = 0
for i in range(k):
ans += (p[i] + 1) / 2
print('{:.12f}'.format(ans)) |
p02712 | s872861058 | Wrong Answer | def Main(N):
ans = 0
for i in range(N):
if i%15 == 0 or i%5 == 0 or i%3 == 0:
continue
else:
ans += i
return ans
def main():
N = int(input())
print(Main(N))
if __name__ == '__main__':
main() |
p03673 | s928086643 | Accepted | n = int(input())
a = list(map(int, input().split()))
if len(a)%2 == 1:
print(*a[0::2][::-1] + a[1::2])
else:
print(*a[1::2][::-1] + a[0::2]) |
p03545 | s131785559 | Accepted | from itertools import product
A,B,C,D = list(input().strip())
for x in product(("+","-"),repeat=3):
a1,a2,a3 = x
if eval(A+a1+B+a2+C+a3+D)==7:
print(A+a1+B+a2+C+a3+D+"=7")
break |
p02594 | s844613383 | Accepted | if int(input()) >= 30:
print('Yes')
else:
print('No') |
p02572 | s607879299 | Accepted | #!/usr/bin/env python3
import functools
M = 10 ** 9 + 7
def sum_mod(xs):
return functools.reduce(lambda x, y: (x + y) % M, xs) % M
def compute(bs):
term1 = sum_mod(bs) * sum_mod(bs) % M
term2 = sum_mod(b * b for b in bs)
double_res = (term1 - term2) % M
inv2 = pow(2, M - 2, M)
res = double_res * inv2 % M
return res
def main():
n = int(input())
bs = [int(b) for b in input().split()]
res = compute(bs)
print(res)
if __name__ == '__main__':
main() |
p03075 | s468085830 | Accepted | # ABC123 A
def main():
antennas = []
for _ in range(5):
char = int(input())
antennas.append(char)
k = int(input())
result = 'Yay!'
for antenna in antennas[::-1]:
if antenna - antennas[0] > k:
result = ':('
break
print(result)
if __name__ == '__main__':
main() |
p02780 | s578014559 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
b=0
for i in range(k):
b+=a[i]
ma=b
for i in range(n-k):
b+=a[k]
b-=a[i]
ma=max(b,ma)
ans=(ma+k)/2
|
p03545 | s410815073 | Wrong Answer | def resolve():
s = input()
for bit in range(2 ** 3):
_str = "".join(
s[i] if i == 3 else s[i] + "+" if 1 << i & bit else s[i] + "-"
for i in range(4)
)
if eval(_str) == 7:
print(_str + "=7")
if __name__ == "__main__":
resolve() |
p03250 | s900446606 | Wrong Answer | A,B,C = map(int,input().split())
print(max(A * 10 + B + C,A + B * 10 + C)) |
p03043 | s231646041 | Wrong Answer | import math
n,k = map(int,input().split())
lis = []
for i in range(n):
lis.append(math.ceil(math.log2((k/(i+1)))))
#print(lis)
ans = []
for i in range(n):
ans.append(1/n * (1/2)**lis[i])
print(sum(ans))
|
p03720 | s449980434 | Accepted | n, m = map(int, input().split())
load = []
for _ in range(m):
load.extend(map(int, input().split()))
for i in range(n):
print(load.count(i+1))
|
p03759 | s548493984 | Accepted | a,b,c=list(map(int,input().split()))
if b-a==c-b:
print("YES")
else:
print("NO")
|
p03241 | s924007338 | Accepted | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort(reverse=True)
return divisors
def main():
N, M = map(int, input().split())
d = make_divisors(M)
for i in d:
if M // i >= N:
return i
print(main())
|
p03073 | s204971364 | Wrong Answer | s= str(input())
ans = 0
for i in range(len(s)):
if i // 2 == 0:
if s[i] == '0':
ans += 1
else:
ans -= 1
else:
if s[i] == '1':
ans += 1
else:
ans -= 1
print((len(s)-abs(ans))//2)
|
p04029 | s094345106 | Wrong Answer | n = int(input())
total = 0
for i in range(n):
total = total + i*i
print(total) |
p02595 | s175012449 | Accepted | import numpy as np
L=list(map(int,input().split()))
N=L[0]
D=L[1]
count=0
M = [list(map(int, input().split(" "))) for j in range(N)]
for j in range(N):
r=np.sqrt((M[j][0])**2+(M[j][1])**2)
if r<=D:
count += 1
print(count) |
p03000 | s602775986 | Accepted | N, X = list(map(int, input().split()))
L = list(map(int, input().split()))
D = 0
a = 1
for i in range(N):
D = D + L[i]
if D <= X:
a += 1
else:
break
print(a) |
p04030 | s967693831 | Wrong Answer | ss=input().split()
r=''
for s in ss:
if s!='B':
r+=s
elif len(r)>0:
r=r[:-1]
print(r)
|
p03293 | s490815579 | Wrong Answer | S=list(input())
T=list(input())
s=sorted(S)
t=sorted(T)
if s==t:
print("Yes")
else:
print("No") |
p03639 | s076378869 | Accepted | n = int(input())
a = list(map(int, input().split()))
mod2 = mod4 = 0
for i in a:
if i%4==0:
mod4 += 1
elif i%2==0:
mod2 += 1
n -= max(0, mod2-1)
if n<=mod4*2+1:
print('Yes')
else:
print('No') |
p03612 | s055748501 | Wrong Answer | n = int(input())
a = list(map(int,input().split(' ')))
ans = 0
tmp = 0
for i in range(n):
if i+1 == a[i]:
tmp += 0.5
elif tmp:
ans += tmp//2 + 1
tmp = 0
if tmp:
ans += int(tmp//2) + 1
print(ans)
|
p03860 | s204321039 | Wrong Answer | sentence = input()
new_sent = sentence.split(" ")
acro = ""
for i in range(len(new_sent)):
acro += new_sent[i]
print(acro) |
p02795 | s341095803 | Wrong Answer | h = int(input())
w = int(input())
n = int(input())
if h < w:
h = w
print(int(n / h) + 1) |
p03720 | s692007623 | Wrong Answer | import itertools
n,m=map(int,input().split())
ab= [list(input()) for _ in range(m)]
ab=list(itertools.chain.from_iterable(ab))
k=len(set(ab))
for i in range(1,k+1):
print(ab.count(i)) |
p03351 | s240959582 | 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')
|
p03681 | s503327522 | Wrong Answer | n,m = list(map(int,input().strip().split()))
p = 10**9+7
result = 1
for i in range(1,n+1):
result = (result *i) % p
for j in range(1,m+1):
result = (result *j) % p
if n == m:
result = (result *2) % p
print(result)
|
p03252 | s394788321 | Accepted |
S = input()
T = input()
from collections import defaultdict
dictS = defaultdict(str)
dictT = defaultdict(str)
for i in range(len(S)):
if dictT[T[i]] and dictT[T[i]] != S[i]:
print("No")
exit()
if dictS[S[i]] and dictS[S[i]] != T[i]:
print("No")
exit()
dictS[S[i]] = T[i]
dictT[T[i]] = S[i]
print("Yes") |
p02860 | s922532253 | Accepted | n = int(input())
s = str(input())
if n % 2 == 1:
print('No')
else:
s_before = s[:int(n/2)]
s_latter = s[int(n/2):]
if s_before == s_latter:
print('Yes')
else:
print('No') |
p03852 | s706174057 | Accepted | # A - 居合を終え、青い絵を覆う
v=['a','e','i','o','u']
c=input()
if c in v:
print("vowel")
else:
print("consonant")
|
p02607 | s814504791 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i % 2 == 0:
if a[i] % 2 != 0:
ans += 1
print(ans) |
p02959 | s212821388 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 0
for i in range(n):
if b[i]>=a[i]:
ans += a[i]
b[i] -= a[i]
a[i] = 0
ans += min(b[i],a[i+1])
b[i] -= min(b[i],a[i+1])
a[i+1] -= min(b[i],a[i+1])
else:
ans += b[i]
a[i] -= b[i]
b[i] -= b[i]
print(ans) |
p03644 | s576132950 | Accepted | N=int(input())
result=64
while N>=1:
if N >= result:
print(result)
break
result=int(result/2)
else:
print(result) |
p02797 | s827598475 | Wrong Answer | N,K,S=map(int,input().split())
ans=[S]*N
for i in range(N-K):
ans[i]=S+1
print(*ans)
|
p03836 | s880970215 | Wrong Answer | # coding: utf-8
sx, sy, tx, ty = map(int, input().split())
ans = ""
dx = tx - sx
dy = ty - sy
for i in range(dx):
ans += "R"
for i in range(dy):
ans += "U"
for i in range(dx):
ans += "L"
for i in range(dy + 1):
ans += "D"
for i in range(dx + 1):
ans += "R"
for i in range(dy + 1):
ans += "U"
ans += "LU"
for i in range(dx + 1):
ans += "L"
for i in range(dy + 1):
ans += "U"
ans += "R"
print(ans)
|
p02842 | s921553226 | Accepted | a = [int(i*1.08) for i in range(1, 46298)]
n = int(input())
if(n in a):
print(a.index(n)+1)
else:
print(":(") |
p02783 | s333248988 | Wrong Answer | h,a=map(int,input().split())
l=0
while h>=0:
h = h-a
l += 1
print(l) |
p02778 | s167086568 | Accepted | n = input()
print("x"*len(n)) |
p03150 | s136131364 | Accepted | from sys import stdin
from sys import setrecursionlimit
import bisect
setrecursionlimit(10 ** 7)
s = input()
point = 0
for i in range(len(s)):
for j in range(i,len(s)):
now = s[:i]+s[j:]
if now == "keyence":
print("YES")
exit()
print("NO") |
p04012 | s360134003 | Accepted | s=list(input());print(['No','Yes'][all([1 if s.count(i)%2==0 else 0 for i in set(s)])]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.