problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02838 | s795837140 | Accepted | n = int(input())
A = list(map(int, input().split()))
bits = [0] * 60
MOD = 10**9 + 7
for a in A:
div = a
i = 0
while True:
div, mod = div // 2, div % 2
bits[i] += mod
i += 1
if div == 0:
break
ans = 0
for i in range(60):
ans += bits[i] * (n-bits[i]) * 2 ** i % MOD
print(ans % MOD)
|
p02880 | s486179277 | Accepted | n = int(input())
ans = "No"
for i in range(1, 10):
if n % i == 0:
nn = n // i
if nn < 10:
ans = "Yes"
break
print(ans) |
p02747 | s374541219 | Wrong Answer | def solve():
s = input()
s = s.replace('hi', '00')
if len(s) == 1:
return 'No'
if len(s) == 2:
return 'Yes' if s == '00' else 'No'
# 3以上
ans = 'No'
for i in range(len(s)-2):
if s[i] + s[i+1] == '00' and s[i+2] != 'i':
ans = 'Yes'
if s[-1] + s[-2] == '00':
ans = 'Yes'
return ans
print(solve()) |
p03836 | s056420562 | Accepted | s_x,s_y,t_x,t_y=map(int,input().split())
ans=''
hor = t_x - s_x
ver = t_y - s_y
ans='U'*ver + 'R'*hor + 'D'*ver + 'L'*hor + 'L' + 'U'*(ver+1) +'R'*(hor+1)+'D'+'R' + 'D'*(ver+1)+'L'*(hor+1)+'U'
print(ans) |
p02678 | s840906965 | Accepted | from collections import deque
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
n,m=nii()
tree=[[] for i in range(n)]
for i in range(m):
a,b=nii()
a-=1
b-=1
tree[a].append(b)
tree[b].append(a)
ans=[-1 for i in range(n)]
ans[0]=0
dq=deque()
dq.append(0)
while dq:
x=dq.popleft()
for i in tree[x]:
if ans[i]==-1:
ans[i]=x
dq.append(i)
print('Yes')
for i in ans[1:]:
print(i+1) |
p03317 | s180180364 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
p = 0
cnt= 0
while p < n - 1:
p += k - 1
cnt += 1
print(cnt) |
p02705 | s124150541 | Accepted | import math
R = int(input())
print(2*R*math.pi)
|
p03250 | s839209745 | Accepted | x=list(map(int,input().split()))
x.sort()
print(x[-1]*10+x[-2]+x[-3]) |
p03131 | s392006613 | Accepted | k,a,b=map(int,input().split())
if b-a<=2 or a>k-1: print(k+1)
else:
k-=a-1
print(a+(b-a)*(k//2)+k%2) |
p03041 | s729504085 | Wrong Answer | N, K = map(int,input().split())
S = input()
OOMOJI = S[K-1]
KOMOJI = (S[K-1]).lower()
output_S = S.replace(OOMOJI, KOMOJI)
print(output_S)
|
p02793 | s930910053 | Accepted | from fractions import gcd
P = 10**9 + 7
N = 1000001 #使う最大値+1以上にする、値に注意3*10^5とかにしとくと安心
inv = [0] + [1] # 1/x
for i in range(2,N):
inv += [inv[P % i] * (P - int(P / i)) % P]
n=int(input())
a=list(map(int,input().split()))
lcm=a[0]
mod=10**9+7
for i in range(1,n):
lcm=(lcm//gcd(lcm,a[i]))*a[i]
ans=0
lcm%=mod
for i in range(n):
ans=(ans+lcm*inv[a[i]])%mod
print(ans%mod) |
p02973 | s054208469 | Accepted | import bisect
N = int(input())
H = []
for _ in range(N):
a = int(input())
ind = bisect.bisect_right(H, -a)
if ind == len(H):
H.append(-a)
else:
H[ind] = -a
print(len(H))
|
p03137 | s398670685 | Accepted | N,M= map(int, input().split())
X= list(map(int, input().split()))
X.sort()
if N >= M:
print(0)
elif N == 1:
print(abs(max(X) - min(X)))
else:
load = [X[i] - X[i - 1] for i in range(1, M)]
load.sort()
print(sum(load[:M - N])) |
p03795 | s382836812 | Accepted | N=int(input())
print(800*N-200*(N//15)) |
p02727 | s110204323 | Accepted | import numpy as np
x, y, a, b, c = map(int,input().split())
p = np.array(input().split(),dtype=int)
q = np.array(input().split(),dtype=int)
r = np.array(input().split(),dtype=int)
p = np.sort(p)[::-1]
q = np.sort(q)[::-1]
ans = 0
kouho = []
for i in range(x):
kouho.append(p[i])
for i in range(y):
kouho.append(q[i])
for i in range(c):
kouho.append(r[i])
kouho = sorted(kouho)[::-1]
for i in range(x+y):
ans += kouho[i]
print(ans)
|
p02953 | s993028423 | Accepted | import sys
from heapq import heappush, heappop
#input = sys.stdin.readline
def main():
n=int(input())
h=list(map(int,input().split()))
ans=0
for i in range(1,n):
if h[n-1-i]-h[n-i]>=2:
ans=1
break
elif h[n-1-i]-h[n-i]==1:
h[n-i-1]-=1
if ans==1:
print('No')
else:
print('Yes')
if __name__ == '__main__':
main() |
p02688 | s108575954 | Accepted | from sys import stdin, setrecursionlimit
setrecursionlimit(10 ** 9)
def input():
return stdin.readline().strip()
N, K = map(int, input().split())
s = set()
for i in range(K):
d = int(input())
A = list(map(int, input().split()))
s |= set(A)
ans = set(range(1, N+1)) - s
print(len(ans)) |
p02578 | s613013335 | Accepted | n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(1,n):
if a[i]<a[i-1]:
cnt+=a[i-1]-a[i]
a[i]=a[i-1]
cnt+=a[i-1]-a[i]
print(cnt) |
p03359 | s758463477 | Wrong Answer | a,b=map(int,input().split());print(min(a,b)) |
p02720 | s350546032 | Accepted | import sys
sys.setrecursionlimit(2 * 10 ** 5)
k = int(input())
r = []
MAX = 3234566667
def dfs(x):
s = str(x)
r.append(x)
last = int(s[-1])
for i in range(last-1, last+2):
if 0 <= i <= 9:
next = int(s + str(i))
if next <= MAX:
dfs(next)
dfs(1)
dfs(2)
dfs(3)
dfs(4)
dfs(5)
dfs(6)
dfs(7)
dfs(8)
dfs(9)
r.sort()
print(r[k-1]) |
p03106 | s366013884 | Accepted | def dv(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)
return divisors
A,B,K = map(int,input().split())
C = list(set(dv(A))&set(dv(B)))
C.sort()
C.reverse()
print(C[K-1]) |
p02792 | s136229348 | Accepted | n = int(input())
ans_list = [[0] * 10 for i in range(10)]
for i in range(1, n+1):
sn = str(i)
a = int(sn[0])
b = int(sn[-1])
ans_list[a][b] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += ans_list[i][j] * ans_list[j][i]
print(ans) |
p02935 | s452101551 | Accepted | N = int(input())
V = list(map(int, input().split()))
V.sort()
ans = 0
ans += V[0]/(2**(N-1))
for i in range(1,N):
ans += V[i]/(2**(N-i))
print(ans) |
p02866 | s026288507 | Accepted | def print0():
print(0)
exit()
n = int(input())
d = list(map(int, input().split()))
mod = 998244353
ans = 1
maxd = max(d)
numcnt = [0] * (maxd + 1)
for i in d:
numcnt[i] += 1
if not d[0] == 0 or not numcnt[0] == 1:
print0()
for i in range(1, maxd + 1):
if numcnt[i] == 0:
print0()
ans *= pow(numcnt[i - 1], numcnt[i], mod)
ans %= mod
print(ans) |
p03962 | s803433869 | Accepted | print(len(set(list(map(int, input().split()))))) |
p02773 | s795144850 | Accepted | from collections import Counter
n = int(input())
s = [input() for i in range(n)]
num = Counter(s)
mx = max(num.values())
T = []
for n in sorted(num):
if num[n] == mx:
print(n) |
p03679 | s409358377 | Accepted | x, a, b = map(int, input().split())
if a < b:
if b - a <= x:
print("safe")
else:
print("dangerous")
else:
print("delicious") |
p03543 | s581327708 | Accepted | S = input()
print('Yes' if S[0] == S[1] == S[2] or S[1] == S[2] == S[3] else 'No') |
p03075 | s634972122 | Accepted | l = [int(input()) for i in range(6)]
out = 0
for i in range(4):
for j in range(5):
if l[j]-l[i] > l[5]:
out += 1
if out > 0:
print(":(")
else:
print("Yay!") |
p03076 | s295084359 | Wrong Answer | inp = [int(input()) for _ in range(5)]
rem = [p % 10 if p % 10 != 0 else 10 for p in inp]
idx = rem.index(min(rem))
min_rem = inp[idx]
res = 0
inp.remove(min_rem)
for a in inp:
print(res)
if a % 10 == 0:
res += a
else:
res += a + (10 - a % 10)
print(res + min_rem) |
p03150 | s826237257 | Accepted | S = input()
s = S.replace('keyence', '0')
lst = []
k = 'keyence'
jdg = False
if s[0] == '0' or s[-1] == '0':
jdg = True
elif '0' in s:
jdg = False
else:
for i in range(1, len(k)):
lst.append([k[:i], k[i:]])
for i, j in enumerate(lst, start=1):
if s[:i] == j[0] and s[i-7:] == j[1]:
jdg = True
break
if jdg: print('YES')
else: print('NO')
|
p03693 | s037486259 | Accepted | a, b, c = list(map(int, input().split()))
if (a*100+b*10+c) % 4 == 0:
print('YES')
else:
print('NO') |
p02642 | s529712454 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a.sort()
flag = [True] * n
for i, num in enumerate(a):
if num > a[-1]*0.5:
break
if a[(i-1)%n]==num or a[(i+1)%n]==num:
flag[i] = False
continue
for j in range(i+1, n):
if a[j]%num==0:
flag[j] = False
counter = 0
#print(flag)
for i in range(len(flag)):
if flag[i]:
counter += 1
print(counter) |
p03456 | s883814625 | Wrong Answer | a, b = input().split()
x = int(a + b)
n = 100
for i in range(n):
if i**2 == x:
print('Yes')
exit()
print('No') |
p03997 | s628600327 | Accepted | a = int(input())
b = int(input())
h = int(input())
print((a + b) * h // 2)
|
p02924 | s280351254 | Wrong Answer | N = int(input())
print(int((1/2)*N*(N-1)+0.5)) |
p02760 | s045758341 | Accepted | a = [list(map(int, input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for l in range(n)]
a = a[0] + a[1] + a[2]
A = [False]*9
for h in range(len(a)):
A[h] = a[h] in b
flag = 'No'
for k in range(3):
if A[k*3] == A[k*3+1] == A[k*3+2] == True:
flag = 'Yes'
if A[k] == A[k+3] == A[k+6] == True:
flag = 'Yes'
if A[0] == A[4] == A[8] == True:
flag = 'Yes'
if A[2] == A[4] == A[6] == True:
flag = 'Yes'
print(flag) |
p02792 | s328273390 | Wrong Answer | num = int(input())
counter = 0
for i in range(num):
a = str(i)
for j in range(num):
b = str(j)
if (a[-1] == b[0]) and (a[0] == b[-1]):
counter += 1
print(counter) |
p03059 | s836953160 | Wrong Answer | a,b,c=map(int,input().split())
d=0
e=1
while 1:
a*=e
if c+0.5>a:
e+=1
d+=b
else:
break
print(d)
|
p02682 | s522509781 | Accepted | import sys
import math
from collections import deque
import heapq
import itertools
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
a,b,c,K = IL()
if K <= a:
print(K)
elif a < K <= a+b:
print(a)
else:
print(a - (K - (a+b))) |
p03219 | s335017977 | Accepted | a, b = map(int, input().split())
print( a + b // 2) |
p02578 | s659328396 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
K = 0
for i in range(0,N-2):
if A[i+1]-A[i]<0:
K += A[i]-A[i+1]+K
else:
K += 0
print(K)
|
p02647 | s716264766 | Wrong Answer | n,k = map(int,input().split())
A = list(map(int,input().split()))
for _ in range(k):
c = [0]*n
for i,j in enumerate(A):
for k in range(i-j,i+j+1):
if 0 <= k <= n-1:
c[k] += 1
if A == c:
break
A = c
print(A)
print(" ".join(map(str,A))) |
p03705 | s350270306 | Accepted | N,A,B=list(map(int,input().split()))
if A == B:
print(1)
exit()
if N ==1 or A>B:
print(0)
exit()
ans=(N-2)*(B-A)
print(ans+1)
|
p02970 | s578164101 | Wrong Answer | n,d = map(int,input().split())
print(1+n//(2*d+1)) |
p02899 | s010947088 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
B = list()
for i in range(N):
B.insert(A[i]-1,i+1)
print(' '.join(map(str,B))) |
p02959 | s571644192 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
total = 0
cnt = 0
for i in range(n):
if a[i] - (b[i] - cnt) >= 0:
total += b[i] - cnt
cnt = min(b[i], a[i] - (b[i] - cnt))
else:
total += a[i]
cnt = max(-b[i], a[i] - (b[i] - cnt))
if cnt < 0:
total += min(a[n], abs(cnt))
print(total) |
p03944 | s795717728 | Accepted | w,h,n = map(int, input().split())
min_x, max_x, min_y, max_y = 0, w, 0, h
for _ in range(n):
x,y,a = map(int, input().split())
if a==1:
min_x = max(min_x, x)
elif a==2:
max_x = min(max_x, x)
elif a==3:
min_y = max(min_y, y)
else:
max_y = min(max_y, y)
print((max_x-min_x if max_x>=min_x else 0)*(max_y-min_y if max_y>=min_y else 0))
|
p02933 | s722961638 | Accepted | a=int(input())
s=input()
if a>=3200:
print(s)
else:
print("red") |
p02753 | s879346857 | Accepted | S = input()
print('No' if S in ['AAA', 'BBB'] else 'Yes')
|
p02731 | s108594769 | Accepted | L = int(input())
print(L*L*L/27) |
p03030 | s022680737 | Accepted | N = int(input())
SPI = [input().split()+[i] for i in range(N)]
SPI.sort(key=lambda x:(x[0], -int(x[1])))
for _,_,i in SPI:
print(i+1) |
p03324 | s732185839 | Accepted | d,n=map(int,input().split())
if n<100:
print(n*100**d)
else:
print(101*100**d) |
p02647 | s860887247 | Accepted | from itertools import accumulate
n, K = map(int,input().split())
A = list(map(int,input().split()))
b = [0 for _ in range(n+1)]
for _ in range(K):
for i,a in enumerate(A):
b[max(0, i-a)] += 1
b[min(n, i+a+1)] -= 1
ac = list(accumulate(b))
A = ac[:-1]
b = [0 for _ in range(n+1)]
if sum(A) == n*n:
break
print(*A) |
p03471 | s332826519 | Accepted | N, Y = map(int, input().split())
ans = [-1, -1, -1]
for x in range(N+1):
for y in range(N+1):
z = N - (x+y)
if 10000*x + 5000*y + 1000*z == Y and (0<= z <= N):
ans = [x, y, z]
break
print(*ans) |
p02659 | s069748781 | Accepted | import math
from decimal import Decimal
a, b = input().split()
a = Decimal(a)
b = Decimal(b)
#print(type(a))
print(math.floor(a*b))
|
p02963 | s635780546 | Wrong Answer | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()
def resolve():
S = I()
X1 = int(S ** 0.5)
print(0, 0, X1, 0, 0, S // X1)
if __name__ == '__main__':
resolve()
|
p03145 | s080528077 | Accepted | a,b,_=map(int,input().split());print(a*b//2) |
p03860 | s868615191 | Wrong Answer | print('A'+input()[0]+'C') |
p02768 | s515559434 | Accepted | mod = 10**9+7
rng = 400100
fctr = [1]
finv = [1]
for i in range(1,rng):
fctr.append(fctr[-1]*i%mod)
def cmb(n,k):
if n-k<0:
return 0
else:
ls=[n]
for i in range(k-1):
ls.append(ls[-1]*(n-i-1)%mod)
return ls[-1]*pow(fctr[k],mod-2,mod)%mod
n,a,b=map(int,input().split())
print((pow(2,n,mod)-cmb(n,a)-cmb(n,b))%mod-1) |
p02785 | s540729509 | Wrong Answer | import sys
sys.setrecursionlimit(int(1e6))
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H.sort()
n = len(H) - K
ans = sum(H[:n])
print(ans)
|
p02802 | s799058033 | Accepted | n, m = map(int, input().split())
a = [input().split() for i in range(m)]
solved = [False] * n
ac_cnt = 0
wa_l = [0] * n
for i in range(m):
cn, cj = int(a[i][0]) - 1, a[i][1]
if not solved[cn]:
if cj == 'WA':
wa_l[cn] += 1
else:
ac_cnt += 1
solved[cn] = True
wa_cnt = 0
for i in range(n):
wa_cnt += solved[i] * wa_l[i]
print(ac_cnt, wa_cnt)
|
p03721 | s219722281 | Accepted | N,K=map(int,input().split())
a=[]
for i in range(N):
c,d=map(int,input().split())
a.append((c,d))
#xについてソート
a.sort()
count = 0
for x,y in a:
count += y
if count>=K:
print(x)
exit() |
p03371 | s933087681 | Accepted | A,B,C,X,Y = map(int, input().split())
ans = float('inf')
for i in range(0,200001,2):
a = max(0,X-i//2)
b = max(0,Y-i//2)
s = a*A+b*B+i*C
ans = min(ans, s)
print(ans) |
p02777 | s924470531 | Accepted | s, t = input().split()
x, y = map(int, input().split())
query = input()
if query == s:
x -= 1
else:
y -= 1
print("{} {}".format(x, y)) |
p02989 | s743184423 | Wrong Answer | n=int(input())
dlis=sorted(list(map(int,input().split())))
print(dlis)
print(dlis[int((n/2))]-dlis[int(n/2)-1]) |
p02793 | s626765125 | Accepted | def lcm(a):
from fractions import gcd
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
def solve(arr):
ab = lcm(arr)
sum = 0
for a in arr:
sum += ab // a
return sum % (10**9+7)
n = int(input())
arr = list(map(int, input().split()))
print(solve(arr))
|
p02910 | s361340109 | Accepted | s = input()
a = 0
for i in range(0, len(s), 2):
if s[i] in ['R', 'U', 'D']:
a += 1
for i in range(1, len(s), 2):
if s[i] in ['L', 'U', 'D']:
a += 1
print('Yes' if a == len(s) else 'No') |
p03672 | s573052789 | Accepted | s = input()
n = len(s)
n -= 1
if n % 2:
n -= 1
while n > 0:
if s[:n//2] == s[n//2:n]:
break
n -= 2
print(n) |
p03127 | s238584502 | Accepted | import fractions
N = int(input())
A = list(map(int,input().split()))
ans = A[0]
for i in range(1,N):
ans = fractions.gcd(ans,A[i])
print(ans) |
p03720 | s538953127 | Accepted | N, M = map(int, input().split())
route = [[0 for i in range(N)] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
route[a-1][b-1] += 1
route[b-1][a-1] += 1
for i in route:
print(sum(i))
|
p03017 | s943890032 | Accepted | n, a, b, c, d = map(int, input().split())
a, b, c, d = a-1, b-1, c-1, d-1
s = input()
if "##" in s[a:d]:
print("No")
exit()
if c < d:
for i in range(b, d):
if s[i] == "#" and s[i+1] == "#":
print("No")
exit()
print("Yes")
else:
for i in range(b, d+1):
if s[i] != "#" and s[i-1] == "." and s[i+1] == ".":
print("Yes")
exit()
print("No") |
p03632 | s401363306 | Accepted | a,b,c,d=map(int,input().split())
s=max(a,c)
f=min(b,d)
print(max(f-s,0)) |
p03261 | s288887802 | Accepted | n = int(input())
s = set()
for i in range(n):
w = str(input())
if i == 0:
p = w
s.add(w)
else:
if w[0] != p[-1] or w in s:
print('No')
exit()
else:
p = w
s.add(w)
else:
print('Yes') |
p04019 | s243254191 | Wrong Answer | s = input()
print(set(s))
if 0 in [s.count("W"),s.count("E")] or 0 in [s.count("N"),s.count("S")]:
print("No")
else:
print("Yes") |
p03211 | s204015845 | Wrong Answer | s = input()
ans = float("inf")
for i in range(len(s)-3):
curr = int(s[i:i+3])
ans = min(ans, abs(753 - curr))
print(ans) |
p03387 | s904009826 | Wrong Answer | a,b,c = map(int,input().split())
x = abs(a-b)
y = abs(b-c)
print (x,y,-(-x//2),-(-y//2))
if (x%2 == 0 and y%2 == 0): # 差が ぐぐ
ans = x//2 + y//2
elif (x%2 == 1 and y%2 == 1): #差が きき
ans = x//2 + y//2 + 1
else: # 差が ぐき or きぐ
ans = x//2 + y//2 + 2
print (ans)
|
p02661 | s207807330 | Wrong Answer | def median(array):
L = len(array)
if L%2==0:
return (array[L//2-1]+array[L//2])/2
else:
return array[L//2]
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
if N%2==1:
print(median(B) - median(A) + 1)
else:
print(int((median(B) - median(A) +0.5)*2)) |
p02695 | s130511095 | Accepted | from itertools import combinations_with_replacement
import sys
input = sys.stdin.readline
n, m, q = map(int, input().split())
abcd = [list(map(int, input().split())) for _ in range(q)]
l = [i for i in range(1, m+1)]
ans = 0
for Alis in combinations_with_replacement(l, n):
cnt = 0
for i in range(q):
if Alis[abcd[i][1] - 1] - Alis[abcd[i][0] - 1] == abcd[i][2]:
cnt += abcd[i][3]
ans = max(ans, cnt)
print(ans)
|
p02660 | s317069203 | Wrong Answer | N = int(input())
res = {}
ans = 0
for i in range(2,int(N**(1/2))+1) :
while(N%i == 0) :
if(i not in res) :
res[i] = 1
else :
res[i] += 1
N /= i
if(N != 1) :
res[N] = 1
for i in res :
b = 1
s = res[i]
while(b <= s) :
ans += 1
s -= 1
b += 1
print(ans) |
p02971 | s431755336 | Wrong Answer | N = int(input())
S = [int(input()) for _ in range(N)]
A = sorted(set(S))
for i in range(N):
if S[i] == A[-1]:
if len(A) > 1:
print(A[-2])
else:
print(A[-1])
else:
print(A[-1])
|
p02659 | s718351013 | Accepted | a, b = input().split()
b1, b2 = b.split('.')
a = int(a)
b1 = int(b1)
b2 = int(b2)
c = int(('{:0=3}'.format(a * b2))[:-2])
print(a * b1 +c)
|
p02973 | s276582744 | Accepted | import bisect
from collections import deque
N = int(input())
ans = deque([-1])
for _ in range(N):
a = int(input())
i = bisect.bisect_left(ans, a)
if i == 0:
ans.appendleft(a)
else:
ans[i-1] = a
print(len(ans))
|
p03951 | s968455432 | Accepted | import re
N = int(input())
s = input(); t = input()
c = 0
for i in range(len(s)):
if re.match(s[i:], t):
c = len(s)-i
break
print(N*2 - c) |
p02880 | s809681821 | Accepted | n=int(input())
t=False
for i in range(1,10):
for j in range(1,10):
if i*j==n:
t=True
break
if t:
print('Yes')
else:
print('No')
|
p03136 | s274244278 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *L = map(int, read().split())
s = sum(L)
ok = True
for l in L:
if l >= s - l:
ok = False
break
if ok:
print('Yes')
else:
print('No')
return
if __name__ == '__main__':
main()
|
p02989 | s083691653 | Accepted | N = int(input())
D = list(map(int,input().split()))
D = sorted(D,reverse = False)
#print(D)
B = N // 2 -1
#print(B)
ans = D[B+1] -D[B]
print(ans)
|
p02958 | s300218148 | Accepted | n = int(input())
num_lists = list(map(int, input().split()))
cnt = 0
for i in range(n):
if num_lists[i] != i+1:
cnt += 1
if cnt <= 2:
ans = 'YES'
else:
ans = 'NO'
print(ans) |
p02621 | s000181989 | Accepted | import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
INF = 1000000000000
a = I()
print(a + a*a + a*a*a)
|
p03220 | s070911680 | Accepted | N = int(input())
T, A = map(int, input().split())
H = list(map(int, input().split()))
print(sorted([(abs(A - (T - h * 0.006)), i+1) for i,h in enumerate(H)])[0][1]) |
p03680 | s039778089 | Wrong Answer | N = int(input())
A = [int(input()) for i in range(N)]
print(A)
cnt = 1
now = 1
while True:
if now == A[1]:
print(cnt+1)
break
if (cnt > N):
print(-1)
break
now = A[now-1]
print(now)
cnt += 1
|
p03711 | s552746189 | Accepted | x,y = map(int, input().split())
A = [1,3,5,7,8,10,12]
B = [4,6,9,11]
C = [2]
if x in A and y in A :
print("Yes")
elif x in B and y in B :
print("Yes")
elif x in C and y in C :
print("Yes")
else :
print("No") |
p02554 | s824567081 | Accepted | n = int(input())
if n < 2:
print('0')
elif n == 2:
print('2')
else:
zero = 10 ** n - 9 ** n
nine = 10 ** n - 9 ** n
zq = 10 ** n - 8 ** n
ans = zero + nine - zq
print(ans % (10 ** 9 + 7))
|
p02572 | s436095879 | Accepted | n = int(input())
a = list(map(int, input().split()))
t = 0
r = 0
mod = 10**9+7
for i in range(n-1, 0, -1):
r += a[i]
t += a[i-1]*r
print(t%mod) |
p03698 | s346187271 | Accepted | s=input()
print("yes" if len(s)==len(set(s)) else "no") |
p04005 | s239760304 | Wrong Answer | A, B, C = map(int, input().split())
a = A//2
b = B//2
c = C//2
print(min(B*C*(A-2*a), C*A*(B-2*b), B*C*(C-2*c)))
|
p02683 | s686700049 | Accepted | n,m,x = map(int,input().split())
books = [list(map(int, input().split())) for _ in range(n)]
ans = []
for i in range( 2 ** n ):
total = [0] * (m + 1)
for j in range(n):
if (i >> j) & 1:
total = [total[k] + books[j][k] for k in range(m+1)]
over = True
for j in range(1, m+1):
if total[j] < x:
over = False
if over:
ans.append(total[0])
if len(ans) > 0:
print(min(ans))
else:
print('-1')
|
p03625 | s471727669 | Wrong Answer | import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = map(int, read().split())
ans = 0
counter = Counter(A)
vec = [k for k, v in counter.items() if v >= 2]
vec.sort()
if len(vec) >= 2:
ans = vec[-2] * vec[-1]
print(ans)
return
if __name__ == '__main__':
main()
|
p03469 | s930402948 | Wrong Answer | x = list(input())
x[3] = "8"
print(x)
|
p02688 | s742143687 | Wrong Answer | N, K = map(int,input().split())
S = set() #Sがお菓子を持っている人
P = list(range(1,N+1,1))
for i in range(K):
D = int(input())
A = list(map(int, input().split()))
for a in A:
S.add(a)
print(set(P) - S) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.