problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02628
|
s146257312
|
Wrong Answer
|
A=list(input().split(" "))
B=list(input().split(" "))
C=sorted(B)
D=[]
M=0
for i in range(int(A[1])):
D.append(int(C[i]))
for j in range(len(D)):
M=D[j]+M
print(M)
|
p04043
|
s438763693
|
Accepted
|
text = str(input())
cnt = 0
for i in text:
if i == "5":
cnt += 1
if i == "7":
cnt += 2
if cnt == 4:
print("YES")
else:
print("NO")
|
p02606
|
s728591652
|
Accepted
|
# -*- coding: utf-8 -*-
import math
#L, R, d = map(int, input().parse())
L, R, d = map(int, input().split())
start_d = int(math.ceil(L / d))
end_d = int(math.floor(R / d))
print(end_d - start_d +1)
|
p02621
|
s733262347
|
Accepted
|
a = int(input())
answer = a + a ** 2 + a ** 3
print(answer)
|
p02771
|
s022609578
|
Wrong Answer
|
n = list(map(int, input().split()))
count = 0
for i in range(1,3):
if n[0] == n[i]:
count+=1
if count == 1:
print("Yes")
else:
print("No")
|
p02677
|
s823635192
|
Accepted
|
import math
A, B, H, M = map(int, input().split())
angleH = 360 * ((H + (M / 60)) / 12)
angleM = 360 * (M / 60)
angle = abs(angleH - angleM)
answer = math.sqrt(math.pow(A, 2) + math.pow(B, 2) - (2 * A * B * math.cos(math.radians(angle))))
print(answer)
|
p02684
|
s109914638
|
Accepted
|
n, k = map(int,input().split())
a = list(map(int,input().split()))
s = [True] * n
c = [1]
now = 0
while s[now]:
s[now] = False
now = a[now] - 1
c.append(now+1)
start_cycle = c.index(c[-1])
loop = c[start_cycle:-1]
cycle = len(loop)
if k < start_cycle:
print(c[k])
else:
k -= start_cycle
k %= cycle
print(loop[k])
|
p03017
|
s253078013
|
Wrong Answer
|
#!/usr/bin/env python3
N, A, B, C, D = map(int, input().split())
S = input()
#hunuke
h = S[B-1:D+1].count('##')
m3 = S[B-1:C+1].count('...')
if C < D:
if h == 0: print('Yes')
else: print('No')
else:
if m3 == 0: print('No')
else: print('Yes')
|
p03264
|
s805171744
|
Accepted
|
K = int(input())
print((K//2)*((K+1)//2))
|
p02645
|
s368423083
|
Accepted
|
s=input()
print(s[:3])
|
p03854
|
s859016632
|
Accepted
|
words = ["dream", "dreamer", "erase", "eraser"]
#5 #7 #5 #6
s = input()
while len(s) > 0:
if s[-5:] in words:
s = s[:-5]
elif s[-6:] in words:
s = s[:-6]
elif s[-7:] in words:
s = s[:-7]
else:
print("NO")
exit()
print("YES")
|
p02664
|
s566506744
|
Wrong Answer
|
def main():
T = input()
# ?D -> PD
# ?P -> DP
# ?? -> PD
# ??? -> PDD
T = T.replace("??", "DD")
T = T.replace("?D", "PD")
T = T.replace("?P", "DP")
T = T.replace("?", "D")
print(T)
if __name__=="__main__":
main()
|
p02787
|
s599028670
|
Wrong Answer
|
H, n = map(int, input().split())
magics = []
for _ in range(n):
a, b = map(int, input().split())
magics.append((a, b))
print(magics)
# 体力をn削るために必要なmpの最小値
dp = [0] * (H+1)
for h in range(1, H+1):
dp[h] = min([dp[max(h-a, 0)] + b for (a, b) in magics])
print(dp[-1])
|
p02678
|
s530260924
|
Wrong Answer
|
import numpy as np
from scipy.sparse.csgraph import shortest_path
N, M = map(int, input().split())
l = [[0]*N for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
l[A-1][B-1] = 1
l[B-1][A-1] = 1
a = np.array(l)
aa = shortest_path(a, directed=False)
if float('inf') in aa[0]:
print('No')
else:
print('Yes')
for i in aa[0][1:]:
print(int(i))
|
p03059
|
s379944889
|
Wrong Answer
|
A,B,T = map(int,input().split())
count = 0
for i in range(1,T):
if i*A<=T:
count += B
print(count)
|
p03627
|
s439902987
|
Wrong Answer
|
n = int(input())
A = list(map(int, input().split()))
from collections import Counter
c = Counter(A)
mul = []
for k, v in c.items():
if v >= 2:
mul.append(k)
elif v >= 4:
mul.append(k)
mul.append(k)
mul.sort()
if len(mul) < 2:
print(0)
else:
print(mul[-1]*mul[-2])
|
p02714
|
s628005356
|
Accepted
|
n=int(input())
s=str(input())
r=0
g=0
b=0
for x in range (n):
if s[x]=='R':
r+=1
elif s[x]=='G':
g+=1
else:
b+=1
rgb=r*g*b
for i in range (n):
for j in range (i,n):
k=j*2-i
if k<n:
if s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
rgb=rgb-1
print(rgb)
|
p02766
|
s807303410
|
Accepted
|
n,k=(int(x) for x in input().split())
i=0
while(n>=k**i):
i+=1
print(i)
|
p02583
|
s397724609
|
Wrong Answer
|
n=int(input())
l=sorted(list(map(int,input().split())),reverse=True)
count=0
if n<3:
print("0")
else:
for i in range(n-2):
for j in range(n-2-i):
for k in range(n-2-i-j):
if l[i]<l[1+j]+l[2+k] and l[i]!=l[1+j]!=l[2+k]:
count+=1
print(count)
|
p02689
|
s415109375
|
Wrong Answer
|
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [0]*M
B = [0]*M
for i in range(M):
A[i], B[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
lis = [0]*M
for i in range(M):
lis[i] = max(H[A[i]],H[B[i]])
print(len(set(lis)))
|
p02601
|
s244584926
|
Accepted
|
a, b, c, k = map(int, open(0).read().split())
while a >= b:
b *= 2
k -= 1
while b >= c:
c *= 2
k -= 1
if k >= 0:
print('Yes')
else:
print('No')
|
p02818
|
s819127169
|
Accepted
|
A, B, K = map(int, input().split())
if K - A <= 0:
print(str(A - K) + ' ' + str(B))
else:
print('0 ' + str(max(0, B - (K - A))))
|
p03795
|
s808919276
|
Accepted
|
a = int(input())
print((a*800)-(a//15*200))
|
p02910
|
s933863163
|
Accepted
|
S = input()
for i in range(len(S)):
if i%2 == 0:
if S[i] == 'L':
print('No')
exit()
else:
if S[i] == 'R':
print('No')
exit()
print('Yes')
|
p02730
|
s420413007
|
Wrong Answer
|
import sys
def is_pal(s):
i,j=0,len(s)-1
while i<=j:
if s[i]==s[j]:
i+=1
j-=1
else:
return False
return True
s=sys.stdin.readline()[:-1]
n=len(s)
if n%2!=0:
if is_pal(s[:n//2]) and is_pal(s[n//2+1:]):
print('Yes')
else:
print('No')
else:
print('No')
|
p03862
|
s235305292
|
Accepted
|
N,x=map(int,input().split())
a=list(map(int,input().split()))+[0]
ans=0
for i in range(N):
eated=max(0,a[i]+a[i-1]-x)
ans+=eated
a[i]-=eated
print(ans)
|
p02761
|
s875624869
|
Accepted
|
n, m = (int(x) for x in input().split())
ans = [None for _ in range(n)]
fail = False
for _ in range(m):
s,c = (int(x) for x in input().split())
s -=1
if ans[s] is None:
ans[s] = c
elif ans[s] != c:
fail = True
break
if fail or (ans[0] == 0 and n > 1):
print(-1)
else:
if ans[0] is None and n > 1:
ans[0] = 1
elif ans[0] is None and n == 1:
ans[0] = 0
print(''.join((str(i) if i is not None else '0' for i in ans)))
|
p03241
|
s586216644
|
Accepted
|
N,M = map(int,input().split())
A = []
for i in range(1,M+1):
if i*i>M:break
if M%i==0:
A.append(i)
A.append(M//i)
A.sort()
for a in A:
if a>=N:
print(M//a)
break
|
p02899
|
s102946841
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
a =[[] for i in range(N)]
for i in range(N):
a[i] =[A[i], i+1]
a.sort()
ans = [0 for i in range(N)]
for i in range(N):
ans[i] = a[i][1]
print(ans)
|
p02909
|
s522539354
|
Accepted
|
S = input()
rotate = ["Sunny","Cloudy","Rainy"]
print(rotate[(rotate.index(S) + 1) % 3])
|
p03711
|
s770296519
|
Accepted
|
def solve():
x, y = map(int, input().split())
a = [1, 3, 5, 7, 8, 10, 12]
b = [4, 6, 9, 11]
c = [2]
if (x in a and y in a) or (x in b and y in b) or (x in c and y in c):
print("Yes")
else:
print("No")
if __name__ == "__main__":
solve()
|
p02778
|
s158372778
|
Wrong Answer
|
S = input()
print('X' * len(S))
|
p03323
|
s108139927
|
Accepted
|
a,b=map(int,input().split())
if a>8 or b>8:
print(":(")
else:
print("Yay!")
|
p02683
|
s341688511
|
Wrong Answer
|
import numpy as np
n, m, x = map(int, input().split())
caa = [np.array(list(map(int, input().split()))) for _ in range(n)]
ans = 1 << 31
for i in range(2**n):
tmp = np.zeros(len(caa[0]))
for j in range(n):
if i % (2**j):
tmp += caa[j]
if min(tmp[1:]) >= x:
ans = min(ans, tmp[0])
if ans != 1<<31:
print(int(ans))
else:
print(-1)
|
p03767
|
s426225123
|
Accepted
|
N = int(input())
A = sorted(list(map(int, input().split())))[::-1]
ans = 0
for i, a in enumerate(A[: - N]):
if i % 2 == 1:
ans += a
print(ans)
|
p02633
|
s496106958
|
Accepted
|
X=int(input())
K=0
B=0
C=0
for i in range(0,360):
B=B+X
C=B%360
K=K+1
if C==0:
print(K)
break
|
p04031
|
s718114276
|
Wrong Answer
|
N = int(input())
a = list(map(int,input().split()))
a.sort()
c = ((a[-1]-a[0])+1)//2+a[0]
ans = 0
for i in range(N):
ans += (a[i]-c)**2
print(ans)
|
p04011
|
s292653197
|
Accepted
|
n = int(input())
k = int(input())
x = int(input())
y = int(input())
if n<=k:
print(n*x)
else:
tmp = (n-k) * y + k * x
print(tmp)
|
p04033
|
s466390266
|
Wrong Answer
|
# -*- coding: utf-8 -*-
a, b = map(int,input().split())
if b < 0:
print("Negative")
elif 0 < a:
print("Positive")
elif -1 * a == b:
print("Zero")
|
p02971
|
s620427210
|
Accepted
|
n = int(input())
A = []
for _ in range(n):
A.append(int(input()))
B = sorted(A, reverse=True)
first = B[0]
second = B[1]
for i in range(n):
if A[i] != first:
print(first)
else:
print(second)
|
p03679
|
s999402410
|
Accepted
|
x, a, b = map(int, input().split())
if b-a <= 0:
print('delicious')
elif b-a <= x:
print('safe')
else:
print('dangerous')
|
p03059
|
s006395961
|
Wrong Answer
|
a,b,t = map(int,input().split())
print((3*a*b)/(t+0.5))
|
p03723
|
s473342783
|
Accepted
|
a,b,c=map(int,input().split());print(len(bin((e:=a-b|c-b)&-e))-3or~c%-2)
|
p02918
|
s526875653
|
Wrong Answer
|
n_k = list(map(int,input().split()))
chr_lr = list(input())
cnt_rl = 0
cnt_con = 0
for i in range(n_k[0]-1):
if(chr_lr[i] == chr_lr[i+1]):
cnt_con += 1
elif(chr_lr[i] == 'R' and chr_lr[i+1] == 'L'):
cnt_rl += 1
if n_k[1] <= cnt_rl:
sum = cnt_con + (n_k[1]*2)
else:
sum = cnt_con + (cnt_rl*2) + (n_k[1] - cnt_rl)
print(sum)
|
p02842
|
s391271118
|
Wrong Answer
|
N=int(input())
for i in range(N):
if round(i*1.08)==N:
print(i)
exit()
print(":(")
|
p02683
|
s305683538
|
Wrong Answer
|
from itertools import product
[N, M, X] = [int(i) for i in input().split()]
bk = [[int(i) for i in input().split()] for _ in range(N)]
ans = 12*10**5
for seq in product(range(2), repeat=N):
S = [0]*(M+1)
for i in range(N):
for j in range(M+1):
S[j] += seq[i]*bk[i][j]
print(S, seq)
if min(S[1:M+1]) >= X:
ans = min(ans, S[0])
print(ans)
|
p03774
|
s899766803
|
Accepted
|
import sys
input = lambda: sys.stdin.readline().rstrip()
n, m = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(n)]
CD = [list(map(int, input().split())) for _ in range(m)]
#print(AB)
#print(CD)
for i in range(n):
dist_list = []
for j in range(m):
dist = abs(AB[i][0] - CD[j][0]) + abs(AB[i][1] - CD[j][1])
dist_list.append(dist)
#print(dist_list)
print(dist_list.index(min(dist_list))+1)
|
p03377
|
s036245182
|
Accepted
|
a, b, x = map(int, input().split())
if x >= a and x <= a + b:
print('YES')
else:
print('NO')
|
p02628
|
s112031738
|
Wrong Answer
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
p.sort()
ans = 0
for i in range(k):
ans += p.pop(0)
|
p02860
|
s483971445
|
Accepted
|
n = int(input())
s = list(input())
if n % 2 == 1:
print("No")
else:
t = s[:int(n/2)]
if s == t * 2:
print("Yes")
else:
print("No")
|
p02972
|
s524055801
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
ans_l = [0]*n
for i in reversed(range(1,n)):
if sum(ans_l[(i)::(i+1)])%2 != a[i]:
ans_l[i] += 1
if sum(ans_l)%2 != a[0]:
ans_l[0] += 1
ans = []
for i in range(n):
if ans_l[i]==1:
ans.append(i+1)
print(len(ans))
if len(ans)>0:
print(" ".join(map(str, ans)))
|
p03035
|
s309252970
|
Accepted
|
a,b=map(int,input().split())
print((b>>(a<13))*(a>5))
|
p02785
|
s285580928
|
Wrong Answer
|
n,k=map(int,input().split())
hp=list(map(int,input().split()))
hp.sort(reverse=True)
print(sum(hp[-k:]))
|
p02777
|
s097821583
|
Wrong Answer
|
s,t=input().split()
a,b=map(int,input().split())
u=input().split()
if s==u:
print(str(a-1)+" "+str(b))
else:
print(str(a)+" "+str(b-1))
|
p03000
|
s981222193
|
Accepted
|
import bisect
n,x=map(int,input().split())
L=list(map(int,input().split()))
lst=[0]*(n+1)
for i in range(1, n+1):
lst[i]=lst[i-1]+L[i-1]
print(bisect.bisect_right(lst,x))
|
p02645
|
s792134145
|
Accepted
|
s = input()
print(s[:3])
|
p02814
|
s634527699
|
Wrong Answer
|
N,M=map(int,input().split())
A = list(map(int,input().split()))
cnt=0
dist = 1
width = 2
fstCmm = 0
while dist <= M:
flag = 1
for a in A:
if (dist / a) - int(dist / a) != 0.5:
flag = 0
break
if flag == 1:
fstCmm = dist
break
dist += width
print((M-dist)//(dist*2) +1)
|
p02880
|
s463356028
|
Wrong Answer
|
N = int(input())
for x in range(9,0,-1):
if N % x == 0 and N // x < 10:
print("yes")
exit()
print("no")
|
p03433
|
s032160900
|
Accepted
|
n, a = map(int, [input() for i in range(2)])
if n-500*(n//500) <= a:
print("Yes")
else:
print("No")
|
p02624
|
s066295883
|
Accepted
|
def main():
n = int(input())
ans = 0
SQRT = int(n ** 0.5)
for m in range(1,SQRT + 1):
b = int(n/m)
ans += m * (m + b) * (b + 1 - m)
ans -= SQRT * (SQRT+1) * (2*SQRT+1) // 6
print(ans)
main()
|
p02801
|
s354600982
|
Accepted
|
# -*- coding: utf-8 -*-
C = input()
print(chr(ord(C) + 1))
|
p02677
|
s027746012
|
Accepted
|
import math
import decimal
xh = 0
yh = 0
xm = 0
ym = 0
a,b,h,m = map(int, input().split())
th = (h*60+m)/720*2*math.pi
tm = (m)/60*2*math.pi
xh = (a)*math.cos(th)
yh = (a)*math.sin(th)
xm = b*math.cos(tm)
th = b*math.sin(tm)
x = abs(xh-xm)
y = abs(yh-th)
ans = math.sqrt(x**2+y**2)
print(format(ans, '.9f'))
|
p02912
|
s675124218
|
Accepted
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(len(A)):
A[i] *= -1
import heapq
heapq.heapify(A)
for _ in range(M):
a = heapq.heappop(A)
heapq.heappush(A, ((a*(-1))//2)*(-1))
result = -sum(A)
print(result)
|
p02696
|
s923099340
|
Accepted
|
a, b, n = [int(elem) for elem in input().split()]
if b <= n:
res = int(a * (b-1) / b) - a * int((b-1) / b)
else:
res = int(a * n / b) - a * int(n / b)
print(res)
|
p02646
|
s401692955
|
Wrong Answer
|
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
set_position = abs(B-A)
move = V-W
for i in range(T):
set_position -= move
if set_position==0:
print("YES")
break
elif set_position < 0:
print("NO")
break
else:
print("NO")
|
p03804
|
s818364334
|
Accepted
|
N,M=map(int,input().split())
A=[]
B=[]
for i in range(N):
A.append(input())
for i in range(M):
B.append(input())
for i in range(N-M+1):
for j in range(N-M+1):
f=True
for k in range(M):
if A[j+k][i:M+i]==B[k]:continue
else:
f=False
break
if f:
print("Yes")
exit()
print("No")
|
p02690
|
s796085191
|
Wrong Answer
|
n = int(input())
a = [i**5 for i in range(120)]
for i in range(119):
for j in range(i+1,119):
if a[j]-a[i] == n:
print(j,i)
break
if a[j]+a[i] == n:
print(j,-i)
break
else: continue
break
|
p03073
|
s594258947
|
Wrong Answer
|
import numpy as np
s_ = int(input())
s = np.array(list(map(int, str(s_))))
a01 = np.tile([0,1], len(s)//2+1)
a10 = np.tile([1,0], len(s)//2+1)
if len(s)%2 != 0:
a01 = np.delete(a01, len(s))
a10 = np.delete(a10, len(s))
else:
a01 = np.delete(a01, [len(s)-1,len(s)])
a10 = np.delete(a10, [len(s)-1,len(s)])
ans01 = np.abs(s -a01)
ans10 = np.abs(s -a10)
if sum(ans01) >= sum(ans10):
print(sum(ans10))
else:
print(sum(ans01))
|
p02724
|
s274899657
|
Accepted
|
money = int(input())
tem_1 = money // 500
money_2 = money % 500
tem_2 = money_2 // 5
ans = 1000*tem_1 + 5*tem_2
print(ans)
|
p02819
|
s702428332
|
Wrong Answer
|
from bisect import bisect_left
def get_prime_list(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
X = int(input())
primes = get_prime_list(100100)
print(bisect_left(primes, X))
|
p03379
|
s756190239
|
Accepted
|
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N = int(readline())
X = list(map(int, readline().split()))
X_sorted = sorted(X)
# この二つ以外にありえない
small, large = X_sorted[(N-1)//2], X_sorted[(N+1)//2]
for x in X:
if x <= small:
print(large)
else:
print(small)
|
p03437
|
s299642399
|
Wrong Answer
|
x,y = input().split(' ')
x = int(x)
y = int(y)
if y == 1:
print(-1)
else:
if 0 < x and x <= 1e18:
print(x)
else :
print(-1)
|
p03696
|
s340963169
|
Accepted
|
n = int(input())
s = input()
add_l = 0
add_r = 0
for e in s:
if e == "(":
add_r += 1
else: # e == ")"
if add_r == 0:
add_l += 1
else:
add_r -= 1
ans = add_l * "(" + s + ")" * add_r
print(ans)
|
p02854
|
s586162503
|
Accepted
|
def main():
N = int(input())
A = list(map(int, input().split()))
total = sum(A)
s = 0
m = total
for a in A:
s += a
tmp = abs(total- 2*s)
if tmp < m:
m = tmp
print(m)
if __name__ == '__main__':
main()
|
p03360
|
s385836201
|
Wrong Answer
|
abc = list(map(int, input().split()))
k = int(input())
abc.sort()
abc[2] = abc[2] * 2 ** (k-1)
print(sum(abc))
|
p02708
|
s453214297
|
Accepted
|
def resolve():
n, k = map(int, input().split())
Mod = 1000000007
ans = 0
for i in range(n - k + 2):
j = i + k
start = j * (j - 1) / 2
final = (n * 2 - j + 1) * j / 2
add = final - start + 1
ans = (ans + add) % Mod
print(int(ans))
resolve()
|
p03331
|
s712338648
|
Wrong Answer
|
n = int(input())
l = []
for i in range(1,n + 1):
j = n - i
x = sum(map(int,list(str(i)))) + sum((map(int,list(str(j)))))
l.append(x)
print(min(l))
|
p02713
|
s888076662
|
Accepted
|
from math import gcd
def solve(i,j,k):
return gcd(gcd(i,j),k)
n = int(input())
ans = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans+=solve(i,j,k)
print(ans)
|
p03438
|
s630266607
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ca = 0
cb = 0
for i,j in zip(a,b):
if i > j:
cb += i-j
else:
ca += j-i
if ca > cb:
print("Yes")
else:
print("No")
|
p02792
|
s125927357
|
Accepted
|
n = int(input())
c = [[0 for _ in range(10)] for _ in range(10)]
for i in range(n + 1):
left = int(str(i)[0])
right = i % 10
c[left][right] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += c[i][j] * c[j][i]
print(ans)
|
p02547
|
s801531419
|
Accepted
|
n = int(input())
cnt = 0
for i in range(n):
a,b = map(int,input().split())
if a==b:
cnt+=1
else:
cnt = 0
if cnt ==3:
print('Yes')
exit()
print('No')
|
p03011
|
s524773119
|
Wrong Answer
|
a,b,c = [int(a) for a in input().split()]
print(a+b)
|
p03286
|
s202326136
|
Accepted
|
n = int(input())
if n == 0:
print(0)
exit()
s = ""
while True:
if n == 0:
break
if n%2 == 0:
s += "0"
n = n//(-2)
else:
s += "1"
n = (n-1)//(-2)
print(s[::-1])
|
p03386
|
s126726593
|
Wrong Answer
|
a,b,n=map(int,input().split())
Alist = list(range(a,min(a+n,b+1),1))
Blist = list(range(max(a,b-n+1),b+1,1))
C = set(Alist)|set(Blist)
for i in list(C):
print(i)
|
p02711
|
s551527075
|
Accepted
|
N = int(input())
A = str(N)
check = 0
for i in range(0,3):
if(A[i] == '7'):
check = 1
if(check == 1):
print("Yes")
else:
print("No")
|
p03219
|
s826729884
|
Accepted
|
X,Y=map(int,input().split())
print(X+Y//2)
|
p02924
|
s980625335
|
Accepted
|
n=int(input())
print(n*(n-1)//2)
|
p03433
|
s553937400
|
Accepted
|
N_ = int(input())
A_ = int(input())
if N_ % 500 > A_:
print("No")
else:
print("Yes")
|
p03623
|
s201202772
|
Accepted
|
x, a, b = map(int,input().split())
if abs(x-a) > abs(x-b):
print("B")
else:
print("A")
|
p02690
|
s434587837
|
Accepted
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque
x = int(stdin.readline().rstrip())
for i in range(-150,150):
for j in range(-150,150):
if i**5-j**5 == x: print(i,j); sys.exit()
|
p02576
|
s930342094
|
Accepted
|
n, x, t = map(int, input().split())
print(((n - 1) // x + 1) * t)
|
p03774
|
s385166199
|
Accepted
|
import numpy as np
N, M = map(int, input().split())
A, B = np.array(tuple(tuple(map(int, input().split())) for _ in range(N)), dtype=np.int64).T
C, D = np.array(tuple(tuple(map(int, input().split())) for _ in range(M)), dtype=np.int64).T
print(*((np.abs(np.subtract.outer(A, C)) + np.abs(np.subtract.outer(B, D))).argmin(axis=1) + 1), sep="\n")
|
p02682
|
s921390499
|
Accepted
|
A,B,C,K=map(int,input().split())
if K<A:
print(K)
if A<=K<A+B:
print(A)
if A+B<=K:
print(2*A+B-K)
|
p03836
|
s175331925
|
Accepted
|
sx, sy, tx, ty = map(int, input().split())
s = ''
for i in range(ty - sy):
s = s + 'U'
for i in range(tx - sx):
s = s + 'R'
for i in range(ty - sy):
s = s + 'D'
for i in range(tx - sx):
s = s + 'L'
s = s + 'L'
for i in range(ty - sy + 1):
s = s + 'U'
for i in range(tx - sx + 1):
s = s + 'R'
s = s + 'DR'
for i in range(ty - sy + 1):
s = s + 'D'
for i in range(tx - sx + 1):
s = s + 'L'
s = s + 'U'
print(s)
|
p03371
|
s035189049
|
Wrong Answer
|
a, b, c, x, y = map(int, input().split())
if a+b<=2*c:
print(x*a+y*b)
else:
ans = c*2*min(x, y)
if x>=y:
ans += (x-y)*a
else:
ans += (y-x)*b
print(ans)
|
p03041
|
s747831917
|
Accepted
|
n, k = map(int, input().split())
k -= 1
s = input()
ans = s[:k] + s[k].lower() + s[k + 1:]
print(ans)
|
p03037
|
s573077299
|
Wrong Answer
|
n,m = map(int,input().split())
l,r = 1,n
for i in range(m):
l_tmp,r_tmp = map(int,input().split())
if l_tmp > l:
l = l_tmp
if r_tmp < r:
r = r_tmp
print(r-l+1)
|
p02916
|
s236625301
|
Accepted
|
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
ans=sum(B)
for i in range(1,N):
if A[i-1]+1==A[i]:
ans+=C[A[i]-2]
print(ans)
|
p02725
|
s613809439
|
Accepted
|
K, N = map(int, input().split())
Ai = list(map(int, input().split()))
Di = [0]*len(Ai)
for i in range(len(Ai)):
if i == len(Ai) - 1:
Di[i] = (K - Ai[i]) + Ai[0]
else:
Di[i] = Ai[i + 1] - Ai[i]
ans = K - max(Di)
print(ans)
|
p03860
|
s386093851
|
Wrong Answer
|
a = input()
print('A'+a[8]+'B')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.