problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02677 | s469225549 | Accepted | import math
a,b,h,m = input().split()
a,b,h,m = int(a),int(b),int(h),int(m)
asin = a * math.sin(math.radians(90-30*h-0.5*m))
acos = a * math.cos(math.radians(90-30*h-0.5*m))
bsin = b * math.sin(math.radians(90-6*m))
bcos = b * math.cos(math.radians(90-6*m))
d = math.sqrt((asin - bsin)**2 + (acos - bcos)**2)
print(d) |
p02918 | s993228976 | Accepted | def solve():
N, K = map(int, input().split())
S = input()
cnt = 1
for i in range(N-1):
if S[i]!=S[i+1]:
cnt += 1
ans = N-max(1,cnt-K*2)
return ans
print(solve()) |
p03472 | s541999706 | Accepted | from math import ceil
n,h = map(int,input().split())
aa = [0]*n
bb = [0]*n
for i in range(n):
a,b = map(int,input().split())
aa[i] = a
bb[i] = b
m = max(aa)
bb.sort(reverse=True)
ans = 0
dmg = 0
for i in range(n):
if bb[i] < m or dmg >= h:
break
dmg += bb[i]
ans += 1
if dmg < h:
ans += ceil((h-dmg)/m)
print(ans)
|
p03221 | s035984661 | Wrong Answer | n,m = map(int,input().split())
l = []
s = ""
tmp = 1
for i in range(m):
p,y = map(str,input().split())
l.append([p.zfill(6),y,i+1])
l = sorted(l, key=lambda x:(x[0],x[1]))
for i in range(m):
s = ""
if i == 0 or l[i-1][0] != l[i][0]:
tmp = 1
else:
tmp += 1
s = l[i][0] + str(tmp).zfill(6)
l[i].append(s)
l = sorted(l, key=lambda x:(x[2]))
for i in range(m):
print(l[i][3]) |
p02756 | s474414002 | Accepted | s = input()
q = int(input())
f = []
b = []
h = 0
for i in range(q):
a = list(input().split())
if a[0] == "1":
f, b = b, f
h = 1 - h
elif len(a) >= 3:
if a[1] == "1":
f.append(a[2])
elif a[1] == "2":
b.append(a[2])
if h == 0:
print("".join(f[::-1]) + s + "".join(b))
else:
print("".join(f[::-1]) + s[::-1] + "".join(b)) |
p02775 | s035608640 | Wrong Answer | import sys
input = sys.stdin.readline
n=input().strip()
ans=0
nxt=0
for i in range(len(n)):
a=int(n[-i-1])+nxt
#print(a)
if a<=5:
ans+=a
nxt=0
elif 6<=a<=9:
ans+=10-a
nxt=1
elif a==10:
ans+=10-a-1
#print(ans)
a=nxt
if a<=5:
ans+=a
elif a>=6:
ans+=10-a
print(ans)
|
p02957 | s670728446 | Accepted | #A
a, b = map(int, input().split())
if (a + b) % 2 == 0:
print((a + b) // 2)
else:
print("IMPOSSIBLE") |
p03035 | s916667900 | Accepted | a,b = map(int,input().split())
if a <= 5 :
print(0)
elif 6 <= a <= 12 :
print(b//2)
else :
print(b)
|
p02988 | s803536107 | Accepted | n = int(input())
p = list(map(int, input().split()))
res = 0
for i in range(1, n-1):
if p[i-1] < p[i] < p[i+1] or p[i-1] > p[i] > p[i+1]:
res += 1
print(res)
|
p03309 | s092161809 | Accepted | def main():
N, *A = map(int, open(0).read().split())
for i in range(N):
A[i] -= i + 1
A.sort()
b = A[N // 2]
print(sum([abs(A[i] - b) for i in range(N)]))
return
main()
|
p03730 | s058564797 | Accepted | from sys import stdin
if __name__ == "__main__":
_in = [_.rstrip() for _ in stdin.readlines()]
A,B,C = list(map(int,_in[0].split(' '))) # type:list(int)
# vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
for a in range(1,B+1):
_ = (a*A)%B
if _ == C:
TF = 'YES'
break
else:
TF = 'NO'
# ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
print(TF)
|
p03986 | s161154890 | Accepted | X = input()
cntS = 0
res = 0
for x in X:
if x == "S":
cntS += 1
elif cntS > 0:
cntS -= 1
else:
res += 1
print(res + cntS)
|
p02676 | s132163122 | Wrong Answer | length=int(input())
s=input()
string = ""
if len(s) < length:
print(s)
else:
for i in range(0,length):
string += s[i]
string +="..."
print(string) |
p03605 | s614794141 | Accepted | if "9" in input():
print("Yes")
else:
print("No")
|
p02888 | s889160700 | Wrong Answer | import bisect
N = int(input())
L = sorted([int(n) for n in input().split()])
#print(L)
count = 0
for i in range(N-1):
for j in range(i+1, N):
count += bisect.bisect(L[j+1:], L[i]+L[j])
print(count) |
p02628 | s165529922 | Accepted | N,K= map(int,input().split())
p= list(map(int,input().split()))
p.sort()
print(sum(p[:K]))
|
p02953 | s514663584 | Accepted | n=int(input())
h=[int(x) for x in input().split()]
a=1
for i in range(n-1):
if h[i]>h[i+1]:
h[i+1]+=1
if h[i]>h[i+1]:
print("No")
a=0
break
if a==1:
print("Yes") |
p02759 | s022051376 | Accepted | N = input()
N = int(N) //2 + int(N)%2
print(N) |
p03345 | s438921232 | Accepted | A, B, C, K = map(int, input().split())
print(A - B if K % 2 == 0 else B - A) |
p03043 | s105605615 | Accepted | import math
n,k=map(int,input().split())
p=0
for i in range(1,n+1):
if k/i<=1:
p+=1
else:
thrw=math.ceil(math.log2(k/i))
p+=0.5**thrw
print(p/n) |
p02996 | s105240955 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
l = []
for _ in range(n):
l.append(iil())
l.sort(key=lambda x:x[1])
time = 0
for item in l:
time += item[0]
if time <= item[1]:
continue
else:
print('No')
exit()
print('Yes') |
p02779 | s863611190 | Wrong Answer | def has_duplicates(seq):
return len(seq) == len(set(seq))
iranai =input()
l = input()
if has_duplicates(l)== "TRUE":
print("YES")
else:
print("NO")
|
p02744 | s296763667 | Accepted | N = int(input())
strlist = 'abcdefghij'
def dfs(s, i):
if len(s) == N:
print(s)
else:
for j in range(i+1):
t = s + strlist[j]
if j == i:
dfs(t, i+1)
else:
dfs(t, i)
dfs('', 0) |
p03486 | s735748196 | Accepted | import sys
s = input()
t = input()
s = sorted(s)
t = sorted(t)[::-1]
N = len(s)
M = len(t)
if N < M:
if s == t[:N]:
print('Yes')
sys.exit()
N = min(N, M)
i = 0
while i < N and s[i] == t[i]:
i += 1
if i < N and s[i] < t[i]:
print('Yes')
else:
print('No')
|
p02881 | s789917624 | Accepted | def divisor(n):
i = 1
table = []
while i * i <= n:
if n%i == 0:
table.append(i)
table.append(n//i)
i += 1
table = list(set(table))
return table
def resolve():
n = int(input())
ans = float('inf')
c = divisor(n)
for a in c:
b = n//a
ans = min(ans,a+b-2)
print(ans)
resolve() |
p03434 | s964758925 | Wrong Answer | N = int(input())
score = list(map(int, input().split()))
total = 0
score.sort(reverse=True)
for i in range(0, N, 2):
if i == N-2 or i == N-1:
total = total + score[i]
else:
total = total + (score[i]-score[i+1])
print(total) |
p03339 | s274936218 | Wrong Answer | n=int(input())
s=list(input())
w=[0]*n
for i in range(n):
if s[i]=="E":
w[i]=1
from itertools import accumulate
d=list(accumulate([0]+w))
ans=10**10
cnt=0
for i in range(n):
cnt=i-d[i]+d[-1]-d[i]
ans=min(ans,cnt)
print(ans) |
p03524 | s278005356 | Accepted | s=input()
cnt_a=s.count('a')
cnt_b=s.count('b')
cnt_c=s.count('c')
ac=abs(cnt_a-cnt_c)
ab=abs(cnt_a-cnt_b)
bc=abs(cnt_b-cnt_c)
if ab<=1 and ac<=1 and bc<=1:
print('YES')
else:
print('NO')
|
p02601 | s722196805 | Wrong Answer | a,b,c=map(int,input().split())
k=int(input())
ans=0
while b <= a:
b=b*2
ans += 1
while c <= b:
c=c*2
ans += 1
if ans <= k:print("YES")
else:print("NO") |
p02957 | s922067956 | Accepted | import math
a,b=(int(x) for x in input().split())
if(a%2 != b%2):
print("IMPOSSIBLE")
else:
k=int (a+b)/2
print(math.floor(k))
|
p02726 | s551976344 | Accepted | n, x, y= map(int, input().split())
ans = [0] * n
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
min_dis = min([
j - i,
abs(j - y) + 1 + abs(x - i),
])
ans[min_dis] += 1
for i in range(1, n):
print(ans[i]) |
p02731 | s652699027 | Accepted | L=int(input())
print((L/3)**3)
|
p02848 | s169673776 | Accepted | n = int(input())
s = input()
print(''.join(chr((ord(c) - ord('A') + n) % 26 + ord('A')) for c in s))
|
p02714 | s600090344 | Accepted | n = int(input())
s = str(input())
rn = s.count("R")
gn = s.count("G")
bn = s.count("B")
ct=0
for i in range(n):
for j in range(i+1,n):
k = 2*j - i
if k >= n:
break
elif s[i]!=s[j] and s[j]!=s[k]and s[i]!=s[k]:
ct += 1
print(rn*gn*bn-ct) |
p02791 | s675090902 | Wrong Answer | n = int(input())
a = list(map(int, input().split( )))
ans = 0
tmp = n+1
for i in range(n):
if tmp>=a[i]:
tmp = a[i]
ans += 1
tmp = max(a[i],tmp)
print(ans) |
p02677 | s700286351 | Accepted | import math
A, B, H, M = map(int, input().split(' '))
deg = abs(H * 30 + 0.5 * M - 6 * M)
if deg > 180:
deg = 360 - deg
deg = math.radians(deg)
print(math.sqrt((B - A * math.cos(deg)) ** 2 + (A * math.sin(deg)) ** 2)) |
p03962 | s660719133 | Accepted | a,b,c = map(int, input().split())
s = [a,b,c]
print(len(set(s))) |
p03699 | s391134067 | Accepted | n = int(input())
S = [int(input()) for i in range(n)]
S.sort()
x = sum(S)
if x % 10 == 0:
for i in range(n):
if S[i] % 10 != 0:
x -= S[i]
print(x)
exit()
print(0)
else:
print(x)
|
p02982 | s709079218 | Accepted | def dist(a, b):
res = 0
for i in range(D):
res += (a[i] - b[i]) ** 2
res = res ** 0.5
return res
N, D = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(N)]
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
if dist(X[i], X[j]).is_integer():
ans += 1
print(ans) |
p03456 | s810169054 | Accepted | ab = int("".join(input().split()))**0.5
if ab.is_integer():
print("Yes")
else:
print("No") |
p03795 | s936091830 | Accepted | n = int(input())
x = 800 * n
y = (n // 15) *200
print(x-y) |
p02823 | s154827880 | Accepted | N,a,b=map(int,input().split())
if (b-a)%2==0 :
print(((b-a)//2))
else:
print(min(b-1,N-a,int(N-b+(b-a+1)//2),int(a+(b-a-1)//2))) |
p02647 | s222616530 | Accepted | import sys
input=sys.stdin.readline
from itertools import accumulate
def main():
n,k=map(int,input().split())
a=list(map(int,input().split()))
k=k if k<50 else 50
for _ in range(k):
b=[0]*(n+1)
for i in range(n):
ai=a[i]
l,r=i-ai,i+ai+1
l=0 if l<0 else l
r=n if r>n else r
b[l]+=1
b[r]-=1
b=tuple(accumulate(b))[:-1]
a=b
if min(set(b))==n:
break
print(*a)
if __name__ == '__main__':
main() |
p02923 | s367879442 | Accepted | n=int(input())
h=list(map(int,input().split()))
ans=0
c=0
for i in range(n-1):
if h[i]>=h[i+1]:
c+=1
else:
ans=max(ans,c)
c=0
ans=max(ans,c)
print(ans)
|
p02836 | s622091753 | Accepted | S=input()
S_len=len(S)
count=0
for i in range(int(S_len/2)):
if S[i]!=S[S_len-i-1]:
count+=1
print(count) |
p02675 | s561327714 | Accepted | N = int(input())
x = N % 10
hon = [2,4,5,7,9]
pon = [0,1,6,8]
bon = [3]
if x in hon:
print('hon')
elif x in pon:
print('pon')
elif x in bon:
print('bon') |
p03013 | s501631572 | Accepted | def main():
N,M,*alst=map(int, open(0).read().split())
alst=set(alst)
mod=10**9+7
dp = [0] * (N+1)
dp[:2] = [1, 1 if 1 not in alst else 0]
for i in range(2, N+1):
if i not in alst:
dp[i] = (dp[i-2] + dp[i-1])%mod
print(dp[N])
main() |
p03679 | s094854619 | Accepted | X, A, B = map(int, input().split())
print('delicious' if A >= B else ('safe' if (A + X) >= B else 'dangerous')) |
p02628 | s438238096 | Accepted | N, K = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
p.sort()
price = 0
for i in range(K):
price += p[i]
print(price) |
p02832 | s919246672 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
t = 1
s = 0
if t not in a:
s = -1
else:
for x in a:
if x == t:
t += 1
else:
s += 1
print(s)
|
p03067 | s965280797 | Wrong Answer | a, b, c = map(int, input().split())
if a < c < b:
print('Yes')
else:
print('No') |
p03486 | s799960380 | Wrong Answer | a=list(input())
s=list(input())
ans=sorted(a)
ans1=sorted(s)
if ans<ans1:
print('Yes')
else:
print('No')
|
p04030 | s029740061 | Accepted | s = input()
ans = list()
for ss in s:
if ss == '0':
ans.append('0')
elif ss == '1':
ans.append('1')
else:
if ans:
ans.pop(-1)
print(''.join(ans)) |
p02600 | s483851908 | Accepted | x = int(input())
print(8-((x-400)//200)) |
p02775 | s207464974 | Accepted | N = input()
DP_just = 0
DP_plus = 1
for c in N:
d = int(c)
last_just = DP_just
last_plus = DP_plus
DP_just = min(last_just + d, last_plus + 10 - d)
d += 1
DP_plus = min(last_just + d, last_plus + 10 - d)
print(DP_just) |
p03371 | s507995766 | Accepted | A, B, C, X, Y = map(int, input().split())
ans = 10**18
for ab in range(max(X, Y) * 2 + 10):
a = max(0, X - ab // 2)
b = max(0, Y - ab // 2)
ans = min(ans, A * a + B * b + C * ab)
print(ans)
|
p03475 | s432896445 | Accepted | n = int(input())
C, S, F = [[0]*n for i in range(3)]
for i in range(1, n):
c, s, f = map(int, input().split())
C[i], S[i], F[i] = c, s, f
ans = [0]*(n+1)
for i in range(1, n):
t = S[i]+C[i]
for j in range(i+1, n):
t = S[j]+C[j]+[0, -(-(t-S[j])//F[j])*F[j]][S[j] < t]
ans[i] = t
print(*(x for x in ans[1:]), sep="\n") |
p02744 | s833401389 | Accepted | n = int(input())
import string
A = [chr(i) for i in range(ord("a"),ord("a")+10)]
B = {}
for i in range(10):
B[A[i]] = i
def d(s,t,ANS):
if len(s) == n:
ANS.append(s)
else:
for i in range(t+2):
d(s + A[i],max(i,t),ANS)
ANS = []
d("",-1,ANS)
ANS.sort()
for i in ANS:
print(i) |
p03774 | s619663098 | Accepted | n, m = map(int, input().split())
l = [list(map(int, input().split())) for i in range(n)]
p = [list(map(int, input().split())) for i in range(m)]
for i in range(n):
min_l = 1000000000
index = 0
for j in range(m):
d = abs(l[i][0] - p[j][0]) + abs(l[i][1] - p[j][1])
if min_l > d:
min_l = d
index = j
print(index + 1) |
p03545 | s830026962 | Wrong Answer | num = list(input())
n = len(num) - 1
lst = ["-"]*n
for i in range(2**n):
temp = [0]*(len(num)+n)
for j in range(n):
if i&(1<<j):
lst[j] = "+"
temp[::2] = num
temp[1::2] = lst
wa = eval("".join(temp[:]))
if wa == 7:
print("".join(temp[:]) + "=7")
exit() |
p03438 | s694206503 | Accepted | import numpy as np
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
d,e=0,0
for i in range(n):
c=a[i]-b[i]
if c>0:
d+=c
elif c%2==0:
e+=-c
else:
e+=-c-1
print('Yes' if 2*d<=e else 'No')
|
p02689 | s226259302 | Accepted | N,M = map(int,input().split())
H = list(map(int,input().split()))
c = [0] * N
for i in range(M):
A,B = map(int,input().split())
if H[A -1] >= H[B -1]:
c[B - 1] += 1
if H[B - 1] >= H[A - 1]:
c[A - 1] += 1
print(c.count(0)) |
p03962 | s427495318 | Accepted | arr = input().split()
arr = list(map(int,arr))
s = set(arr)
print(len(s))
|
p02554 | s244924148 | Accepted | n = int(input())
w = 1000000007
if(n == 1):
print(0)
exit()
if(n == 2):
print(2)
exit()
ans1 = 1
for i in range(n):
ans1 = ans1*10%w
ans2 = 2
for i in range(n):
ans2 = ans2*9%w
ans3 = 1
for i in range(n):
ans3 = ans3*8%w
ans = ans1-ans2+ans3
ans %= w
ans += w
ans %= w
print(ans)
|
p03351 | s250539515 | Accepted | a, b, c, d = [int(_) for _ in input().split()]
if abs(a - c) <= d or (abs(a - b) <= d and abs(b - c) <= d):
print('Yes')
else:
print('No') |
p02860 | s614655492 | Wrong Answer | n,s=open(0);print("YNeos"[s!=s[:int(n)//2]*2::2]) |
p03163 | s576231668 | Accepted | from sys import stdin
input = stdin.buffer.readline
def main():
n, w = map(int, input().split())
wv = [tuple(map(int, input().split())) for _ in range(n)]
dp = [0] * (w + 1)
for weight, value in wv:
for i in range(w - weight + 1)[::-1]:
if dp[i + weight] < dp[i] + value:
dp[i + weight] = dp[i] + value
print(dp[w])
main() |
p02772 | s235240411 | Accepted | import numpy as np
N = int(input())
A = list(map(int,input().split()))
a = np.array(A)
odd = a[a%2 == 0]
if np.sum((odd%3 != 0)&(odd%5 != 0)) == 0:
print('APPROVED')
else:
print('DENIED')
|
p04029 | s563170814 | Accepted | N = int(input())
print(int((N+1)*N/2)) |
p02748 | s395560676 | Accepted | A, B, M = list(map(int,input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
m = [list(map(int, input().split())) for _ in range(M)]
# no discount
min_val = min(a) + min(b)
# with discount
for ai, bi, ci in m:
val = a[ai-1] + b[bi-1] - ci
if min_val > val:
min_val = val
print(min_val) |
p02918 | s504024885 | Wrong Answer | N,k=map(int,input().split())
A=input()
ans=0
for i in range(0,N-1):
if A[i]==A[i+1]:
ans=ans+1
if A[N-2]=='R' and A[N-1]=='R':
ans=ans-1
print(min(N-1,2*k+ans))
|
p02546 | s823855596 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def main():
S = input()
if S[-1] == "s":
print(S + "es")
else:
print(S + "s")
if __name__ == "__main__":
main()
|
p02900 | s842515724 | Wrong Answer | from math import ceil
from fractions import gcd
a, b = map(int, input().split())
c = gcd(a, b)
count = 1
for num in range(2, ceil(c**0.5) + 1):
if c % num == 0:
count += 1
while c % num == 0:
c = c // num
print(count) |
p03448 | s466475753 | Wrong Answer | count = 0
def check(a,b,c,n):
if n==0:
global count
count += 1
return
if n<0:
return
if a>0:
check(a-1,b,c,n-500)
if b>0:
check(a,b-1,c,n-100)
if c>0:
check(a,b,c-1,n-50)
return
a = int(input())
b = int(input())
c = int(input())
x = int(input())
check(a,b,c,x)
print(count)
|
p03435 | s646285127 | Accepted | l = [[int(i) for i in input().split()] for _ in range(3)]
total1 = 0
total2 = 0
for i in range(3):
total1 += sum(l[i])
total2 += l[i][i]
if total1 == total2 * 3:
print('Yes')
else:
print('No') |
p02787 | s268267838 | Accepted | import sys
f=lambda:map(int,sys.stdin.readline().split())
h,n=f()
dp=[10**9]*(h+1)
dp[0]=0
for i in range(n):
a,b=f()
for j in range(h+1):
dp[j]=min(dp[j],dp[max(j-a,0)]+b)
print(dp[h]) |
p02854 | s142445427 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = []
R = 0
L = sum(A)
for i in range(N):
B.append(abs(L-R))
R += A[i]
L -= A[i]
print(min(B)) |
p03319 | s978450524 | Wrong Answer | N, K = map(int, input().split())
Alist = list(map(int, input().split()))
if K >= N:
print(1)
else:
from math import ceil
one = Alist.index(1)
left = one + 1
right = N - one + 1
if right < K or left < K:
print(ceil(N / K))
else:
print(ceil(left / K) + ceil(right / K))
|
p03986 | s845458499 | Accepted | X=input()
ans = []
for i in X:
if i=='S':
ans.append(i)
elif i=='T' and (not ans or ans[-1] == 'T'):
ans.append(i)
else:
ans.pop()
print(len(ans)) |
p02946 | s690368194 | Wrong Answer | k,x = map(int,input().split())
for i in range(x-k+1,x+k):
print(i,end="") |
p02720 | s606656460 | Accepted | K = int(input())
rnrn = list(range(10))
idx = 0
for idx_base in range(0, K + 1):
base = rnrn[idx_base]
for d in (-1, 0, 1):
digit = base % 10 + d
if digit < 0 or 9 < digit: continue
if base == 0: continue
rnrn.append(10 * base + digit)
if len(rnrn) >= K + 1: break
if len(rnrn) >= K + 1: break
# print("#", rnrn)
print(rnrn[K])
# なんでや！阪神関係無いやろ！ |
p02699 | s728303766 | Accepted | s,w=input().split()
if(int(s)>int(w)):
print('safe')
else:
print('unsafe') |
p03261 | s444123759 | Accepted | n = int(input())
w = []
for _ in range(n):
ww = list(input())
w.append(ww)
bool = True
for i in range(n-1):
if w.count(w[i]) == 1:
if w[i][-1] == w[i+1][0]:
continue
else:
bool = False
break
else:
bool = False
break
print('Yes' if bool else 'No') |
p03860 | s168297611 | Accepted | s=input().split()
print("A"+s[1][0]+"C") |
p02760 | s703088377 | Accepted | import numpy as np
A = np.array([list(map(int, input().split())) for _ in range(3)])
n = int(input())
for _ in range(n):
b = int(input())
A = np.where(A == b, 0, A)
x = np.all(A[[0, 1, 2], [0, 1, 2]] == 0)
y = np.all(A[[0, 1, 2], [2, 1, 0]] == 0)
z = np.any(np.sum(A, axis=0) == 0)
w = np.any(np.sum(A, axis=1) == 0)
print(['Yes', 'No'][not x and not y and not z and not w]) |
p02795 | s255927925 | Accepted | H = int(input())
W = int(input())
N = int(input())
X = 0
if H <= W:
X = N // W
if N % W != 0:
X = X + 1
else :
X = N // H
if N % H != 0:
X = X + 1
print(X) |
p03309 | s269909797 | Wrong Answer | from math import floor
def solve(n, A):
b = floor(sum(a - (i + 1) for i, a in enumerate(A)) / n)
return sum(abs(a - (b + i + 1)) for i, a in enumerate(A))
_n = int(input())
_A = list(map(int, input().split()))
print(solve(_n, _A))
|
p03261 | s530473448 | Accepted | N = int(input())
ls = []
ans = ('Yes')
for i in range(N):
ls.append(input())
for i in range(1,N):
if ls[i] in ls[:i]:
ans = ('No')
break
else:
if ls[i][0] == ls[i-1][-1]:
continue
else:
ans = ('No')
break
print(ans) |
p02897 | s461722518 | Wrong Answer | n = int(input())
if n == 1:
print(1)
elif n%2 == 0:
print(0.5)
else:
print(0.6) |
p02720 | s125878614 | Accepted | from collections import *
k=int(input());q=deque(range(1,10));c=0
while c<k:
t=q.popleft()
for j in range(max(t%10-1,0),min(t%10+2,10)): q+=[t*10+j]
c+=1
print(t) |
p02577 | s017742594 | Wrong Answer | n = list(input())
n = [int(i) for i in n]
l = [0]
s = sum(n)
if s%9 == 0 and l != n:
print("Yes")
else:
print("No") |
p02730 | s149174155 | Wrong Answer | s = input()
n = len(s)
if s[:(n-1)//2] == ''.join(reversed(s[:(n-1)//2])) and s[((n+3)//2-1):] == ''.join(reversed(s[((n+3)//2-1):])):
print("Yes")
else:
print("No") |
p02582 | s742870177 | Accepted | S = input()
if(S=="RRR"):
print(3)
elif(S=="RRS" or S=="SRR"):
print(2)
elif(S[0]=="R" or S[1]=="R" or S[2]=="R"):
print(1)
else:
print(0) |
p03062 | s135768091 | Accepted | _, *a = map(int, open(0).read().split())
*z, = map(abs, a)
s = sum(z)
print(s if len([i for i in a if i<0])%2==0 or 0 in a else s-min(z)*2) |
p03862 | s575184943 | Accepted | N, x = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
ans = 0
if a[0] > x:
ans+=a[0]-x
a[0] = x
for i in range(1, N):
if (a[i-1]+a[i] > x):
ans+= (a[i]-(x-a[i-1]))
a[i] = x-a[i-1]
print(int(ans)) |
p03611 | s752073422 | Accepted | n = int(input())
a = list(map(int, input().split()))
d = {}
for each in a:
d[each] = d.get(each, 0) + 1
d[each-1] = d.get(each-1, 0) + 1
d[each+1] = d.get(each+1, 0) + 1
print(max(d.values())) |
p03281 | s451213379 | Wrong Answer | print(2) |
p02570 | s384449439 | Wrong Answer | d,t,s=map(int,input().split())
if(d//s<=t):
print("Yes")
else:
print("No")
|
p02552 | s203883838 | Accepted | x = int(input())
if x:
print(0)
else:
print(1) |
p02602 | s795733585 | Accepted | n,k=map(int, input().split())
a=list(map(int, input().split()))
for x in range(k,n):
if a[x]>a[x-k]:
print('Yes')
else:
print('No') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.