problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02859 | s062253194 | Accepted | print((int(input()))**2) |
p03730 | s992057763 | Accepted | a, b, c = map(int, input().split())
for i in range(0,a*b+1,a):
if i % b == c:
print('YES')
break
else:
print('NO') |
p02552 | s021268644 | Wrong Answer | x = int(input())
print(x!=0) |
p03814 | s657314679 | Wrong Answer | s = str(input())
k = 1
a = 0
b = 0
num = 0
for i in range(len(s)):
if s[i] == 'A':
if k == 1:
a = i
k = 2
if s[i] == 'Z':
if k == 2:
b = i - a + 1
k = 1
if num < b:
num = b
print(num)
|
p02760 | s937304838 | Accepted | import itertools
A = [list(map(int,input().split())) for i in range(3)]
AA = list(itertools.chain.from_iterable(A))
grid = []
N = int(input())
for i in range(N):
b = int(input())
if b in AA:
grid.append(AA.index(b))
#print(grid)
if (0 in grid and 4 in grid and 8 in grid) or (2 in grid and 4 in grid and 6 in grid):
print("Yes")
elif(0 in grid and 1 in grid and 2 in grid) or (3 in grid and 4 in grid and 5 in grid) or (6 in grid and 7 in grid and 8 in grid):
print("Yes")
elif(0 in grid and 3 in grid and 6 in grid) or (1 in grid and 4 in grid and 7 in grid) or (2 in grid and 5 in grid and 8 in grid):
print("Yes")
else:
print("No") |
p03797 | s220472736 | Wrong Answer | S, C = map(int, input().split())
ans = 0
# 初期のSで可能な限りSCCを作る
if S*2 <= C:
C = C - S*2
print(C, S, C//4)
ans += S
ans += C // 4
else:
print(C//2)
ans += C // 2
print(ans)
|
p03657 | s794790413 | Accepted | a,b=map(int,input().split())
if a%3==0 or b%3==0 or (a+b)%3==0:
print("Possible")
else:
print("Impossible") |
p03317 | s608590108 | Accepted | import math
n,k=map(int,input().split());input();print(math.ceil((n-1)/(k-1))) |
p02730 | s228493503 | Wrong Answer | text_ = input()
if text_ != text_[::-1]:
print('No')
elif text_[:((len(text_) - 1)//2)] != text_[:((len(text_) - 1)//2)][::-1]:
print('No')
elif text_[:((len(text_) + 3) // 2)] != text_[:((len(text_) + 3) // 2)][::-1]:
print('No')
else:
print('Yes') |
p03720 | s769534163 | Wrong Answer | N,M = map(int,input().split())
res = {}
for _ in range(M):
a,b = map(int,input().split())
if a in res.keys():
res[a] += 1
else:
res[a] = 1
if b in res.keys():
res[b] += 1
else:
res[b] = 1
for key,value in sorted(res.items()):
print(value) |
p03282 | s497038220 | Accepted | import re
s = input()
k = int(input())
if s[0] != '1':
print(s[0])
exit()
else:
pos = re.search(r'1+',s).end()
if k <= pos:
print(1)
else:
print(s[pos]) |
p03038 | s278839357 | Accepted | #!/usr/bin/env python3
import heapq
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
bc = sorted(bc, key=lambda x: x[1], reverse=True)
# print(bc)
heapq.heapify(a)
for b, c in bc:
for i in range(b):
num = heapq.heappop(a)
if num < c:
heapq.heappush(a, c)
else:
heapq.heappush(a, num)
break
# print(a)
print(sum(a))
|
p03623 | s637292633 | Wrong Answer | x,a,b=map(int,input().split());print(['a','b'][abs(x-a)>abs(x-b)]) |
p03220 | s565232703 | Accepted | N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
now = 99999
ans = 0
for i in range(N):
tem = T - H[i] * 0.006
if abs(tem - A ) < now:
now = abs(tem - A)
ans = i+1
print(ans) |
p02862 | s492393302 | Wrong Answer | X,Y = map(int,input().split())
M = max(X,Y)
m = min(X,Y)
mod = 10 ** 9 + 7
if (X + Y) % 3 != 0:
print(0)
else:
con = (X + Y) // 3
dif = M - m
n = (con - dif) // 2
def comb(n, r):
n += 1
over = 1
under = 1
for i in range(1,r + 1):
over = over * (n - i) % mod
under = under * i % mod
#powでunder ** (mod - 2) % modを実現、逆元を求めている
return over * pow(under,mod - 2,mod) % mod
ans = comb(con,n)
print(ans)
|
p02958 | s349888711 | Wrong Answer | n=int(input())
p=list(map(int,input().split()))
x=0
for i in range(n-1):
if int(p[i])!=i+1:
x+=1
if x<=2:
print("Yes")
else:
print("No") |
p03011 | s171964901 | Wrong Answer | p,q,r=map(int,input().split())
if p+q<=q+r and p+q<p+r:
print(p+q)
if p+r<=p+q and p+r<q+r:
print(p+r)
if q+r<=p+r and q+r<p+q:
print(q+r)
if p+r==q+r and p+r<p+q:
print(p+r)
if p==q==r:
print(p+q)
if r+p==q+r and r+p>p+q:
print(r+p) |
p03067 | s852110942 | Wrong Answer | a, b, c = map(int, input().split())
if a <= c <= b or b <= c <= a:
print('YES')
else:
print('No')
|
p03331 | s201202310 | Accepted | N=int(input())
ans=0
for i in range(N//2):
s=0
a=i+1
b=N-i-1
while a>0 or b>0:
s+=a%10+b%10
a=a//10
b=b//10
if ans==0 or ans>s:
ans=s
print(ans)
|
p03838 | s942127024 | Wrong Answer | def answer(x, y):
absX = abs(x)
absY = abs(y)
a = abs(absY - absX)
b = 0
if (x == 0 and y > 0) or (x < 0 and y == 0):
return a
if (x == 0 and y < 0) or (x > 0 and y == 0):
return a+1
if x > 0 and y > 0:
if x < y:
return a
else:
return (x+y)+1
if (x < 0 and y > 0) or (x > 0 and y < 0):
return a+1
x, y = map(int, input().split())
print(answer(x, y)) |
p03208 | s152738099 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
n, k = map(int, input().split())
h = sorted([int(input()) for _ in range(n)])
ans = float('inf')
for i in range(n-k+1):
ans = min(ans, h[i+(k-1)]-h[i])
print(ans)
if __name__ == '__main__':
main() |
p03799 | s012132945 | Wrong Answer | N, M = map(int, input().split())
ans = 0
if 2*N <= M:
ans += N
M -= 2*N
ans += M//4
print(ans)
|
p03427 | s799316347 | Accepted | n = int(input())
lst = list(map(int,str(n)))
if len(lst) == 1:
print(n)
elif set(lst[1:]) == {9}:
print(lst[0] + 9*(len(lst)-1))
else:
print((lst[0]-1) + 9*(len(lst)-1)) |
p02818 | s794340391 | Wrong Answer | T, S, K = list(map(int, input().split()))
if T - K > 0:
print(T - K, S)
else:
print(0, T - K + S)
|
p03286 | s465738488 | Wrong Answer | n=int(input()) |
p02664 | s298538113 | Wrong Answer | paramT = input()
paramReplaced = list(paramT.replace('?', 'D'))
point = 0
for i in range(len(paramReplaced)):
if paramReplaced[i] == 'D':
point += 1
if i != 0 and paramReplaced[i - 1] == 'P' and paramReplaced[i - 1] == 'D':
point += 1
print(point)
|
p03951 | s722024953 | Wrong Answer | def main():
N = int(input())
s = input()
t = input()
if s == t:
print(N)
else:
s = s[::-1]
count = 0
for i in range(N):
if s[i] == t[i]:
count += 1
else:
break
print(2*N-count)
if __name__ == '__main__':
main() |
p03943 | s461630462 | Accepted | a,b,c = map(int,input().split())
d = [a,b,c]
d = sorted(d)
if d[0]+d[1]==d[2]:
print('Yes')
else:
print('No') |
p02583 | s100557671 | Accepted | N=int(input())
Array = list(map(int, input().strip().split()))
array=list(set(Array))
array.sort()
n=len(array)
f=0
for i in range(0,n-2):
for j in range(i+1,n-1):
for w in range(j+1,n):
if array[i]+array[j]>array[w]:
f+=Array.count(array[i])*Array.count(array[j])*Array.count(array[w])
print(f)
|
p03821 | s824311914 | Accepted | import math
N = int(input())
a_li = []
b_li = []
ans = 0
for _ in range(N):
a, b = map(int, input().split())
a_li.append(a)
b_li.append(b)
for i in reversed(range(N)):
a, b = a_li[i], b_li[i]
a += ans
div = math.ceil(a / b)
ans += b * div - a
print(ans)
|
p02601 | s089547710 | Wrong Answer | import itertools
l = list(map(int,input().split()))
k = int(input())
p = list(itertools.combinations_with_replacement([0,1,2], k))
f = False
ans = 0
for i in p:
a = (l[0] * 2 * i.count(0) if i.count(0) else 1)
b = (l[1] * 2 * i.count(1) if i.count(1) else 1)
c = (l[2] * 2 * i.count(2) if i.count(2) else 1)
if a<b<c:
f = True
if f == False:
print("No")
else:
print("Yes")
|
p02720 | s593772512 | Wrong Answer | import sys
k = int(input())
counter = 13
if k < 13 :
print(k)
else :
for i in range(13, k**3) :
counter += 1
nums = list(map(int, list(str(i))))
for j in range(0, len(nums)-1) :
if abs(nums[j] - nums[j+1]) > 1 :
counter -= 1
break
if counter == k :
print(i+1)
sys.exit() |
p03126 | s573603280 | Accepted | N,M=map(int,input().split())
cnt_loved=[0]*M
ans=0
for _ in range(N):
love_list=list(map(int,input().split()))
for a in love_list[1:]:
cnt_loved[a-1]+=1
for i in range(M):
if cnt_loved[i]==N:
ans+=1
print(ans) |
p02629 | s943726102 | Wrong Answer | n = int( input() )
alphabet = [ '' ] + [chr(i) for i in range(97, 97+26)]
conv = []
k = n
while k > 0:
conv.append( k % 26 )
k = k // 26
ans = []
for c in conv:
ans.append( alphabet[ c ] )
print( "".join( reversed( ans ) ) ) |
p03073 | s450316835 | Accepted | s=input()
n=len(s)
if n%2==0:
odd=even=n//2
else:
even=n//2
odd=even+1
odd_black=0
even_black=0
for i in range(n):
if i%2==0:
if s[i]=="0":
odd_black+=1
else:
if s[i]=="0":
even_black+=1
odd_white=odd-odd_black
even_white=even-even_black
if odd_black<=even_black:
count=odd_black+even_white
else:
count=odd_white+even_black
print(count) |
p03795 | s142334829 | Accepted | import math
n = int(input())
a = math.floor(n / 15)
print(800 * n - 200 * a) |
p02608 | s245127908 | Accepted | from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)
n = int(stdin.readline().rstrip())
li = [0]*1000000
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
li[i**2+j**2+k**2+i*j+j*k+k*i] += 1
for i in range(1,n+1):
print(li[i]) |
p03210 | s657358857 | Accepted | ''' Versao V judge'''
line = input()
num = [int(n) for n in line.split()][0]
predicted_value = "NO"
if num in [3, 5, 7]:
predicted_value = "YES"
print(predicted_value) |
p03309 | s887372861 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
diff = []
for i in range(N):
diff.append(A[i] - (i + 1))
diff.sort()
b = (diff[(N - 1) // 2] + diff[N // 2]) // 2
result = 0
for i in range(N):
result += abs(A[i] - (i + 1 + b))
print(result)
if __name__ == "__main__":
main()
|
p02783 | s080388128 | Accepted | import math
h, a = map(int, input().split())
print(math.ceil(h / a)) |
p02731 | s707400339 | Wrong Answer | print(333*333*333) |
p02933 | s377339332 | Accepted | a=int(input())
s=input('')
if a>=3200:
print(s)
else :
print('red') |
p02720 | s457112743 | Accepted | k = int(input())
ls = []
def dfs(n):
if len(n) >= 12:
return
ls.append(int(n))
lastNum = int(n[-1])
for i in range(max(0, lastNum-1), min(lastNum + 2, 10)):
dfs(n + str(i))
dfs("1")
dfs("2")
dfs("3")
dfs("4")
dfs("5")
dfs("6")
dfs("7")
dfs("8")
dfs("9")
ls = list(ls)
ls = sorted(ls)
print(ls[k-1])
|
p02684 | s643635833 | Accepted | n,k = (int(x) for x in input().split())
town = [int(i) for i in input().split()]
warp = [1]
checklist = [0]+[-1]*n
i = 0
j = 1
s = 0
while j<=n:
warp.append(town[i])
if checklist[town[i]-1]!=-1:
s = checklist[town[i]-1]
loop = warp[s:j]
break
checklist[town[i]-1] = j
i = town[i]-1
j += 1
if k>=s:
m = len(loop)
print(loop[(k-s)%m])
else:
print(warp[k]) |
p03456 | s131177454 | Wrong Answer | a, b = map(str,input().split())
c = a + b
d = int(c)
i = 0
while i < 317:
e = i * i
if e == d:
print("Yes"),
i = 317
else:
if e > d:
print("No")
i = 317
else:
i = i +1 |
p02755 | s515910779 | Wrong Answer | def tax8(n):
return int(n*(1.08))
def tax10(n):
return int(n*(1.1))
a , b = map(int,input().split())
ans = -1
x = []
for i in range(1,a+1):
if tax8(i) == a:
x.append(i)
y = []
for i in range(1,b+1):
if tax10(i) == b:
y.append(i)
for i in x:
if i in y:
ans = i
break
print(ans) |
p02697 | s871511022 | Wrong Answer | N, M = list(map(int, input().split()))
for i in range(M):
print(1 + i, N - i)
|
p02719 | s028878770 | Accepted | #create date: 2020-04-04 21:11
import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
n, k = na()
print(min(n%k, k-(n%k)))
if __name__ == "__main__":
main() |
p02916 | s601424512 | Wrong Answer | n = int(input())
a_list = [0] + list(map(int, input().split()))
b_list = [0] + list(map(int, input().split()))
c_list = [0] + list(map(int, input().split()))
sum = 0
j = 1
for i in range(1, n+1):
sum += b_list[a_list[i]]
if i >= 2:
if a_list[i] == a_list[i-1] + 1:
sum += c_list[a_list[i-1]]
#j += 1
print(sum)
print(sum) |
p02987 | s943323268 | Wrong Answer | s = input()
t = sorted(s)
if t[0] == t[1] and t[2] == t[3]:
print('Yes')
else:
print('No')
|
p02755 | s023267724 | Accepted | import math
a, b = map(int, input().split())
ans = -1
for i in range(1, 1251):
if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
ans = i
break
print(ans)
|
p03339 | s942099475 | Accepted | n = int(input())
s = input()
w = []
e = []
cnt_w, cnt_e = 0, 0
for i in range(n):
if s[i] == "W":
cnt_w += 1
else:
cnt_e += 1
w.append(cnt_w)
e.append(cnt_e)
f_inf = float("inf")
res = f_inf
for i in range(n):
if s[i] == "W":
t = w[i] - w[0] + e[len(e) - 1] - e[i]
else:
t = w[i] + e[len(e) - 1] - e[i]
res = min(res, t)
print(res) |
p03827 | s036254808 | Accepted | from sys import stdin
def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
n = I()
s = S()
ans = 0
x = 0
for i in range(n):
if s[i] == 'I':
x += 1
if ans < x:
ans = x
else:
x -= 1
print(ans) |
p03821 | s460758622 | Wrong Answer | N = int(input())
arr = [list(map(int, input().split())) for i in range(N)]
ans = 0
for i in range(N - 1, -1, -1):
a, b = arr[i]
if b == 1:
continue
if a % b == 0:
continue
a += ans
ans += b - (a % b)
print(ans) |
p02576 | s155526148 | Accepted | def main():
N, X, T = map(int, input().split())
if N % X == 0: return N // X * T
else: return (N//X + 1) * T
if __name__ == '__main__':
print(main())
|
p02988 | s802430387 | Accepted | n=int(input())
p=list(map(int,input().split()))
ans=0
for i in range (1,n-1):
if p[i-1]<=p[i]<=p[i+1] or p[i+1]<=p[i]<=p[i-1]:
ans+=1
print(ans) |
p02912 | s230233165 | Accepted | import sys
import heapq
input = sys.stdin.readline
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
A[i] = (-1)*A[i]
heapq.heapify(A)
for i in range(M):
a = heapq.heappop(A)
heapq.heappush(A, int(a/2))
print(abs(sum(A))) |
p03254 | s808505977 | Accepted | n, x = [int(w) for w in input().split()]
a_li = [int(w) for w in input().split()]
a_li.sort()
ans = 0
for a in a_li:
x -= a
if x >= 0:
ans += 1
else:
break
if x == 0:
pass
else:
if x > 0:
ans = max(ans - 1, 0)
print(ans)
|
p02922 | s594929672 | Wrong Answer | a, b = [int(x) for x in input().split()]
print((b - a) // (a - 1) + 1) |
p02723 | s492337712 | Accepted | S = input()
if S[2]==S[3]:
if S[4]==S[5]:
print("Yes")
else:
print("No")
else:
print("No") |
p03799 | s708794078 | Accepted | # NはSの個数、MはCの個数
N, M = map(int, input().split())
# 既存のSを消費しきれない場合
if M < 2 * N:
# Cの個数のみでSccの数が決まる
print(M // 2)
# 既存のSを消費し切れる場合
else:
ans_1 = N
M = M - 2 * N
ans_2 = M // 4
print(ans_1 + ans_2)
|
p03455 | s312170642 | Accepted | # --- coding: utf-8 ---
a, b = map(int, input().split())
if a * b % 2 == 0:
print("Even")
else:
print("Odd")
|
p03592 | s960610781 | Wrong Answer | n, m, k = list(map(int, input().split()))
for i in range(n+1):
for j in range(m+1):
if (n-j)*i + (m-i)*j == k:
print('Yes')
exit()
print('No')
|
p03239 | s410264250 | Accepted | N,T=map(int,input().split())
li=[list(map(int,input().split())) for i in range(N)]
li2=[]
for i in range(N):
if li[i][1]<=T:
li2.append(li[i])
li2.sort()
if len(li2)==0:
print('TLE')
exit()
print(li2[0][0]) |
p03077 | s556304832 | Accepted | import math
n = int(input())
a = [int(input()) for _ in range(5)]
print(math.ceil(n / min(a)) + 4) |
p02811 | s395460519 | Accepted | K, X = map(int, input().split())
if 500*K >= X:
print('Yes')
else:
print('No') |
p03319 | s269348866 | Accepted | import math
N,K = map(int,input().split(' '))
A = map(int,input().split(' '))
# 最初
N = N - K
if N == 0:
print(1)
else:
print(math.ceil(N/(K-1))+1) |
p03086 | s326552505 | Accepted | s=input()
l=len(s)
ans=0
for i in range(l):
for j in range(1,l-i+1):
t=s[i:i+j]
for k in range(j):
if t[k]=='A' or t[k]=='C' or t[k]=='G' or t[k]=='T':
continue
else:
break
else:
ans=max(ans,j)
print(ans) |
p03386 | s521210383 | Wrong Answer | a, b, k = map(int, input().split())
s = set(range(a, min(b + 1, a + k)))
s |= set(range(b, max(a - 1, b - k)))
s = sorted(s)
print('\n'.join(map(str, s))) |
p03545 | s434438004 | Wrong Answer | L = [int(i) for i in str(input())]
for i in range(2 ** 3):
l = ['+'] * 3
for j in range(3):
if ((i >> j) & 1):
l[j] = '-'
s = L[0]
for k in range(3):
if l[k] == '+':
s += L[k + 1]
else:
s -= L[k + 1]
if s == 7:
for m in range(3):
print(str(L[m]) + str(l[m]), end='')
print(str(L[3]) + '=7')
|
p02697 | s381273552 | Accepted | n,m = map(int,input().split())
if n % 2 == 1:ans = [[1+i,n-i] for i in range(n//2)]
else:ans = [[1+i,n-i] for i in range(n//4)]+[[n//2+1+i,n//2-1-i] for i in range(n//2-n//4-1)]
for i in range(m):print(ans[i][0],ans[i][1]) |
p03696 | s593880708 | Accepted | def test(length, cost):
tmp = length.replace('()', '')
if len(length) < 2 or len(tmp) == len(length):
return length
return test(tmp, len(length))
n = int(input())
s = input()
last = test(s, len(s))
print(last.count(')') * '(' + s + last.count('(') * ')')
|
p03067 | s528692919 | Accepted | A, B, C = map(int, input().split())
print('Yes' if A<C<B or B<C<A else 'No') |
p02995 | s706744950 | Accepted | import fractions
a,b,c,d = map(int, input().split())
def lcm(a,b):
return a * b // fractions.gcd(a, b)
def count(num, a, b):
return int(num - num//a - num//b + num//lcm(a,b))
print(count(b,c,d)-count(a-1,c,d))
|
p03000 | s466701948 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
d=0
cnt=1
for i in range(1,n+1):
d=d+l[i-1]
if d<=x:
cnt+=1
print(cnt)
|
p02729 | s986986070 | Accepted | N, M = map(int, input().split())
print(int(N*(N-1)/2 + M*(M-1)/2)) |
p03696 | s605258575 | Accepted | N = int(input())
S = input()
left_cnt = 0
right_cnt = 0
for c in S:
if '(' == c:
left_cnt += 1
elif left_cnt == 0:
right_cnt += 1
else:
left_cnt -= 1
#print(right_cnt, left_cnt)
print('(' * right_cnt + S + ')' * left_cnt) |
p03680 | s707940117 | Accepted | N = int(input())
A = [0]
for _ in range(N):
A.append(int(input()))
S = set()
i = 1
cnt = 0
while i != 2 and not i in S:
S.add(i)
i = A[i]
cnt += 1
if i == 2:
print(cnt)
else:
print(-1) |
p02546 | s812093880 | Wrong Answer | s=input()
if s[-1]==s:
print(s+"s")
else:
print(s+"es") |
p03761 | s710707934 | Wrong Answer | import collections
n = int(input())
s = [input() for i in range(n)]
w = ""
if n == 1:
r = collections.Counter(s[0])
for k, v in r.items():
w += k * r[k]
print(w)
exit()
a = collections.Counter(s[0])
b = collections.Counter(s[1])
res = a & b
if n <= 2:
for k in sorted(res):
w += k * res[k]
print(w)
else:
for i in s[2:]:
res = res & collections.Counter(i)
if not res:
print("")
for k in sorted(res):
w += k * res[k]
print(w) |
p02608 | s825321432 | Accepted | N = int(input())
list = [0]*(N+1)
for i in range(1,100):
for j in range(1,100):
a = i*i + j*j + i*j
for k in range(1,100):
a = i*i + j*j + k*k + i*j +j*k + i*k
if a <= N:
list[a] += 1
for i in range(1,N+1):
print(list[i]) |
p03986 | s473101215 | Wrong Answer | from bisect import bisect_right
def cal(X):
S,T = [],[]
for i in range(len(X)):
if X[i] == "S":
S.append(i)
else:
T.append(i)
pt = bisect_right(S,T[len(T)-1])
return 2*(len(S)-pt)
def main():
X = input()
print(cal(X))
if __name__ == "__main__":
main()
|
p03617 | s367354864 | Accepted | Q, H, S, D = map(int, input().split())
N = int(input())
D = min(8 * Q, 4 * H, 2 * S, D)
S = min(4 * Q, 2 * H, S)
ans = (N // 2) * D + (N % 2) * S
print(ans) |
p03041 | s915831746 | Wrong Answer | N,K = list(map(int, input().split()))
S = str(input())
s = [S[i] for i in range(len(S))]
ans = (s[K-1].lower)
print(ans) |
p02765 | s396570500 | Accepted | N, R = map(int, input().split())
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) |
p03495 | s304979973 | Accepted | import collections
n, k = map(int, input().split())
ls = list(map(str, input().split()))
c = collections.Counter(ls)
ls_s = c.most_common()
l = len(ls_s)
ans = 0
if l <= k:
print(0)
else:
for i in range(l - k):
ans += ls_s[-1][1]
del ls_s[-1]
print(ans) |
p02621 | s836123080 | Accepted | n=int(input())
print(n+n**2+n**3) |
p03951 | s385258282 | Wrong Answer | from collections import defaultdict
from collections import deque
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
s = input()
t = input()
if s==t and len(s)>=n:
print(len(s))
exit()
if n>=len(s)+len(t):
print(n)
exit()
de = 0
for i in range(min(len(s),len(t))):
if s[i*-1-1]==t[i]:
de+=1
else:
break
print(len(s)+len(t)-de) |
p03371 | s377839923 | Accepted | a, b, c, x, y = map(int, input().split())
# print(a, b, c, x, y)
ans = 10000 * (10 **5) + 7
c_max = 0
if x > y:
c_max = x * 2
else:
c_max = y * 2
for cc in range(0, c_max+1, 2):
ac = x - (cc // 2)
bc = y - (cc // 2)
if ac < 0:
ac = 0
if bc < 0:
bc = 0
price = ac * a + bc * b + cc * c
# print('price: {}, ac: {}, bc: {}, cc: {}'.format(price, ac, bc, cc))
ans = min(ans, price)
print(ans)
|
p02743 | s894935827 | Accepted | import math
a, b, c = map(int, input().split())
ab = a * b
out = c - a - b
num = ((out))**2
if out < 0:
num = -num
if 4*ab < num:
print("Yes")
else:
print("No")
|
p02641 | s216797978 | Accepted | X, N = list(map(int, input().split()))
P = list(map(int, input().split()))
ans = float('inf')
cnt = 0
while ans == float('inf'):
ans_plus = X + cnt
ans_minus = X - cnt
if not ans_plus in P:
ans = ans_plus
if not ans_minus in P:
ans = min(ans, ans_minus)
cnt += 1
print(ans) |
p03250 | s391202948 | Accepted |
a,b,c=map(int,input().split())
if a<b:
a,b=b,a
if b<c:
b,c=c,b
if a<b:
a,b=b,a
print(10*a+b+c)
|
p03637 | s663344414 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
four = 0
two = 0
for e in A:
if e % 4 == 0:
four += 1
elif e % 2 == 0:
two += 1
if (four*2+two)>=(N-1):
print('Yes')
else:
print('No') |
p03854 | s866347038 | Wrong Answer | s=input()
s=s.replace("eraser","")
s=s.replace("erase","")
s=s.replace("dreamer","")
s=s.replace("drea,","")
if s:
print("NO")
else:
print("YES") |
p03524 | s273361186 | Wrong Answer | s = input()
a = [0]*3
for i in s:
a[ord(i)-97] += 1
a = sorted(a)
A=a[2]-a[0]
B=a[1]-a[0]
#print(A,B)
if A == 1 and B == 0:
print("YES")
elif A-B==1 and a[0]==0:
print("NO")
elif A-B>1:
print("NO")
else:
print("YES") |
p03478 | s185625559 | Wrong Answer | N,A,B = list(map(int,input().split()))
cnt = 0
for n in range(1,N):
val = 0
tmp = n
while tmp // 10 > 0:
val += tmp % 10
tmp = tmp // 10
if val >= A and val <= B:
cnt += 1
print(cnt) |
p02820 | s962608956 | Wrong Answer | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = str(input())
i = 0
while len(T) > i+K:
if T[i] == T[i+K]:
if len(T) > i+K+1:
T = T[:i+K] + T[i+K+1:]
else:
T = T[:i+K]
i += 1
score = 0
for i in range(len(T)):
if T[i] == 'r':
score += P
elif T[i] == 's':
score += R
else:
score += S
print(score)
|
p03719 | s186629634 | Accepted | a,b,c=map(int,input().split())
print("Yes" if a<=c<=b else "No") |
p03035 | s286804869 | Accepted | a, b = map(int, input().split())
if 13 <= a:
print(b)
elif 6 <= a <= 12:
print(b // 2)
else:
print(0) |
p03487 | s069871450 | Accepted | from collections import Counter
a = input()
b_list = list(map(int, input().split()))
counter = Counter(b_list)
ans = 0
for num, count in counter.most_common():
if num == count:
pass
else:
if num < count:
ans += count - num
elif num > count:
ans += count
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.