problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03146 | s917813915 | Accepted | s = int(input())
l = [s]
temp = s
for i in range(2, 10**7):
if temp % 2 == 0:
temp //= 2
else:
temp = 3 * temp + 1
if temp in l:
print(i)
exit()
else:
l.append(temp)
|
p02622 | s301102409 | Wrong Answer | S= input()
T= input()
count = 0
i = 0
while i < len(S):
print("len" + str(len(S)))
print("S[i]:" + S[i])
if S[i] != T[i]:
count+=1
i+=1
print(count)
|
p03730 | s152054136 | Accepted | a, b, c = map(int, input().split())
temp = 0
for i in range(20000):
temp = (temp + a) % b
if temp == c:
print('YES')
exit()
print('NO') |
p03345 | s330910386 | Accepted | a,b,c,k = map(int,input().split())
if k%2 == 0:
print(a-b)
else:
print(b-a) |
p02900 | s900177570 | Accepted | def prime_factor(n):
ass = []
for i in range(2,int(n**0.5)+1):
while n % i==0:
ass.append(i)
n = n//i
if n != 1:
ass.append(n)
return ass
A,B = map(int,input().split())
A_s = set(prime_factor(A))
B_s = set(prime_factor(B))
from fractions import gcd
print(len(A_s&B_s)+1)
|
p02657 | s128847002 | Wrong Answer | A,B = input().split()
a = int(A)
b = B.replace(".","")
import math
print(math.floor(a*int(b)//100)) |
p02918 | s560824318 | Accepted | N, K = map(int, input().split())
S = list(input())
l = []
bef = ""
start = 0
ans = 0
for i, s in enumerate(S):
if bef=="":
start = i
elif bef!=s:
cnt = 0
l.append(i-start)
start = i
bef = s
l.append(i-start+1)
size = len(l)
ans = 0
for i in range(min(2*K+1, size)):
ans += l[i]
ans -= 1
for i in range(min(2*K+1, size), size):
ans += l[i]-1
print(ans) |
p02759 | s706630089 | Accepted | N = int(input())
print(N // 2 + N % 2)
|
p03555 | s952864039 | Accepted | # -*- coding: utf-8 -*-
print(['NO', 'YES'][input() == input()[::-1]]) |
p02873 | s744016171 | Accepted | from itertools import*
a = b = 0
for k, n in groupby(input()):
n = len(list(n))
a -= n*~n//2 + min(n, b)*(k==">")
b = n
print(a) |
p03416 | s095786145 | Accepted | A, B = map(int, input().split())
ans = 0
for i in range(100,999+1):
Pal = str(i)
Pal += Pal[1]+Pal[0]
Palans = int(Pal)
if A<=Palans<=B:
ans+=1
print(ans) |
p03627 | s117069817 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
cnt=Counter(a)
lis = sorted(list(set(a)),reverse=True)
ans1,ans2 = 0,0
for val in lis:
if ans1==0:
if cnt[val]>=2:
cnt[val]-=2
ans1=val
if cnt[val]>=2:
ans2=val
break
else:
if cnt[val]>=2:
ans2=val
break
print(ans1*ans2) |
p03478 | s709806729 | Accepted | N,A,B = map(int,input().split())
def sum_of_num(num):
list_a = []
sums = 0
while num > 0:
list_a.append(num % 10)
num = num // 10
for i in range(len(list_a)):
sums = sums + list_a[i]
return sums
list_b = []
for i in range(1,N+1):
if A <= sum_of_num(i) <=B:
list_b.append(i)
sums = 0
for i in range(len(list_b)):
sums = sums + list_b[i]
print(str(sums)) |
p03250 | s373348817 | Accepted | a,b,c = map(int,input().split())
print(max(a * 10 + b + c,a + b * 10 + c,a + b + c * 10)) |
p03380 | s274042023 | Accepted | def main3():
input()
t = sorted(list(map(int, input().split())))
ma = t.pop(-1)
r = min(t, key=lambda x: abs(x - ma / 2))
print(ma, r)
if __name__ == '__main__':
main3() |
p03854 | s180578389 | Accepted | s = input()
s = s.replace('eraser', '')
s = s.replace('erase', '')
s = s.replace('dreamer', '')
s = s.replace('dream', '')
if len(s) == 0:
print('YES')
else:
print('NO')
|
p03359 | s796031054 | Accepted | a, b = map(int, input().split())
if b >= a:
print(a)
else:
print(a-1) |
p02847 | s627490341 | Accepted | w=["SUN","MON","TUE","WED","THU","FRI","SAT"]
print(7-w.index(input())) |
p03472 | s500267196 | Accepted | N,H = map(int,input().split())
ab = [list(map(int,input().split())) for i in range(N)]
maxa = max(ab[i][0] for i in range(N))
lastb = [ab[i][1] for i in range(N) if ab[i][1] >= maxa]
lastb.sort(reverse=True)
count = 0
while H > 0 and count < len(lastb):
H -= lastb[count]
count += 1
if H <= 0:
print(count)
else:
count += (H-1)//maxa+1
print(count) |
p02622 | s086965262 | Accepted | import math # noqa: F401
from typing import Dict, List, Optional, Tuple, Union # noqa: F401
def main(S: str, T: str):
ans = 0
for s, t in zip(list(S), list(T)):
if s != t:
ans += 1
print(ans)
if __name__ == "__main__":
S = input()
T = input()
main(S, T)
|
p03986 | s511347226 | Accepted | l = 0
ans = 0
for c in input():
if c == 'S':
l += 1
else:
if l == 0:
ans += 1
else:
l -= 1
print(ans + l)
|
p03012 | s321747799 | Accepted | n=int(input())
W=list(map(int,input().split()))
l=0
r=sum(W)
res=100000000000
for w in W:
l+=w
r-=w
res=min(res,abs(r-l))
print(res) |
p03106 | s980641909 | Wrong Answer | a, b, k = map(int, input().split(' '))
n = min(a, b)
cnt = 0
for i in range(1, n + 1):
if (a % i == 0) and (b % i == 0):
cnt += 1
if cnt == k:
result = i
break
print(result) |
p02761 | s248363839 | Accepted | n,m=map(int,input().split())
if n==1 and m==0:
print(0)
exit()
c=[list(map(int,input().split())) for i in range(m)]
if [1,0] in c and n>1:
print(-1)
exit()
num=[1]+[0]*(n-1)
try:
for i in c:
num[i[0]-1]=i[1]
except:
print(-1)
exit()
for i in c:
if num[i[0]-1]!=i[1]:
print(-1)
exit()
print(int("".join(map(str,num)))) |
p03705 | s350006445 | Accepted | N,A,B=map(int,input().split())
if A>B :
print(0)
elif N==1 and A!=B:
print(0)
elif N==1 and A==B:
print(1)
else:
number=B-A+1
N=N-2
answer=N*(B-A)+1
print(answer)
|
p03699 | s999989111 | Accepted | from collections import defaultdict
from collections import deque
import itertools
import copy
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 = [readInt() for i in range(n)]
s.sort()
ans = sum(s)
boo = 0
if ans%10==0:
for i in s:
if i%10!=0:
ans-=i
boo = 1
break
if boo==0:
ans = 0
print(ans) |
p03627 | s820090321 | Accepted | from collections import Counter
n = int(input())
l = list(map(int,input().split()))
a = Counter(l)
b = a.most_common()
c = []
for i,j in b:
if j>=4:
c.append(i)
c.append(i)
elif j>=2:c.append(i)
c.sort()
print(c[-1]*c[-2] if len(c)>=2 else 0) |
p03261 | s866326357 | Accepted | n = int(input())
W = [input() for i in range(n)]
flg = 1
Word = [W[0]]
for i in range(1,n):
s = W[i-1]
t = W[i]
if(s[-1] != t[0] or t in Word):
flg = 0
break
Word.append(t)
if (flg): print("Yes")
else: print("No")
|
p02665 | s299821615 | Accepted | n=int(input())
a=[int(j)for j in input().split()]
ans=0
s=sum(a)
p=1
b=True
for i,j in enumerate(a):
if p<j:
print(-1)
exit()
ans+=p
p-=j
s-=j
if i==n:
continue
if p<s and b:
if p*2<s:
p*=2
else:
p=s
if p==s:
b=False
print(ans) |
p02570 | s355891393 | Wrong Answer | D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split()]
if (D and T) and S <=10000 and D/S==T:
print("Yes")
else:
print("No") |
p02623 | s416053839 | Accepted | N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])
ans, j = 0, M
for i in range(N + 1):
if a[i] > K:
break
while b[j] > K - a[i]:
j -= 1
ans = max(ans, i + j)
print(ans) |
p02684 | s212705847 | Wrong Answer | N,K = map(int, input().split())
A = list(map(int, input().split()))
B = [1]
for i in range(N):
s = B[i]
if A[s-1] != 1:
B.append(A[s-1])
else:
break
l = len(B)
print(B[(K%l)]) |
p04044 | s236605653 | Accepted | first= input()
first = first.split()
N = int(first[0])
L =[]
for i in range(N):
s = input()
L.append(s)
L.sort()
for i in L:
print(i,end="")
|
p02701 | s497615222 | Accepted | N = int(input())
S = set()
for _ in range(N):
S.add(input())
print(len(S))
|
p02873 | s184241298 | Wrong Answer | S = input()
s = S.count('>')
ans = s*(s+1)/2
print(int(ans)) |
p03814 | s837090429 | Accepted | s=input()
n=len(s)
x=0
y=n-1
for i in range(n):
if s[i]=='A':
x=i
break
for i in range(n-1,0,-1):
if s[i]=='Z':
y=i
break
print(y-x+1) |
p03059 | s149811695 | Accepted | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
a,b,c=INTM()
print(c//a*b)
if __name__ == '__main__':
do() |
p03329 | s985700296 | Accepted | def cal(n,x):
res=0
while n>0:
res+=n%x
n//=x
return res
N=int(input())
ans=N
for i in range(N+1):
ans=min(ans,cal(i,6)+cal(N-i,9))
print(ans) |
p03012 | s922073163 | Accepted | N = int(input())
W = list(map(int, input().split()))
m = float('inf')
for i in range(N):
m = min(m, abs(sum(W[:i]) - sum(W[i:])))
print(m)
|
p02910 | s745916815 | Wrong Answer | S = input()
l = list(S)
#odd loop
for i in range(0,len(S),2):
if l[i] == 'L':
print('NO')
exit()
#even loop
for j in range(1, len(S), 2):
if l[j] == 'R':
print('NO')
exit()
print('YES') |
p02556 | s401169629 | Accepted | n = int(input())
a,b = [],[]
for i in range(n):
x,y = map(int,input().split())
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0],b[-1]-b[0])
print(ans) |
p02621 | s388670477 | Wrong Answer | n = int(input())
ans = 0
for i in range(1,n+1):
ans += ((i+i*(n//i))*(n//i))//2
#print(ans)
print(ans) |
p02629 | s277496758 | Accepted |
n = int(input())
def num2alpha(num):
if num <= 26:
return chr(64+num)
elif num % 26 == 0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num % 26)
print(num2alpha(n).lower()) |
p02786 | s092896556 | Wrong Answer | import sys
def s(d, i=1, a=1):
a += i*2
if d <= 1:
return a
return s(d-1,i=i*2, a=a)
H = int(input())
count = 0
while True:
count += 1
H = H // 2
if H <= 1:
break
print(s(count))
|
p03544 | s772540177 | Wrong Answer | n = int(input())
L = [2,1]
for i in range(2,n):
k = L[i-2]+L[i-1]
L.append(k)
print(L[len(L)-1]) |
p03319 | s849291760 | Wrong Answer | def resolve():
'''
code here
'''
N, K = [int(item) for item in input().split()]
As = [int(item) for item in input().split()]
if K > 2:
print(N//(K-1))
else:
print(N-1)
if __name__ == "__main__":
resolve()
|
p03548 | s470644360 | Wrong Answer | X,Y,Z=map(int,input().split())
print((X-Z)//Y+Z) |
p02811 | s762922172 | Accepted | K, X = map(int, input().split())
Z = int(500 * K)
if Z >= X :
print("Yes")
else:
print("No") |
p03274 | s270684163 | Accepted | n,k=map(int,input().split())
x=list(map(int,input().split()))
print(min(x[i]-x[i-k+1]+min(abs(x[i]),abs(x[i-k+1])) for i in range(k-1,n)))
|
p02596 | s282232436 | Accepted | # C Repsept
k = int(input())
mod = 0
cnt = 0
for i in range(k):
mod = (mod*10+7) % k
cnt += 1
if mod == 0:
print(cnt)
exit()
print(-1) |
p03416 | s587087951 | Accepted | def count(n):
N = []
while n > 0:
N.append(n % 10)
n = n // 10
if N[0] == N[4] and N[1] == N[3]:
return 1
else:
return 0
A, B= map(int,input().split())
ans = 0
for i in range(A, B + 1):
if count(i) == 1:
ans += 1
print(int(ans)) |
p02712 | s560974728 | Wrong Answer | a=int(input())
fizzbuzz = 0
for i in range(1,a+1):
if (i%3) == 0:
fizzbuzz += i
elif (i%5) == 0:
fizzbuzz += i
all_ = (1+a)*a/2
print(all_-fizzbuzz) |
p03407 | s908950091 | Wrong Answer | A, B, C = map(int, input().split())
print('Yes' if A+2*B >= C else 'No')
|
p02923 | s154974583 | Accepted | n = int(input())
h = list(map(int,input().split()))
if n<2:
print(0)
else:
mvmn = 0
maxmvm = 0
for i in range(1,n):
if h[i]>h[i-1]:
mvmn = 0
else:
mvmn += 1
maxmvm = max(maxmvm,mvmn)
print(maxmvm) |
p03785 | s467296769 | Accepted | n,c,k=map(int,input().split())
t=[int(input()) for _ in range(n)]
t.sort()
ans=0
num=0
for i in range(n+3):
if num>=n:
break
num2=t[num]+k
ans+=1
for j in range(c-1):
num+=1
if num==n:
break
if t[num]>num2:
num-=1
break
num+=1
print(ans)
|
p02911 | s800533720 | Accepted | n,k,q = map(int,input().split())
cnt = [0]*n
A = []
for i in range(q):
a = int(input())-1
cnt[a]+=1
s =sum(cnt)
for c in cnt:
if s-c>=k:print("No")
else:print("Yes")
|
p02700 | s657128531 | Wrong Answer | A,B,C,D=map(int,input().split())
while A>0 and C>0:
A=A-D
C=C-B
if A>C:
print("Yes")
else:
print("No") |
p02754 | s653543114 | Wrong Answer | n, a, b = map(int, input().split())
c = a + b
q = n // c
mod = n % c
if a == 0:
print(0)
else:
print(q*a+mod) |
p03386 | s619287556 | Accepted | a,b,k = map(int,input().split())
ans_list = []
for i in range(a,a+k):
ans_list.append(i)
if ans_list[-1] == b:
[print(i) for i in ans_list]
exit()
for i in range(b-k+1,b+1):
if ans_list.count(i) == 0:
ans_list.append(i)
[print(i) for i in ans_list] |
p03785 | s410510475 | Wrong Answer | n,c,k = map(int,input().split())
t = [int(input()) for _ in range(n)]
t = sorted(t)
ans = 0
g = [0]*(n+1)
now = 0
for i in range(n-1):
if t[i]+k >= t[i+1]:
if g[now]>=3:
now += 1
g[now] += 1
continue
g[now] += 1
else:
g[now] += 1
now += 1
g[now] += 1
for i in g:
ans += -(-i//c)
print(ans) |
p02600 | s651865673 | Wrong Answer | number = int(input())
if number in range(400, 599):
print('8')
elif number in range(600, 799):
print('7')
elif number in range(800, 999):
print('6')
elif number in range(1000, 1199):
print('5')
elif number in range(1200, 1399):
print('4')
elif number in range(1400, 1599):
print('3')
elif number in range(1600, 1799):
print('2')
elif number in range(1800, 1999):
print('1') |
p03721 | s627915988 | Accepted | n,k = map(int,input().split())
di = [0]*(10**5)
for i in range(n):
a,b = map(int,input().split())
di[a-1] += b
q = 0
p = 0
while True:
q += di[p]
if k <= q:
print(p +1)
break
p += 1 |
p02633 | s170855669 | Accepted | # coding:utf-8
x = int(input())
r = 0
for k in range(360):
r += x
if r % 360 == 0:
break
print(k + 1)
|
p03719 | s783984383 | Accepted | a,b,c=[int(i) for i in input().split()]
if b>=c>=a:
print('Yes')
else:
print('No') |
p02718 | s447755950 | Wrong Answer | N, M = map(int, input().split())
A = list(map(int, input().split()))
t = 0
S = 0
for Ai in A:
S=S+Ai
for Ai in A:
if Ai >= S/(4*M):
t = t+1
if t >= M:
print('yes')
else:
print('no')
|
p02835 | s118793158 | Wrong Answer | S = list(input())
c = 0
for i in range(int(len(S)/2)):
if S[i] != S[-(i+1)]:
c += 1
print(c) |
p02765 | s076979519 | Accepted | N, R = map(int, input().split())
ans = 100*(10-N)+R
if N>=10:
print(R)
else:
print(ans) |
p03379 | s525874276 | Accepted | def main():
n, *x = map(int, open(0).read().split())
y = sorted(x)
a, b = y[n // 2 - 1], y[n // 2]
ans = ""
for i in x:
if i <= a:
ans += str(b) + "\n"
else:
ans += str(a) + "\n"
print(ans)
if __name__ == '__main__':
main()
|
p03693 | s146205676 | Accepted | n = "".join(list(input().split()))
n = int(n)
if n % 4 == 0:
print('YES')
else:
print('NO') |
p02785 | s477818245 | Accepted | #abc153c
n,k=map(int,raw_input().split())
h=map(int,raw_input().split())
h.sort(reverse=True)
if n<=k:
print 0
else:
print sum(h[k::])
|
p02888 | s594601804 | Accepted | n=int(input())
L=list(map(int,input().split()))
L.sort()
count=0
for i in range(n-2):
for j in range(i+1,n-1):
x=j+1
y=n-1
while y!=x+1 and y!=x:
if L[i]+L[j]>L[(x+y)//2]:
x=(x+y)//2
else:
y=(x+y)//2
p=y if L[i]+L[j]>L[y] else x
if L[i]+L[j]<=L[p]:
count+=0
else:
count+=p-j
print(count) |
p03407 | s106258984 | Accepted | a, b, c = map(int,input().split())
if a+b < c:
print("No")
else:
print("Yes") |
p02717 | s492738302 | Wrong Answer | X, Y, Z = map(int, input().split())
"""
temp = Y
Y = X
X = temp
temp = Z
Z = X
X = temp
"""
print(Z, Y, X) |
p02712 | s939325277 | Accepted | N = int(input())
ans = 0
for i in range(1, N + 1):
if i % 3 != 0 and i % 5 != 0:
ans += i
print(ans)
|
p02783 | s015672400 | Accepted | print(-eval(input().replace(' ','//-'))) |
p03041 | s595248911 | Wrong Answer | N, K = map(int, input().split())
s = input()
list = list(s)
list[K-1] == list[K-1].lower
print("".join(list)) |
p03632 | s065556446 | Accepted | A,B,C,D=map(int,input().split())
Ans = [0] * 101
for i in range(100+1):
if A<=i and i<B:
Ans[i]+=1
if C<=i and i<D:
Ans[i]+=1
print(Ans.count(2))
|
p03041 | s615208708 | Wrong Answer | num,loc = map(int,input().split())
dummy = ["" for i in range(num)]
moj = input()
count = 0
for j in moj:
dummy[count] = j
count = count + 1
S = dummy[loc-1]
W = S.swapcase()
dummy[loc-1] = W
print(dummy) |
p03150 | s942804163 | Accepted |
KEY = "keyence"
def main():
s = input()
if s.startswith(KEY) or s.endswith(KEY):
print("YES")
return
for i in range(1, len(KEY)):
st = KEY[0:i]
ed = KEY[i:]
if s.startswith(st) and s.endswith(ed):
print("YES")
return
print("NO")
main()
|
p02833 | s121135492 | Accepted | n=int(input())
if n%2:
print(0)
else:
c=0
n//=2
while n:
n//=5
c+=n
print(c) |
p02678 | s487597636 | Accepted | N, M = map(int, input().split())
E = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
E[A-1].append(B-1)
E[B-1].append(A-1)
ans = [None]*N
ans[0]=-1
queue=[0]
while queue:
queue_new = []
for q in queue:
for e in E[q]:
if ans[e] is not None: continue
ans[e]=q
queue_new.append(e)
queue = queue_new
print("Yes")
for a in ans[1:]:
print(a+1) |
p02971 | s089487769 | Wrong Answer | n = int(input())
a = []
for i in range(n):
a.append(int(input()))
max1 = max(a)
max2 = sorted(a)[-2]
if a.count(max1) == 2:
for i in range(n):
print(max1)
elif a.count(max1) < 2:
for i in range(n):
if a[i] == max1:
print(max2)
else:
print(max1) |
p03338 | s411567142 | Wrong Answer | N = int(input())
S = input()
diff = -1
ans = 0
for i in range(N):
x = len(set(list(S[0:i])))
y = len(set(list(S[i:len(S)])))
if diff < x - y:
diff = x - y
ans = min(x, y)
print(ans) |
p02729 | s910991923 | Accepted | import sys
input = sys.stdin.readline
def get_ans(n):
if n <= 1:
return 0
return get_ans(n - 1) + n - 1
def main():
n, m = map(int, input().split())
print(get_ans(n) + get_ans(m))
if __name__ == '__main__':
main()
|
p02642 | s702763130 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort()
a_max=max(a)
check = [0]*(a_max+1)
for i in a:
if check[i] != 0:
check[i] = 2
continue
if check[i] == 0:
check[i] = 1
for j in range(1,a_max//i):
check[(j+1)*i] = 2
print(check.count(1)) |
p03319 | s929816645 | Accepted | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
print(math.ceil((n-1)/(k-1))) |
p03351 | s038071026 | Wrong Answer | a, b, c, d=map(int,input().split())
k1=abs(a-b)
k2=abs(a-c)
k3=abs(b-c)
if k2<=d:
print("Yes")
elif k1<=d or k3<=d:
print("Yes")
else:
print("No") |
p02714 | s708430790 | Accepted | n = int(input())
s = input()
r = len([i for i in range(n) if s[i] == 'R'])
g = len([i for i in range(n) if s[i] == 'G'])
b = len([i for i in range(n) if s[i] == 'B'])
ans = r * g * b
sub = 0
for j in range(n):
for i in range(j):
if s[i] == s[j]:
continue
k = 2 * j - i
if k >= n or ((s[i] == s[k]) or (s[j] == s[k])):
continue
sub += 1
print(ans - sub) |
p02688 | s742321847 | Accepted | N,K=map(int,input().split(' '))
h = []
for i in range(K):
d = int(input())
l = list(map(int,input().split(' ')))
for j in l:
h.append(j)
print(N-len(list(set(h)))) |
p04020 | s491641832 | Wrong Answer | n = int(input())
A = [0]*(n+1)
ans = 0
for i in range(n):
a = int(input())
ans += a//2
A[i] = a%2
for i in range(n):
if A[i]==1 and A[i+1]==1:
ans += 1
A[i+1] -= 1
print(ans) |
p03494 | s961421594 | Accepted | def func():
n = int(input())
a = [str(bin(int(x))) for x in input().split()]
cnt = float('inf')
for i in range(n):
cnt = min(cnt, len(a[i]) - 1 - a[i].rfind('1'))
print(cnt)
if __name__ == "__main__":
func() |
p03994 | s055159856 | Wrong Answer | s,k,t=input(),int(input()),""
for q in s:
if(p:=(122-ord(q))%26)<k:t+="a";k-=p
else:t+=q
print(t[:-1]+chr((ord(t[-1])-97+k)%26+97)) |
p02547 | s819329894 | Accepted | N = int(input())
x = [0] * N
y = [0] * N
for i in range(N):
x[i], y[i] = map(int, input().split())
n = 0
for i in range(N):
if x[i] == y[i]:
n = n+1
elif n >=3:
break
elif x[i] != y[i]:
n = 0
if n >= 3:
print("Yes")
else:
print("No") |
p04045 | s616491973 | Wrong Answer | N, K = list(map(int, input().split()))
D = set(input().split())
num = {str(i) for i in range(10)} - D
while True:
print(set(str(N)))
if set(str(N)) == num:
ans = N
break
else:
N += 1
print(ans) |
p03860 | s622616124 | Accepted | a,b,c = map(str,input().split())
print("A"+b[0]+"C") |
p02624 | s939060500 | Wrong Answer | # 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
N = I()
num = 0
for i in range(1, N+1):
y = math.floor(N/i)
num += y*(y+1)*i/2
print(num)
if __name__ == '__main__':
main()
|
p02838 | s591769640 | Accepted | MOD=10**9+7
N=int(input())
alist=list(map(int,input().split()))
#print(alist)
blist=[0]*60
for a in alist:
bblist=[]
while a:
bblist.append(a%2)
a//=2
#print(bblist)
for i in range(len(bblist)):
blist[i]+=bblist[i]
#print(blist)
answer=0
pow2=1
for i in range(60):
answer+=blist[i]*(N-blist[i])*pow2
answer%=MOD
pow2=2*pow2%MOD
print(answer) |
p02707 | s491734709 | Accepted | n = int(input())
A = list(map(int,input().split()))
sya = [0]*n
for a in A:
sya[a-1]+=1
for i in range(n):
print(sya[i])
|
p03639 | s828965934 | Accepted | N = int(input())
a = list(map(int,input().split()))
cnt_4 = 0
cnt_2 = 0
for v in a:
if v % 4 == 0:
cnt_4 += 1
elif v % 2 == 0:
cnt_2 += 1
if cnt_2 <= 1:
if N//2 <= cnt_4:
print('Yes')
else:
print('No')
else:
if (N-(cnt_2-1))//2 <= cnt_4:
print('Yes')
else:
print('No') |
p02813 | s529756743 | Accepted | import itertools
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
if P == Q:
print(0)
exit()
L = list(range(1, N+1, 1))
p = itertools.permutations(L, N)
cn = 0
cn1 = 0
cn2 = 0
for i in p:
i = list(i)
cn = cn + 1
if i == P:
cn1 = cn
elif i == Q:
cn2 = cn
print(abs(cn1 - cn2)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.