problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03611 | s879237470 | Wrong Answer | from collections import Counter
N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(max(a)):
ans = max(ans, Counter(a)[i - 1] + Counter(a)[i] + Counter(a)[i + 1])
print(ans)
|
p02658 | s032664824 | Wrong Answer | n = int(input())
re = 1
list = [int(s) for s in input().split()]
for i in range(n):
re *= list[i]
if(re >= 100000000000000100000):
print("-1")
else:
print(re) |
p03760 | s845433344 | Accepted | o = input()
e = input()
for i in range(len(o)+len(e)):
if i % 2 == 0:
print(o[i//2],end="")
elif i % 2 == 1:
print(e[(i-1)//2],end="") |
p02727 | s753262055 | Accepted | # E - Red and Green Apples
def main():
X, Y, A, B, C = map(int, input().split())
P = sorted(map(int, input().split()), reverse=True)[:X]
Q = sorted(map(int, input().split()), reverse=True)[:Y]
R = list(map(int, input().split()))
PQR = P + Q + R
PQR.sort(reverse=True)
ans = sum(PQR[: X + Y])
... |
p02552 | s863472358 | Accepted | x=int(input())
if x==0:
print(1)
else:
print(0) |
p02814 | s515456892 | Accepted | from fractions import gcd
n, m = map(int, input().split())
a = [int(i) // 2 for i in input().split()]
x = 1
for i in range(n):
x *= a[i] // gcd(x, a[i])
for i in a:
if x // i % 2 == 0:
print(0)
exit()
print((m // x + 1) // 2) |
p02744 | s983835617 | Accepted | n=int(input())
a=['a','b','c','d','e','f','g','h','i','j']
def dfs(s, count):
if len(s) == n:
print(s)
return
for z in range(count + 1):
dfs(s + a[z], count + 1 if z == count else count)
dfs("",0)
|
p02742 | s125010460 | Accepted | a, b= map(int, input().split())
if a == 1:
print('1')
elif b == 1:
print('1')
else:
if (a*b)%2 == 0:
print(round((a*b)/2))
else:
print(round(((a//2)+(a%2))*b)-(b//2)) |
p02732 | s550843444 | Accepted | N=int(input())
A=list(map(int,input().split()))
dic={}
for a in A:
if a in dic.keys():
dic[a]+=1
else:
dic[a]=1
r=0
for a in dic.keys():
c=dic[a]
r+=c*(c-1)//2
for i in range(N):
c=dic[A[i]]
print(r - c*(c-1)//2 + (c-1)*(c-2)//2 )
|
p02696 | s099409676 | Wrong Answer | import math
a,b,n = map(int,input().split())
ans = 0
al = []
for i in range(n,-1,-1):
ans = ((a*i)//b)-(a*(i//b))
al.append(ans)
if len(al) > 1:
if al[-1] < al[-2]:
break
print(max(al)) |
p03261 | s211653596 | Accepted | N = int(input())
W = [tuple(input()) for _ in range(N)]
now = W[0][-1]
said = [W[0]]
for w in W[1:]:
if not w in said and w[0] == now:
now = w[-1]
said.append(w)
continue
print("No")
exit()
print("Yes") |
p03011 | s193050712 | Accepted | n = input().split()
total_list =[]
a = 0
for i in range(3):
a = int(n[i-1]) + int(n[i])
total_list.append(a)
print(min(total_list))
|
p02888 | s346164653 | Accepted | import sys
input = sys.stdin.readline
from bisect import *
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N):
for j in range(i+1, N):
k = bisect_left(L, L[i]+L[j])
ans += k-j-1
print(ans) |
p02705 | s355471034 | Wrong Answer | R=int(input())
print(R*3.1415926)
|
p02706 | s750879296 | Accepted | # coding: utf-8
# Your code here!
input_line = input().split()
N = int(input_line[0])
M = int(input_line[1])
count = 0
line = input().split()
for i in range(M):
count+=int(line[i])
if N - count <= -1:
print(-1)
else:
print(N - count) |
p03695 | s303587115 | Accepted | n = int(input())
a = list(map(int, input().split()))
c = [0]*9
for i in a:
t = i // 400
if t < 8:
c[t] = 1
else:
c[8] += 1
cmin = max(sum(c[:-1]), min(c[8], 1))
cmax = sum(c)
print(cmin, cmax) |
p02888 | s350163567 | Wrong Answer | from bisect import*
n, *l = map(int, open(0).read().split())
print(sum(max(0, bisect_left(l, l[i] + l[j]) - j - 1) for i in range(n) for j in range(i+1, n))) |
p03803 | s273208474 | Wrong Answer | a,b = map(int,input().split())
if a == b:
print('Draw')
elif a == 1 or a > b:
print('Alice')
else:
print('Bob') |
p02935 | s572123894 | Accepted | n = int(input())
vv = sorted([int(x) for x in input().split()])
while len(vv) > 1:
a, b = vv[:2]
vv = vv[2:]
vv = sorted([(a + b) / 2] + vv)
print(vv[0]) |
p03289 | s149395281 | Accepted | s = input()
a = s.lower()
l = len(s)
c = 0
n = 0
if s[0] == 'A':
for i in range(2 , l-1):
if s[i] == 'C':
c += 1
if c == 1:
for i in range(1,l):
if s[i] != a[i]:
n += 1
if n == 1:
print('AC')
exit()
print('WA') |
p02814 | s506501586 | Accepted | n,m=map(int,input().split())
lists=list(map(int,input().split()))
uselist=[]
for some in lists:
some=some//2
uselist.append(some)
import fractions
import math
ans = uselist[0]
for i in range(1, n):
ans = ans* uselist[i] // fractions.gcd(ans, uselist[i])
flags=True
for some in uselist:
a=ans//some
... |
p02628 | s208941217 | Accepted | n, k = map(int, input().split())
x = list(map(int, input().split()))
sx=sorted(x)
ans=0
for i in range(k):
ans=ans + sx[i]
print(ans)
|
p02833 | s920183068 | Accepted | N = int(input())
if N % 2:
print(0)
exit()
ans = 0
x = 1
while pow(5, x) <= N:
ans += N // 2 // pow(5, x)
x += 1
print(ans)
|
p02676 | s144284563 | Accepted | from sys import stdin
K = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
ans = S[:K]
if len(S) > K:
ans += '...'
print(ans) |
p02711 | s442796424 | Wrong Answer | x=input()
for i in x:
if i=="7":
print("Yes")
else:
print("No") |
p02683 | s355741423 | Accepted | import numpy as np
[n,m,x] = [int(x) for x in input().split()]
data = np.array([[int(x) for x in input().split()] for _ in range(n)])
ans = []
for i in range(2**(n)):
temp = np.array([0]*(m+1))
for j in range(n):
if (i >> j) & 1:
temp = temp + data[j]
for k in temp[1:]:
... |
p02720 | s432920188 | Accepted | import queue
K = int(input())
q = queue.Queue()
[q.put(i) for i in range(1, 10)]
for _ in range(K):
num = q.get()
mod = num % 10
deca = num * 10 + mod
if mod != 0:
q.put(deca - 1)
q.put(deca)
if mod != 9:
q.put(deca + 1)
print(num) |
p02744 | s001124276 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
N = int(input())
L = list("abcdefghij")
def nasu(x, n, e):
if n == N:
print(x)
return
for i in range(e + 1):
if i == e:
nasu(x + L[i], n + 1, e + 1)
else:
nasu(x + L[i], n + 1, e)
nasu("", 0, 0)
|
p03359 | s237568091 | Accepted | a, b = map(int, input().split())
if (a <= b):
print(a)
else:
print(a - 1)
|
p03730 | s460563976 | Wrong Answer | A, B, C = map(int,input().split())
if A % 2 == C % 2:
print("YES")
else:
print("NO") |
p02996 | s997841606 | Accepted | n = int(input())
li = [] # AとBのリスト
x = 0
for i in range(n):
li.append(list(map(int,input().split())))
li.sort(key=lambda x: x[1]) # Bの締め切りの早いものでソート
for i in range(n):
x += li[i][0]
if x > li[i][1]:
print("No") # 締め切りの早いものから終わらせていき、終わらなかったらNo
exit()
print("Yes") |
p02584 | s211298457 | Accepted |
startX, countK, distanceD = map(int, input().split())
n = int(abs(startX) / distanceD)
ans = abs(startX) % distanceD
if n > countK:
ans += distanceD * (n - countK)
else:
if (countK - n) % 2 == 1:
ans= abs(ans - distanceD)
print(ans)
|
p02663 | s258585783 | Accepted | h1,m1,h2,m2,k = map(int,input().split())
a = h1*60 + m1
b = h2*60 + m2
print(b-a-k) |
p03001 | s641604035 | Accepted | w,h,x,y=map(int,input().split())
print(str(w*h/2)+' '+str(1*(w==2*x and h==2*y))) |
p02642 | s854648854 | Accepted | n=int(input())
l=list(map(int,input().split()))
ml=max(l)
m=[0]*(ml+1)
for i in l:
m[i]+=1
for i in range(ml+1):
if m[i]>=1:
for j in range(2*i,ml+1,i):
if m[j]>0:
m[j]=0
#print(j)
for i in range(ml+1):
if m[i]>=2:
m[i]=0
print(sum(m))
|
p02791 | s968151991 | Accepted | N = int(input())
P = list(map(int, input().split()))
res = 0
mini = P[0]
for i in range(N):
mini = min(mini, P[i])
if(mini >= P[i]):
res += 1
print(res)
|
p02790 | s025981105 | Accepted | a, b = input().split()
cnt = 0
if( a <= b ):
cnt = a
for i in range(int(b)):
print(cnt, end="")
else:
cnt = b
for i in range(int(a)):
print(cnt, end="")
print("") |
p02687 | s800928819 | Wrong Answer | S=input()
if S is'ABC':
print('ARC')
else:
print('ABC') |
p02780 | s904734554 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N, K = map(int, input().split())
p = [((int(i)+1) * int(i) / 2)/int(i) for i in input().split()]
dp = [0 for i in range(N-K+1)]
dp[0] = 0
for i in range(1, N-K+1):
dp[i] = max(dp[i-1], sum(j for j in p[i:i+K]))
print(max(dp))
if... |
p03804 | s069907761 | Wrong Answer | n,m=map(int,input().split())
A=[input() for _ in range(n)]
B=[input() for _ in range(m)]
ok=0
for i in range(n-m+1):
for k in range(n-m+1):
if B[0]==A[i][k:k+m]:
for j in range(i,i+m):
if B[j-i]!=A[j][k:k+m]:
break
else:
ok=1
print("Yes" if ok==1 else "No") |
p03479 | s745725852 | Wrong Answer | import math
X,Y=map(int,input().split())
print(int(math.log2(Y/X))+1)
|
p02583 | s775085026 | Accepted | n=int(input())
l=list(map(int, input().split()))
l.sort()
ans=0
for i in range(n):
for j in range(i+1,n):
for k in range(j+1,n):
if l[i]+l[j]>l[k] and l[i]!=l[j] and l[j]!=l[k]:
ans+=1
print(ans) |
p02753 | s167277754 | Accepted | S=input()
if S=="AAA" or S=="BBB":
print("No")
else:
print("Yes") |
p02658 | s176367489 | Accepted | n = int(input())
limit = 10 ** 18
l = sorted([int(i) for i in input().split()])
flg = True
if l[0] == 0:
flg = False
print(0)
else:
ans = 1
for i in l:
if ans > limit:
print(-1)
flg = False
break
else:
ans *= i
if flg:
p... |
p03997 | s407422185 | Accepted | a = int(input())
b = int(input())
h = int(input())
print((a+b)*h//2) |
p02970 | s872351834 | Accepted | n,d = map(int, input().split())
a = (2*d+1)
if (n % a == 0):
print(n//a)
else:
print(n//a + 1) |
p02911 | s637859378 | Accepted | n,k,q=map(int, input().split())
a = [0]*(n+1)
for i in range(q):
a[int(input())] += 1
for i in range(1, n+1):
a[i] += k-q
if a[i] > 0:
print("Yes")
else:
print("No") |
p02861 | s752376945 | Accepted | import math
from collections import defaultdict
import itertools
N = int(input())
town = [[int(i) for i in input().split(' ')] for _ in range(N)]
dist = 0
c = 0
for v in itertools.permutations(town,len(town)):
c += 1
sx = v[0][0]
sy = v[0][1]
for i in v[1::]:
dist += math.sqrt((sx - i[0]) ** 2 ... |
p02706 | s448064282 | Accepted | def main():
n,m=map(int,input().split())
a=list(map(int,input().split()))
s=sum(a)
ans=n-s if n-s>=0 else -1
print(ans)
if __name__ == '__main__':
main() |
p03852 | s686703385 | Accepted | # 文字を取得
c = str(input())
v_list = ["a","e","i","o","u"]
# 母音なのかを確認し結果を出力
if c in v_list:
print("vowel")
else:
print("consonant") |
p02688 | s032321137 | Accepted | n, k = map(int, input().split())
ans = [0] * n
cnt = 0
for i in range(k):
d = int(input())
a = list(map(int, input().split()))
for j in a:
ans[j-1] += 1
for i in ans:
if i == 0:
cnt += 1
print(cnt) |
p03282 | s272991432 | Accepted | import sys
input = sys.stdin.readline
S=input().strip()
K=int(input().strip())
n = 0
m = 0
for c in S:
if c != '1':
m = int(c)
break
n += 1
if K <= n:
print(1)
else:
print(m) |
p03309 | s874546869 | Accepted | n = int(input())
al = list(map(int, input().split()))
new_al = []
for i,a in enumerate(al):
new_al.append(a-i-1)
new_al.sort()
if n%2 == 0:
med = (new_al[n//2] + new_al[n//2-1])/2
else:
med = new_al[n//2]
ans = 0
for a in new_al:
ans += abs(a-med)
print(int(ans)) |
p02689 | s145997705 | Accepted | N,M=map(int,input().split())
H=list(map(int,input().split()))
AB=[]
for i in range(M):
AB.append(list(map(int,input().split())))
J=[0]*N
for i in range(M):
if H[AB[i][0]-1]<H[AB[i][1]-1]:
J[AB[i][0]-1]+=1
elif H[AB[i][0]-1]==H[AB[i][1]-1]:
J[AB[i][0]-1]+=1
J[AB[i][1]-1]+=1
e... |
p02793 | s183272677 | Wrong Answer | def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
Q = 10**9+7
def main():
N = int( input())
A = list( map( int, input().split()))
s = 1
for a in A:
s = s*a//gcd(a,s)
ans = 0
for a in A:
ans += s//a
print(ans)
if __name__ == '__main__':
main()
|
p02708 | s582040337 | Wrong Answer | import math
n,k = map(int,input().split())
#全部選ぶときの和の個数は0+1+2+ ~ +nの1+(n+1)n/2個
#k個は好きな選び方ができる。
#k個以上の数を選ぶときに「絶対に満たせない和の値」を考える。
#その数は10**100 + 10**100+1 + ... + 10*100+k-1 -1 の(k-1)k/2である。
result_before_division = 1+(n+1)*n/2 - (k-1)*k/2
result = result_before_division % (10**9 + 7)
print(int(result))
|
p03475 | s364651674 | Wrong Answer | n=int(input())
ab = []
for _ in range(n-1):
a, b, c = (int(x) for x in input().split())
ab.append([a, b, c])
for i in range(n-1):
ans = ab[i][0]+ab[i][1]
for j in range(i+1,n-1):
if ans <= ab[j][1]:
ans = ab[j][1]
elif (ans-ab[j][1])%ab[j][2]!=0:
ans += (ans-ab[j... |
p02688 | s461485523 | Wrong Answer | N, K = list(map(int, input().split()))
d = []
A = []
B = set()
for i in range(K):
_d = int(input())
_A = list(map(int, input().split()))
d.append(_d)
A.append(_A)
_B = set(_A)
B = B or _B
print(N - len(B)) |
p02554 | s044782761 | Accepted | N=int(input())
print((10**N-8**N-(2*(9**N-8**N)))%(10**9+7))
|
p02754 | s289448017 | Accepted | List = list(map(int, input().split()))
Set0 = List[0]//(List[1]+List[2])
E = List[0] - (List[1]+List[2])*Set0
if E >= List[1]:
Blue = Set0 * List[1] + List[1]
else:
Blue = Set0 * List[1] + E
print(Blue) |
p03760 | s620558950 | Wrong Answer | a=input()
b=input()
i=0
j=0
s=""
while(i<len(a) and j<len(b)):
s+=a[i]
s+=b[j]
i=i+1
j=j+1
print(s)
|
p03282 | s547424025 | Accepted | S = str(input())
K = int(input())
one = 0
for i in range(len(S)):
if S[i] == "1":
one += 1
else:
notone = S[i]
break
#print(one,K,notone)
if one >= K:
print("1")
else:
print(notone) |
p02771 | s562656732 | Accepted | a=map(int,input().split())
A=list(a)
B=0
if A[0]==A[1]:
B+=1
if A[1]==A[2]:
B+=1
if A[0]==A[2]:
B+=1
if B==1:
print("Yes")
else:
print("No") |
p03309 | s527849910 | Accepted | N= int(input())
A = list(map(int,input().split()))
B = []
for i in range(N):
B.append(A[i]-(i+1))
#print(B)
b= (sorted(B)[N//2])
#print(b)
ans = 0
for i in range(N):
ans += abs(B[i]-b)
print(ans) |
p03012 | s339714725 | Accepted | N = int(input())
WW = list(map(int,input().split()))
Wsum = sum(WW)
phalf = 0
ohalf = 0
psum = 0
for i in range(N):
psum += WW[i]
if psum > Wsum / 2:
ohalf = psum
phalf = psum - WW[i]
break
difp = Wsum - phalf * 2
difo = ohalf - (Wsum - ohalf)
print(min(difp,difo))
|
p02683 | s084004978 | Accepted | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
#深さ優先探索
def DFS(n,cost,Xls):
if n==N:
if min(Xls)>=X:
ans.add(cost)
else:
Xnext=[Xls[i]+Book[n][i+1] for i in range(M)]
DFS(n+1,cost+Book[n][0],Xnext)
DFS(n+1,co... |
p02957 | s551757550 | Accepted | s = sum(list(map(int,input().split())))
if s % 2 == 0:
print(s//2)
else:
print('IMPOSSIBLE')
|
p02747 | s040144663 | Accepted | def solve():
s = input()
n = len(s)
if n%2 == 1:
print("No")
else:
tmp = "hi"*(n//2)
if s == tmp:
print("Yes")
else:
print("No")
solve() |
p02923 | s843417668 | Accepted | n = int(input())
h = list(map(int, input().split()))
idx, size = 0, 0
for j in range(1,len(h)):
if h[j-1] < h[j]:
idx = j
size = max(size,j-idx)
print(size) |
p03673 | s109346238 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
odd, even = [], []
odd = [i for i in l if i % 2 == 1]
even = [j for j in l if j % 2 == 0]
even.reverse()
e_o = even + odd
if n%2 == 1:
e_o.reverse()
print(*e_o)
else:
print(*e_o) |
p02695 | s860284521 | Wrong Answer | #入力
A,B,N=map(lambda x:int(x),input().split())
Max=0
x=1
for x in range(N+1):
num=int(A*x/B)-A*int(x/B)
if num>=Max:
Max=num
x=x+1
print(Max) |
p02597 | s936097324 | Accepted | import collections
N= int(input())
s = input()
counter = collections.Counter({'R':0, 'W':0})
counter.update(s)
print(s[:counter['R']].count('W')) |
p03657 | s477520783 | Accepted | a=list(map(int,input().split()))
b=sum(a)
if (b%3 ==0 or a[0]%3 ==0 or a[1]%3==0) :
print('Possible')
else :
print('Impossible') |
p03699 | s816690202 | Accepted | def main():
n, *s = map(int, open(0).read().split())
s.sort()
x = [i for i in s if i % 10 != 0]
t = sum(s)
if t % 10 != 0:
ans = t
elif len(x) > 0:
ans = t - x[0]
else:
ans = 0
print(ans)
if __name__ == '__main__':
main()
|
p03206 | s683564051 | Accepted | d=int(input())
s="Christmas"
day=25-d
for i in range(day):
s+=" Eve"
print(s) |
p02623 | s379209264 | Accepted | from itertools import accumulate
N, M, K = map(int, input().split())
*A, = map(int, input().split())
*B, = map(int, input().split())
cumsum_A, cumsum_B = [0] + list(accumulate(A)), [0] + list(accumulate(B))
ans = 0
j = M
for i in range(N+1):
if cumsum_A[i] > K: break
while cumsum_A[i] + cumsum_B[j] > K: j -= 1... |
p02687 | s929913620 | Accepted | import sys
S = input();
if S == 'ABC':
print('ARC')
else:
print('ABC') |
p02717 | s764745484 | Accepted | x, y, z = map(int,input().split())
x, y = y, x
x, z = z, x
print(x, y, z) |
p03416 | s294427053 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
nor = str(i)
rev = "".join(list(reversed(nor)))
if nor == rev:
ans += 1
print(ans) |
p03161 | s776309280 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [100000 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0 :
break
else :
minToatalCostList[i] = min(minToatalCostList[i], abs(h[i] -... |
p02719 | s379727533 | Wrong Answer | n,k=map(int,input().split())
if k==1:
print(0)
elif n>k:
print(k-(n%k))
else:
print(n) |
p02552 | s955091838 | Accepted | i = input()
if i == "0":
print(1)
else:
print(0) |
p03352 | s471021640 | Accepted | x=int(input())
ans=0
num=x+100
for i in range(1,33):
for j in range(2,11):
a=x-(i**j)
if a>=0 and num>a:
ans=x-a
num=a
print(ans)
|
p03862 | s335964867 | Accepted | N, x = map(int, input().split())
a = list(map(int, input().split()))
r1 = sum(a)
flow = 0
for i in range(1, N):
t = (a[i] + a[i - 1]) - x
if flow != 0:
a[i-1] -= flow
t -= flow
flow = 0
if t > 0:
if t > a[i]:
t -= a[i]
a[i - 1] -= t
t = ... |
p02775 | s837088261 | Accepted | N_list = [int(i) for i in list(input())]
N_list = N_list[::-1] + [0]
for index in range(0, len(N_list)):
if N_list[index] >= 6 or (N_list[index] == 5 and N_list[index+1] >= 5) :
N_list[index] = 10 - N_list[index]
N_list[index+1] += 1
print(sum(N_list)) |
p02615 | s994936069 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
b = sorted(a, reverse=True)
ans = 0
for i in range(n):
ans += b[(i+1)//2]
print(ans)
|
p03042 | s852248042 | Accepted | import sys
s = sys.stdin.readline().rstrip()
def main():
a, b = int(s[:2]), int(s[2:])
if 1 <= a <= 12:
if 1 <= b <= 12:
return 'AMBIGUOUS'
else:
return 'MMYY'
else:
if 1 <= b <= 12:
return 'YYMM'
else:
return 'NA'
if __name_... |
p03835 | s962322034 | Wrong Answer | k, s = 2,2
ans = 0
for x in range(k+1):
for y in range(k+1):
if s-x-y >= 0:
if x+y+(s-x-y) == s:
ans += 1
print(ans)
|
p02917 | s303870321 | Accepted | N = int(input())
B =list(map(int,input().split()))
A=[0]*N
A[0]=B[0]
for i in range(1,N-1):
A[i]=min(B[i],B[i-1])
A[-1]=B[-1]
print(sum(A)) |
p02760 | s352448495 | Wrong Answer | list = []
list1 = []
list2 = []
list3 = []
list5 = []
list1 = input().split()
list2 = input().split()
list3 = input().split()# separate by whitespace
list.extend(list1)
list.extend(list2)
list.extend(list3)
n = int(input())
a = 1
for i in range(0,n):
a = (input())
list5.append(a)
for item in list5:
for ... |
p02726 | s317829459 | Accepted | n,x,y=map(int,input().split())
k=[0]*n
for i in range(1,n):
for j in range(1,n-i+1):
t=min(j,abs(i-x)+abs(i+j-y)+1)
k[t]+=1
for i in range(1,n):
print(k[i]) |
p04020 | s636040616 | Accepted | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdi... |
p02613 | s589027739 | Wrong Answer | N = int(input())
c0=[]
c1=[]
c2=[]
c3=[]
for i in range(N):
S = input()
if S == "AC":
c0.append(S)
elif S == "WA":
c1.append(S)
elif S == "TLE":
c2.append(S)
elif S == "RE":
c3.append(S)
print("AC","×",len(c0))
print("WA","×",len(c1))
print("TLE","×",len(c2))
print("... |
p03041 | s930285962 | Wrong Answer | n,k=map(int,input().split())
s=input()
print(s.replace(s[k-1],s[k-1].lower())) |
p02777 | s267138884 | Accepted | n, k=input().split()
l, m= map(int, input().split())
o = input()
if n==o:
l = l-1
if k == o:
m = m-1
print(l,m) |
p02861 | s702124302 | Accepted | import itertools
import math
def calc_distance(pos_i, pos_j):
return math.sqrt((pos_i[0] - pos_j[0]) ** 2 + (pos_i[1] - pos_j[1]) ** 2)
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
N = int(input())
pos_dict = {i: list(map(int, input().split())) for i in range(1, N + 1)}
sum... |
p02700 | s964526958 | Accepted | a, b, c, d = map(int, input().split())
i = 0
while a > 0 and c > 0:
if i%2==0:
c -= b
else:
a -= d
i+=1
if a <= 0:
print("No")
else:
print("Yes") |
p03387 | s186396656 | Accepted | nums = [int(i) for i in input().split()]
nums = sorted(nums, reverse=True)
diff_2_3 = nums[1] - nums[2]
if diff_2_3 == 0:
cnt = 0
else :
q, r = divmod(diff_2_3, 2)
cnt = q + r
if r == 1:
cnt +=1
cnt += nums[0] - nums[1]
print(cnt) |
p03264 | s995299581 | Wrong Answer | k=int(input())
if k % 2 == 0:
print(k / 2 * k / 2)
else:
print(int(k // 2 * (k // 2 + 1)))
|
p02730 | s659745675 | Accepted | s = input()
n = len(s)
a, b = (n-1)//2, ((n+3)//2)-1
if s[0:a] == ''.join(reversed(s[0:a])) and s[b:] == ''.join(reversed(s[b:])) and s == ''.join(reversed(s)):
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.