problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03944 | s465305031 | Wrong Answer | w,h,n = map(int, input().split())
xya = [list(map(int, input().split())) for i in range(n)]
x2 = w
x1 = 0
y2 = h
y1 = 0
for a,b,c in xya:
if c == 1 and 0 <= a <= w:
x1 = a
elif c == 2 and 0 <= a <= w:
x2 = a
elif c == 3 and 0 <= b <= h:
y1 = b
elif c == 4 and 0 <= b <= h:
... |
p03804 | s238311565 | Accepted | N,M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1):
C = [A[k][i:i+M] for k in range(j, j+M)]
if B == C:
print('Yes')
exit()
print('No') |
p02659 | s567879723 | Accepted | a, b = input().split()
a = int(a)
b100 = int(b[0])*100 + int(b[2])*10 + int(b[3])
print(a * b100 // 100)
|
p02783 | s324055669 | Accepted | h, a = [int(x) for x in input().split()]
if h % a == 0:
print(h // a)
else:
print(h // a + 1) |
p02952 | s869663407 | Wrong Answer | n = int(input())
sum = 0
for i in range(5):
if n == 100000:
sum = 90909
break
elif 10**i <= n < 10**(i+1):
if (i+2) % 2 == 0:
sum += n - 10**i + 1
break
else:
break
else:
if (i+2) % 2 == 0:
sum += 9 * (10**(2*i))
print(s... |
p03071 | s436652333 | Accepted | a, b = map(int, input().split())
if a == b:
ans = a + b
else:
ans = max(a, b) + max(a-1, b -1)
print(ans) |
p02720 | s185071064 | Wrong Answer | from collections import deque
k=int(input())
deq=deque([1,2,3,4,5,6,7,8,9])
for i in range(k):
a=deq.popleft()
if not a%10==0:
deq.append(a*10+a%10-1)
deq.append(a*10+a%10)
if a%10==9:
deq.append(a*10+a%10+1)
print(a)
|
p03427 | s542849707 | Accepted | N=str(input())
L=len(N)
dp=[[0]*2 for _ in range(L)]
dp[0][0]=int(N[0])
dp[0][1]=int(N[0])-1
for i in range(1,L):
dp[i][1]=max(dp[i-1][0]+max(0,int(N[i])-1),dp[i-1][1]+9)
dp[i][0]+=(dp[i-1][0]+int(N[i]))
print(max(dp[L-1][0],dp[L-1][1])) |
p03998 | s542712528 | Wrong Answer | from collections import defaultdict
data = defaultdict()
for i in range(3):
s = input()
data[chr(ord("a") + i)] = s
cnt = [0] * 3
turn = "a"
while 1:
if cnt[ord(turn) - ord("a")] == len(data[chr(ord(turn))]):
ans = ord(turn) - (ord("a") - ord("A"))
break
turn = data[chr(ord(turn))][cn... |
p03910 | s635797377 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: B
# CreatedDate: 2020-07-30 16:55:09 +0900
# LastModified: 2020-07-30 18:15:00 +0900
#
import os
import sys
# import numpy as np
# import pandas as pd
def main():
n = int(input())
if n == 1:
print(1)
return
if n % 2 == 0:
... |
p02732 | s938341054 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
uA = list(set(A))
c = {u:A.count(u) for u in uA}
la = {}
lb = {}
for a in uA:
la[a] = int(c[a]*(c[a]-1)/2)
lb[a] = int((c[a]-1)*(c[a]-2)/2)
for a in A:
ks = list(la.values())
b = lb[a] + sum([k for k in ks if k !=a])
print(b) |
p04012 | s369617592 | Accepted | w=input()
a=list('abcdefghijklmnopqrstuvwxyz')
for A in a:
if w.count(A) % 2 == 1:
print('No')
exit()
print('Yes') |
p02793 | s502472429 | Accepted | from fractions import gcd
N = int(input())
A = tuple(map(int, input().split()))
MOD = 10 ** 9 + 7
def modinv(a, mod=10 ** 9 + 7):
return pow(a, mod - 2, mod)
lcm = A[0]
for i in range(1, N):
lcm = (lcm * A[i] // (gcd(lcm, A[i])))
ans = 0
lcm %= MOD
for a in A:
ans = (ans + lcm * modinv(a)) % MOD
print... |
p02602 | s462266306 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(0,n-k):
if a[i]<a[i-n+k+2]:
print('Yes')
else:
print('No') |
p02717 | s391113634 | Accepted | x,y,z = map(int,input().split())
print(z,x,y) |
p02760 | s026986961 | Accepted | a=[list(map(int,input().split()))for _ in range(3)]
for i in range(int(input())):
b=int(input())
for j in range(3):
for k in range(3):
if a[j][k]==b:a[j][k]=0
ans="No"
for i in range(3):
if a[i][0]==a[i][1]==a[i][2]==0:ans="Yes"
if a[0][i]==a[1][i]==a[2][i]==0:ans="Yes"
if a[0][0]==a[1][1]==a[2][2]==0... |
p02773 | s111190087 | Accepted | import numpy as np
n = int(input())
s_list = [input() for i in range(n)]
new_dict = {}
for s in s_list:
if s not in new_dict.keys():
new_dict[s] = 1
else:
new_dict[s] += 1
values = []
keys = []
for key in new_dict.keys():
values.append(new_dict[key])
keys.append(key)
valu... |
p02909 | s037475298 | Wrong Answer | s = input()
a = ["Sunny", "Cloudy","Rainy"]
if(s == a[0]):
print(a[1])
elif(a == a[1]):
print(a[2])
else:
print(a[0]) |
p03407 | s549129539 | Accepted | a,b,c = map(int,input().split())
if a+b >= c:
print("Yes")
else:
print("No") |
p03323 | s493777500 | Accepted | a,b = map(int, input().split())
if a<=8 and b<=8:
print("Yay!")
else:
print(":(") |
p02790 | s719862773 | Wrong Answer | N,M = map(int, input().split())
print(str(max(N,M)) * min(N,M)) |
p03254 | s616460539 | Accepted | n,x = map(int,input().split())
a = list(map(int,input().split()))
cnt = 0
a.sort()
for i in range(n):
if x - a[i] >= 0:
cnt += 1
x -= a[i]
else:
break
if x == 0 or cnt < n:
print(cnt)
else:
print(cnt-1) |
p03632 | s838028223 | Accepted | A, B, C, D = map(int, input().split())
a = set(range(A, B))
b = set(range(C, D))
c = a& b
print(len(c)) |
p03455 | s669198351 | Accepted | a,b=map(int,input().split())
print("Even" if a*b%2==0 else "Odd") |
p03206 | s793822034 | Accepted | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
d = ni()
if d == 25:
print("Christmas")
elif d == 24:
print("Christmas Eve")
elif... |
p02813 | s319941348 | Wrong Answer | import itertools
def countOrder(n, plist, qlist):
ans = 0
p = 0
q = 0
irelist = list(itertools.permutations(range(1, n+1), n))
for index, i in enumerate(irelist):
if i == plist:
p = index
elif i == qlist:
q = index
ans = abs(p-q)
return ans
def ... |
p03711 | s336814988 | Wrong Answer | a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
acount = 0
bcount = 0
ccount = 0
x, y = input().split()
for i in range(0, 7):
if int(x) == a[i] or int(y) == a[i]:
acount += 1
for i in range(0, 4):
if int(x) == b[i] or int(y) == b[i]:
bcount += 1
if int(x) == c[0]:
ccount += 1
if in... |
p02880 | s319753445 | Accepted | N=int(input())
boo=False
for i in range(1,10):
for j in range(1,10):
if i*j==N:
boo=True
break
if boo==True:
print("Yes")
else:
print("No")
|
p03206 | s784469096 | Wrong Answer | S=int(input())
if S==25:
print('Crisitmas')
if S==24:
print("Christmas Eve")
if S==23:
print("Christmas Eve Eve")
if S==22:
print("Christmas Eve Eve Eve")
|
p02947 | s485238554 | Wrong Answer | from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
cnt = 0
d = {}
for i in range(n):
sortsi = ''.join(sorted(s[i]))
#print(sortsi)
if sortsi in d: cnt+=1
else: d[sortsi]=1
print(cnt) |
p02724 | s363062995 | Accepted | x = int(input())
u = 0
u += (x - (x % 500) ) * 2
u += (x - (x // 500) * 500 ) // 5 * 5
print(u) |
p03719 | s574801392 | Accepted | a,b,c=map(int,input().split());print("Yes" if c>=a and c<=b else "No") |
p02608 | s989458100 | Accepted | N = int(input())
ans = [0 for _ in range(N)]
for x in range(1, 1000):
if x**2 > N:
continue
for y in range(1, 1000):
if x**2 + y**2 > N:
break
for z in range(1, 1000):
n = x**2 + y**2 + z**2 + x*y + y*z + z*x
if n <= N:
ans[n-1] += 1
... |
p03059 | s381624781 | Wrong Answer | import sys
A, B, T = map(int, input().split())
t = 1
ans = 0
if A > T:
print(0)
sys.exit()
while t < T:
ans += B
t += A
print(ans)
|
p03250 | s693398362 | Accepted | values = list(map(int, input().split(' ')))
m = max(values)
values.remove(m)
print(10 * m + sum(values))
|
p03835 | s811931251 | Accepted | k,s = map(int,input().split())
cnt = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s-x-y <= k:
cnt += 1
print(cnt)
|
p03944 | s671601066 | Accepted | w, h, n = map(int, input().split())
OPS = list(list(map(int, input().split())) for _ in range(n))
l, r, t, b = 0, w, h, 0
for i in OPS:
if i[2] == 1 and i[0] > l:
l = i[0]
elif i[2] == 2 and i[0] < r:
r = i[0]
elif i[2] == 3 and i[1] > b:
b = i[1]
elif i[2] == 4 and i[1] < t:
... |
p03836 | s899273855 | Accepted | # UU R DD L
#LUUU RR DR DDD LLU
sx, sy, tx, ty = map(int, input().split())
print('U'*abs(ty-sy),
'R'*abs(tx-sx),
'D'*abs(ty-sy),
'L'*abs(tx-sx),
'L',
'U'*(abs(ty-sy)+1),
'R'*(abs(tx-sx)+1),
'DR',
'D'*(abs(ty-sy)+1),
'L'*(abs(tx-sx)+1),
... |
p03485 | s515437236 | Wrong Answer | a, b = map(int, input().split())
print(round((a + b) / 2))
|
p02996 | s653437337 | Wrong Answer | x = int(input())
job = []
time = []
for i in range(x):
j, t = list(map(int, input().split()))
job.append(j)
time.append(t)
jt = 0
tt = 0
f = 0
for i in range(x):
if job[i] <= time[i]:
pass
else:
print("No")
f = 1
break
jt += job[i]
if tt < time[i]:
tt ... |
p03208 | s498012324 | Accepted | N, K, *h = map(int, open(0).read().split())
h = sorted(list(h))
print(min(h[i + K - 1] - h[i] for i in range(N - K + 1)))
|
p03146 | s567137235 | Wrong Answer | s = int(input())
def f(n):
if n%2==0:
return n//2
else:
return 3*n+1
cnt = 0
m = 1
S = -1
while True:
s = f(s)
m = m+1
if cnt == 0 and s in [4,2,1]:
S = s
cnt=1
continue
if s == S:
print(m)
else:
continue
break |
p03035 | s424630674 | Wrong Answer | #ABC127 A
A, B = map(int,input().split())
if A >= 13:
print(B)
elif 6 <= A <= 12:
print(B/2)
elif A <= 5:
print(0) |
p03103 | s637151314 | Wrong Answer | n,m=map(int,input().split())
AB=[]
for i in range(n):
a,b=map(int,input().split())
AB.append((a,b))
AB.sort()
cnt=0
ans=0
for a,b in AB:
if cnt==m:
print(ans)
break
temp=min(m-cnt,b)
ans+=a*temp
cnt+=temp |
p02608 | s336451592 | Accepted | # C - XYZ Triplets
from collections import Counter
def main():
N = int(input())
calc = lambda x, y, z: x ** 2 + y ** 2 + z ** 2 + x * y + y * z + z * x
lim = int(N ** 0.5) + 1
cnt = Counter(
calc(i, j, k)
for i in range(1, lim + 1)
for j in range(1, lim + 1)
for k in ra... |
p03328 | s252126628 | Accepted | import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
a, b = [int(num) for num in lines.pop(0).split(" ")]
dif = b - a
height = dif * (dif - 1) // 2
print(height - a)
|
p03043 | s041779198 | Wrong Answer | import math
n, k = map(int, input().split())
pro = 0
if n < k:
for i in range(1,n+1):
if k/i % 2 == 0:
x = int(math.log2(k/i))
else:
x = int(math.log2(k/i)) + 1
coin = 2**x
pro += (1/n) * (1/coin)
if n >= k:
pro += (n-k+1)/n
for j in range(1,k):
if k/j % 2 == 0:
x = int(math.... |
p02899 | s851159367 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
out = [0] * n
for i in range(len(a)): out[a[i] - 1] = i + 1
print(' '.join([str(i) for i in out])) |
p02848 | s745459300 | Accepted | n=int(input())
s=input()
b=""
for i in s:
a=(ord(i)-ord("A")+n)%26
b+=chr(a+ord("A"))
print(b) |
p03759 | s051189951 | Accepted | a,b,c = map(int,input().split())
if b-a==c-b:
print('YES')
else:
print('NO') |
p02695 | s922120935 | Accepted | def c_many_requirements():
from itertools import combinations_with_replacement as h
N, M, Q = [int(i) for i in input().split()]
Queries = [[int(i) for i in input().split()] for j in range(Q)]
def calc_score(seq):
return sum(d for a, b, c, d in Queries if seq[b - 1] - seq[a - 1] == c)
return... |
p02553 | s652146664 | Wrong Answer | a,b,c,d = map(int,input().split())
if a*c >= b*d:
if a*c >= a*d:
if a*c >= b*c:
print(a*c)
if a*d >= b*d:
if a*d >= b*c:
print(a*d)
if b*c >= b*d:
print(b*c)
else:
print(b*d)
|
p02780 | s035357501 | Accepted | N, K = map(int, input().split())
P = list(map(int, input().split()))
E = [0] * N
E[0] = sum(P[:K])
for i in range(1, N-K):
E[i] = E[i-1] + P[i+K-1] - P[i-1]
E[N-K] = sum(P[N-K:])
maxE = max(E)
#print(E)
print((maxE - K) / 2.0 + K)
|
p03126 | s680931318 | Accepted | n,m = map(int,input().split())
A=[0]*(m+1)
for i in range(n):
K = list(map(int,input().split()))
for j in range(1,len(K)):
A[K[j]]+=1
print(A.count(n))
|
p04043 | s263036111 | Wrong Answer | lis = sorted(input().split())
print(lis)
if lis == ['5', '5', '7']:
print('YES')
else:
print('NO') |
p04044 | s115951033 | Accepted | number, length = map(int, input().split())
dict_list = []
for i in range(number):
dict_list.append(input())
new_dict_list = sorted(dict_list)
answer = ''.join(new_dict_list)
print(answer)
|
p04031 | s696498450 | Accepted | n = int(input())
a_list = list(map(int,input().split()))
mid = round(sum(a_list)/n)
ans = 0
for a in a_list:
ans += (a-mid) ** 2
print(ans) |
p02612 | s682710599 | Accepted | #!/usr/bin/python
# -*- Coding: utf-8 -*-
n = int(input())
if n % 1000 == 0:
print(0)
elif n > 1000:
a = (n//1000 + 1)*1000
print(a - n)
else:
print(1000 - n) |
p02988 | s568817861 | Wrong Answer | n = int(input())
p = list(map(int, input().split()))
a = 0
for i in range(n-2):
if p[i]<p[i+1] and p[i+1] < p[i+2]:
a += 1
print(a) |
p03126 | s004849103 | Wrong Answer | N, M = list(map(int, input().split()))
K, A = [0] * N, [0] * N
for i in range(N):
K[i], *A[i] = set(map(int, input().split()))
k = set(i for i in range(1, M + 1))
for j in range(N):
k = k.intersection(A[j])
print(len(k)) |
p03035 | s289496563 | Accepted | a, b = map(int, input().split())
if a >= 13:
print(b)
elif 6 <= a <= 12:
print(b // 2)
else:
print(0) |
p03160 | s532527721 | Accepted | N = int(input())
h = [int(val) for val in input().split(' ')]
dp = [0, abs(h[0]-h[1])]
for i in range(len(h)-2):
step1_cost = dp[i+1] + abs(h[i+1]-h[i+2])
step2_cost = dp[i] + abs(h[i]-h[i+2])
dp.append(min(step1_cost, step2_cost))
print(dp[-1]) |
p02982 | s237143192 | Wrong Answer | n,d=[int(x) for x in input().rstrip().split()]
l=[]
for i in range(n):
X=[int(x) for x in input().rstrip().split()]
l.append(X)
ans=0
for i in range(n):
ni=l[i]
for j in range(i+1,n):
nj=l[j]
now=0
for s in range(d):
now+=(ni[s]-nj[s])**2
now=now**0.5 |
p03543 | s092547193 | Accepted | n=input()
if n[0]==n[1]==n[2] or n[1]==n[2]==n[3]:print('Yes')
else:print('No') |
p02973 | s807383311 | Wrong Answer | n=int(input())
a=[int(input()) for _ in range(n)]
import bisect
#a=[0,2,3,4,67,8]
#a.sort()
#bisect.bisect_left(a, 4) #被ったら左側のindexを返す
#bisect.bisect_right(a, 4)#被ったら右側のindexを返す
color=[-1]
for aa in a:
i=bisect.bisect_left(color, aa)
if i==0:
color.insert(aa,0)
else:
color[i-1]=aa
... |
p02911 | s144483033 | Accepted | n, k, q = map(int, input().split())
p = int(k - q)
if p > 0:
for _ in range(n): print("Yes")
else:
a = {}
for _ in range(q):
a_i = str(input())
if a_i not in a.keys():
a[a_i] = 1
else:
a[a_i] += 1
for i in range(1, n+1):
if str(i) not in a.keys(): ... |
p04034 | s288093815 | Wrong Answer | n,m=map(int,input().split())
check=[False]*n
check[0]=True
ball=[1]*n
for i in range(m):
x,y=map(int,input().split())
x-=1
y-=1
if check[x]:
check[y]=True
else:
continue
ball[y]+=1
ball[x]-=1
if ball[x]==0:
check[x]=False
ans=0
for chk in check:
if chk:
... |
p03838 | s304768997 | Accepted | x, y = (int(x) for x in input().split())
ans = 100000000000
if x <= y: ans = min(ans, y - x)
if (-1) * x <= y: ans = min(ans, y + x + 1)
if x <= (-1) *y: ans = min(ans, (-1) * y + (-1) * x + 1)
if (-1) * x <= (-1) * y: ans = min(ans, (-1) * y + x + 2)
print(ans) |
p02583 | s683693172 | Accepted | n = int(input())
l = list(map(int, input().split(' ')))
l.sort(reverse=True)
length = len(l)
ans = 0
for i in range(length-2):
for j in range(i+1,length-1):
if not l[i]==l[j]:
for k in range(j+1,length):
if not l[j]==l[k]:
if l[i]<l[j]+l[k]:
... |
p02578 | s932232536 | Accepted | n = int(input())
h = [int(i) for i in input().split()]
m = h[0]
s = 0
for i in h:
if(i > m):
m = i
else:
s += m - i
print(s) |
p03254 | s467017984 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = 0
for i in range(n):
if a[i] <= x:
ans += 1
x -= a[i]
else:
break
else:
if x != 0:
ans -= 1
print(ans)
|
p03284 | s812962018 | Accepted | n, k = map(int, input().split())
print(1 if n % k != 0 else 0)
|
p02699 | s606207269 | Wrong Answer | import sys
def solve(n):
ret = 0
for i in range(n):
ret += i
return ret
def cc_export():
from numba.pycc import CC
cc = CC('my_module')
cc.export('solve', '(i4,)')(solve)
cc.compile()
if sys.argv[-1] == 'ONLINE_JUDGE':
cc_export()
exit()
else:
from my_module import solve
print(solve(100)) |
p02719 | s418535117 | Wrong Answer | n, k = map(int, input().split())
if n % k == 0:
print(0)
else:
while n > abs(n-k):
n = abs(n-k)
print(n)
|
p02802 | s180952187 | Accepted | n,m = map(int, input().split())
l = [[] for _ in range(n)]
ac,wa = (0,0)
for i in range(m):
p,s = input().split()
p = int(p)
if s == "AC":
if s not in l[p-1]:
l[p-1].append(s)
ac += 1
wa += l[p-1].count("WA")
else:
l[p-1].append(s)
print(ac,wa) |
p02790 | s928087839 | Accepted | a,b=map(int,input().split())
s=str()
t=str()
for i in range(b):
s=s+str(a)
for i in range(a):
t=t+str(b)
print(sorted([s,t])[0]) |
p03657 | s644587324 | Accepted | # A - Sharing Cookies
# A,B,A+Bのいずれかが3の倍数かどうか判定する
A,B = map(int,input().split())
if A % 3 == 0\
or B % 3 == 0\
or (A+B) % 3 == 0:
print('Possible')
else:
print('Impossible')
|
p02935 | s416276578 | Accepted | n=int(input())
v=list(map(int,input().split()))
for i in range(n):
min1=v.pop(v.index(min(v)))
min2=v.pop(v.index(min(v)))
new=(min1+min2)/2
v.append(new)
if len(v)==1:
print(new)
exit()
#for i in range(n):
|
p02618 | s824243166 | Wrong Answer | import numpy as np
a = np.arange(1, 366)
np.random.shuffle(a)
print(*a, sep='\n') |
p02689 | s305071304 | Wrong Answer | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = [0]* n
result =0
for j in range(m):
text = list(map(int,input().split()))
if h[text[0]-1] < h[text[1]-1]:
ans[text[0]-1] += 1
else:
ans[text[1]-1] += 1
for i in ans:
if i == 0:
result +=1
print(result)
|
p02947 | s818034454 | Accepted | N=int(input())
dict={}
cnt=0
for a in range(N):
s="".join(sorted(input()))
if s in dict:
dict[s]+=1
cnt+=dict[s]
else:
dict[s]=0
print(cnt) |
p02971 | s507148511 | Accepted | n=int(input())
an=[]
an=[int(input()) for i in range(n)]
s_an=sorted(an,reverse=True)
m_an=max(an)
m_an2=s_an[1]
for i in an:
if m_an==i:
print(m_an2)
else:
print(m_an) |
p02675 | s661636113 | Wrong Answer | x = input()
if x[-1] in [2,4,5,7,9]:
print("hon")
elif x[-1] in [0,1,6,8]:
print("pon")
else:
print("bon") |
p03073 | s278595737 | Wrong Answer | 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())
s = s()
cnt0 = 0
cnt1 = 0
for i in range(1,len(s)):
if i%2 == 0 :
if s[i] == "0":
cnt1 += 1
else:
cnt0 += 1
else:
... |
p03493 | s059149286 | Accepted | print(input().count('1')) |
p03360 | s345799404 | Accepted | l = list(map(int, input().split()))
k = int(input())
l.sort()
print(l[0] + l[1] + l[2] * (2 ** k)) |
p03086 | s108117766 | Wrong Answer | s = list(input())
ans = 0
cnt = 0
for i in range(len(s)):
if s[i] not in ["A", "C", "G", "T"]:
ans = max(ans, cnt)
cnt = 0
else:
cnt += 1
print(ans) |
p03086 | s128072161 | Wrong Answer | S = input()
N = len(S)
ACGT = []
others = 'BDEFHIJKLMNOPQRSUVWXYZ'
for i in range(N):
fl = True
for j in range(i+1,N+1):
tmp_S = S[i:j]
M = len(tmp_S)
for k in range(M):
if tmp_S[k] in others:
fl = False
if fl==False:
break
ACGT.app... |
p03699 | s320944464 | Accepted | N = int(input())
S = sorted([int(input()) for i in range(N)])
min_no_ten = float('inf')
for s in S:
if s % 10 != 0:
min_no_ten = s
break
else:
print(0)
exit()
total = sum(S)
if total % 10 != 0:
print(total)
else:
print(total - min_no_ten)
|
p03555 | s611086133 | Accepted | x = list(input())
y = list(input())
if x == list(reversed(y)):
print("YES")
else:
print("NO")
|
p03162 | s512708201 | Accepted | #dp[i+1][x]:i日目にxを選んだ時の総和の最大値
N = int(input())
dp = [[0 for i in range(3)] for j in range(N+1)]
for i in range(N):
a, b, c = map(int, input().split())
dp[i+1][0] = max(dp[i][1], dp[i][2]) + a
dp[i+1][1] = max(dp[i][0], dp[i][2]) + b
dp[i+1][2] = max(dp[i][0], dp[i][1]) + c
print(max(dp[N][0], dp[N][1]... |
p03408 | s687062160 | Accepted | n = int(input())
S = [input() for i in range(n)]
m = int(input())
T = [input() for j in range(m)]
ANS = []
for i in range(len(S)):
p = 0
q = 0
for j in range(len(S)):
if S[i]== S[j]:
p += 1
for k in range(len(T)):
if S[i] == T[k]:
q += -1
ANS.append(p+q)
print(max(max(ANS),0))
|
p02661 | s416884764 | Accepted | n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
a, b = map(int, input().split())
A[i] = a
B[i] = b
A.sort()
B.sort()
if n%2 == 1:
ans = B[n//2]-A[n//2]+1
else:
ans = B[n//2-1]+B[n//2]-(A[n//2-1]+A[n//2])+1
print(ans)
|
p03827 | s770490249 | Accepted | N=int(input())
S=str(input())
x=0
y=0
for i in range(N):
if S[i]=='I':
x+=1
elif S[i]=='D':
x-=1
y=max(x,y)
print(y) |
p03377 | s265319896 | Wrong Answer | A, B, X= map(int, input().split())
print("YES" if A+B>=X else "NO") |
p03487 | s399896994 | Accepted | N = int(input())
A = list(map(int, input().split()))
d = dict()
for i in range(N):
if d.get(A[i]) is None:
d[A[i]] = 1
else:
d[A[i]] += 1
ans = 0
for key, value in d.items():
if key <= value:
ans += value - key
else:
ans += value
print(ans)
|
p03493 | s422213789 | Accepted | n = input()
print(n.count("1")) |
p02784 | s340265803 | Accepted | #n = int(input())
h,n = map(int,input().split())
lst1 = list(map(int,input().split()))
if h > sum(lst1):
print("No")
else:
print("Yes") |
p02701 | s290124188 | Accepted | N = int(input())
S = [input() for i in range(N)]
print(len(set(S))) |
p02719 | s364385743 | Wrong Answer | n, k = map(int, input().split())
if n==k or k==1:
print(0)
else:
if abs(n-k)<k:
print(abs(abs(n-k)-(k)))
else:
print(abs(n-k)%k) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.