problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03219 | s909046715 | Accepted | """
author : halo2halo
date : 22, 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)
A, B = map(int, readline().split())
print(A + B // 2)
|
p03150 | s645835490 | Wrong Answer | S = input()
ans = True
for i in range(len(S)):
for j in range(i, len(S)):
moji = S[:i] + S[j:]
if moji == 'keyence':
ans = True
break
if ans:
print('YES')
else:
print('NO')
|
p02787 | s063367484 | Accepted | H,N=map(int, input().split())
A=[]
B=[]
for n in range(N):
a,b=map(int, input().split())
A.append(a)
B.append(b)
dp=[float('inf')]*(H+1)
dp[0]=0
for h in range(1,H+1):
for i in range(N):
if h-A[i]>=0:
dp[h]=min(dp[h-A[i]]+B[i],dp[h])
else:
dp[h]=min(dp[h],B[i])
print(dp[H]) |
p03041 | s031787479 | Wrong Answer | if __name__ == '__main__':
n, k = map(int, input().split())
ans = input()
if k == 1:
ans = ans[0].lower() + ans[1:n]
elif k == n:
ans = ans[0:n - 2] + ans[n - 1].lower()
else:
ans = ans[0:k - 1] + ans[k - 1].lower() + ans[k:n - 1]
print(ans)
|
p03017 | s204511251 | Accepted | n, a, b, c, d = map(int,input().split())
s = input()
for i in range(a-1,c-2):
if s[i] == "#" and s[i+1] == "#":
print("No")
exit()
for i in range(b-1,d-2):
if s[i] == "#" and s[i+1] == "#":
print("No")
exit()
if c > d:
for i in range(b-1,d):
if s[i] == "." and s[i-1] == "." and s[i+1] == ".":
print("Yes")
exit()
print("No")
else:
print("Yes")
|
p03030 | s796724890 | Wrong Answer | N = int(input())
lis = [(input() + " " + str(i+1)).split() for i in range(N)]
lis = [k for k in lis]
lis.sort(key=lambda k: int(k[1]))
lis.sort(key=lambda k: k[0])
for i in lis:
print(i[2]) |
p02888 | s472317158 | Wrong Answer | # -*- coding: utf-8 -*-
n = int(input())
l = list(map(int, input().split()))
l.sort()
acc = [0]*(10**3+1)
idx = 0
for i in range(10**3):
if idx<n and l[idx]==i:
acc[i] += 1
idx += 1
acc[i+1] += acc[i]
res = 0
for i in range(n-1):
for j in range(i+1,n):
# print(l[i],l[j],acc[min(l[i]+l[j]-1,10**3)] - acc[l[j]])
res += acc[min(l[i]+l[j]-1,10**3)] - acc[l[j]]
print(res) |
p03672 | s914546289 | Accepted | s = input()
for i in range(1,len(s)):
if (len(s)-i) % 2 != 0: continue
else :
S = s[:-i]
n = len(S)
if S[0:n//2] == S[n//2:n]:
print(n)
exit()
|
p02594 | s108504111 | Accepted | x = int(input())
if x >= 30:
print("Yes")
else:
print("No") |
p03821 | s291842456 | Accepted | n=int(input())
ab=[]
for _ in range(n):
a_,b_=map(int,input().split())
ab.append([a_,b_])
ans=0
for i in range(n-1,-1,-1):
ans+=(-ab[i][0]-ans)%ab[i][1]
print(ans) |
p03416 | s569054506 | Wrong Answer | a,b=map(int,input().split())
cnt=0
for i in range(a,b+1):
s = [int(_) for _ in str(i)]
if s==reversed(s):
cnt+=1
print(cnt) |
p02899 | s257446218 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.sort()
print([A[0-i] for i in range(N)]) |
p03799 | s910747153 | Accepted | N,M = map(int,input().split())
if M<=2*N:
print(M//2)
else:
print(N+(M-2*N)//4) |
p02866 | s891384750 | Wrong Answer | import collections
mod=998244353
n=int(input())
arr=list(map(int,input().split()))
l=len(set(arr))
m=max(arr)
if l!=m+1:
print(0)
else:
dic=collections.defaultdict(int)
for d in arr:
dic[d]+=1
ans=1
for i in range(1,n):
ans*=pow(dic[i-1],dic[i],mod)
ans%=mod
print(ans) |
p02759 | s804704546 | Accepted | n = int(input())
ans = n//2
if n%2==1:
ans+=1
print(ans) |
p03210 | s578424677 | Accepted | x=int(input())
if x == 3 or x == 5 or x == 7:
print("YES")
else:
print("NO") |
p03345 | s099591756 | Accepted | a, b, c, k = map(int, input().split())
ans = a-b
if k%2: ans *= -1
print(ans) |
p02935 | s298483406 | Wrong Answer | import heapq
N = int(input())
V = []
for v in map(int, input().split()):
heapq.heappush(V, v)
while len(V) > 2:
a, b = heapq.heappop(V), heapq.heappop(V)
heapq.heappush(V, (a + b) // 2)
print((heapq.heappop(V) + heapq.heappop(V)) / 2)
|
p03385 | s737475053 | Accepted | s=input()
print('Yes'if s.count('a')==s.count('b')==s.count('c')else'No')
|
p02630 | s787788212 | Accepted | N = int(input())
cnt = [0]*(10**5)
ans = 0
for i in list(map(int,input().split())):
cnt[i-1] += 1
for i in range(10**5):
ans += (i+1)*cnt[i]
Q = int(input())
for i in range(Q):
a,b = map(int,input().split())
ans += (b-a)*cnt[a-1]
cnt[b-1] += cnt[a-1]
cnt[a-1] = 0
print(ans) |
p02789 | s400072965 | Wrong Answer | n, m = map(int, input().split())
print(['No', 'Yes'][n >= m]) |
p02881 | s944014815 | Accepted | n = int(input())
ans = n - 1
for i in range(1, n):
if i * i > n:
break
if n % i != 0:
continue
ans = min(ans, i + (n // i) - 2)
print(ans)
|
p03251 | s737202834 | Accepted | n,m,x,y = map(int, input().split())
a = list(map(int, input().split())) + [x]
b = list(map(int, input().split())) + [y]
print ("No War" if max(a) < min(b) else "War")
|
p02578 | s928803412 | Wrong Answer | import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7
def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def main():
N = int(input())
A = read_list()
pre = A[0]
res = 0
for a in A:
res += max(0, a - pre)
pre = a
print(res)
if __name__ == "__main__":
main()
|
p02842 | s915217728 | Wrong Answer | import math
N=int(input())
x=math.ceil(N/1.08)
X=math.floor((N+1)/1.08)
if x <= X:
print(X)
else:
print(":(")
|
p02678 | s577465573 | Wrong Answer | from collections import deque
N, M = map(int,input().split())
graph = [[] for i in range(N + 1)]
dist = [-1] * (N + 1)
for _ in range(M):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
dist[1] = 1
q = deque([1])
while q:
x = q.popleft()
for j in graph[x]:
if dist[j] == -1:
q.append(j)
dist[j] = x
ans = dist[2:]
print(*ans, sep = "\n") |
p03087 | s757023341 | Wrong Answer | n,q = map(int, input().split())
s = input()
af = False
AClist = [0 for i in range(10**5)]
for i,c in enumerate(s):
if af:
if c == 'C':
AClist[i-1]+=1
elif c != 'A':
af = False
else:
if c == 'A':
af = True
a2=[0]
for i in AClist:a2.append(a2[-1]+i)
def SumArea(l, r):
return a2[r]-a2[l]
for i in range(q):
l,r = map(int, input().split())
print(SumArea(l-1, r-1)) |
p02796 | s893311619 | Accepted | N = int(input())
MAX_list = []
ans = 0
A = -10**9-2
for _ in range(N):
X, L = map(int, input().split())
MAX_list.append(((X + L), (X - L)))
MAX_list = sorted(MAX_list)
for m, l in MAX_list:
if l >= A:
ans += 1
A = m
print(ans) |
p02802 | s467906027 | Accepted | N, M = map(int,input().split())
p = [0]*M
S = [0]*M
T = [0]*(N+1)
U = [0,0]
for i in range(M):
p[i],S[i] = input().split()
P = int(p[i])
if T[P] != -1:
if S[i] == 'WA':
T[P] += 1
elif S[i] == 'AC':
U[0] += 1
U[1] += T[P]
T[P] = -1
print(U[0],U[1])
|
p03998 | s983758015 | Accepted | s = [input() for i in range(3)]
s = {'a': s[0]+'@', 'b': s[1]+'@', 'c': s[2]+'@'}
l = {'a': len(s['a'])-1, 'b': len(s['b'])-1, 'c': len(s['c'])-1}
if len(s['a'])==1:
print('A')
exit()
ini = s['a'][0]
while True:
l[ini] += -1
tem_s=s[ini][0]
s[ini] = s[ini][1:]
if tem_s=='@':
print(ini.upper())
exit()
ini =tem_s
|
p03785 | s937913529 | Accepted | n, c, k=map(int,input().split())
bus=1
pssgr=0
fst_pssgr=0
t_lst=[]
for i in range(n):
t=int(input())
t_lst.append(t)
t_lst.sort()
for i in range(n):
if t_lst[i]-t_lst[fst_pssgr]>k:
bus+=1
pssgr=1
fst_pssgr=i
continue
pssgr+=1
if pssgr==c and i<n-1:
bus+=1
pssgr=0
fst_pssgr=i+1
print(bus) |
p02601 | s953859237 | Wrong Answer | i = list(map(int, input().split()))
K = int(input())
red=i[0]
red_double=i[0]*2
green=i[1]
green_double=i[1]*2
blue=i[2]
blue_double=i[2]*2
success=0
for num in range(K):
if green < red:
green = green_double
green_double = green_double*2
elif blue < green:
blue = blue_double
blue_double = blue_double*2
if (blue > green and green > red):
success=1
if success == 1:
print("Yes")
else:
print("No") |
p03061 | s567565974 | Accepted | from math import gcd
N=int(input())
A = [0] + list(map(int, input().split()))
L = [0]*(N+2)
R = [0]*(N+2)
ans = 0
L[0] = 0
R[N+1] = 0
for i in range(1, N+1):
L[i+1] = gcd(L[i], A[i])
for i in range(N, 0, -1):
R[i] = gcd(R[i+1], A[i])
for i in range(N+1):
ans = max(ans, gcd(L[i], R[i+1]))
print(ans) |
p03487 | s149611942 | Accepted | # import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")
N = int(input())
A = list(map(int, input().split()))
d = defaultdict(int)
for a in A:
d[a] += 1
cnt = 0
for key, val in d.items():
if key <= val:
cnt += val - key
else:
cnt += val
print(cnt)
|
p03160 | s957097678 | Wrong Answer | n=int(input())
h=list(map(int,input().split()))
f=[0]+[10**5]*(n-1)
rage=range #lol
for i in rage(1,n):
for j in range(i-2,i):
if j>=0:
f[i]=min(f[i],f[j]+abs(h[i]-h[j]))
print(f[-1])
|
p03243 | s005675916 | Wrong Answer | print(max(list(input()))*3) |
p03073 | s189823549 | Accepted | s=input()
s=list(s)
c=0
for i in range(0,len(s),2):
if s[i]=='0':
c+=1
for i in range(1,len(s),2):
if s[i]=='1':
c+=1
d=0
for i in range(0,len(s),2):
if s[i]=='1':
d+=1
for i in range(1,len(s),2):
if s[i]=='0':
d+=1
print(min(c,d)) |
p03711 | s416765790 | Wrong Answer | A=[1,3,5,7,8,10,12]
B=[4,6,9,11]
C=[2]
x,y=map(int,input().split())
if x in A and y in A:
print('YES')
elif x in B and y in B:
print('YES')
else:
print('NO')
|
p02882 | s424894217 | Accepted | from math import atan2, degrees
a, b, x = [int(x) for x in input().split()]
temp = 2 * b - 2 * x / a ** 2
if temp < b:
s = a
t = temp
else:
s = 2 * x / a / b
t = b
theta = degrees(atan2(t, s))
print(theta) |
p02818 | s401748116 | Wrong Answer | a,b,k=map(int, input().split())
s = a-k if k<a else 0
print('%d %d'%(s, (a+b)-k)) |
p03627 | s812591563 | Wrong Answer | from collections import Counter
n=int(input())
a=Counter(list(map(int,input().split()))).most_common()
x=[0,0]
for i in range(len(a)):
if x[0]<a[i][0] and a[i][1]>=2:
x[1]=x[0]
x[0]=a[i][0]
print(x[0]*x[1]) |
p02682 | s723560625 | Wrong Answer | a,b,c,k=(int(x) for x in input().split())
if a+b > k:
print(a)
else:
print(a+(c-k)) |
p03659 | s700741629 | Accepted | #!/usr/bin/env python
n = int(input())
a = list(map(int, input().split()))
l = a[0]
r = sum(a)-l
ans = abs(l-r)
for i in range(1, n-1):
l += a[i]
r -= a[i]
if abs(l-r) <= ans:
ans = abs(l-r)
print(ans)
|
p02663 | s910712178 | Wrong Answer | H1, H2, H3, H4, K = map(int, input().split())
up = H1*60 + H2
down = H3*60 - H4
print(down - up - K) |
p03494 | s518949308 | Wrong Answer | def main():
N = int(input())
A = list(map(int, input().split()))
c = 0
while True:
for i in range(N):
if A[i] % 2 == 1:
return c
else:
A[i] = A[i] // 2
c += 1
print(c)
main() |
p04044 | s689498212 | Accepted | N, L = map(int, input().split())
S = [input() for i in range(N)]
sorted_S = sorted(S)
print("".join(sorted_S))
|
p02552 | s410377980 | Accepted | x = int(input())
if x == 0:
print(1)
else:
print(0) |
p02702 | s483700176 | Accepted | s = input()[::-1] # 入力文字列を逆順でsに格納
counts = [0] * 2019
counts[0] = 1
num, d = 0, 1
for char in s:
num += int(char) * d
num %= 2019
d *= 10
d%= 2019
counts[num] += 1
ans = 0
for cnt in counts:
ans += cnt * (cnt - 1) // 2
print(ans) |
p02873 | s646182108 | Accepted | s = input()
l = [0] * (len(s)+1)
for i in range(len(s)):
if s[i] == "<":
l[i+1] = l[i]+1
for i in range(len(s)):
if s[len(s)-i-1] == ">":
l[len(s)-i-1] = max(l[len(s)-i-1], l[len(s)-i]+1)
print(sum(l)) |
p02939 | s352967678 | Wrong Answer | S=input()
i=0
ans=1
while i<len(S)-1:
if S[i]==S[i+1]:
i+=1
i+=1
ans+=1
print(ans) |
p03329 | s666388772 | Accepted | N = int(input())
dp = [i for i in range(N+1)]
for i in range(1, 7):
for j in range(9**i, N+1):
dp[j] = min(dp[j], dp[j-9**i]+1)
for i in range(1, 7):
for j in range(6**i, N+1):
dp[j] = min(dp[j], dp[j-6**i]+1)
print(dp[N]) |
p02838 | s402984071 | Accepted | import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = np.array(lr())
MOD = 10 ** 9 + 7
length = int(A.max()).bit_length()
answer = 0
for i in range(length):
B = (A >> i) & 1
x = np.count_nonzero(B)
y = N - x
x *= y
x *= 2 ** i % MOD
answer += x
print(answer % MOD)
|
p03605 | s601771310 | Wrong Answer | N = str(input())
if "9" == N[0] or "9" == N[1]:
print( "YES" )
else:
print( "NO" ) |
p03037 | s600209170 | Accepted | n,m = map(int, input().split())
lr = [0, 10**6]
for _ in range(m):
t = sorted(list(map(int, input().split())))
lr[0] = max(lr[0], t[0])
lr[1] = min(lr[1], t[1])
ans = lr[1] - lr[0] + 1
if ans < 0:
print(0)
else:
print(ans) |
p03544 | s406488483 | Wrong Answer | N = int(input())
dp = [[]for i in range(87)]
dp[0] = 2
dp[1] = 1
for i in range(2,87):
dp[i] = dp[i-1]+dp[i-2]
if i == N:
print(dp[i])
break
|
p02802 | s954820397 | Accepted | N,M = [int(i) for i in input().split()]
submissions = {str(i):[] for i in range(1,N+1)}
AC,WA = 0,0
for i in range(M):
P,S = [j for j in input().split()]
submissions[P].append(S)
for i in submissions:
if 'AC' not in submissions[i]:
continue
for j in submissions[i]:
if j == 'AC':
AC+=1
break
WA +=1
print(AC,WA) |
p02838 | s509006365 | Accepted | n,*a=map(int,open(0).read().split())
c=0
for i in range(61):
i=2**i
t=sum(i&b and 1for b in a)
c+=t*(n-t)*i;c%=10**9+7
print(c) |
p04005 | s634237109 | Accepted | N = [int(i) for i in input().split()]
N.sort()
is_even = lambda n: True if n % 2 == 0 else False
flag = False
for n in N:
if is_even(n):
flag = True
if flag:
print(0)
else:
print(N[0] * N[1]) |
p03693 | s831388055 | Accepted | rgb = int(input().replace(" ", ""))
if rgb % 4 == 0:
print("YES")
else:
print("NO") |
p03814 | s635987145 | Accepted | s = input()
print(s.rfind("Z") - s.find("A") + 1)
|
p03760 | s091870731 | Accepted | q=str(input())
e=str(input())
a=len(q)
b=len(e)
c=""
if a==b:
for i in range(a):
c+=q[i]
c+=e[i]
else:
for i in range(b):
c+=q[i]
c+=e[i]
c+=q[a-1]
print(c) |
p03427 | s487632974 | Wrong Answer | # coding: utf-8
# Your code here!
N=int(input())
if 1==len(set(list(str(N)))) and int(str(N)[0])==9:
ans=9*len(str(N))
else:
ans=9*(len(str(N))-1) + int(str(N)[0])-1
print(ans)
|
p03835 | s859152111 | Accepted | # vim: fileencoding=utf-8
def main():
k, s = map(int, input().split())
c = 0
for i in range(k + 1):
for j in range(k + 1):
z = s - i - j
if z >= 0 and z <= k:
c += 1
print(c)
if __name__ == "__main__":
main()
|
p03723 | s865770719 | Accepted | #13A - Cookie Exchanges
A,B,C = map(int, input().split())
cnt = 0
while (A%2 + B%2 + C%2) == 0:
if A == B == C:
print (-1)
exit()
else:
a = B/2 + C/2
b = A/2 + C/2
c = A/2 + B/2
A = a
B = b
C = c
cnt += 1
print (cnt) |
p02866 | s168902738 | Wrong Answer | mod = 998244353
N = int(input())
D = list(map(int,input().split()))
from collections import Counter
if D[0] != 0:
print(0)
else:
dc1 = Counter(D[1:])
dc = [0 for i in range(max(D))]
for k,v in dc1.items():
dc[k-1] = v
now = 1
ans = 1
for i in range(len(dc)):
if dc[i] == 0:
ans = 0
break
ans = (ans*(dc[i-1]**dc[i]))%mod
print(ans) |
p03612 | s149457183 | Wrong Answer | N = int(input())
p = list(map(int, input().split()))
c = 0
m = 0
box = []
for i in range(N):
if p[i] - 1 == i:
c += 1
box.append(i)
if len(box) >= 2 and box[-2] + 1 == box[-1]:
m += 1
print(c-m) |
p02717 | s768084449 | Accepted | x,y,z=map(int,input().split())
print(z,x,y)
|
p03146 | s819978873 | Accepted | mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
s = int(input())
i = 1
seen = {s}
while True:
i += 1
if s & 1:
s = s*3+1
else:
s //= 2
if s in seen:
print(i)
break
else:
seen.add(s)
if __name__ == '__main__':
main()
|
p04019 | s996707478 | Accepted | i = input()
if "S" in i and "N" not in i:
print("No")
elif "N" in i and "S" not in i:
print("No")
elif "E" in i and "W" not in i:
print("No")
elif "W" in i and "E" not in i:
print("No")
else:
print("Yes") |
p03835 | s671326421 | Accepted | import sys
readline = sys.stdin.buffer.readline
k,s = map(int,readline().split())
ans = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if 0 <= z <= k:
ans += 1
print(ans) |
p02923 | s623710323 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
cnt = 0
for j in range(i, n):
if h[j] <= h[(j + 1) % n]:
cnt += 1
ans = max(ans, cnt)
print(ans) |
p02689 | s903425064 | Accepted | n,m = map(int, input().split())
h=list(map(int, input().split()))
good=[True]*n
for i in range(m):
a,b = map(int, input().split())
if h[a-1] > h[b-1]:
good[b-1]=False
if h[b-1] > h[a-1]:
good[a-1]=False
if h[a-1] == h[b-1]:
good[b-1]=False
good[a-1]=False
ans=0
for i in good:
if i:
ans+=1
print(ans) |
p04031 | s882411291 | Wrong Answer | n = int(input())
a = [int(i) for i in input().split()]
m_cost = 10 ** 5
for i in range(min(a), max(a)+1):
cost = 0
for j in range(n):
cost += (a[j] - i) ** 2
m_cost = cost if cost < m_cost else m_cost
print(m_cost)
|
p02951 | s725843171 | Accepted | a,b,c = map(int,input().split())
if b+c-a >= 0:
print(b+c-a)
else:
print(0) |
p03817 | s629802430 | Accepted | x = int(input())
if x <= 6:
print(1)
elif x <= 11:
print(2)
else:
ans = (x//11)*2
if x % 11 != 0:
ans += 1
if x % 11 >= 7:
ans += 1
print(ans)
|
p02933 | s253307520 | Wrong Answer | a = int(input())
s = input()
print(s) if a < 3200 else print('red')
|
p02725 | s232521242 | Accepted | K,N = map(int, input().split())
A = list(map(int, input().split()))
d = K-A[N-1]+A[0]
for i in range(N-1):
d = max(d,A[i+1]-A[i])
print(K-d) |
p03524 | s865939272 | Wrong Answer | S = input()
temp = ["a", "b", "c"]
abc = [S.count(x) for x in temp]
abc.sort(reverse=True)
if abc.count(0) > 0:
print("NO")
elif abc[0] == abc[1] == abc[2]:
print("YES")
elif abc[0] == abc[1] == abc[2]+1:
print("YES")
elif abc[0] == abc[1]+1 == abc[2]+1:
print("YES")
else:
print("NO") |
p03239 | s768475543 | Accepted | N, T = map(int, input().split())
costs = []
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
costs.append(c)
if costs:
costs.sort()
ans = costs[0]
else:
ans = 'TLE'
print(ans)
|
p02546 | s013377540 | Wrong Answer | S = input()
print(S + 's' if S[-1] != 's' else 'es')
|
p02767 | s314563685 | Accepted | import numpy as np
N=int(input())
X = [int(i) for i in input().split()]
X=np.array(X)
minval = 1000000000000
ans=0
for candidate in range(101):
tmp = sum((X-candidate)**2)
if tmp < minval:
minval=tmp
ans = candidate
print(minval)
|
p03548 | s069894098 | Wrong Answer | x, y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
cnt = 0
rest = x
while(True):
if(rest - (y + z) > z):
x -= y + z
cnt += 1
rest -= (y + z)
else:
break
print(cnt) |
p03767 | s280930648 | Accepted | def solve():
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = 0
for i in range(1,2*N,2):
ans += A[i]
return ans
print(solve()) |
p02995 | s420881595 | Accepted | import math
a,b,c,d = map(int, input().split())
lcm = int(c*d / math.gcd(c,d))
def num(i):
ans = b//i - a//i
if a % i == 0:
ans +=1
return ans
lcm_num = num(lcm)
cd_num = num(c) + num(d)
num = cd_num - lcm_num
print(b-a+1-num) |
p02578 | s798689023 | Wrong Answer | num = int(input())
item = input().split()
res = 0
for i in range(num):
if i == 0:
continue
b = int(item[i - 1])
t = int(item[i])
if b > t:
res += (b - t)
print(res) |
p02699 | s390874524 | Accepted | s,w=list(map(int, input().split()))
if w>=s:
print("unsafe")
else:
print("safe")
|
p02659 | s977880817 | Wrong Answer | A, B = input().split()
A = int(A)
B = float(B)
print(int(A*B)) |
p03001 | s210773393 | Wrong Answer | W,H,X,Y = map(int,input().split())
xwari = min(X*H,(W-X)*H)
ywari = min(Y*W,(H-Y)*W)
if xwari == ywari:
f = 1
else:
f = 0
print(max(xwari,ywari),f) |
p02602 | s874223555 | Accepted | n, k = (int(each) for each in input().split())
a = [int(each) for each in input().split()]
for i in range(n-k):
if a[i] < a[k+i]:
print('Yes')
else:
print('No') |
p03221 | s806102660 | Accepted | N,M = map(int,input().split())
d=[0]*M
res = []
for i in range(M):
P,Y = map(int,input().split())
res.append((P,Y,i))
c=0
res.sort()
t = str(res[0][0])
for i in res:
x = str(i[0])
tmp = (6-len(x))*'0'+x+(6-len(str(c)))*'0'+str(c)
if x == t:
c+=1
else:
c=1
t = x
d[i[2]] = (6-len(x))*'0'+x+(6-len(str(c)))*'0'+str(c)
for i in d:
print(i) |
p02829 | s557327619 | Wrong Answer | a=input()
b=input()
if a==1 and b==2:
print "3"
elif a==2 and b==3:
print "1"
elif a==3 and b==1:
print "2"
|
p02987 | s629066675 | Wrong Answer | S=list(input())
if S[0]==[1] and S[2]==S[3] and S[0]!=S[2] or S[1]!=S[3]:
print('Yes')
elif S[0]==S[2] and S[1]==S[3] and S[0]!=S[1] or S[2]!=S[3]:
print('Yes')
elif S[0]==S[3] and S[1]==S[2] and S[0]!=S[1] or S[2]!=S[3]:
print('Yes')
else:
print('No')
|
p02817 | s094689354 | Wrong Answer | a = list(input().split())
a.sort()
print(''.join(a))
|
p02688 | s447595936 | Accepted | N,K=map(int,input().split())
arr=[0]*N
for _ in range(K):
d=int(input())
A=list(map(int,input().split()))
for a in A:
arr[a-1]=1
print(N-sum(arr)) |
p02922 | s524357847 | Accepted | A,B=map(int,input().split())
ans=0
while(1):
if 1+ans*(A-1) >= B:
print(ans)
break
else:
ans += 1 |
p03605 | s717832755 | Accepted | n = input()
if n[0] == "9" or n[1] == "9":
print("Yes")
else:
print("No")
|
p03000 | s510607987 | Accepted | import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
n,x=MI()
ls=LI()
dp=[0 for i in range(n+1)]
for i in range(n):
dp[i+1]=dp[i]+ls[i]
#print(dp)
count=0
for d in dp:
if d<=x:
count+=1
print(count) |
p02725 | s462411161 | Accepted | K, N = map(int, input().split())
A = list(map(int, input().split()))
dist=0
max_dist=0
max_i=0
for i in range(N):
a=A[i%N]
b=A[(i+1)%N]
tmp=b-a if b>a else K+b-a
if max_dist<tmp:
max_dist=max(max_dist,tmp)
max_i = i
for i in range(N-1):
i2 = i+max_i+1
a=A[i2%N]
b=A[(i2+1)%N]
tmp=b-a if b>a else K+b-a
dist+=tmp
print(dist) |
p02861 | s924239292 | Accepted | import math
from itertools import permutations
N = int(input())
xy = [list(map(int, input().split())) for _ in range(N)]
ans_ = 0
count = 0
sum_list = list(permutations(range(N), N))
for nums in sum_list:
for i in range(len(nums)-1):
x1, y1 = xy[nums[i]]
x2, y2 = xy[nums[i+1]]
ans_ += math.sqrt((x1-x2)**2+(y1-y2)**2)
count += 1
print(ans_ / count) |
p03607 | s046937222 | Accepted | from collections import defaultdict
d = defaultdict(int)
N =int(input())
for i in range(N):
a = int(input())
d[a] += 1
ans = 0
for a in d:
ans += d[a] % 2
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.