problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03543 | s902338303 | Wrong Answer | import sys
from collections import defaultdict
def input(): return sys.stdin.readline().strip()
def main():
n = input()
d = defaultdict(int)
for c in n: d[int(c)] += 1
flag = False
for key in d:
if d[key] >= 3: flag = True
if flag:
print("Yes")
else:
print("No")
i... |
p04020 | s324553709 | 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] and A[i+1]:
ans += 1
A[i+1] -= 1
print(ans) |
p02795 | s855312554 | Accepted | H = int(input())
W = int(input())
N = int(input())
max = max(H, W)
if N % max == 0:
print(N // max)
else:
print(N // max + 1) |
p03469 | s598372559 | Wrong Answer | s = str(input())
s.replace('2017', '2018')
print(s) |
p03067 | s069326719 | Wrong Answer | a, b, c = map(int, input().split())
print('Yes' if a <= c <= b else 'No') |
p03206 | s206908461 | Wrong Answer | D=input()
D=int(D)
if D==25:
print("Christmas")
if D==24:
print("Christmas Eve")
if D==23:
print("Christmas Eve Eve")
if D==23:
print("Christmas Eve Eve Eve") |
p02629 | s892627173 | Wrong Answer | n = int(input())
if n==1:
print('a')
i = 0
buf = 0
while 26**i+buf<=n:
buf += 26**i
i += 1
ans = ''
for j in range(i):
ans += chr(ord('a')+(n//(26**j)-1)%26)
n -= 26**j
print(ans[::-1])
|
p03797 | s299091466 | Wrong Answer | n, m = map(int, input().split())
c = 2*n
m -= c;
m = (m//4)+n
print(m) |
p02707 | s870615930 | Wrong Answer | import sys
from collections import Counter
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
c = Counter(A)
k = set(A)
r = set(range(1, N + 1))
for key in r - k:
c[key] = 0
for v in c.values():
print(v)
|
p02988 | s561735085 | 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] and p[i] < p[i+1]: ans += 1
if p[i-1] > p[i] and p[i] > p[i+1]: ans += 1
print(ans) |
p03419 | s029738308 | Accepted | n, m = map(int,input().split())
print(abs((n-2)*(m-2))) |
p02647 | s958406512 | Accepted | def read_input(trans=int):
return list(map(trans, input().split()))
N, K = read_input()
A = read_input()
K = min(K, 41)
for _ in range(K):
B = [0]*N
for i in range(N):
start = max(i-A[i], 0)
end = min(i+A[i], N-1)
B[start] += 1
if end+1 < N:
B[end+1] -= 1
... |
p02553 | s673255024 | Accepted | a, b, c, d = map(int, input().split())
ans = max(a*c, a*d, b*c, b*d)
print(ans) |
p02702 | s304971604 | Accepted | import sys
from collections import deque
def input():
return sys.stdin.readline()[:-1]
S = deque(map(int, list(input())))
num = 0
dict = {}
dict[0] = 1
ans = 0
for i in range(len(S)):
num += S.pop() * pow(10,i,2019)
cand = num % 2019
if cand in dict.keys():
dict[cand] += 1
else:
di... |
p03035 | s462660253 | Wrong Answer | A, B = map(int, input().split())
ans = B
if 6 <= A <= 12:
ans = B / 2
elif A <= 5:
ans = 0
print(ans) |
p02759 | s853963465 | Accepted | N = int(input())
if N % 2 == 0:
print(N//2)
else:
print((N//2)+1) |
p03241 | s552693720 | Accepted | n, m = map(int, input(). split())
b = set()
i = 1
while i * i <= m:
if m % i == 0:
b.add(i)
b.add(m // i)
i += 1
ans = 1
for i in b:
if i * n <= m:
ans = max(ans, i)
print(ans)
|
p03854 | s963605918 | Accepted | a,b,c,d=[i[::-1] for i in ['dream','dreamer','erase','eraser']]
s,j=input()[::-1],True
while j:
j=False
for i in [a,b,c,d]:
if s.startswith(i): s=s[len(i):];j=True
print('YNEOS'[len(s)>0::2]) |
p03105 | s993791533 | Accepted | a,b,c = map(int, input().split())
x = b//a
print(x if x<c else c)
|
p02631 | s070556665 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = []
Ans = [1]
for a1, a2 in zip(A, A[1:]):
B.append(a1 ^ a2)
B.append(A[0] ^ A[-1])
for b in B:
Ans.append(Ans[-1] ^ b)
for a in Ans[:-2]:
print(a, end=' ')
print(Ans[-2]) |
p02584 | s713669853 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
if X // D > K:
ans = X - D * K
else:
if (K - X // D) % 2 == 0:
ans = X % D
else:
ans = abs(X % D - D)
print(ans) |
p03745 | s397985770 | Accepted | N = int(input())
a = list(map(int, input().split()))
# 最小の答えは1、ここに足していく
ans = 1
# 増加と減少切り替わったタイミングで組の数を増やす
flags = [False, False]
for i in range(N - 1):
da = a[i + 1] - a[i]
if da > 0:
flags[0] = True
elif da < 0:
flags[1] = True
if flags[0] == True and flags[1] == True:
ans ... |
p02843 | s458829649 | Accepted | x = int(input())
li = [0]*100105
li[0] = 1
for i in range(x):
if li[i] == 1:
for j in range(6):
li[i+j+100] = 1
print(li[x]) |
p02629 | s918980751 | Wrong Answer | N = int(input())
s = ''
for i in reversed(range(27)):
if 26 ** i > N:
continue
M = N // (26 ** i)
s += chr(M + 96)
N -= M * (26 ** i)
print(s) |
p02795 | s991510329 | Accepted | h=int(input())
w=int(input())
n=int(input())
p=max(h,w)
print(n//p+(n%p!=0)) |
p03131 | s090537475 | Accepted | import sys
input = sys.stdin.buffer.readline
def main():
K,A,B = map(int,input().split())
if A+2 >= B:
print(K+1)
else:
if K<=A:
print(K+1)
else:
rest = K-(A-1)
print(A+(B-A)*(rest//2)+rest%2)
if __name__ == "__main__":
main()
|
p02726 | s707280576 | Accepted | n, x, y = map(int,input().split())
list_length = [0 for i in range(n)]
length = 0
for i in range(1, n+1):
for j in range(i+1, n+1):
length = min(j-i, abs(x-i)+1+abs(y-j), abs(y-i)+1+abs(x-j))
list_length[length] += 1
for i in range(1, len(list_length)):
print(list_length[i])
|
p03774 | s283033530 | Wrong Answer | n,m = map(int,input().split())
s,c = [],[]
for i in range(n):
a = list(map(int,input().split()))
s.append(a)
for i in range(m):
a = list(map(int,input().split()))
c.append(a)
for i in range(n):
tmp = 10**8
ans = 0
for j in range(m):
b = (abs(s[i][0]-c[j][0])+abs(s[i][1]-c[j][1]))
... |
p03037 | s005166147 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[7]:
N,M = map(int, input().split())
lr = []
l_max = 1
r_min = N
for _ in range(M):
lr.append(list(map(int, input().split())))
l_max = max(l_max, lr[-1][0])
r_min = min(r_min, lr[-1][1])
print(max(0, r_min - l_max +1))
# In[ ]:
|
p02897 | s587125685 | Accepted | n = int(input())
if n % 2 == 0:
print(0.5)
else:
print((n+1)/2/n) |
p03282 | s381214163 | Wrong Answer | S = list(input())
K = int(input())
if S.count('1') == len(S):
print(1)
for s in S:
if s != '1':
print(s)
exit(0)
|
p03261 | s638356977 | Wrong Answer | n = int(input())
w = [input() for _ in range(n)]
result = 'Yes'
for i in range(1,n-1):
en = len(w[i-1]) - 1
if w[i][0] != w[i-1][en]:
result = 'No'
nw = set(w)
if len(nw) != n:
result = 'No'
print(result)
|
p03062 | s981107890 | Accepted | N = int(input())
*A, = map(int, input().split())
dp1 = [A[0]]
dp2 = [-A[0]]
for i in range(1, N-1):
dp1.append(max(dp1[i-1] + A[i], dp2[i-1] - A[i]))
dp2.append(max(dp1[i-1] - A[i], dp2[i-1] + A[i]))
dp1.append(dp1[-1] + A[N-1])
dp2.append(dp2[-1] - A[N-1])
print(max(dp1[-1], dp2[-1])) |
p04043 | s238759596 | Wrong Answer | line = input()
if line == '5 5 7' or line == '7 5 5':
print('Yes')
else:
print('NO') |
p03695 | s819728692 | Wrong Answer | from collections import Counter
input()
rates = Counter(map(lambda a: int(a) // 400, input().split()))
over3199 = rates[8]
colors = len(rates) - bool(over3199)
print(max(1, colors), colors + over3199)
|
p04011 | s284545758 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
print(k * x + (n - k) * y if n > k else n * x) |
p03243 | s249075722 | Wrong Answer | n = sorted(list(str(input())),reverse=True)
print(int(''.join([n[0],n[0],n[0]])))
|
p03495 | s292478271 | Accepted | N,K=map(int, input().split())
A=list(map(int, input().split()))
from collections import Counter
AL=Counter(A)
AL= sorted(AL.items(), key=lambda x:x[1])
n=len(set(A))-K
sum=0
for i in range(n):
sum+=AL[i][1]
print(sum) |
p02859 | s064574563 | Wrong Answer | r = int(input('> '))
r = r*r
print(r) |
p03162 | s022375328 | Accepted | import sys
input=sys.stdin.readline
n=int(input())
a=[None]*n
b=[None]*n
c=[None]*n
for i in range(n):
a[i],b[i],c[i]=map(int,input().split())
dpa=[a[0]]+[None]*(n-1)
dpb=[b[0]]+[None]*(n-1)
dpc=[c[0]]+[None]*(n-1)
for i in range(1,n):
dpa[i]=a[i]+max(dpb[i-1],dpc[i-1])
dpb[i]=b[i]+max(dpa[i-1],dpc[i-1])... |
p03281 | s629384418 | Accepted | input = int(input())
count = 0
for i in range(1, input + 1, 2):
num = 0
for j in range(2, i):
if i % j == 0:
num += 1
if num == 6:
count += 1
print(count) |
p03827 | s345411338 | Accepted | n = int(input())
s = input()
ans = 0
x = 0
for i in s:
if i=="I":
x +=1
else:
x -=1
ans = max(ans,x)
print(ans) |
p02911 | s062930092 | Accepted | n, k, q = map(int,input().split())
a = []
for i in range(q):
a.append(int(input()))
p = [k for i in range(n)]
for i in range(q):
p[a[i]-1] += 1
for i in range(n):
if p[i] -q <= 0:
print('No')
else:
print('Yes') |
p03419 | s127524506 | Wrong Answer | n, m = map(int, input().split())
if n == 1 and m == 1: ans = 1
elif n == 1 and m != 1: ans = m-2
else: ans = (n-2) * (m-2)
print(ans) |
p03860 | s604845022 | Wrong Answer | #ABC048.A
s = input('')
print('AtCoder'+s[0]+'Contest') |
p03281 | s603088201 | Wrong Answer | N=int(input())
count=0
ans =0
for j in range(N+1):
count =0
for i in range(1,N+1):
if j %2 ==0:
continue
if j % i ==0:
count +=1
else:
continue
if count == 8 and i ==N:
ans += 1
print(ans) |
p02802 | s423596904 | Accepted | n,m = map(int,input().split())
a = [0]*n
AC,WA=0,0
for i in range(m):
x,y = input().split()
x = int(x)
if a[x-1]!=-1 and y=="WA":
a[x-1]+=1
if a[x-1]!=-1 and y=="AC":
WA+=a[x-1]
AC+=1
a[x-1]=-1
print(AC,WA) |
p03645 | s801991163 | Wrong Answer | N, M = map(int, input().split())
ab = []
for i in range(M):
a, b = map(int, input().split())
if a == 1 or b == N:
ab.append([int(a), int(b)])
flag = False
for i in range(len(ab)):
for k in range(len(ab)-i):
if len(set(ab[i])&set(ab[k]))==1:
print('POSSIBLE')
flag = T... |
p02836 | s490926788 | Wrong Answer | s=input()
n=len(s)
ans=0
for i,j in zip(s[:n//2-1],s[n:n//2-1:-1]):
if i!=j:
ans+=1
print(ans) |
p03012 | s047536293 | Wrong Answer | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(i... |
p03612 | s223797076 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(N - 1):
if p[i] == i + 1:
ans += 1
p[i], p[i + 1] = p[i + 1], p[i]
if p[-1] == N:
ans += 1
print(ans)
if __name__ == "__mai... |
p03625 | s533843406 | Accepted | from collections import Counter
n = int(input())
list_A = list(map(int, input().split()))
list_C = Counter(list_A)
list_D = sorted(list_C.items(), key=lambda x:x[0],reverse=True)
q = []
for i in range(len(list_D)):
if len(q) == 2:
break
l = list_D[i]
if l[1] > 1:
q.append(l[0])
if le... |
p03037 | s915136437 | Accepted |
def main():
n,m = map(int,input().split())
lm = 1
rm = n
for i in range(m):
l,r = map(int,input().split())
lm = max(lm,l)
rm = min(rm,r)
print(max(0,rm-lm+1))
if __name__ == "__main__":
main()
|
p02989 | s421079762 | Accepted | N = int(input())
array = sorted(list(map(int, input().split())))
print(array[N//2]-array[N//2-1]) |
p02608 | s662601675 | Accepted | n = int(input())
n_list = [0]*50000
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
if x+y+z >= 150:
break
index = x*x + y*y + z*z + x*y + y*z + z*x
n_list[index] = n_list[index]+1
for i in range(1,n+1):
print(n_list[i]) |
p04020 | s181227273 | Accepted | n = int(input())
ans = 0
m = 0
for i in range(n):
a = int(input())
ans += (m+a)//2
m = max(0,a-m)%2
print(ans) |
p02959 | s650515940 | Wrong Answer | a = (int)(input())
mons = list(map(int, input().split(" ")))
yuu = list(map(int, input().split(" ")))
count = 0
for i in range(a):
print(count)
if yuu[i] >= mons[i]:
yuu[i] -= mons[i]
count += mons[i]
if yuu[i] >= mons[i + 1]:
yuu[i] -= mons[i + 1]
count += mons[i + 1]
else:
mons[i... |
p03109 | s478444631 | Accepted | import sys
import os
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
S = sys.stdin.buffer.readline().decode().rstrip()
print('Heisei' if S <= '2019/04/30' else 'TBD')
if __name__ == '__main__':
main()
|
p03433 | s224191998 | Accepted | def resolve():
n, a = [int(input()) for _ in range(2)]
if n % 500 > a:
print('No')
else:
print('Yes')
resolve() |
p03548 | s242188716 | Wrong Answer | x,y,z = map(int,input().split())
a = x-y
b = a//(y+z)
print(b+1) |
p02641 | s542148478 | Wrong Answer | x,n = map(int, input().split())
valid = [1] *101
p = list(map(int, input().split()))
for i in range(n):
valid[p[i]] = 0
for j in range(x):
print(x,j,x-j,x+j)
if((x-j) >= 1):
if(valid[x-j] == 1):
print(x-j)
break
elif((x+j) <= 100):
if(valid[x+j] == 1):
print(x+j)
break
|
p03721 | s432435223 | Accepted | n,k=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(n)]
ab.sort()
def slv():
cnt = 0
for i in range(n):
cnt += ab[i][1]
if cnt >= k:
return print(ab[i][0])
slv() |
p02732 | s491470814 | Accepted | import collections
a=int(input())
b=list(map(int,input().split()))
c=collections.Counter(b)
n,m=zip(*c.most_common())
n,m=list(n),list(m)
result=0
for i in range(len(m)):
result+=(m[i]*(m[i]-1))//2
for i in b:
print(result-c[i]+1)
|
p02628 | s778344249 | Wrong Answer | x=input()
if x.isupper()==True:
print("A")
else:
print("a")
|
p03623 | s488071116 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def main():
x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
print("A")
else:
print("B")
if __name__ == "__main__":
main()
|
p02772 | s884741758 | Accepted | N = int(input())
ans = 'APPROVED'
for a in map(int, input().split()):
if a % 2 == 0 and a % 3 != 0 and a % 5 != 0:
ans = 'DENIED'
print(ans)
|
p03162 | s905243897 | Accepted | def main():
n = int(input())
a = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * 3 for _ in range(n)]
dp[0] = a[0]
for i in range(n - 1):
dp[i + 1][0] = a[i + 1][0] + max(dp[i][1], dp[i][2])
dp[i + 1][1] = a[i + 1][1] + max(dp[i][2], dp[i][0])
dp[i + 1][2] =... |
p02831 | s892128499 | Wrong Answer | a,b=map(int,input().split())
ans=a*b
for i in (2,max(a,b)):
if a%i==0 and b%i==0:
ans=ans/i
print(ans) |
p03438 | s265660892 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
A=sorted(A)
B=sorted(B)
x=sum(B)-sum(A)
cnt=0
for i in range(N):
if B[i]<A[i]:
cnt+=(A[i]-B[i])
else:
cnt+=(B[i]-A[i]+1)//2
if x<cnt:
print('No')
else:
print('Yes') |
p02546 | s420678745 | Accepted | s = input()
if s[-1] == "s":
print(s + "es")
else:
print(s + "s") |
p02690 | s323238936 | Wrong Answer | x = int(input())
for a in range(-100, 101):
for b in range(-100, 101):
if a**5 - b**5 == x:
print(a, b)
break
else:
continue
break
else:
print(-1) |
p03105 | s507043936 | Accepted | a,b,c = map(int,input().split())
print(min(c,b//a)) |
p03324 | s245575982 | Wrong Answer | D, N = map(int, input().split())
ans = N * 100 ** D
print(ans)
|
p02756 | s326766916 | Accepted | s = input()
qn = int(input())
left = ''
right = s
for i in range(qn):
q = input()
if q[0] == '1':
left, right = right, left
else:
_, f, c = q.split()
if f == '1':
left += c
else:
right += c
print(left[::-1] + right)
|
p04019 | s696428038 | Wrong Answer | s = input()
if ('N' in s and 'S' in s) or ('S' in s and 'W' in s):
print('Yes')
else:
print('No') |
p02923 | s572849933 | Wrong Answer | import math
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()))
mod = 10**9 + 7
sys.setrecursionlimit(1000010)
N = ni()
H = nl()
current = 0
ans = 0
for... |
p03699 | s173418584 | Accepted | #!/usr/bin/env python3
n = int(input())
s = [int(input()) for _ in range(n)]
s_5 = [s[i] for i in range(n) if s[i] % 10 != 0]
# maxはsumから5の倍数ならそのまま、10の倍数ならminの5の倍数をひく
sum_s = sum(s)
s_5.sort()
#print(s_5)
if sum_s % 10 != 0:
print(sum_s)
else:
if len(s_5) == 0:
print(0)
else: print(sum_s - s_5[0]) |
p02606 | s426260230 | Accepted | l , r, d = map(int, input().split())
a = [i for i in range(l, r+1)]
count = 0
for i in a:
if i % d == 0:
count += 1
print(count)
|
p03721 | s884823387 | Accepted | N, K = map(int, input().split())
ab = sorted([[int(i) for i in input().split()] for j in range(N)])
count = 0
for i in range(N):
count += ab[i][1]
if count >= K:
print(ab[i][0])
break |
p02661 | s369572059 | Accepted | N, *AB = map(int, open(0).read().split())
A = sorted(zip(*[iter(AB)] * 2), key=lambda t: t[0])
B = sorted(zip(*[iter(AB)] * 2), key=lambda t: t[1])
if N % 2 == 1:
L = A[N // 2][0]
R = B[N // 2][1]
else:
L = A[N // 2 - 1][0] + A[N // 2][0]
R = B[N // 2 - 1][1] + B[N // 2][1]
print(R - L + 1) |
p03289 | s103877391 | Wrong Answer | s = list(input())
if "C" in s[2:-2] and s[0]=="A":
del s[s.index("C")]
del s[0]
else:
print("WA")
exit()
for i in range(len(s)):
if s[i].islower():
continue
else:
print("WA")
exit()
print("AC") |
p02693 | s569914332 | Wrong Answer | import sys
k = int(input())
a,b = map(int,input().split())
if k==1:
print('Ok')
sys.exit()
wk = (a//k)+1
while wk <=b:
if wk*k<=b:
print('Ok')
sys.exit()
else:
wk+=1
print('NG') |
p02744 | s202499458 | Wrong Answer | n=int(input())
l=[['a1']]+[[] for _ in range(9)]
for i in range(9):
for b in l[i]:
t=b[-1]
for p in range(int(t)):
l[i+1].append(b[:-1]+chr(97+p)+t)
l[i+1].append(b[:-1]+chr(97+int(t))+str(int(t)+1))
for i in l[n-1]:
print(i[:-1]) |
p03293 | s678034225 | Accepted | s=input()
t=input()
ans=0
if s == t:
print('Yes')
else:
for i in range(len(s)):
s = s[-1] + s[0:-1]
if s == t:
ans += 1
if ans == 0:
print('No')
else:
print('Yes') |
p03943 | s042703095 | Wrong Answer | x=list(map(int,input().split()))
x.sort()
if x[0]+x[1] == x[2]:
print('YES')
else:
print('NO') |
p02755 | s235071804 | Accepted | A,B = map(int,input().split())
x = -1
for i in range(1,20000):
if int(i*1.08)-i==A and int(i*1.1)-i==B:
x = i
break
print(x) |
p02756 | s636072641 | Wrong Answer | s = input()
qn = int(input())
right = []
left = [s]
for i in range(qn):
q = input()
if q[0] == '1':
right, left = left, right
else:
_, f, c = q.split()
if f == '1':
left.append(c)
else:
right.append(c)
print(''.join(left[::-1]) + ''.join(right))
|
p03971 | s717959887 | Accepted | N, A, B = map(int, input().split())
S = input()
a = 0
b = 0
for char in S:
if char == 'a' and a+b < A+B:
print("Yes")
a += 1
elif char == 'b' and a+b < A+B and b < B:
print("Yes")
b += 1
else:
print("No") |
p02707 | s148759093 | Accepted | n = int(input().strip())
a = map(int, input().strip().split())
x = [0] * n
for i in a:
x[i-1] += 1
print('\n'.join(map(str, x))) |
p03860 | s015532202 | Wrong Answer | xs = input().split()
print("A"+xs[2][0]+"C") |
p02768 | s607138198 | Wrong Answer | n, a, b = list(map(int, input().split(' ')))
M = 10**9 + 7
result = pow(2, n, M)
def comb(n, r):
x = 1
y = 1
for i in range(r):
x *= (n - i)
y *= (i + 1)
x %= M
y %= M
x %= M
y %= M
return x // y
print(result - comb(n, a) - comb(n, b))
|
p02554 | s593634014 | Accepted | n=int(input())
MOD=10**9+7
ans=pow(10,n,MOD)-2*pow(9,n,MOD)+pow(8,n,MOD)
print(ans%MOD) |
p02624 | s624702049 | Accepted | n = int(input())
total = 0
for i in range(1, n + 1):
m = n // i
total += i * m * (m + 1) // 2
print(total) |
p02701 | s268207140 | Accepted | import collections
N=int(input())
SS=[]
for a in range(N):
S=input()
SS.append(S)
c = collections.Counter(SS)
print(len(c))
|
p02783 | s318041770 | Wrong Answer | h,a = map(int,input().split())
print(h // a + 1) |
p03338 | s784516529 | Accepted | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N=int(input())
S=list(input... |
p03565 | s970977323 | Accepted | S=input()
T=input()
lt=len(T)
ls=len(S)
if ls<lt:f=0
else:
for i in range(ls-lt,-1,-1):
f=1
for s,t in zip(S[i:i+lt],T):
if s=='?' or s==t: continue
f=0
if f:break
print((S[0:i]+T+S[i+lt:ls]).replace('?','a') if f else 'UNRESTORABLE') |
p02866 | s348760047 | Accepted | from collections import defaultdict
N = int(input())
D = list(map(int, input().split()))
MOD = 998244353
p = defaultdict(int)
for d in D:
p[d] += 1
if p[0] == 1 and D[0] == 0:
ans = 1
for i in range(max(D)):
ans *= pow(p[i], p[i + 1], mod=MOD)
ans %= MOD
if ans == 0:
... |
p02682 | s533161961 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
a, b, c, k = map(int, input().split())
if k <= a:
print(k)
sys.exit(0)
ans = a
k = k - a
if k <= b:
print(ans)
sys.exit(0)
k = k - b
ans = ans - k
print(ans)
|
p03644 | s625393412 | Wrong Answer | n=int(input())
now=1
while True:
if now>n:
break
now*=2
print(now)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.