problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02775 | s817866233 | Accepted | N = input()
a = 0 # not carried
b = 0 # carried
t = int(N[-1])
a, b = a + t, a + (10 - t)
for i in range(len(N) - 2, -1, -1):
t = int(N[i])
a, b = min(a + t, b + (t + 1)), min(a + (10 - t), b + (10 - (t + 1)))
print(min(a, b + 1))
|
p02554 | s202598044 | Accepted | n = int(input())
m = 10**9 + 7
print(((10**n) % m - (9**n) % m * 2 + (8**n) % m) % m) |
p04043 | s423933748 | Accepted | def prod(ls):
def resolve(ls, a):
if len(ls) == 1:
return a*ls[0]
else:
car = ls[0]
ls = ls[1:]
return resolve(ls, a*car)
return resolve(ls, 1)
ls = list(map(int, input().split()))
if sum(ls) == 17 and prod(ls) == 175:
print("YES")
else :
... |
p02729 | s839297254 | Wrong Answer | N, M = tuple(map(int, input().split()))
import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
if N < 2 and N < 2:
print(0)
elif M < 2:
print(comb(N,2))
elif N < 2:
print(comb(M,2))
else:
print(comb(N,2) + comb(M, 2)) |
p03745 | s855563372 | Accepted | N = int(input())
a = list(map(int,input().split()))
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 all(flags):
ans += 1
flags = [False,False]
print(ans)
|
p02553 | s243304025 | Wrong Answer | a, b, c, d = map(int, input().split())
if b < 0 and d < 0:
print(c * a)
elif a > 0 and b > 0:
print(a * b)
elif b < 0 and d > 0:
print(c * b)
elif b > 0 and d < 0:
print(d * a)
|
p03720 | s443469401 | Accepted | n,m = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(m)]
G = [[] for _ in range(n)]
for l in L:
G[l[0]-1].append(l[1]-1)
G[l[1]-1].append(l[0]-1)
for g in G:
print(len(g)) |
p02659 | s259598216 | Accepted | a,b = input().split()
a = int(a)
b = int(b[0:-3] + b[-2:])
print(a * b // 100) |
p03637 | s139867961 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
cnt = 0
flg_2 = 0
for a in A:
if a % 4 == 0:
cnt += 1
elif a == 2:
flg_2 += 1
if flg_2==2:
N -= 1
flg_2 = 0
if cnt >= N//2:
ans = 'Yes'
else:
ans = 'No'
print(ans) |
p02606 | s502144217 | Wrong Answer | L,R,D = map(int, input().split())
r = [i for i in range(L-1,R+1)]
A = [j for j in range(L-1,R+1)]
N = [k for k in r if k % D == 0]
print(len(N)) |
p03695 | s567308749 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A = [a//400 for a in A]
l = len({0,1,2,3,4,5,6,7}&set(A))
S = sum(a>7 for a in A)
print(max(l, S), l+S) |
p02727 | s559256549 | Accepted | 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)
X,Y,A,B,C=nm()
p = sorted(nl(),reverse=True... |
p02661 | s138284648 | Accepted | n=int(input(""))
a=[]
b=[]
for i in range(n):
cc=input("").split(" ")
a+=[int(cc[0])]
b+=[int(cc[1])]
s=0
a.sort()
b.sort()
if (n%2==0):
s=(a[int(n/2)]+a[int(n/2)-1]-b[int(n/2)]-b[int(n/2)-1])
else:
s=a[int((n-1)/2)]-b[int((n-1)/2)]
print(int(-s+1))
|
p02760 | s607144487 | Wrong Answer | a=[list(map(int,input().split())) for _ in range(3)]
n=int(input())
for i in range(n):
b=int(input())
for j in range(3):
for k in range(3):
if a[j][k]==b:
a[j][k]=0
ans=0
for i in range(3):
if a[i][0]==0 and a[i][1]==0 and a[i][2]==0:
ans=1
elif a[0][i]==0 and a[1][i]==0 and a[2][i]==0:
... |
p02786 | s847337018 | Accepted | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def solve(H: int):
ret = 0
i = 1
while H > 0:
ret += i
i *= 2
H //= 2
print(ret)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
... |
p03605 | s379987894 | Accepted | # 数値を取得
N = str(input())
# 文字列を検査し結果を出力
if "9" in N:
print("Yes")
else:
print("No") |
p03469 | s080329168 | Accepted | s=input()
u=list(s)
u[3]="8"
k="".join(u)
print(k) |
p03485 | s485558412 | Accepted | import math
a,b = map(int,input().split())
x = (a + b)/2
xx= math.ceil(x)
print(xx) |
p03557 | s490016212 | Wrong Answer | from bisect import bisect_right
from bisect import bisect_left
N = int(input())
A = sorted(map(int, input().split()))
B = sorted(map(int, input().split()))
C = sorted(map(int, input().split()))
answer = 0
for i in range(N):
x1 = bisect_left(A, B[i])
x2 = bisect_right(C, B[i])
print(x1, x2, N)
answer +=... |
p02595 | s568252787 | Wrong Answer | n,d=map(int,input().split())
cnt=0
for _ in range(n):
x,y=map(int,input().split())
if (x**2+y**2)>=d**2:
cnt+=1
print(cnt) |
p02663 | s409923090 | Accepted | ii = lambda:int(input())
mi = lambda:list(map(int,input().split()))
ix = lambda x:list(input() for _ in range(x))
mix = lambda x:list(mi() for _ in range(x))
iix = lambda x:list(int(input()) for _ in range(x))
##########
def resolve():
h1,m1,h2,m2,k = mi()
res = convert(h2,m2) - convert(h1,m1) - k
print(re... |
p03071 | s597825453 | Wrong Answer | A,B=map(int,input().split())
if A-1<=B:
print(A+B)
else:
print(A+(A-1))
|
p02754 | s934911033 | Accepted | n, a, b = map(int, input().split())
period = a+b
times = n//period
k = n%period
n = a if k >a else k
print(times*a + n) |
p02683 | s627646384 | Accepted | N,M,X=map(int,input().split())
C=[]
As=[]
for _ in range(N):
c,*a=map(int,input().split())
C+=[c]
As+=[a]
r=1e9
for i in range(2**N):
cost=0
perf=[0]*M
for j in range(N):
if (i>>j)&1:
cost+=C[j]
perf=[perf[k]+As[j][k] for k in range(M)]
if all(p>=X for p in perf):
r=min(r,cost)
if r==1... |
p03161 | s157652728 | Wrong Answer | import sys
def main():
INF=sys.maxsize
N,K=tuple(map(int,sys.stdin.readline().split()))
h=tuple(map(int,sys.stdin.readline().split()))
dp=[INF for _ in range(N)]
dp[0]=0
for i in range(N-1):
for j in range(K+1):
if i+j<N:dp[i+j]=min([dp[i+j],dp[i]+abs(h[i]-h[i-j])])
print... |
p02622 | s537002387 | Accepted | s = input()
t = input()
ans = 0
for i in range(len(s)):
if s[i] != t[i]:
ans += 1
print(ans) |
p02947 | s065310044 | Accepted | from collections import defaultdict
n = int(input())
d = defaultdict(lambda: 0)
for _ in range(n):
s = list(input())
s.sort()
d[''.join(s)] += 1
ans = 0
for v in d.values():
ans += v*(v-1)//2
print(ans)
|
p03146 | s661604625 | Wrong Answer | s=int(input())
count=0
for i in range(10000000):
if s%2==1:
s=s*3+1
else:
s=s//2
if s==4:
count+=1
if count==2:
print(i+2)
break |
p03821 | s982405523 | Accepted | n = int(input())
ab = []
pushCount = 0
for i in range(n):
ab.append(list(map(int, input().split())))
ans = 0
for i in range(n)[::-1]:
ab[i][0] += pushCount
if ab[i][0] % ab[i][1] != 0:
ans += ab[i][1] - ab[i][0] % ab[i][1]
pushCount += ab[i][1] - ab[i][0] % ab[i][1]
print(ans) |
p02555 | s560630518 | Accepted | s = int(input())
MOD = 10 ** 9 + 7
fact = [0] * 4400
invfact = [0] * 4400
fact[0] = 1
for i in range(1, 4400):
fact[i] = fact[i-1] * i % MOD
invfact[4400 - 1] = pow(fact[4400 - 1], MOD - 2, MOD)
for i in range(4400 - 1, 0, -1):
invfact[i-1] = invfact[i] * i % MOD
def nCk(n, k):
return fact[n] * invf... |
p02768 | s489583394 | Wrong Answer | mod = (10 ** 9 + 7)
def comb(n, r):
p, q = 1, 1
for i in range(r):
p = p *(n-i)%mod
q = q *(i+1)%mod
return (p / q) % mod
n, a, b = list(map(int, input().split()))
s = pow(2, n, mod) - 1
print((s - comb(n, a) - comb(n, b)) % mod) |
p02689 | s383699846 | Wrong Answer | N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(M)]
cnt = 0
s = set()
used = set()
for i in range(M):
lef = AB[i][0]-1
rig = AB[i][1]-1
if not H[lef] == H[rig]:
s.add(max(H[lef], H[rig]))
used.add(H[lef])
use... |
p03478 | s362927478 | Accepted | n,a,b=map(int,input().split())
s=0
for i in range(1,n+1):
seqi=str(i)
sumi=0
for j in range(len(seqi)):
sumi+=int(seqi[j])
if a<=sumi<=b:
s+=i
print(s) |
p02603 | s873068006 | Wrong Answer | N = int(input())
A = [int(_) for _ in input().split()]
dp = [1000]
K = [0]
C = [0]
for i in range(N):
k, c = divmod(dp[-1], A[i])
v = max(dp[-1], K[-1] * A[i] + C[-1])
K.append(k)
C.append(c)
dp.append(v)
print(dp[-1])
|
p03639 | s178303458 | Accepted | n = int(input())
a = list(map(int, input().split()))
c_4 = 0
c_2 = 0
for i in range(n):
if a[i] % 4 == 0:
c_4 += 1
elif a[i] % 2 == 0:
c_2 += 1
if c_4 >= n // 2:
print('Yes')
elif c_4 * 2 + c_2 >= n:
print('Yes')
else:
print('No') |
p02612 | s605893408 | Wrong Answer | n = int(input())
print((1000-n//1000)%1000) |
p02959 | s877889499 | Accepted | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
count=0
for i,b in enumerate(B):
attack=min(b,A[i]+A[i+1])
count+=attack
A[i+1]-=max(0,attack-A[i])
print(count) |
p03449 | s045586046 | Accepted | N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
L=[A,B]
S=0
for i in range(N):
K=sum(L[0][0:i+1])+sum(L[1][i:N])
S=max(S,K)
print(S) |
p02624 | s284502015 | Accepted | n = int(input())
ans = 0
for i in range(1, n//2 + 1):
ans += i * (n//i) * (n//i + 1) // 2
ans += (n + n//2 + 1) * (n - n//2) // 2
print(ans) |
p02881 | s291201359 | Wrong Answer | n = int(input())
for i in range(int(n**0.5)+1, 0, -1):
if n//i == 0 and i <= n//i:
key = i
break
print(i+n//i-2) |
p03239 | s179159567 | Accepted | N, T = map(int, input().split())
ans = 1e9
for n in range(N):
c, t = map(int, input().split())
if t <= T:
ans = min(ans, c)
if ans == 1e9:
print('TLE')
else:
print(ans)
|
p03127 | s819744655 | Accepted | from math import *
N=int(input())
A=list(map(int,input().split()))
ans=A[0]
for i in range(1,N):
ans=gcd(ans,A[i])
print(ans)
|
p03351 | s633955249 | Wrong Answer | data = input()
dataa,datab,datac,datad = data.split(' ')
dataa = int(dataa)
datab = int(datab)
datac = int(datac)
datad = int(datad)
length1 = dataa -datab + datab - datac
length2 = dataa - datac
if length2 < datad:
print('Yes')
elif length1 < datad:
print('Yes')
else:
print('No')
|
p03639 | s284288499 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
cnt_2 = 0
cnt_4 = 0
for a in A:
if a % 4 == 0:
cnt_4 += 1
elif a % 2 == 0:
cnt_2 += 1
if N <= cnt_4 * 3:
print('Yes')
else:
N -= cnt_4 * 3
if N % 2 != 0:
N += 1
if N <= cnt_2:
print('Yes')
else:
print('No')
|
p02613 | s656116116 | Wrong Answer | import collections
n = int(input())
m = [input() for i in range(n)]
check = ["AC","WA","TLE","RE"]
m = m+check
c = collections.Counter(m)
for i,j in c.items():
print(i+ " x " +str(j-1)) |
p03105 | s095789250 | Accepted | A,B,C=map(int,input().split())
print(min(C,B//A))
|
p03038 | s400827532 | Accepted | n,m=map(int,input().split())
a=sorted(map(int,input().split()))
l=list()
for i in range(m):
l.append(list(map(int,input().split())))
l.sort(key=lambda x:-x[1])
i=0
for b,c in l:
for j in range(b):
if i+j<n and a[i+j]<c:
a[i+j]=c
else:
print(sum(a))
exit()
... |
p03219 | s907915764 | Accepted | x, y = map(int, input().split())
print(x + y//2 ) |
p03556 | s362428498 | Accepted | n = int(input())
for i in range(n, -1, -1):
temp = i ** 0.5
if temp == int(temp):
print(i)
break |
p02996 | s546126519 | Accepted | n = int(input())
a = []
b = []
for i in range(n):
p,q = map(int,input().split())
a.append(p)
b.append(q)
ab = zip(b,a)
ab = sorted(ab)
b,a = zip(*ab)
val = 0
ans = "Yes"
for i in range(n):
val +=a[i]
if val > b[i]:
ans = "No"
break
print(ans) |
p02712 | s731991014 | Wrong Answer | n = int(input())
sum = 0
for i in range(n):
if i % 3 == 0 and i % 5 == 0:
# print('FizzBuzz')
pass
elif i % 3 == 0:
# print('Fizz')
pass
elif i % 5 == 0:
# print('Buzz')
pass
else:
# print(i)
sum += i
print(sum) |
p03041 | s722693018 | Accepted | N, K = map(int,input().split())
S = input()
a = S[:K-1] + str.lower(S[K-1]) + S[K:]
print(a) |
p02571 | s224011655 | Accepted | s = input()
t = input()
numlist = []
for i in range(len(s)-len(t)+1):
a = s[i:i+len(t)]
count = 0
for j in range(len(t)):
if a[j] != t[j]:
count += 1
numlist.append(count)
print(min(numlist)) |
p03407 | s020663108 | Accepted | a, b, c = map(int, input().split())
print('Yes') if a + b >= c else print('No') |
p03103 | s578788473 | Accepted | n,m = map(int,input().split())
ab = []
for i in range(n):
a,b = map(int,input().split())
ab.append((a,b))
ab.sort()
yen = 0
cnt = 0
for i, a_b in enumerate(ab):
if cnt + a_b[1] < m:
yen += a_b[0] * a_b[1]
cnt += a_b[1]
else:
tmp = m - cnt
cnt += tmp
yen += tmp * a... |
p02772 | s146994126 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
def linersearch(N,A):
for i in range(N):
if A[i]%3==0 or A[i]%5==0:
return "APPROVED"
return "DENIED"
linersearch(N,A) |
p03220 | s477112585 | Accepted | N=int(input())
T,A=map(int,input().split())
H=list(map(int,input().split()))
L=[]
P=[]
for i in range(N):
L.append(abs(A-(T-0.006*H[i])))
P=sorted(L)
print(L.index(P[0])+1) |
p02995 | s535129150 | Wrong Answer | import fractions
a,b,c,d=map(int,input().split())
g=fractions.gcd(c,d)
l=int(c*d/g)
x=b-a
ac=a/c
bc=b/c
ad=a/d
bd=b/d
al=a/l
bl=b/l
if ac==int(ac) or bc==int(bc):
cans=x//c+1
else:
cans=x//c
if ad==int(ad) or bd==int(bd):
dans=x//d+1
else:
dans=x//d
if al==int(al) or bl==int(bl):
lans=x//l+1
else:... |
p04044 | s366396994 | Wrong Answer | def calord(tmp):
sumord = ""
for c in tmp:
sumord = sumord + str(ord(c))
return int(sumord)
n, l = map(int, input().split())
l1 = [0]*n
for i in range(n):
tmp = input()
sum_ord = calord(tmp)
l1[i] = (sum_ord, tmp)
l2 = sorted(l1)
r = ""
for i in range(n):
r = r + l2[i][1]
print(r) |
p02726 | s327301893 | Accepted | N,X,Y=map(int,input().split())
ans=[0]*(N-1)
for i in range(1,N):
for j in range(i+1,N+1):
d1=j-i
d2=abs(X-i)+1+abs(Y-j)
d=min(d1,d2)
ans[d-1]+=1
for i in ans:
print(i) |
p03408 | s603650915 | Accepted | blue = []
red = []
ans = 0
n = int(input())
for i in range(n):
blue.append(input())
m = int(input())
for j in range(m):
red.append(input())
word = set(blue)
for k in word:
c = blue.count(k) - red.count(k)
ans = max(ans,c)
print(ans) |
p03761 | s991725610 | Wrong Answer | import collections
N = int(input())
S = collections.Counter(list(input()))
for i in range(N-1):
c = collections.Counter(list(input()))
S &= c
print(sum(S.values())) |
p04011 | s036307503 | Wrong Answer | def ston():
n = int(input())
k = int(input())
x = int(input())
y = int(input())
if n <= k:
print(n*x)
else:
print(k*x + (n-k)*y)
|
p02814 | s808370268 | Wrong Answer | import math
import fractions
N, M = map(int, input().split())
a_i = list(map(int, input().split()))
half_a_i = []
for i in a_i:
i //= 2
half_a_i.append(i)
lcm = half_a_i[0]
for i in range(1, N):
lcm = lcm * half_a_i[i] // fractions.gcd(lcm, half_a_i[i])
if (M // lcm) == 0:
print(0)
else:
pri... |
p04011 | s337761573 | Wrong Answer | n=int(input())
k=int(input())
x=int(input())
y=int(input())
if n>k:
print(k*x+(n-k)*y)
else:
print(k*n) |
p02597 | s585428948 | Accepted | n = int(input())
c = input()
l = 0
r = n - 1
ans = 0
while True:
while c[l] == 'R' and l < r:
l += 1
while c[r] == 'W' and l < r:
r -= 1
if l < r:
ans += 1
l += 1
r -= 1
else:
print(ans)
break |
p02682 | s290035074 | Accepted | a,b,c,k=map(int,input().split())
ans=a
if a>k: ans=k
if a+b<k: ans-=(k-(a+b))
print(ans)
|
p02742 | s360134414 | Wrong Answer | h, w = [int(x) for x in input().split()]
if h%2 == 0 and w%2 == 0:
print((h*w)//2)
else:
print((h*w)//2+1) |
p02553 | s798130541 | Accepted | a,b,c,d = map(int, input().split())
A=a*c
B=a*d
C=b*c
D=b*d
print(max(A,B,C,D)) |
p02618 | s816515851 | Wrong Answer | n = int(input())
for i in range(n):
print("100") |
p02639 | s446722226 | Accepted | #
import sys
input=sys.stdin.readline
def main():
x=list(map(int,input().split()))
print(x.index(0)+1)
if __name__=="__main__":
main()
|
p04034 | s252070536 | Accepted | N, M = map(int, input().split())
A = [0 for i in range(N)]
B = [1 for i in range(N)]
A[0] = 1
for i in range(M):
a, b = map(int, input().split())
B[a-1] -= 1
B[b-1] += 1
if A[a-1] == 1:
A[b-1] = 1
if B[a-1] == 0:
A[a-1] = 0
print(sum(A)) |
p02994 | s406063623 | Accepted | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------... |
p03861 | s872119849 | Accepted | a, b, x = map(int, input().split())
mod = a % x
if mod == 0:
start = a-(x-1)
else:
start = a-(mod-1)
print((b-start+1)//x)
|
p03673 | s430586455 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=[0]*n
for i in range(n):
if n%2 and i==n-1:
b[i]=a[n//2]
else:
if i<n//2:
b[i]=a[n-i*2-1]
else:
b[i]=a[(i-n//2)*2]
print(' '.join(map(str,b))) |
p03797 | s810680942 | Wrong Answer | N,M=map(int,input().split())
if N >= 2*M:
print(M//2)
exit()
x = (M-2*N)//4
print(N+x) |
p02707 | s876720958 | Wrong Answer | N = int(input())
A = [0]
B = list(map(int, input().split()))
A += B
#print(A)
sig = [0] * N
for i in range(N-1):
sig[A[i+1]] += 1
#print(sig)
print(sig)
for i in sig:
print(i) |
p02633 | s269087825 | Accepted | def gcd(a: int, b: int) -> int:
"""a, bの最大公約数(greatest common divisor: GCD)を求める
計算量: O(log(min(a, b)))
"""
while b:
a, b = b, a % b
return a
x = int(input())
ans = gcd(x, 360)
print(360 // ans) |
p02548 | s468471123 | Wrong Answer | n = int(input())
s=(n-1)
ab = n//2 if n%2==0 else n//2 + 1
for x in range(2,ab):
if n%x==0:
s+=(n//x - 1)
else:
s+=(n//x)
print(s + n//2)
|
p02676 | s723733060 | Wrong Answer | K = int(input())
S = str(input())
if len(S) <= K:
print(S)
else:
print(S[:7] + '...') |
p02795 | s256967236 | Accepted | import math
h = int(input())
w = int(input())
n = int(input())
done=0
count=0
while True:
if h>w:
if w==0:
exit()
else:
done+=h
count+=1
w-=1
else:
if h==0:
exit()
else:
done+=w
count+=1
h-=1
if done>=n:
print(count)
exit() |
p02640 | s843538704 | Accepted | x, y = map(int, input().split())
ans = 'No'
for a in range(1, x+1):
b = x - a
if b == x:
break
if 2*a + 4*b == y or 2*b + 4*a == y:
ans = 'Yes'
break
print(ans) |
p03644 | s112084024 | Accepted | N = int(input())
for i in range(6, -1, -1):
if 2**i > N:
continue
print(2**i)
break |
p02899 | s079695531 | Accepted | n = int(input())
a = list(map(int , input().strip().split()))
students = {}
ans = []
for i in range(len(a)):
students[i] = a[i]
students= sorted(students.items(), key=lambda x:x[1])
for i in range(n):
ans.append(str(students[i][0] + 1))
print(' '.join(ans)) |
p03548 | s462875216 | Accepted | X,Y,Z = map(int,input().split())
n = X // (Y+Z)
if X % (Y+Z) < Z :
print(n-1)
else:
print(n) |
p02622 | s313581980 | Accepted | s = str(input())
t = str(input())
count = 0
for i in range(len(s)):
if s[i] != t[i]:
count += 1
print(count) |
p03617 | s445630925 | Accepted | Q,H,S,D = map(int,input().split())
N = int(input())
Min = min(4*Q,2*H,S)
if Min > D/2:
if N%2 == 0:
print(N//2*D)
else:
print(N//2*D + Min)
else:
print(Min*N) |
p03069 | s794706029 | Wrong Answer | n = int(input())
s = input()
h = 0
t = len(s)
while h < t and s[h] == '.':
h += 1
while 0<t and s[t-1] == '#':
t -= 1
s = s[h:t]
print(min(s.count('.'), s.count('#')))
|
p02701 | s942894597 | Accepted | n = int(input())
sequence = [input() for _ in range(n)]
print(len(set(sequence))) |
p03435 | s583784367 | Wrong Answer | c1 = list(map(int, input().split()))
c2 = list(map(int, input().split()))
c3 = list(map(int, input().split()))
result = 'No'
if sum(c1[:2]) == c1[2]:
if sum(c2[:2]) == c2[2]:
if sum(c2[:2]) == c3[2]:
result = 'Yes'
print(result) |
p03069 | s820501257 | Wrong Answer | n = int(input())
s = input()
black = []
white = []
cb=0
cw=0
for l in s:
if l =="#":
cb+=1
else:
cw+=1
black.append(cb)
white.append(cw)
if n == 1:
print(0)
else:
ans = []
for i in range(1,n):
ans.append(black[i-1]+white[-1]-white[i-1])
print(min(ans))
|
p02917 | s686614987 | Accepted | N = int(input())
B = [10**5+1] + list(map(int, input().split())) + [10**5+1]
res = 0
for i in range(1, N+1):
res += min(B[i-1], B[i])
print(res)
|
p03679 | s825541791 | Accepted | x,a,b=map(int,input().split())
if a>=b:
print("delicious")
elif x+a<b:
print("dangerous")
else:
print("safe") |
p02724 | s190457814 | Accepted | x = int(input())
print(x//500*1000 + x%500//5*5) |
p02718 | s799819275 | Accepted | n,m = map(int,input().split())
a = sorted(list(map(int,input().split())))
lim = sum(a)/(4*m)
cnt = 0
for i in a:
if i >= lim:
cnt += 1
if cnt >= m:
print("Yes")
else:
print("No") |
p03163 | s458524940 | Wrong Answer | def main():
n, W, *wv = map(int, open(0).read().split())
dp = [[0] * (W + 1)] * (n + 1)
for i in range(n):
w = wv[i * 2]
v = wv[i * 2 + 1]
pv = dp[i][w]
dp[i + 1] = [max(dp[i][j], dp[i][j - w] + v) if j >= w else pv for j in range(0, W + 1)]
print(dp[-1][W])
main()
|
p03076 | s758331255 | Accepted | import math
def roundup(x):
return int(math.ceil(x / 10.0)) * 10
l = [int(input()) for _ in range(5)]
ll = [roundup(v) for v in l]
m = sum(ll)
print(min([m - ll[i] + l[i] for i in range(5)]))
|
p02633 | s274659463 | Accepted | x = int(input())
for i in range(1, 10**5):
if 360 * i % x == 0:
print(360 * i // x)
break |
p02603 | s366429597 | Accepted | N=int(input())
A=list(map(int,input().split()))
ans=1000
dp=[0]
for i in range(N-1):
if A[i]<A[i+1]:
dp.append(1)
else:
dp.append(0)
o=len(dp)
dp.append(0)
for i in range(o):
if dp[i]==1 and dp[i+1]==0:
dp[i]=2
if dp[i]==0 and dp[i+1]==1:
dp[i]=-1
p=0
for i in range(N):
if dp[i]==-1:
p=ans... |
p03773 | s022848646 | Accepted | def main():
A, B = map(int, input().split())
if A + B >= 24:
print(A+B-24)
else:
print(A+B)
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.