problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02909 | s608252205 | Accepted | w = ['Sunny','Cloudy','Rainy']
i = w.index(input())
print(w[(i+1)%3]) |
p03767 | s829601329 | Accepted | import sys
n = int(input())
a = list(map(int, input().split()))
a.sort()
max_sum = 0
for i in range(n):
max_sum += a[3*n - 2*(i+1)]
print("{}".format(max_sum)) |
p02646 | s014944509 | Accepted | a,v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())
distance = b - a
speed_remainder = v - w
if speed_remainder < 0:
print("NO")
elif abs(distance) <= t * speed_remainder:
print("YES")
else:
print("NO")
|
p03210 | s371149990 | Accepted | x = int(input())
if x == 7 or x == 5 or x == 3:
print('YES')
else:
print('NO') |
p02787 | s910772226 | Wrong Answer | # coding=utf-8
# Date: 2020-01-08
# Author: lee215
get = lambda: int(raw_input().strip())
getl = lambda: raw_input().strip()
gets = lambda: list(map(int, raw_input().strip().split()))
getss = lambda n: [gets() for _ in range(n)]
# fi = open('sample3.in', 'r')
# raw_input = fi.readline
h, N = gets()
AB = getss(N)
dp = [0] + [float('inf')] * 100000
for a, b in AB:
for i in range(h + 1):
j = min(i + a, 1000000)
dp[j] = min(dp[j], dp[i] + b)
print(dp[h])
# PyPy2 Accepted
# PyPy3 Accepted
# Python2 TLE
# Python3 TLE
|
p03243 | s077657658 | Accepted | a=int(input())
b=a%100
c=a//100
if b<=c*11:
print(c*111)
else:
print((c+1)*111) |
p03274 | s931771461 | Accepted | n,k=map(int,input().split())
x=list(map(int,input().split()))
ans=10**25
for i in range(n-k+1):
if x[i+k-1]<=0:
num=x[i]*-1
elif x[i]>=0:
num=x[i+k-1]
else:
num1=abs(x[i])
num=min(num1,x[i+k-1])*2+max(num1,x[i+k-1])
ans=min(ans,num)
print(ans)
|
p03262 | s930205465 | Accepted | from math import gcd
n,x = map(int, input().split())
l = sorted([x]+list(map(int, input().split())))
nums = [0]*n
for i in range(n): nums[i] = l[i+1] - l[i]
ans = nums[0]
for i in range(1,n):
ans = gcd(ans,nums[i])
print(ans) |
p02918 | s310177280 | Accepted | N,K=map(int, input().split())
S=input()
comp=[]
tmp=""
for i in range(N):
if tmp=="":
tmp=S[i]
cnt=1
else:
if S[i]==tmp:
cnt +=1
if S[i]!=tmp:
comp.append([tmp,cnt])
tmp=S[i]
cnt=1
if i==N-1:
comp.append([tmp,cnt])
ans=0
for run in comp:
ans += run[1]-1
ans += K*2
ans = min(ans,N-1)
print(ans) |
p03377 | s653945723 | Accepted | a,b,c = list(map(int,input().split()))
if a>c or a+b<c:
print("NO")
else:
print("YES") |
p02848 | s287436988 | Accepted | import string
N = int(input())
C = list(input())
L = list(string.ascii_uppercase)
count = 0
for i in C:
for j in L:
if i == j:
break
count += 1
if count + N <= 25:
print(L[count+N], end='')
else:
print(L[count+N-26], end='')
count = 0 |
p02714 | s538046045 | Accepted | n = int(input())
s = input()
S = list(s)
r = S.count('R')
g = S.count('G')
b = S.count('B')
ans = r * g * b
for k in range(n):
for j in range(k):
i = 2*j - k
if i >= 0 and i < j and S[i] != S[j] and S[j] != S[k] and S[k] != S[i]:
ans -= 1
print(ans) |
p02759 | s015628158 | Accepted | print((int(input())+1)//2)
|
p03281 | s064607769 | Wrong Answer | import sys
input = sys.stdin.readline
N = int(input())
if N < 105 :
print(0)
elif N >= 105 and N<135 :
print(1)
elif N>= 135 and N<189 :
print(2)
else :
print(3) |
p03379 | s867146479 | Accepted | # coding: utf-8
N=int(input())
X=list(map(int,input().split()))
X_=sorted(X)
M=X_[(len(X)-1)//2]
for x in X:
if x<=M:
print(X_[(len(X)-1)//2+1])
else:
print(M) |
p02688 | s306057606 | Accepted | n, k = map(int, input().split())
A = [None]*k
for i in range(k):
d = int(input())
A[i] = list(map(int, input().split()))
snuke = [0] * n
for i in range(k):
for j in A[i]:
snuke[j - 1] += 1
ans = 0
for i in snuke:
if i == 0:
ans += 1
print(ans) |
p03067 | s889779328 | Accepted | A, B, C = map(int, input().split())
if A < C < B or B < C < A:
print("Yes")
else:
print("No") |
p02691 | s582044593 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
n = int(input())
a = list(map(int, input().split()))
ans = 0
R = {}
L = {}
for i in range(n):
r = i + a[i]
l = max(i - a[i], 0)
if r in R:
R[r] += 1
else:
R[r] = 1
if l in L:
L[l] += 1
else:
L[l] = 1
for k, v in R.items():
if k in L:
ans += v * L[k]
print(ans)
|
p02731 | s202514035 | Accepted | n = int(input())
print(n**3/27) |
p03821 | s611469072 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
AB = [0] * N
for i in range(N):
AB[i] = map(int, input().split())
n_press = 0
for A, B in reversed(AB):
_, r, = divmod(A + n_press, B)
n_press += B - r if r > 0 else 0
ans = n_press
print(ans)
if __name__ == "__main__":
main()
|
p02922 | s847457953 | Accepted | a, b = map(int, input().split())
tap = 0
outlet = 1
while(outlet < b):
outlet -= 1
outlet += a
tap += 1
print(tap) |
p02554 | s564235835 | Accepted | N = int(input())
y = 10**N - 2*(9**N) + 8**N
y_d = y % ( 10**9 + 7 )
print(y_d)
|
p02629 | s406537896 | Accepted | # coding:utf-8
n = int(input())
name = ''
count = 0
while n > 0:
n -= 1
mod = n % 26
name += chr(97 + mod)
n = n // 26
print(name[::-1])
|
p03612 | s598980282 | Accepted | N = int(input())
P = list(map(int,input().split()))
ls = [""] * N
cnt = 0
for i in range(N):
if P[i] == i + 1:
ls[i] = "#"
else:
ls[i] = "."
if ls[-1] == "#":
if ls[-2] == "#":
ls[-1], ls[-2] = ".", "."
else:
ls[-1] = "."
cnt += 1
for j in range(N-1):
if ls[j] == "#":
if ls[j+1] == "#":
ls[j+1] = "."
cnt += 1
print(cnt) |
p02719 | s851779603 | Wrong Answer | n, k = list(map(int, input().split()))
while(True):
x = abs(n-k)
print(n,k,x)
if n < x:
print(n)
break
n = x |
p03623 | s166620697 | Accepted | # 入力 : 数字3つ
x, a, b = map(int, input().split())
# 出力 a, b のうちxに近い方
if abs(x-a) < abs(x-b) :
print("A")
else :
print("B")
|
p03433 | s575929599 | Wrong Answer | N = int(input())
a = sorted(list(map(int,input().split())),reverse=True)
print(sum(a[::2])-sum(a[1::2])) |
p02792 | s756773961 | Accepted | N=int(input())
c=[[0]*10 for _ in range(10)]
for A in range(1,N+1):
Astr=str(A)
pre=int(Astr[0])
suf=int(Astr[-1])
c[pre][suf]+=1
cnt=0
for i in range(10):
for j in range(10):
cnt+=c[i][j]*c[j][i]
print(cnt) |
p02697 | s591069818 | Wrong Answer | n,m = map(int,input().split())
a = 1
while a<=m:
print(a,n)
a+=1
n-=1 |
p03611 | s148018322 | Accepted | n=int(input())
a=list(map(int, input().split()))
ans = 0
l = [0]*(10**5+2)
for i in range(n):
l[a[i]] +=1
for i in range(10**5):
x = l[i] +l[i+1]+l[i-1]
ans = max(ans,x)
print(ans) |
p02707 | s192585225 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
leng = 0
count = 0
for ai in a:
ans[ai-1] += 1
for i in ans:
print(i) |
p03136 | s231411091 | Wrong Answer | n=input()
l=list(map(int, input().split()))
if max(l)<(sum(l)-max(l)):
print('YES')
else:
print('NO')
|
p02724 | s386197207 | Wrong Answer | n = int(input())
a = n//500
b = a//5
print(1000*a+b) |
p03695 | s856613712 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
o=0
m=0
u=[0]*8
for i in a:
if 3199<i:
o+=1
else:
if u[i//400]==0:
u[i//400]+=1
m+=1
print(m,m+o) |
p03076 | s437963320 | Accepted | Time = [int(input()) for X in range(0,5)]
Loss = [(10-X%10)%10 for X in Time]
print(sum(Time)+sum(sorted(Loss)[:4])) |
p02862 | s161423044 | Accepted | X, Y = map(int, input().split())
n = (2 * X - Y) / 3
m = (2 * Y - X) / 3
if n < 0 or m < 0 or not n.is_integer() or not m.is_integer():
print(0)
exit()
n, m = map(int, [n, m])
mod = 10**9 + 7
fact = [1]
inv = [1]
for i in range(1, X + Y + 1):
fact.append((fact[i-1] * i) % mod)
inv.append(pow(fact[-1], mod-2, mod))
def cmb(n, r):
return fact[n] * inv[n-r] * inv[r]
print(cmb(n+m, min(n, m)) % mod)
|
p02718 | s405694619 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Sat Apr 4 20:49:19 2020
@author: naoki
"""
N, M = map(int,input().split())
A = list(map(int,input().split()))
criteria = sum(A) / (4*M)
count = 0
for i in range(N):
if A[i] >= criteria:
count+=1
if count >= M:
print("Yes")
else:
print("No") |
p02832 | s744785537 | Accepted | N=int(input())
A=list(map(int,input().split()))
ans_count=0
number_count=1
for i in range(len(A)):
if A[i]==number_count:
number_count+=1
else:
ans_count+=1
if number_count!=1:print(ans_count)
else:print("-1") |
p02983 | s922457367 | Accepted | l, r = map(int, input().split())
if r-l+1 >= 2019:
print(0)
else:
l %= 2019
r %= 2019
if l <= r:
ans = float('inf')
for i in range(l, r):
for j in range(i+1, r+1):
ans = min(ans, (i*j)%2019)
else:
ans = 0
print(ans) |
p02761 | s983208263 | Accepted | n, m = map(int, input().split())
listans = [0] * n
ans = 0
for i in range(m):
s, c = map(int, input().split())
s -= 1
if listans[s] == 0:
listans[s] = c
elif listans[s] != c:
ans = -1
if n > 1 and s == 0 and c == 0:
ans = -1
if n > 1 and listans[0] == 0:
listans[0] = 1
if ans == 0:
ans = "".join([str(li) for li in listans])
print(ans) |
p03556 | s951741450 | Accepted | print(int(int(input())**0.5)**2) |
p02952 | s658997712 | Accepted | N = int(input())
cnt = 0
for i in range(1, N+1):
if int(len(str(i))) % 2 == 1:
cnt += 1
print(cnt) |
p02831 | s961234517 | Accepted | import fractions
a,b = map(int, input().split())
print((a * b) // fractions.gcd(a,b)) |
p02622 | s163878828 | Wrong Answer | S = input()
T = input()
S_T_ = set(S)^set(T)
print(len(S_T_)) |
p02946 | s169748969 | Accepted | K, X = map(int, input().split())
li = []
for i in range (2*K-1):
li.append (X-K+i+1)
print (*li) |
p02843 | s084805408 | Accepted | import math
x=int(input())
y=x//100
z=math.ceil((x%100)/5)
if y >= z:
print(1)
else:
print(0)
|
p03760 | s364023069 | Accepted | o = input()
e = input()+" "
ans = ""
for i in range(len(o)):
ans += o[i]+e[i]
print(ans) |
p02880 | s589166651 | Accepted | import sys
N=int(input())
for i in range(1,10):
for j in range(1,10):
if i*j==N:
print('Yes')
sys.exit()
print('No') |
p02785 | s678000924 | Accepted | N,K = map(int,input().split())
alist = list(map(int,input().split()))
alist.sort(reverse=True)
p = 0
for i in range(K,N):
p = p + alist[i]
print(p) |
p03437 | s737777152 | Accepted | #15:15
x,y = map(int,input().split())
if x % y == 0:
print(-1)
else:
print(x) |
p03721 | s808752021 | Wrong Answer | def main():
N, K = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(N)]
S = []
for ab in AB:
S.extend([ab[0]]*ab[1])
print(S[K-1])
if __name__ == '__main__':
main()
|
p03481 | s246904396 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
x, y = map(int, input().split())
cnt = 1
while True:
if x*2 <= y:
cnt += 1
x *= 2
else:
break
print(cnt)
|
p03038 | s287841473 | Wrong Answer | # coding: utf-8
import heapq
N, M = map(int, input().split())
A = list(map(int, input().split()))
heapq.heapify(A)
minus = 0
print(*A)
for i in range(M):
b, c = map(int, input().split())
if A[0] < c:
for j in range(b):
tmp = heapq.heappop(A)
heapq.heappush(A, c)
print(sum(A)) |
p03627 | s965737769 | Accepted | n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
tmp = a[0]
ans = []
cnt = 0
for i in range(1,len(a)):
if tmp == a[i]:
cnt += 1
if cnt == 1 or cnt == 3:
ans.append(tmp)
else:
tmp = a[i]
cnt = 0
if len(ans) < 2:
print(0)
else:
print(ans[0]*ans[1]) |
p02621 | s088121238 | Wrong Answer | import sys
input = sys.stdin.readline
#-------------------------------------
c = int(input())
print( c*6 ) |
p04034 | s934687651 | Accepted | n,m = map(int, input().split())
redl = [False]*(n+1)
redl[1] = True
cnts = [1]*(n+1)
cnts[0] = 1
for _ in range(m):
x,y = map(int, input().split())
if redl[x]: redl[y] = True
if cnts[x] == 1: redl[x] = False
cnts[x] -= 1
cnts[y] += 1
ans = redl.count(True)
print(ans) |
p03371 | s387275945 | Accepted | a,b,c,x,y = map(int,input().split())
ans = float('inf')
for i in range(0,2*max(x,y)+1,2):
ab = i
x_tmp = x - i//2
y_tmp = y - i//2
tmp = max(0,a*x_tmp) + max(0,b*y_tmp) + c*i
if tmp < ans:
ans = tmp
print (ans)
|
p03071 | s436602630 | Accepted | a,b = map(int,input().split())
ans = 0
for _ in range(2):
if a >= b:
ans += a
a -= 1
else:
ans += b
b -= 1
print(ans) |
p03659 | s582344864 | Accepted | import sys
import numpy as np
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
A = nl()
cumA = np.cumsum(A)
total = cumA[-1]
ans = 10 ** 10000
for a in cumA[:-1]:
ans = min(ans, abs(a - (total - a)))
print(ans)
if __name__ == '__main__':
main()
|
p03632 | s456055794 | Wrong Answer | a, b, c, d = map(int, input().split())
print(max(b - c - max(b - d, 0), 0)) |
p03351 | s952173985 | Accepted | # A - Colorful Transceivers
# https://atcoder.jp/contests/abc097/tasks/abc097_a
a, b, c, d = map(int, input().split())
result = 'No'
if abs(a - c) <= d:
result = 'Yes'
elif abs(a - b) <= d and abs(b - c) <= d:
result = 'Yes'
print(result)
|
p02546 | s012289165 | Accepted | str = input()
if str[len(str)-1] == "s":
str = str + "es"
else:
str = str + "s"
print(str) |
p02747 | s452524385 | Wrong Answer | s = input()
if 'hi' in s:
print('Yes')
else:
print('No') |
p04030 | s968767763 | Accepted | s=list(input())
ans=[]
num=0
for i in range(len(s)):
if s[i]=="1":
ans.append("1")
num+=1
elif s[i]=="0":
ans.append("0")
num+=1
else:
if num!=0:
del ans[-1]
num-=1
print("".join(ans)) |
p03719 | s910334009 | Accepted | A,B,C = map(int,input().split())
if A<=C and C <= B:
print("Yes")
else:
print("No") |
p02720 | s058376645 | Accepted | # https://atcoder.jp/contests/abc161/tasks/abc161_d
from collections import deque
K = int(input())
ans = 0
count = 0
queue = deque()
for i in range(1, 10):
queue.append(i)
while True:
count += 1
a = queue.popleft()
if count == K:
print(a)
exit(0)
for i in range(-1, 2):
d = a % 10 + i
if d < 0 or d > 9:
continue
queue.append(a * 10 + d)
|
p02602 | s615094111 | Accepted | n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
for i in range(n-k):
if (arr[i]<arr[i+k]):
print("Yes")
else:
print("No") |
p02684 | s824718986 | Wrong Answer | n,k=map(int,input().split())
a=[int(x) for x in input().rstrip().split()]
l=[0 for i in range(n)]
cnt=0
dist=[]
now=0
while(True):
if l[now]+1==3:
break
dist.append(now)
l[now]+=1
now=a[now]-1
# k=k-l.count(1)
g=l.count(2)
# print(dist)
# print(l)
print(dist[k%g+l.count(1)]+1)
|
p02861 | s688223438 | Accepted | import math
N = int(input())
Nlist = [list(map(int, input().split())) for i in range(N)]
total = 0
for i in range(N-1):
for j in range(i+1, N):
total += math.sqrt((Nlist[i][0]-Nlist[j][0])
** 2+(Nlist[i][1]-Nlist[j][1])**2)
ans = total*2/N
print(ans)
|
p03632 | s301787221 | Wrong Answer | a, b, c, d = map(int, input().split())
print(max(0,max(a,c)-min(b,d))) |
p03345 | s569677435 | Accepted | a,b,c,k = map(int,input().split())
print(a-b if k%2==0 else b-a) |
p03617 | s779743305 | Accepted | def resolve():
A,B,C,D = map(int,input().split())
N = int(input())*4
cc = [(8*A,A,1),(4*B,B,2),(2*C,C,4),(D,D,8)]
cc.sort()
ans = 0
for _,cost,vol in cc:
enable = N//vol
ans += enable*cost
N %= vol
print(ans)
resolve()
|
p03994 | s336196283 | Wrong Answer | s=input()
K=int(input())
znum=ord("z")
count=0
ans=[]
lst=dict()
for i in range(len(s)):
num=ord(s[i])
if s[i]=="a":
ans.append("a")
continue
sa=znum-num+1
if sa<=K:
ans.append("a")
K-=sa
else:
ans.append(s[i])
if count<K:
K%=26
ans[-1]=chr(ord(s[-1])+K)
S=""
for i in range(len(ans)):
S=S+ans[i]
print(S) |
p02996 | s587564364 | Accepted | from heapq import heappush, heappop
N = int(input())
AB = []
for i in range(N):
a, b = map(int, input().split())
heappush(AB, (b, a))
current = 0
for i in list(range(N)):
deadline, cost = heappop(AB)
if current + cost > deadline: # 締め切り時間を過ぎてしまっているとき
print("No")
exit()
current += cost
print("Yes") |
p02647 | s304353065 | Accepted | import sys
import numpy as np
from numba import jit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, *A = map(int, read().split())
K = min(50,K)
@jit
def imos(A):
B = np.zeros_like(A)
for i,x in enumerate(A):
a = max(0,i-x)
b = min(N-1,i+x)
B[a] += 1
if b+1 <= N-1:
B[b+1] -= 1
B = np.cumsum(B)
return B
for i in range(K):
if i >= 50:
break
A = imos(A)
print(*A) |
p03379 | s043599014 | Wrong Answer | n = int(input())
x = list(map(int, input().split()))
y = sorted(x)
p = y[n//2]
q = y[(n//2)-1]
for i in range(n):
if x[i] == p:
print(q)
else:
print(p)
|
p02801 | s730245163 | Accepted | C=input()
print(chr(((ord(C)-ord('a'))+1)%26+ord('a'))) |
p03971 | s032106995 | Accepted | N, A, B = map(int,input().split())
S = input()
Fore_rank = 1
passed = 0
for i in range(N):
if S[i] == 'a' and A+B > passed:
print("Yes")
passed += 1
elif S[i] == 'b' and A+B > passed and B >= Fore_rank:
print("Yes")
Fore_rank += 1
passed += 1
else: print("No") |
p03720 | s311160399 | Accepted | n, m = map(int, input().split())
# a = [0] * m
# b = [0] * m
# for i in range(m):
# a[i], b[i] = map(int, input().split)
answer = [0] * (n+1)
for _ in range(m):
a, b = map(int, input().split())
answer[a] += 1
answer[b] += 1
for i in range(1, n+1):
print(answer[i]) |
p02727 | s442847591 | Accepted | X,Y,A,B,C = map(int, input().split())
p = sorted(list(map(int, input().split())), reverse=True)
q = sorted(list(map(int, input().split())), reverse=True)
r = sorted(list(map(int, input().split())), reverse=True)
l = p[:X] + q[:Y] + r
print(sum(sorted(l, reverse=True)[:X+Y]))
|
p03359 | s373230523 | Wrong Answer | a, b = map(int, input().split())
s = min(a, b)
print(s) |
p02624 | s777444992 | Wrong Answer | n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
if j%i == 0:
ans += i
print(i) |
p03377 | s372462566 | Wrong Answer | a,b,x=map(int,input().split())
if(a<=x or a+b==x):
print("Yes")
else:
print("No")
|
p03317 | s164171783 | Wrong Answer | import math
N, K = map(int,input().split())
l = list(map(int,input().split()))
tag = l.index(1)
print(math.ceil((N-1-tag)/(K-1))+math.ceil(tag/(K-1))) |
p03814 | s297111111 | Wrong Answer | # -*- coding: utf-8 -*-
s = list(input())
tmp_str =""
output=""
start = False
end = False
for ss in s:
if ss == 'A' and start == False:
tmp_str = ss
start = True
elif ss == 'Z' and start == True:
tmp_str += ss
if len(output) < len(tmp_str):
output = tmp_str
end = True
elif end == True:
start = end = False
if len(output) < len(tmp_str):
output = tmp_str
elif start == True:
tmp_str += ss
print(len(output)) |
p02972 | s668344770 | Accepted | n=int(input())
A=list(map(int,input().split()))
B=[0]*n
for i in range(n):
now=(n-i)*2
cnt=A[n-i-1]
while now<=n:
cnt+=B[now-1]
now+=n-i
if cnt%2==1:
B[n-i-1]=1
print(sum(B))
for i in range(n):
if B[i]:
print(i+1,end=" ") |
p02552 | s043371297 | Wrong Answer | # coding: utf-8
def solve(*args: str) -> str:
x = args[0]
return '0' if x == '1' else '0'
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
p04043 | s588340912 | Wrong Answer | def check():
A = list(map(int, input().split()))
if A.count(5)!=2 or A.count(7)!=1:
return 'No'
return 'Yes'
print(check()) |
p03145 | s664170335 | Accepted | A,B,C=map(int,input().split())
print(A*B//2) |
p02924 | s727432868 | Accepted | n = int(input())
print(n*(n-1)//2) |
p02952 | s156111961 | Wrong Answer | n = int(input())
ans = 0
if n < 10:
ans += n
else:
ans += 9
if n < 1000:
ans += max(0, n-1000)
else:
ans += 900
if n < 100000:
ans += max(0, n-100000)
else:
ans += 90000
print(ans)
|
p02760 | s706090651 | Accepted | import itertools
A=[list(map(int,input().split())) for i in range(3)]
A=list(itertools.chain.from_iterable(A))
N=int(input())
for _ in range(N):
b=int(input())
try:
A[A.index(b)]="X"
except:
continue
answer="No"
for bingo in [[0,1,2],[3,4,5],[6,7,8],[0,4,8],[2,4,6],[0,3,6],[1,4,7],[2,5,8]]:
if A[bingo[0]]=="X" and A[bingo[1]]=="X" and A[bingo[2]]=="X":
answer="Yes"
print(answer) |
p02554 | s056018300 | Wrong Answer | mod = 1000000007
N = int(input())
A = 1
B = 1
C = 1
for _ in range(1,N+1):
A *= 10
A %= mod
B *= 9
B %= mod
C *= 8
C %= mod
ans = A - (2*B - C)
print(ans)
|
p04030 | s101530467 | Accepted | n = input()
s=""
for i in range(len(n)):
if(n[i]=="B"):
if(s != ""):
s=s[:-1]
else:
s+=n[i]
print(s)
|
p02748 | s294483542 | Accepted | a, b, m = map(int,input().split())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
ans = 10**19
for i in range(m):
x, y, c = map(int,input().split())
ans = min(A[x-1]+B[y-1]-c, ans)
print(min(ans,min(A)+min(B))) |
p03486 | s086342099 | Accepted | s = input()
t = input()
ss = sorted(s)
tt = sorted(t, reverse=True)
print('Yes') if ss < tt else print('No') |
p03998 | s789916460 | Accepted | S={c:list(input()) for c in "abc"}
s="a"
while S[s]:s=S[s].pop(0)
print(s.upper()) |
p02859 | s504664245 | Wrong Answer | import numpy
def multiply(r):
s = r*r
return s |
p02664 | s623086968 | Accepted | T=input()
print(T.replace('?', 'D')) |
p03126 | s232714443 | Accepted | n,m = map(int, input().split())
k = [list(map(int, input().split())) for i in range(n)]
c = 0
for i in range(1,m+1):
for j in range(n):
if i not in k[j][1:]:
break
else:
c+=1
print(c) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.