problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03360 | s601121894 | Accepted | # Problem B - Maximum Sum
# input
a, b, c = map(int, input().split())
k = int(input())
# initialization
max_cost = 0
# max index search
if a>=b and a>=c:
for i in range(k):
a = a * 2
elif b>=a and b>=c:
for i in range(k):
b = b * 2
elif c>=a and c>=b:
for i in range(k):
c = c * 2
ans = a + b + c
print(ans)
|
p02819 | s768582826 | Accepted | num = int(input())
flag = False
while True:
if num == 2:
print(2)
exit()
for i in range(2, int(num**0.5)+1):
if num % i ==0:
flag = False
break
else:
flag = True
if flag:
print(num)
exit()
else:
num+=1 |
p03548 | s470976738 | Accepted | x,y,z=map(int,input().split())
print((x-z)//(y+z))
|
p02711 | s061582204 | Wrong Answer | n=input()
result=''
for s in n:
if s=='7':
result+='Yes'
else:
continue
if result=='Yes':
print(result)
else:
print('No') |
p02730 | s765493659 | Wrong Answer | ##B
S = str(input())
N = int(len(S))
##print(N)
S1 = S[0:(N-1)//2]
N1 = len(S1)
S2 = S[(N+3)//2-1:N]
N2 = len(S2)
if S1 == S2:
if S1[0:(N1-1)//2] == S1[(N1+3)//2-1:N1]:
if S2[0:(N2-1)//2] == S2[(N2+3)//2-1:N2]:
print("Yes")
else:
print("No") |
p04034 | s723232261 | Accepted | N, M = map(int, input().split())
boxes = [1] * N
ans = {1}
for i in range(M):
x, y = map(int, input().split())
boxes[x - 1] -= 1
boxes[y - 1] += 1
if x in ans:
if boxes[x - 1] == 0:
ans.remove(x)
ans.add(y)
print(len(ans))
|
p03407 | s482843397 | Wrong Answer | a, b, c = map(int, input().split())
print('Yes' if c == a or c== b or c ==a+b else 'No') |
p03472 | s385815930 | Accepted | n, h = map(int, input().split())
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = map(int, input().split())
a = sorted(a, reverse=True)
b = sorted(b, reverse=True)
ans = 0
i = 0
while i < n and a[0] < b[i]:
h -= b[i]
i += 1
ans += 1
if h <= 0:
break
if h <= 0:
print(ans)
else:
print(ans + (h + a[0] - 1) // a[0])
|
p02622 | s638698438 | Accepted | a=input()
b=input()
good=0
for i in range(len(a)):
if(a[i]!=b[i]):
good+=1
print(good) |
p02983 | s667963822 | Accepted | L, R = map(int, input().split())
if L == 0 or R-L >= 2019:
ans = 0
else:
ans = 10**18
for i in range(L, R):
for j in range(i+1, R+1):
tmp = (i*j)%2019
ans = min(ans, tmp)
if not ans:
break
print(ans)
|
p02623 | s803895544 | Accepted | import numpy as np
import bisect
N,M,K= map(int, input().split())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
if A[0]>K and B[0]>K:print(0);exit()
Asum=[0]
for i in range(N):
if Asum[-1]+A[i]<=K:
Asum.append(Asum[-1]+A[i])
else:break
Bsum=[0]
for j in range(M):
if Bsum[-1]+B[j]<=K:
Bsum.append(Bsum[-1]+B[j])
else:break
C=[]
for i in range(len(Asum)):
C.append(bisect.bisect(Bsum,K-Asum[i])+i-1)
print(max(C)) |
p02596 | s536562421 | Accepted | import math
K = int(input())
if K == 7 or K == 1:
print(1)
elif math.gcd(K,10) != 1:
print(-1)
else:
if K % 7 == 0:
K //= 7
cnt = 1
res = 10
while True:
cnt += 1
res *= 10
res %= (9 * K)
if res == 1:
break
print(cnt) |
p02779 | s965460128 | Accepted | n = int(input())
s = set(input().split())
print('YES' if n == len(s) else 'NO') |
p03479 | s538662482 | Wrong Answer | from math import log2
X, Y = map(int, input().split())
ans = log2(Y / X) + 1
print(ans) |
p02755 | s329157942 | Accepted | a,b = list(map(int,input().split()))
x = list(range(int(a//0.08+1), int((a+1)//0.08+1)))
y = list(range(int(b//0.1+1), int((b+1)//0.1+1)))
z = list(set(x) & set(y))
if not z:
print(-1)
else:
print(min(z)) |
p02922 | s885583918 | Wrong Answer | A,B=map(int,input().split())
for i in range(20):
if i==0 and A>=B:
break
if i>0 and (i+1)*A-1>=B:
break
print(i+1) |
p03524 | s988325147 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
s=input()
l=[]
l.append(s.count("a"))
l.append(s.count("b"))
l.append(s.count("c"))
if max(l)-min(l)<=1:
print("YES")
else:
print("NO") |
p02714 | s815881876 | Accepted | n = int(input())
s = list(input())
cnt = {
"R": 0,
"G": 0,
"B": 0
}
for i, c in enumerate(s):
cnt[c] += 1
ans = cnt["R"] * cnt["G"] * cnt["B"]
d = 0
for i in range(n-2):
for j in range(i + 1, n - 1):
k = j + (j - i)
if (k < n):
if (s[i] != s[j])and(s[j] != s[k]) and (s[k] != s[i]):
d += 1
print(ans-d)
|
p03699 | s748809899 | Wrong Answer | N=int(input())
s=[int(input()) for _ in range(N)]
s.sort()
ans=sum(s)
for i in range(N):
if ans%10==0:
ans-=s[i]
else:
print(ans)
exit()
print(ans)
|
p02813 | s322053967 | Wrong Answer | import itertools
n = int(input())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
x = [i+1 for i in range(n)]
ans = 0
c = 1
for j in itertools.permutations(x,n):
y = list(j)
if p == y:
ans += c
elif q == y:
ans -= c
c += 1
print(abs(ans)) |
p03206 | s260644413 | Wrong Answer | D =int(input())
print("""'Christmas' if D==25 else 'Christmas Eve' if D==24 else
'Christmas Eve Eve' if D==23 else 'Christmas Eve Eve Eve' if D==22""") |
p04044 | s765787023 | Accepted | n, l = map(int, input().split())
S = [input() for i in range(n)]
sorted_list = sorted(S)
print(*sorted_list, sep="") |
p02753 | s139770154 | Wrong Answer | s=input()
if s=="AAA" or "BBB":
print("No")
else:
print("Yes") |
p02820 | s099039632 | Accepted | n,k = map(int,input().split())
r,s,p = map(int,input().split())
a = list(input())
hand = {"r":p,"s":r,"p":s}
ans = 0
for i in range(n):
if a[i-k] == a[i] and i-k >= 0:
a[i] = "0"
else:
ans += hand[a[i]]
print(ans)
|
p03854 | s820314906 | Wrong Answer | S = input()
S_r = S[::-1]
Ss = ["maerd","remaerd","esare","resare"]
for s in Ss:
S_r = S_r.replace(s,"")
if S_r == "":
print("YES")
else:
print("NO") |
p03456 | s017331342 | Accepted | import math
a,b=input().split()
x=int(a+b)
y=int(math.sqrt(x))
print("Yes" if y*y==x else "No")
|
p03705 | s425456781 | Accepted | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,a,b = map(int,input().split())
ans = ((n-1)*b + a) - (b + (n-1)*a) + 1
print(max(ans,0)) |
p02918 | s533119123 | Accepted | n, k = map(int, input().split())
s = input()
cnt = 0
for i in range(n - 1):
if s[i] == s[i + 1]:
cnt += 1
print(min(cnt + 2 * k, n - 1)) |
p03221 | s774291403 | Wrong Answer | n,m=map(int,input().split())
pre=[[] for _ in range(n)]
for _ in range(m):
p,y=map(int,input().split())
pre[p-1].append([y,_,p])
for p in range(n):
pre[p].sort(key=lambda x:x[0])
for i in range(len(pre[p])):
pre[p][i].append(i)
lis=[]
for i in pre:
for j in i:
lis.append(j)
lis.sort(key=lambda x:x[1])
for i in lis: print("{:06}{:06}".format(i[3]+1,i[2])) |
p03127 | s837650930 | Accepted | from fractions import gcd
from functools import reduce
n = int(input())
a = [int(i) for i in input().split()]
print(reduce(gcd, a)) |
p02555 | s343651671 | Wrong Answer | s = int(input())
mod = 10**9+7
import numpy as np
if s == 1 or s == 2:
print(0)
elif s == 3:
print(1)
else:
array = np.zeros(s+1)
array[0] = 1
for i in range(3, s+1):
array[i] = np.sum(array[:i-2]) % mod
print(array[s])
|
p03645 | s479081106 | Wrong Answer | N,M=map(int,input().split())
u=0
A=[]
B=[]
for i in range(M):
a,b=map(int,input().split())
A.append(a)
B.append(b)
for i in range(M):
if A[i]==1:
s=B[i]
idxlist=[]
for idx,val in enumerate(A):
if val==s:
idxlist.append(idx)
for j in idxlist:
if B[j]!=N:
u+=1
if u==len(idxlist):
print("IMPOSSIBLE")
else:
print("POSSIBLE") |
p02971 | s722367944 | Wrong Answer | N = int(input())
A = []
def remove_one(num, A):
B = []
N = len(A)
if (num == 0):
B = A[1:]
elif (num == N):
B = A[:N-1]
else:
B = A[:i-1] + A[i+1:]
return(B)
for i in range(N):
A.append(int(input()))
for i in range(N):
B = remove_one(i+1,A)
print(max(B)) |
p02982 | s540644898 | Accepted | N,D=map(int, input().split())
X=list(list(map(int, input().split())) for _ in range(N))
import itertools
import math
tmp=0
ans=0
for x1,x2 in list(itertools.combinations(X,2)):
for d in range(D):
tmp+=(x1[d]-x2[d])**2
tmp=math.sqrt(tmp)
tmp1=math.ceil(tmp)
if tmp==tmp1:
ans+=1
tmp=0
print(ans) |
p03474 | s814310303 | Accepted | from sys import exit
num = ["0","1","2","3","4","5","6","7","8","9"]
A, B = map(int,input().split())
S = input()
for i in range(A + B + 1):
if i == A:
if S[i] != "-":
print("No")
exit()
else:
if S[i] not in num:
print("No")
exit()
print("Yes") |
p03351 | s714594814 | Accepted | a, b, c, d = map(int, input().split())
if abs(a-b) <= d and abs(b-c) <= d:
print('Yes')
elif abs(a-c) <= d:
print('Yes')
else:
print('No') |
p02633 | s390396983 | Accepted | n=int(input())
for i in range(1,361):
if (n*i)%360==0:
print(i);exit() |
p02933 | s759117798 | Accepted | a = int(input())
s = input()
print(s if a >= 3200 else 'red') |
p03317 | s248173541 | Accepted | import sys
n, k = map(int, sys.stdin.readline().split())
def main():
print((n + k - 3) // (k - 1))
if __name__ == '__main__':
main() |
p02571 | s547548099 | Wrong Answer | s = input()
t = input()
ans = len(t)
len_t = len(t)
for i in range(len(s)-len(t)):
cnt = len_t
for j in range(len(t)):
if s[i+j] == t[j]:
cnt -= 1
if ans > cnt:
ans = cnt
print(ans)
|
p02918 | s785410928 | Accepted | # solution
n, m = map(int, input().split())
strs = str(input())
count = 0
for i in range(n):
if strs[i:i+2] == 'LL' or strs[i:i+2] == 'RR':
count += 1
print(min((count + 2*m), n-1)) |
p03254 | s724694204 | Accepted | #coding:utf-8
n, x = map(int, input().split())
a = list(map(int, input().split()))
child = sorted(a)
for i in range(n):
x -= child[i]
if x < 0:
break
elif x == 0:
print(i+1)
exit()
print(i) |
p03095 | s280688463 | Wrong Answer | def resolve():
'''
code here
'''
import sys
N = int(input())
S = sys.stdin.readline().strip()
set_S = set([item for item in S])
res = 1
for s in set_S:
cnt = 1
for letter in S:
if s == letter:
cnt += 1
res *= cnt
print(res-1)
if __name__ == "__main__":
resolve()
|
p03474 | s948119151 | Accepted | a,b = map(int,input().split())
n = list(input())
if n[a] == '-' and '-' not in n[:a] and '-' not in n[a+1:]:
print('Yes')
else:
print('No') |
p03243 | s629548617 | Wrong Answer | n=int(input())
if 100<=n<=111:
print(111)
a=0
for a in range(1,9):
if 1+111*a<=n<=111*(a+1):
print(n)
print(111*(a+1))
|
p02792 | s384064385 | Accepted | n = int(input())
f_dict = {}
s_dict = {}
cnt_all = 0
for i in range(n):
moji = str(i+1)
if not moji[0]+moji[-1] in f_dict:
f_dict[moji[0]+moji[-1]] = 1
else:
f_dict[moji[0]+moji[-1]] += 1
if not moji[-1]+moji[0] in s_dict:
s_dict[moji[-1]+moji[0]] = 1
else:
s_dict[moji[-1]+moji[0]] += 1
for mykey in f_dict.keys():
if mykey in s_dict:
cnt_all += f_dict[mykey] * s_dict[mykey]
print(cnt_all) |
p02993 | s995395905 | Accepted | S =input()
for i in range(len(S)-1):
if S[i] == S[i+1]:
print('Bad')
exit()
print('Good') |
p03910 | s771187760 | Wrong Answer | n = int(input())
if n%2==0:
a = int(n//2)
print(a-1)
print(a+1)
else:
a = int(n//2)
if a!=0:
print(a)
print(a+1) |
p03693 | s038958752 | Accepted | r, g, b = map(int, input().split())
print('YES' if (100 * r + 10 * g + b) % 4 == 0 else 'NO') |
p03719 | s246447786 | Wrong Answer | a,b,c=map(int,input().split())
if c>a and c<b:
print('Yes')
else:
print('No') |
p02848 | s766673774 | Wrong Answer | N = int(input())
S = list(input())
ans = []
for i in S:
s = int(ord(i)) + N
if s > 90:
ans.append(chr(s % 90 + 65))
else:
ans.append(chr(s % 65 + 65))
print(''.join(ans))
|
p02924 | s331325353 | Wrong Answer | from sys import stdin
import math
import fractions
import heapq
n = int(stdin.readline().rstrip())
cnt = int((1 + (n-1)) * (n-1) / 2)
print(cnt) |
p03419 | s294263369 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, m = map(int, input().split())
if n == 1 and m == 1:
print(1)
sys.exit(0)
if n == 1:
print(m - 2)
sys.exit(0)
if m == 1:
print(n - 2)
sys.exit(0)
print(n * m - (n * 2 + m * 2 - 4))
|
p03261 | s768346055 | Accepted | n = int(input())
w = [''] * n
for i in range(n):
w[i] = str(input())
flag = True
for i in range(1,n):
a = list(w[i-1])
b = list(w[i])
if a[-1] == b[0]:
pass
else:
flag = False
chk = list(set(w))
if len(w) == len(chk):
pass
else:
flag = False
if flag:
print('Yes')
else:
print('No')
|
p02576 | s934799924 | Accepted | #A - Takoyaki
N,X,T = map(int,input().split())
Time = (int(N / X ) ) * T
amari = N % X
if amari != 0 :
Time += T
# 出力
print(Time)
|
p03699 | s355870808 | Accepted | N=int(input())
A=[]
for i in range(N):
A.append(int(input()))
A.sort(reverse=True)
ans=sum(A)
if ans%10!=0:
print(ans)
exit()
else:
for i in range(N):
tmp=ans-A[-(i+1)]
if tmp%10!=0:
print(tmp)
exit()
print(0) |
p02910 | s634627830 | Accepted | s = input().rstrip()
r = 'Yes'
for i in range(len(s)):
if (i + 1) % 2 == 0:
if s[i] in 'LUD':
pass
else:
r = 'No'
else:
if s[i] in 'RUD':
pass
else:
r = 'No'
if r != 'Yes':
break
print(r)
|
p03814 | s658206141 | Accepted | s = input()
print(s.rfind('Z')-s.find('A')+1) |
p02682 | s847414257 | Wrong Answer | A, B, C, K = map(int,input().split())
# 1 0 -1 Num
result = 0
if K <= A + B:
print(A)
else:
x = K-A-B
print(A-x) |
p02818 | s329397314 | Accepted | def main():
a, b, k = map(int, input().split())
if k >= a and b >= k-a:
print(0, b-(k-a))
elif k >= a and b < k-a:
print(0, 0)
else:
print(a-k, b)
if __name__ == '__main__':
main()
|
p02959 | s789963773 | Wrong Answer | def solve():
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
maximum = sum(A)
for i in reversed(range(N)):
reduce2 = max(0, A[i + 1] - B[i])
reduce1 = max(0, A[i] - B[i] + reduce2)
A[i + 1] = reduce2
A[i] = reduce1
now = sum(A)
print(maximum - now)
if __name__ == '__main__':
solve()
|
p02697 | s684334663 | Accepted | from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
head = 1
tail = N
while head <= M:
if (N % 2 == 0 and tail - head == N // 2) or (N % 4 == 0 and tail - head == N // 2 - 1):
tail -= 1
print(head, tail)
head += 1
tail -= 1
|
p03067 | s436052639 | Accepted | import sys
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
A, B, C = MI()
print('Yes' if A < C < B or B < C < A else 'No') |
p03565 | s048466711 | Accepted | s = input()
t = input()
ss = []
for i in range(len(s)-len(t)+1):
for j in range(len(t)):
if s[i+j] not in ('?', t[j]):
break
else:
S = s[:i] + t + s[i+len(t):]
ss.append(S.replace('?', 'a'))
if ss:
print(min(ss))
else:
print("UNRESTORABLE") |
p03698 | s365137694 | Accepted | import sys
input = sys.stdin.readline
s=list(input().strip())
b={}
for a in s:
b[a]=1
if len(b)==len(s):
print("yes")
else:
print("no")
|
p02629 | s865654421 | Accepted | import copy
N = int(input())
keta = 1
n = copy.deepcopy(N)
flag = True
while flag:
if n-1 >= 26**keta:
n -= 26**keta
keta += 1
else:
flag = False
for i in range(1, keta):
N -= 26**i
alph = 'abcdefghijklmnopqrstuvwxyz'
ans = []
ans.append(alph[(N%26)-1])
for i in range(1, keta):
num = (N-1)//(26**i)
if num ==0:
ans.append("a")
else:
ans.append(alph[(num%26)])
ans.reverse()
print("".join(ans)) |
p03035 | s333581253 | Wrong Answer | A, B = map(int, input().split())
if A <= 5:
print(0)
elif A <= 12:
C = B / 2
print(C)
else :
print(B) |
p02882 | s141414215 | Accepted | from decimal import Decimal
from math import pi, atan
a,b,x = map(Decimal, input().split())
thre = a*a*b / Decimal(2.0)
if x >= thre:
d = 2*b - 2*x / (a*a)
theta = 180.0 / pi * atan(d / a)
print(theta)
else:
d = 2* x / (a*b)
theta = 180.0 / pi * atan(b / d)
print(theta)
|
p03106 | s529538739 | Accepted | #!/usr/bin/env python3
a, b, k = map(int, input().split())
ans = []
for i in range(1, 101):
if a % i == 0 and b % i == 0: ans.append(i)
print(ans[-k]) |
p02618 | s350191284 | Wrong Answer | d=int(input())
a=[]
for x in range(d+1):
b=list(map(int,input().split()))
a.append(b)
print(a[1][1])
sum1=sum(a[0][1:d])
ans=[0]*d
for n in range(d):
ans[n]=(a[n+1][0])
ans[n]=int(int(ans[n])-(sum1))
try:
ans[n]=ans[n]+ans[n-1]
except:
True
for y in range(d):
print(ans[y])
|
p03285 | s069406909 | Accepted | n = int(input())
s = "No"
for d in range(n // 7, -1, -1):
if (n - 7 * d) % 4 == 0:
s = "Yes"
break
print(s) |
p03011 | s974370812 | Accepted | p, q, r = map(int, input().split())
print(min(p+q, p+r, q+r)) |
p02888 | s558842551 | Accepted | import bisect
def LI():
return list(map(int, input().split()))
N = int(input())
L = LI()
L.sort()
ans = 0
for i in range(N-1, 1, -1):
for j in range(i-1, 0, -1):
xl = L[i]-L[j]
ind = bisect.bisect_right(L, xl)
if j > ind:
ans += j-ind
print(ans)
|
p03804 | s197596652 | Accepted | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
for i in range(n - m + 1):
for j in range(n - m + 1):
check = [a[i + k][j:j + m] for k in range(m)]
flag = True
for x in range(m):
if check[x] != b[x]:
flag = False
break
if flag:
print('Yes')
exit()
print('No')
|
p02777 | s834939740 | Wrong Answer | S,T=list(input().split())
A,B=list(map(int,input().split()))
U=input()
D=dict()
D[S]=A
D[T]=B
D[U]-=1
print(*list(D.values())) |
p03059 | s991103462 | Wrong Answer | a,b,t=map(int,input().split());print((t+0.5)//a*b) |
p03150 | s671139336 | Accepted | s = input()
S = len(s)
for i in range(S-1):
for j in range(i,S):
if s[:i]+s[j:] == "keyence":
print("YES")
exit()
print("NO") |
p03162 | s238404000 | Accepted | x = int(input())
li = []
for i in range(x):
l = list(map(int, input().split()))
li.append(l)
dp = [[0]*3 for _ in range(x+1)]
for i in range(x):
for j in range(3):
for k in range(3):
if j != k:
dp[i+1][j] = max(dp[i][k]+li[i][j], dp[i+1][j])
print(max(max(dp[x][0], dp[x][1]), max(dp[x][1], dp[x][2]))) |
p02909 | s565500729 | Wrong Answer | S = input()
lis = ["Sunny","Cloudy","Rainy","Sunny"]
ans = lis[lis.index(S)]
print(ans)
|
p03338 | s765965644 | Accepted | n = int(input())
s = input()
m = 0
for i in range(1, n):
t = set(s[:i])
u = set(s[i:])
m = max(len(t & u), m)
print(m) |
p03659 | s903877013 | Accepted | from itertools import accumulate
N = int(input())
A = list(map(int, input().split()))
B = list(accumulate(A))
S = B[-1]
ans = float('inf')
for i in range(N-1):
x = B[i]
y = S - x
ans = min(ans, abs(x - y))
print(ans) |
p03774 | s951100644 | Accepted | #ABC057-B
n,m = map(int,input().split())
students = [list(map(int,input().split())) for _ in range(n)]
points = [list(map(int,input().split())) for _ in range(m)]
def manhattan(s,points):
lst = []
for i in points:
lst.append(abs(s[0] - i[0]) + abs(s[1] - i[1]))
return lst.index(min(lst))+1
for i in students:
print(manhattan(i,points)) |
p02982 | s708404692 | Wrong Answer | n, d = map(int, input().split())
L = [list(map(int, input().split())) for i in range(n)]
for i in range(n-1):
for j in range(i+1, n):
ans = 0
int_ = 0
for k in range(d):
int_ += (L[i][k]-L[j][k])**2
if int(int_**0.5):
ans += 1
print(ans) |
p02701 | s100194898 | Wrong Answer | N=int(input())
A=set(input().split())
print(len(A))
|
p02791 | s503028405 | Wrong Answer | N = int(input())
P = [int(x) for x in input().split()]
ans = 1
for i in range(N-1):
if P[i] > P[i+1]:
ans += 1
print(ans)
|
p02621 | s534147775 | Accepted | n = int(input())
print(n+(n**2)+(n**2)*n) |
p03282 | s564483352 | Accepted |
import collections
def solve():
S = list(input())
K = int(input())
for i in range(K):
if S[i] != "1":
print(S[i])
break
else:
print(1)
if __name__ == "__main__":
solve()
|
p02612 | s133209141 | Accepted | n = int(input())
print((1000-n%1000) % 1000) |
p02747 | s823694132 | Accepted |
class gv:
input = None;
def build():
gv.str = input()
def solve():
slen = len(gv.str)
if (slen&1) == 1:
print("No")
return
for i in range(0,slen,2):
if (gv.str[i:i+2] == "hi") :
pass
else :
print("No")
return
print("Yes")
if __name__ == '__main__':
build()
solve()
|
p03380 | s128986264 | Wrong Answer | import bisect
n = int(input())
a = list(map(int, input().split()))
a.sort()
M = max(a)
m = M // 2
left = bisect.bisect_left(a, m)
right = bisect.bisect_right(a, m)
if abs(m - a[left]) < abs(m - a[right]):
print(M, a[left])
else:
print(M, a[right])
|
p02725 | s178380453 | Accepted | k,n=map(int,input().split())
a=list(map(int,input().split()))
tmp=a[0]+(k-a[n-1])
for i in range(n-1):
cnt=a[i+1]-a[i]
tmp=max(cnt,tmp)
print(k-tmp)
|
p03705 | s192300180 | Wrong Answer | #AGC015-A
n,a,b = map(int,input().split())
mi = a * (n-2)
ma = b * (n-2)
result = ma - mi + 1
if a > b:
print(0)
elif a == b and n != 1:
print(0)
else:
print(result) |
p03146 | s432430090 | Accepted | s = int(input())
ans = []
for i in range(2, 1000002):
ans.append(s)
if s % 2 == 0:
s /= 2
else:
s = 3 * s + 1
if s in ans:
print(i)
break |
p03284 | s141357416 | Accepted | def ABC_105_A():
N,K = map(int, input().split())
if N%K == 0:
print(0)
else:
print(1)
if __name__ == '__main__':
ABC_105_A() |
p02775 | s689546121 | Accepted | s = input().rstrip()
s = s[::-1]
n = len(s)
dp = [[0]*2 for _ in range(n+1)]
for i in range(1,n+1):
if i == 1:
dp[1][0] = int(s[0])
dp[1][1] = 10-int(s[0])
else:
dp[i][0] = min(dp[i-1][0]+int(s[i-1]),dp[i-1][1]+int(s[i-1])+1)
dp[i][1] = min(dp[i-1][0]+10-int(s[i-1]),dp[i-1][1]+9-int(s[i-1]))
print(min(dp[n][0],dp[n][1]+1)) |
p03479 | s223978702 | Wrong Answer | from math import log
X, Y = map(int, input().split(' '))
print(int(log(Y, 2) - log(X, 2)) + 1)
|
p02659 | s837484213 | Accepted | import math
a,b = input().split()
B = int(str(b).replace(".",""))
A = int(a)
print(A*B//100)
|
p02843 | s832532611 | Accepted | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
X = int(input())
n = X//100
if X <= 105 * n:
print(1)
else:
print(0)
|
p02631 | s362745048 | Accepted | N = int(input())
a = list(map(int, input().split()))
s = 0
for i in range(N):
s ^= a[i]
ans = []
for i in range(N):
ans.append(a[i] ^ s)
print(*ans) |
p03328 | s005186242 | Wrong Answer | a,b = map(int,input().split())
sum = 1
for i in range(2,999):
if a > sum:
sum += i
else:
break
print(sum-a) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.