problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03475 | s913240459 | Accepted | n = int(input())
li = []
for i in range(n-1):
c,s,f = map(int,input().split())
li.append((c,s,f))
for i in range(n-1):
cur = li[i][1]+li[i][0]
for j in range(i+1,n-1):
c,s,f = li[j]
cur = max(s,-(-cur//f)*f)+c
print(cur)
print(0) |
p03163 | s158294820 | Accepted | N,W=map(int,input().split())
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(1,N+1):
w,v=map(int,input().split())
for j in range(1,W+1):
if j>=w:
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w]+v)
else:
dp[i][j]=dp[i-1][j]
print(dp[-1][-1]) |
p02600 | s520189200 | Accepted | n=int(input())
if 400<=n<=599:
print(8)
elif 600<=n<=799:
print(7)
elif 800 <= n <= 999:
print(6)
elif 1000<=n<=1199:
print(5)
elif 1200<=n<=1399:
print(4)
elif 1400<=n<=1599:
print(3)
elif 1600<=n<=1799:
print(2)
else:
print(1)
|
p02693 | s092601149 | Accepted | K = int(input())
A, B = map(int,input().split())
if A % K == 0 or B % K == 0:
print("OK")
else:
if (A // K + 1)*K <= B:
print("OK")
else:
print("NG") |
p02787 | s516727908 | Accepted | h,n=map(int,input().split())
ab=[list(map(int,input().split())) for _ in range(n)]
inf=10**10
dp=[inf]*(h+1)
dp[-1]=0
for a,b in ab:
for i in range(h,0,-1):
if i-a>=0:
dp[i-a]=min(dp[i-a],dp[i]+b)
else:
dp[0]=min(dp[0],dp[i]+b)
print(dp[0]) |
p04029 | s947585409 | Wrong Answer | a = int(input())
s = 0
for i in range(a):
s += i
print(s) |
p03486 | s874809464 | Accepted | import sys
import math
import bisect
import re
def solve():
s = input()
t = input()
s = ''.join(sorted(s))
t = ''.join(sorted(t, reverse=True))
return s < t
def main():
if solve():
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
p03543 | s490623209 | Wrong Answer | import sys
input = sys.stdin.readline
n = input().rstrip("\r\n")
for i in range(1, 10):
ans = "Yes" if n.count(str(i)*3)>0 else "No"
if (ans == "Yes"):break
print(ans) |
p03478 | s673736515 | Wrong Answer | N,A,B=map(int,input().split())
Answer=[]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i*10**3+j*10**2+k*10+l<=N and A<=i+j+k+l<=B:
Answer.append(i*10**3+j*10**2+k*10+l)
print(sum(Answer))
|
p03069 | s011128940 | Wrong Answer | N = int(input())
S = input()
max_w = S.count(".")
if max_w == 0 or max_w == N:
print(0)
exit()
ans = float("inf")
b, w = 0, max_w
for s in S:
if s == "#":
b += 1
else:
w -= 1
ans = min(ans, b+w)
print(ans)
|
p03087 | s608631821 | Wrong Answer | #ABC122C
def main():
import sys
S = sys.stdin.readline().rstrip()
#print(S)
cnt = 0
ans = 0
for s in S:
if s in ['A', 'G', 'C', 'T']:
cnt +=1
else:
ans = max(ans, cnt)
cnt=0
ans = max(ans, cnt)
print(ans)
... |
p03605 | s567127767 | Accepted | s=int(input())
if s%10==9 or s//10==9:
print("Yes")
else:
print("No") |
p02916 | s039172124 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
cnt = 0
for i in range(n-1):
if a[i]+1==a[i+1]:
cnt += c[a[i]-1]
bb = sum(b)
print(bb+cnt) |
p02641 | s496229348 | Accepted | x, n = map(int, input().split())
p = list(map(int, input().split()))
ans = []
sortlist = []
if n == 0:
print(x)
else:
p.sort()
p1 = p[0]
pn = p[n-1]
new = [i for i in range(0, 102)]
nolist = set(new) ^ set(p)
nolist = list(nolist)
for i in range(0, len(nolist)):
d = abs(nolist[i... |
p02987 | s001069363 | Accepted | s = input()
use = set()
for i in range(4):
use.add(s[i])
if len(use) != 2:
print("No")
exit()
if (s[0] == s[1] and s[1]==s[2]) or (s[0] == s[1] and s[1] == s[3]) or (s[0] == s[2] and s[2] == s[3]) or (s[1]== s[2] and s[2]== s[3]):
print("No")
exit()
print("Yes") |
p02947 | s309407513 | Accepted | from collections import defaultdict
n = int(input())
dic = defaultdict(int)
cnt = 0
for i in range(n):
s = sorted(input())
cnt += dic[''.join(s)]
dic[''.join(s)] += 1
print(cnt) |
p03126 | s993965443 | Accepted | """
author : halo2halo
date : 9, Jan, 2020
"""
import sys
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, M = map(int, readline().split())
se = set(range(M + 1))
for _ in range(N):
enquete = [int(x) for ... |
p03107 | s261787040 | Wrong Answer | r = 0
b = 0
for a in input():
if a == '0':
r += 1
else:
b += 1
print(min(r, b)) |
p02796 | s193791576 | Accepted | from collections import deque
N = int(input())
X = [0]*N
L = [0]*N
lis = deque()
for i in range(N):
X[i], L[i] = map(int, input().split())
lis.append([i,X[i]-L[i], X[i]+L[i]])
lis = sorted(lis, key=lambda x:x[2])
lis = deque(lis)
end = lis[0][2]
start = lis[0][1]
lis.popleft()
cnt = 1
while lis:
x, y, z =... |
p03162 | s572502987 | Accepted | n = int(input())
a, b, c = [], [], []
for _ in range(n):
ai, bi, ci = map(int, input().strip().split())
a.append(ai)
b.append(bi)
c.append(ci)
dp = []
dp.append((a[0], b[0], c[0]))
for i in range(1, n):
prev = dp[i-1]
chosen_a = a[i] + max(prev[1], prev[2])
chosen_b = b[i] + max(prev[0], pre... |
p02606 | s647215764 | Wrong Answer | l,r,d = map(int,input().split())
a=l/d
b=r/d
if l==1:
a=0
print(int(b)-int(a)) |
p02771 | s048626147 | Accepted | A, B, C = map(int, input().split())
x = set([A, B, C])
if len(x) == 2:
print('Yes')
else:
print('No')
|
p02601 | s981296494 | Accepted | import sys
input = sys.stdin.readline
a, b, c = map(int, input().split())
k = int(input())
def two(num):
for i in range(1,8):
if (2**(i-1)<=num) & (num<2**(i)):
return i
return 0
ab = two(a/b)
b_ = b*2**ab
b_c = two(b_/c)
if k>=(ab+b_c):
print("Yes")
else:
print("No")
|
p03693 | s848413939 | Wrong Answer | # -*- coding: utf-8 -*-
r, g, b = map(int, input().split())
n = r*100 + g*10 + b
if n%4 == 0:
print("YES")
else:
print("No") |
p02730 | s405020858 | Accepted | s=input()
wlist=[]
for ch in s:
wlist.append(ch)
N=len(wlist)
F=int((N-1)/2)
A=int((N+3)/2)
r=0
for i in range(F-1):
if wlist[i]!=wlist[N-1-i]:
r=r+1
if wlist[i]!=wlist[F-1-i]:
r=r+1
if wlist[A-1+i]!=wlist[N-1-i]:
r=r+1
if r==0:
print('Yes')
else:
print('No') |
p03804 | s469915592 | Wrong Answer | n, m = map(int, input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
for i in a:
for j in b:
if j not in a:
print("No")
exit()
print("Yes")
|
p03680 | s483563924 | Wrong Answer | import sys
N=int(input())
a = [int(input()) for _ in range(N)]
cnt=1
t=1
for i in range(10000):
cnt+=1
t=a[t-1]
if a[t-1]==2:
print(cnt)
sys.exit()
print(-1) |
p03565 | s281677362 | Wrong Answer | s = input()
t = input()
def match(i):
for j in range(len(t)):
if not s[i+j] == '?' and s[i+j] != t[j]:
return False
return True
for i in range(len(s) - len(t), -1, -1):
if not match(i):
continue
for j in range(i):
print('a' if s[j] == '?' else s[j], end='')
print(t, end='')
for j in ran... |
p02958 | s071275179 | Accepted | n = int(input())
li1 = list(map(int,input().split()))
li2 = sorted(li1)
cnt = 0
for i in range(n):
if li1[i] != li2[i]:
cnt += 1
if cnt>2:
print('NO')
else:
print('YES')
|
p03943 | s744140245 | Accepted | l = list(map(int, input().split()))
l.sort(reverse=True)
if l[0] == l[1] + l[2]:
print('Yes')
else:
print('No') |
p03408 | s278826691 | Wrong Answer | s_num=int(input())
s=[]
s=[input(x) for x in range(s_num)]
t=[]
t_num=int(input())
t=[input(x) for x in range(t_num)]
max_v=0
for i in range(s_num):
if max_v < (s.count(s[i]) - t.count(s[i])):
max_v = (s.count(s[i]) - t.count(s[i]))
print(max_v) |
p03693 | s559306372 | Accepted | n = input().replace(" ","")
if int(n)%4==0:
print("YES")
else:
print("NO") |
p03059 | s907832144 | Accepted | a,b,t = map(int,input().split())
print(t//a*b) |
p02705 | s849723556 | Accepted | import math
r = int(input())
circle = r*2*math.pi
print(circle) |
p03251 | s131535722 | Wrong Answer | n, m, x, y = map(int, input().split())
if x>y :
print('War')
else:
X = sorted(list(map(int, input().split())))
Y = sorted(list(map(int, input().split())))
for i in range(x+1, y+1):
if X[-1]<i and i <= Y[0]:
print('No War')
break
else :
print('War')
... |
p03759 | s844702811 | Accepted | a,b,c = map(int,input().split())
print('YES' if b-a == c-b else 'NO') |
p02761 | s006676398 | Wrong Answer | import sys
n,m = map(int, input().split())
num = [0]*n
Ans = 0
for i in range(m):
s,c = map(int, input().split())
if num[s-1] != 0 and num[s-1] != c:
print(-1)
sys.exit()
else:
num[s-1] = c
if num.count(0)==n:
print(-1)
sys.exit()
if num[0] == 0:
num[0] = 1
for i in range... |
p02917 | s872161214 | Accepted | import sys
N=int(input())
B=list(map(int,input().split()))
if(N==2):
print(B[0]*2)
sys.exit()
before=B.pop(0)
ans=before
for b in B:
ans+=min(before,b)
before=b
ans+=B[-1]
print(ans) |
p03419 | s137602511 | Accepted | a,b=map(int,input().split())
if a==1 and b==1:
print(1)
elif a==1:
print(b-2)
elif b==1:
print(a-2)
else:
print((a-2)*(b-2)) |
p04034 | s441948199 | Wrong Answer | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
from fractions import gcd
#input=sys.stdin.readline
import bisect
n,m=map(int,input().split())
num=[1]*n
s=set()
s.add(1)
ans=1
for i in range(m):
... |
p02603 | s302468744 | Accepted | N = int(input())
A = list(map(int,input().split()))
money = 1000
stock = 0
for i in range(N-1):
if stock == 0:
if A[i] <= A[i+1]:
num = money // A[i]
money -= num * A[i]
stock += num
else:
if A[i] >= A[i+1]:
money += stock * A[i]
stock ... |
p02689 | s894862579 | Accepted | n,m=map(int,input().split())
H=list(map(int,input().split()))
L=[[h,[]] for h in H]
for i in range(m):
a,b=map(int,input().split())
L[a-1][1].append(b-1)
L[b-1][1].append(a-1)
c=0
for l in L:
h=l[0]
if all([h>L[i][0] for i in l[1]]):c+=1
print(c) |
p03486 | s190686700 | Accepted | import bisect,collections,copy,itertools,math,string
import sys
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():
s = S()
t ... |
p02873 | s539038766 | Accepted | s = input()
n = len(s)
a = [0]*(n+1)
for i in range(n):
if s[i] == '<':
a[i+1] = max(a[i+1], a[i]+1)
if s[n-i-1] == '>':
a[n-i-1] = max(a[n-i-1], a[n-i]+1)
print(sum(a)) |
p03698 | s678442263 | Wrong Answer | s = input()
l = []
for i in s:
if i in l:
print('No')
exit()
else:
l.append(i)
print('Yes') |
p02546 | s696560970 | Accepted | s = input().strip()
if s.endswith("s"):
s+="es"
else:
s+='s'
print(s) |
p03069 | s908665908 | Accepted | import numpy as np
def f(lst):
return np.cumsum(lst)
n = int(input())
s = input()
res1 = s.count('.')
res2 = s.count('#')
a = [0]*n
b = [0]*n
for i in range(n):
if s[i]=='.':
a[i] += 1
else:
b[i] += 1
cum_a = f(a).tolist()
cum_b = f(b).tolist()
res3 = np.inf
for i in range(n):
if a[i... |
p03994 | s025090887 | Accepted | s = list(input())
k = int(input())
t = list(map(lambda x:ord(x)-ord("a"),s))
for i in range(len(t)):
diff = 26-t[i]
if diff != 26 and diff <= k:
t[i]+=diff
k-=diff
t[-1]+=k
u = "".join(list(map(lambda x:chr((x%26+ord("a"))),t)))
print(u) |
p03262 | s623231366 | Wrong Answer | # 最大公約数
def gcd(a,b):
while b != 0:
a,b = b, a%b
return a
n,x = map(int,input().split())
X = list(map(int, input().split()))
X.sort()
dist = []
if len(X) == 1:
print(abs(X[0]-x))
exit()
for i in range(len(X)-1):
dist.append(X[i+1] - X[i])
ans = 0
for d in dist:
ans = gcd(ans,d)
print(an... |
p03759 | s405020825 | Wrong Answer | a, b, c = map(int, input().split())
if b - a == c - b:
print("Yes")
else:
print("No") |
p03555 | s861930844 | Accepted | c1 = input().strip()
c2 = input().strip()
if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
print("YES")
else:
print("NO")
|
p02766 | s628783963 | Accepted | n, k = map(int, input().split())
def base_10_to_n(x, n):
if (int(x/n)):
return base_10_to_n(int(x/n), n)+str(x % n)
return str(x % n)
print(len(base_10_to_n(n, k)))
|
p03150 | s318417211 | Accepted | s=input()
str1="keyence"
count=0
num=len(s)
if s==str1:
yn=0
elif s[:7]==str1:
yn=0
elif s[num-8:]==str1:
yn=0
else:
for i in range(7):
if str1[i]==s[i]:
count+=1
else:
break
if s[num-7+count:]==str1[count:]:
yn=0
else:
yn=1
if yn==0:
p... |
p02786 | s861324541 | Wrong Answer | def calc(x):
if x == 0:
return 1;
return 2 * calc(x//2) + 1;
h = int(input())
print(calc(h)) |
p04033 | s224982961 | Accepted | a, b = map(int, input().split())
if a <= 0 <= b:
print('Zero')
elif a > 0 and b > 0:
print('Positive')
elif a < 0 and b < 0:
if (abs(a-b)+1) % 2 == 0:
print('Positive')
else:
print('Negative')
|
p03485 | s266563133 | Accepted | a, b = map(int, input().split())
print(-(-(a+b)//2))
|
p03127 | s578832156 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ln = []
for i in a:
for j in a:
ln.append(min((max(i, j) % min(i, j)), min(i, j) - (max(i, j) % min(i, j))))
ln = [x for x in ln if x != 0]
if ln == []:
print(min(a))
else:
print(min(ln)) |
p02983 | s524541404 | Wrong Answer | l, r = map(int, input().split())
mod = min(l%2019, r%2019)
print(mod*(mod+1))
|
p02697 | s142602241 | Accepted | n, m = map(int, input().split())
ans = []
p = 1
q = 2 * ((m + 1) // 2)
for i in range((m + 1) // 2):
ans.append((p, q))
p += 1
q -= 1
p = 2 * ((m + 1) // 2) + 1
q = p + (m // 2) * 2
for i in range(m // 2):
ans.append((p, q))
p += 1
q -= 1
for row in ans[:m]:
print(row[0], row[1])
|
p02555 | s944483295 | Accepted | import math
n = int(input())
mod = 10**9+7
ans = 0
for i in range(1, n):
if n/3 < i:
break
ans = (ans + math.comb(n-3*i+i-1, i-1) % mod) % mod
print(ans)
|
p02658 | s238903467 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
a=1
for i in range(n):
a*=l[i]
if a>10**8:
print(-1)
else:
print(a) |
p02993 | s550043859 | Accepted | def atc_131a(input_value: str) -> str:
for i in range(0, len(input_value) - 1):
if input_value[i] == input_value[i + 1]:
return "Bad"
return "Good"
input_value = input()
print(atc_131a(input_value)) |
p02622 | s403580166 | Wrong Answer | s = input()
t = input()
u = 0
if s == t:
print(0)
else:
for i in range(len(s)):
if s[i] == t[i]:
u += 1
print(u) |
p03281 | s170188876 | Wrong Answer | n = int(input())
ans = 0
A = [i for i in range(n+1)]
A = A[1:n+1:2]
for i in range(len(A)):
a=0
for j in range(len(A)):
if A[i] % (j+1) == 0:
a += 1
if a == 8:
ans += 1
print(ans)
|
p02699 | s771379868 | Accepted | s,w = map(int,input().split())
print("safe") if w < s else print("unsafe") |
p02900 | s032070122 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
from fractions import gcd
def prime_fact(m):
pf={}
for i in range(2,int(m**0.5)+1):
while m%i==0:
pf[i]=pf.get(i,0)+1
m//=i
if m>1:pf[m]=1
return list(pf)
def main():
a,b=map(int,input().split())
print(1... |
p03285 | s816299098 | Accepted | n = int(input())
for i in range(n // 4 + 1):
for j in range(n // 7 + 1):
if 4 * i + 7 * j == n:
print('Yes')
exit()
print('No') |
p03285 | s312297205 | Wrong Answer | import math
N = int(input())
str == 'No'
for i in range (math.floor( N/4 )+1):
for j in range(math.floor(N/7)+1):
if 4*i + 7*j == N:
str = 'Yes'
print(str) |
p03778 | s421920828 | Accepted | W,a,b=map(int, input().split())
if a+W<=b:
print(b-(a+W))
elif a+W>b and a<=b:
print(0)
elif a>b and a<b+W:
print(0)
elif a>=b+W:
print(a-(b+W)) |
p03827 | s272738766 | Wrong Answer | N = int(input())
S = input()
a = 0
for i in range(N):
a = max(a,S[:i].count('I')-S[:i].count('D'))
print(a)
|
p02676 | s061311350 | Accepted | k = int(input())
s = input()
if len(s) <= k:
print(s)
else:
print(s[:k] + '...') |
p02729 | s964129041 | Accepted | n, m = map(int, input().split())
ans = (n * (n - 1) // 2) + (m * (m - 1) // 2)
print(ans) |
p03416 | s918820869 | Wrong Answer | a,b = input().split()
cnt = 0
A1 = int(a[1])*10+int(a[0])
A2 = int(a[-2])*10+int(a[-1])
B1 = int(b[1])*10+int(b[0])
B2 = int(b[-2])*10+int(b[-1])
if A1 -A2 >= 0:
cnt += 1
if B1 - B2 > 0:
cnt -= 1
cnt += (int(b)-int(a))//100
print(cnt) |
p02787 | s623725730 | Accepted | # coding: utf-8
def solve(*args: str) -> str:
h, n = map(int, args[0].split())
AB = [tuple(map(int, s.split())) for s in args[1:]]
inf = 10**12
dp = [inf]*(h+1)
dp[0] = 0
for a, b in AB:
for i, m in enumerate(dp):
k = min(h, i+a)
dp[k] = min(dp[k], dp[i]+b)
... |
p02697 | s987580703 | Accepted | N, M = map(int, input().split())
halfPos = -(-N//2)
qPos = halfPos // 2
q3Pos = qPos + halfPos
for m in range(1, M+1):
if m % 2:
print(qPos-m//2, qPos+m//2+1)
else:
print(q3Pos-m//2, q3Pos+m//2) |
p03951 | s227173911 | Accepted | n = int(input())
s = input()
t = input()
for i in range(n):
if s[i:] == t[:n-i]:
print(n-i+i*2)
break
else:
print(2*n) |
p02723 | s594940375 | Wrong Answer | s=input()[2::];print('Yes' if len(set(s))==2 else 'No') |
p02860 | s071474568 | Accepted | N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
t = S[i]
T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
if i == k:
y += 1
else:
n += 1
if int(N % 2) != 0:
print('No')
elif y == int(N / 2):
print('Yes')
else:
print('No') |
p03329 | s434749174 | Wrong Answer | import numpy as np
N=int(input())
six=[1]
nine=[]
for i in range(1,N):
six.append(6**i)
nine.append(9**i)
if 6**i>N:
break
six=np.array(six)
nine=np.array(nine)
L=np.concatenate([six,nine])
now=N
count=0
dp=np.ones(N+L.max()+1)*np.inf
dp[1]=1
#dp[i+1] iをちょうど引き出すのに必要な最小回数
for i in range(1,N):
dp[i+1]=(dp... |
p03659 | s900789167 | Accepted | input()
cards = tuple(map(int, input().split(' ')))
a = sum(cards[1:])
s = cards[0]
diff_min = abs(a - s)
for card in cards[1:-1]:
a -= card
s += card
diff_min = min(diff_min, abs(a - s))
print(diff_min)
|
p02718 | s377748258 | Accepted | n=input().split()
m=input().split()
N=n[0]
Nn=n[1]
l = 0
a = 0
for k in range(int(N)):
a+=int(m[k])
for i in range(int(N)):
if int(m[i])/(a/(int(Nn)*4)) >= 1:
l+=1
if l >= int(Nn) :
print("Yes")
else :
print("No") |
p03206 | s521527342 | Accepted | def i():
return int(input())
def i2():
return map(int,input().split())
def s():
return str(input())
def l():
return list(input())
def intl():
return list(int(k) for k in input().split())
d = i()
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif d == 23:
print("Christmas Eve Eve")
else:
... |
p02552 | s360080768 | Accepted | n = int(input())
if n == 0:
print(1)
if n == 1:
print(0) |
p03680 | s139764103 | Accepted | n = int(input())
a = [int(input()) for i in range(n)]
chk = [False for i in range(n)]
c = 0
d = 0
while True:
if chk[c]:
print (-1)
exit()
else:
chk[c] = True
if c == 1:
print (d)
exit()
c = a[c]-1
d += 1 |
p02555 | s861436631 | Accepted | a=1
b=c=0
exec('a,b,c=b,c,a+c;'*int(input()))
print(a%(10**9+7)) |
p03379 | s431494571 | Wrong Answer | # input
N = int(input())
X = list(map(int, input().split()))
# check
l, r = N // 2 - 1, N // 2
X.sort()
lx, rx = X[l], X[r]
for ind in range(N):
if ind <= l:
print(rx)
else:
print(lx) |
p02952 | s222343347 | Accepted | import math
def dig(n):
return math.floor(math.log10(n))+1
ans = 0
for i in range(int(input())):
ans += (dig(i+1) % 2 == 1)
print(ans) |
p03073 | s556743531 | Accepted | S=list(input())
ans=0
for i in range(1,len(S)):
if S[i-1]==S[i]: ans+=1; S[i]= '0' if S[i]=='1' else '1'
print(ans) |
p02848 | s499052569 | Accepted | N = int(input())
S = input()
a = ""
b = []
List = ["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"]
for i in range(len(S)):
a = S[i]
c = List.index(a)
c = c + N
if 25 < c:
c = c - 26
b.append(List[c])
for i i... |
p03435 | s621092741 | Wrong Answer | c=[]
for i in range(3):
c.append(list(map(int, input().split())))
c_sum = sum(c[0] + c[1] + c[2])
if c_sum//3 <= 100 and c_sum % 3 == 0:
print("Yes")
else:
print("No") |
p02718 | s400432277 | Accepted | N, M = map(int, input().split())
A_array = list(map(int, input().split()))
item = 0
vote_sum = sum(A_array)
boarder = vote_sum / (4 * M)
for a in A_array:
if a >= boarder:
item += 1
if item >= M:
print("Yes")
else:
print("No")
|
p02742 | s429958018 | Wrong Answer | H, W = map(int, input().split())
print((H * W + 1) // 2) |
p02829 | s154666226 | Wrong Answer | a = int(input())
b = int(input())
if a == 2 and b == 3 or b == 3 and a == 2:
print('1')
elif a == 1 and b == 2 or b == 1 and a == 2:
print('3')
else:
print('2')
|
p03612 | s655055437 | Accepted | 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)
|
p03679 | s737212451 | Accepted | a,b,c=map(int,input().split())
if b-c>=0:
print("delicious")
elif a+b-c>=0:
print("safe")
else:
print("dangerous") |
p02797 | s271405915 | Wrong Answer | n, k, s = map(int, input().split())
for i in range(1, n+1):
if i <= k+1:
if s %2 == 1 and i % 2 == 1:
print(s//2 + 1)
else:
print(s//2)
else:
print(s//2+5) |
p02675 | s931631780 | Accepted | N = input()
if N[-1] == '2' or N[-1] =='4' or N[-1] == '5' or N[-1] == '7' or N[-1] == '9':
print('hon')
elif N[-1] == '3':
print('bon')
else:
print('pon') |
p03077 | s021465483 | Accepted | import math
lis = []
n = int(input())
for i in range(5):
lis.append(int(input()))
print(math.ceil(n/min(lis))+4) |
p02838 | s213462968 | Accepted | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7... |
p04020 | s795687640 | Accepted | def main():
N = int(input())
A = [int(input()) for _ in range(N)]
ans = A[0] // 2
s = A[0] % 2
for a in A[1:]:
diff_p = min(s, a)
self_p = (a - diff_p) // 2
ans += diff_p + self_p
s = a - diff_p - 2 * self_p
print(ans)
if __name__ == '__main__':
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.