problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02785 | s009780802 | Accepted | N, K = map(int, input().split())
H = [int(i) for i in input().split()]
H.sort(reverse = True)
print(sum(H[K:])) |
p02836 | s400959944 | Wrong Answer | import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')
def main():
s = input()
ans = 0
for i in range(len(s)//2 + 1):
if s[i] != s[-(i+1)]:
ans += 1
print(ans)
if __name__ == '__main__':
main() |
p02987 | s556928661 | Wrong Answer | import collections
s = str(input())
l = []
for i in range(0,4):
l.append(s[i])
i += 1
c = collections.Counter(l)
print(len(c)) |
p02748 | s751650731 | Wrong Answer | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
vals = []
for _ in range(M):
i, j, v = map(int, input().split())
print(i, j, v)
vals.append( a[i - 1] + b[j - 1] - v)
vals.append(min(a) + min(b))
print(min(vals)) |
p03815 | s323186262 | Accepted | x = int(input())
y = x//11
ans = 2*y
if x-y*11 == 0:
pass
elif x-y*11 <= 6:
ans += 1
else:
ans += 2
print(ans) |
p02973 | s332512141 | Wrong Answer | n = int(input())
A = []
for _ in range(n):
a = int(input())
A.append(a)
ans = 0
tmp = 1
if n==1:print(1);exit()
for i in range(n-1):
if A[i]>=A[i+1]:
tmp += 1
ans = max(ans,tmp)
else:
tmp = 1
print(ans)
|
p03448 | s859000739 | Wrong Answer | A, B, C, X = [int(input()) for i in range(4)]
print(500*a+100*b+50*c == X for a in range(A+1) for b in range(B+1) for c in range(C+1)) |
p03324 | s766982056 | Wrong Answer | d,n =map(int,input().split())
if n%100 != 0:
ans = 10**d*n
else:
ans = 10**d*n+1
print(ans) |
p02951 | s372180618 | Accepted | a,b,c=map(int,input().split())
x=b+c-a if a<b+c else 0;print(x) |
p02829 | s014903736 | Wrong Answer | a = {1, 2, 3}
a.remove(int(input()))
a.remove(int(input()))
print(list(a)) |
p03627 | s368226419 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
a.sort(reverse=True)
b = list(set(a))
b.sort(reverse=True)
l = len(b)
c = [0 for _ in range(l)]
prei = b[0]
j = 0
for i in a:
if i != prei:
j += 1
c[j] += 1
prei = i
x = []
for i in range(l):
if c[i] >= 2:
x.append(b[i])
if c[i] >= 4:
x.append(b[i])
if len(x) >= 2:
ans = x[0] * x[1]
print(ans)
else:
print(0)
|
p02831 | s649992451 | Accepted | import fractions
A,B = map(int,input().split())
print(A*B//fractions.gcd(A,B)) |
p03679 | s929351211 | Wrong Answer | a, b, c = list(map(int, input().split()))
if (b<=a) and (c<=a):
print("delicious")
elif (b<=a) and (c>a):
print("safe")
elif (b>a) and (c>a):
print("dangerous") |
p03910 | s491592267 | Accepted | n = int(input())
now = 1
num = 1
for i in range(1, n+1):
now = int(i*(i+1)/2)
if now >= n:
num = i
break
diff = now - n
for i in range(1,num+1):
if i == diff:
pass
else:
print(i)
|
p02719 | s534632307 | Accepted | n, k = map(int, input().split())
x = n % k
print(min(abs(x-k), x)) |
p03000 | s291911396 | Accepted |
n,x = map(int,input().split())
l = list(map(int,input().split()))
count = 0
d = [0]
for i in range(1,len(l)+1):
d.append(l[i-1]+d[i-1])
for i in range(len(d)):
if d[i] <= x:
count += 1
print(count)
|
p03779 | s805771155 | Accepted | X=int(input())
t=int((2*X)**0.5)+1
ans=0
for i in range(t,0, -1):
if X <= i*(i+1)/2:
ans=i
else:
break
print(ans) |
p04029 | s745253696 | Accepted | n=int(input())
ans=0
for i in range(n):
ans+=n-i
print(ans) |
p03680 | s830231268 | Accepted | N = int(input())
A = []
ex = [0]*N
light = 0
c = 0
for i in range(N) :
A.append(int(input()))
while light != 1 :
if ex[light] == 1 :
print('-1')
exit()
ex[light] = 1
light = A[light]-1
c += 1
print(c) |
p03657 | s944079040 | Accepted | a, b = map(int, input().split())
if (a + b) % 3 == 0 or a % 3 == 0 or b % 3 == 0:
print("Possible")
else:
print('Impossible') |
p02701 | s252377136 | Accepted | N=int(input())
s=set()
for i in range(N):
s.add(input())
print(len(s)) |
p02726 | s919170654 | Wrong Answer | N, R1, R2 = map(int, input().split())
count={}
for m in range(N-1):
count[m+1] = 0
for i in range(N):
for j in range(i+1, N):
if i <= R1-1 and j >= R2-1:
count[j-i-(R2-R1-1)] +=1
else:
count[j-i] += 1
for k in count.values():
print(k)
|
p02647 | s885299785 | Accepted | def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n,k=map(int,input().split())
a=list(map(int,input().split()))
if k>100:
a=[n]*n
print(*a)
exit()
for i in range(k):
b=[0]*(n+1)
for j in range(n):
l,r=max(0,j-a[j]),min(n,j+a[j]+1)
b[l]+=1
b[r]-=1
a=Csum(b)[1:-1]
print(*a) |
p02959 | s246095008 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
for i in range(n):
if b[i]>a[i]:
ans+=a[i]
b[i]-=a[i]
if b[i]>a[i+1]:
ans+=a[i+1]
a[i+1]=0
else:
a[i+1]-=b[i]
ans+=b[i]
else:
ans+=b[i]
print(ans) |
p02789 | s120271223 | Accepted | n,m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No') |
p02838 | s960082670 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(60):
X = sum([1 for x in A if (x >> 1) & 1])
ans += (1 << i) * X * (N - X)
ans %= mod
print(ans)
|
p02621 | s367492756 | Wrong Answer | a=int(input())
print(a+a^2+a^3) |
p03437 | s443310400 | Accepted | x,y=map(int,input().split())
print(x if x%y!=0 else -1) |
p03774 | s707507542 | Accepted | n,m = map(int,input().split())
l = [list(map(int,input().split())) for i in range(n)]
a,b = [list(i) for i in zip(*l)]
l = [list(map(int,input().split())) for i in range(m)]
c,d = [list(i) for i in zip(*l)]
for i in range(n):
p = 10 ** 9
t = 50
for j in range(m):
e = abs(a[i] - c[j]) + abs(b[i] - d[j])
if p > e:
p = e
t = j + 1
print(t) |
p02854 | s747624497 | Accepted | n=int(input())
A =list(map(int,input().split()))
k = sum(A)/2
cnt=0
cnt2 = 0
for i in A:
k -= i
if k < 0:
cnt += abs(k)
cnt2 += k + i
break
print(int(2*min(cnt,cnt2))) |
p02792 | s559804443 | Accepted | N = int(input())
count = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1, N + 1):
st, ed = int(str(i)[0]), int(str(i)[-1])
count[st][ed] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += count[i][j] * count[j][i]
print(ans) |
p02603 | s099521619 | Accepted | n = int(input())
a = list(map(int,input().split()))
m = 1000
s = 0
for i in range(n-1):
if s == 0:
if a[i+1]>a[i]:
s += m//a[i]
m = m%a[i]
if s != 0:
if a[i+1]<a[i]:
m += s*a[i]
s = 0
#print(i,m)
if s != 0:
m += s*a[n-1]
s = 0
print(m)
|
p02897 | s582560595 | Accepted | N = int(input())
print(1- (N // 2) / N) |
p02922 | s316582843 | Accepted | A, B = map(int, input().split())
C = 0
while (True):
if(A*C-C+1 >= B):
break
C += 1
print(C) |
p02899 | s951029410 | Accepted | stdin = open(0).read().rstrip().split('\n')
N = int(stdin[0])
A = list(map(int,stdin[1].split()))
ans =[0]*N
for i in range(N):
ans[A[i]-1] = i+1
print(' '.join(map(str,ans))) |
p03761 | s477850588 | Accepted | n = int(input())
sList = []
for i in range(n):
sList.append(input())
cList = []
sN = ord('a')
while True:
if ord('z')+1 == sN:
break
sA = 50
for i in range(n):
tmp = sList[i].count(chr(sN))
if sA > tmp:
sA = tmp
cList.append(sA)
sN += 1
cS = ''
for i in range(len(cList)):
cS += chr(ord('a')+i)*cList[i]
print(cS)
|
p03705 | s719793166 | Accepted | def main():
n, a, b = map(int, input().split())
if a == b:
print(1)
return 0
elif a > b or n == 1:
print(0)
return 0
else:
print((b-a)*(n-2)+1)
return 0
if __name__ == '__main__':
main()
|
p03449 | s920001108 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
print(max(sum(a[:i+1])+sum(b[i:]) for i in range(n))) |
p03910 | s580946438 | Accepted | import bisect
import numpy as np
n = int(input())
arr = np.arange(4500) + 1
arr = arr.cumsum()
div = bisect.bisect_left(arr, n) + 1
arr = np.arange(div) + 1
rem = arr.sum() - n
arr = arr[np.where(arr != rem)]
print(*arr, sep="\n") |
p04033 | s521622519 | Accepted | a,b=map(int,input().split())
if a<=0 and b>=0:print("Zero")
if a>0:print("Positive")
if b<0:print("Positive" if (b-a)%2 else "Negative") |
p03285 | s431312975 | Accepted | N =int(input())
flag = False
for i in range(N):
for j in range(N):
if(4*i+7*j==N):
flag=True
break
if(flag):
break
if(flag):
print("Yes")
else:
print("No") |
p03760 | s388309510 | Accepted | def joinstring(O, E) :
if len(O) - len(E) > 0 :
str = "".join([i + j for i, j in zip(O, E)])
str += O[-1]
return str
else :
str = "".join([i + j for i, j in zip(O, E)])
return str
O = input()
E = input()
print(joinstring(O, E)) |
p03657 | s044488820 | Wrong Answer | a,b=map(int,input().split())
if a==b:
print("Possible")
elif a%2==0 and b%2==0:
print("Possible")
else:
print("Impossible") |
p02766 | s191096056 | Accepted | n, r = map(int, input().split())
for i in range(1, 10**100):
if r ** (i - 1) <= n < r ** i:
print(i)
exit()
|
p03478 | s375703997 | Accepted | def sum_digits(n):
total = 0
while n > 0:
total += n % 10
n //= 10
return total
N, A, B = map(int, input().split())
ans = 0
for i in range(1, N + 1):
n = sum_digits(i)
if n >= A and n <= B:
ans += i
print(ans) |
p03695 | s633706553 | Accepted | def main():
n=int(input())
ans=[0]*8
other = 0
for a in map(int,input().split()):
if a >= 3200:
other+=1
else:
ans[a//400] = 1
a = ans.count(1)
print(a if a != 0 else 1, a+other)
if __name__ == "__main__":
main() |
p03711 | s400646619 | Accepted | A = [1, 3, 5, 7, 8, 10, 12]
B = [4, 6, 9, 11]
C = [2]
x, y = map(int, input().split())
ans = "No"
for group in [A, B, C]:
if x in group and y in group:
ans = "Yes"
print(ans)
|
p02690 | s279086488 | Accepted | x = int(input())
for i in range(1000):
for j in range(1000):
a = i**5
b = j**5
if a-b == x:
print(i,j)
exit()
elif a+b == x:
print(i,-j)
exit()
elif -a-b == x:
print(-i,-j)
exit() |
p04034 | s677246217 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Sun Jun 7 14:28:00 2020
@author: NEC-PCuser
"""
N, M = map(int, input().split())
x, y = [], []
for i in range(M):
x_tmp, y_tmp = map(int, input().split())
x.append(x_tmp)
y.append(y_tmp)
box = [1] * N
ball_set = set()
ball_set.add(1)
start_flg = True
for i in range(len(x)):
ball_set.add(y[i])
box[x[i] - 1] -= 1
box[y[i] - 1] += 1
if box[x[i] - 1] == 0:
ball_set.discard(x[i])
print(len(ball_set))
|
p03479 | s964535290 | Accepted | X, Y = list(map(int, input().split()))
cnt = 1
x = X
while True:
x = 2 * x
if x > Y:
break
cnt += 1
print(cnt)
|
p03385 | s389665625 | Accepted | n=input()
a=n.count("a")
b=n.count("b")
c=n.count("c")
if a==1 and b==1 and c==1:
print("Yes")
else:
print("No")
|
p03773 | s142966890 | Accepted | a,b = map(int, raw_input().split())
print (a + b) % 24
|
p02771 | s137071625 | Accepted | A,B,C = input().split()
A = int(A)
B = int(B)
C = int(C)
if A==B and B==C:
print("No")
elif A==B:
print("Yes")
elif B==C:
print("Yes")
elif A==C:
print("Yes")
else:
print("No")
|
p03035 | s619949389 | Wrong Answer | import sys
import math
num = input().split()
A = int(num[0])
B = int(num[1])
if A<=12:
B=B/2
if A<=5:
B=0
print(B)
|
p03407 | s377723425 | Accepted | a, b, c= map(int, input().split())
if a + b >= c:
print('Yes')
else:
print('No') |
p02862 | s283272768 | Accepted | import sys
p=10**9+7
x,y=map(int,input().split())
if (x+y)%3!=0 or x>2*y or y>2*x:
print(0)
sys.exit()
a=(-x+2*y)//3
b=(2*x-y)//3
A=1
for i in range(1,a+1):
A=A*i
A=A%p
B=1
for i in range(1,b+1):
B=B*i
B=B%p
AB=1
for i in range(1,a+b+1):
AB=AB*i
AB=AB%p
C=(AB*pow(A,p-2,p)*pow(B,p-2,p))%p
print(C) |
p02640 | s855399423 | Accepted | a,b = list(map(int, input().split()))
for x in range(0, 101):
for y in range(0, 101):
if(x == 0 and y == 0):
continue
if(x + y == a and 2*x + 4*y == b):
print("Yes")
exit()
print("No") |
p03331 | s103713705 | Accepted | N = int(input())
A = str(N - 1)
B = '1'
ans = 10 ** 9
for i in range(1, (N // 2) + 1):
tmpa = list(map(int, A))
tmpb = list(map(int, B))
tmp = sum(tmpa) + sum(tmpb)
ans = min(ans, tmp)
A = str(N - i - 1)
B = str(i + 1)
print(ans) |
p02646 | s832117568 | Accepted | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
Vf = V - W
D = abs(A - B)
Df = D - Vf * T
if Df <= 0:
print("YES")
else:
print("NO") |
p02773 | s513792317 | Accepted | n=int(input())
s=[input() for i in range(n)]
from collections import Counter
c=Counter(s)
c=list(c.most_common())
m=0
ans=[]
for k,v in c:
if v>=m:
ans.append(k)
m=v
ans.sort()
print(*ans,sep='\n')
|
p03075 | s090716403 | Accepted | from itertools import combinations
a2e = [int(input()) for i in range(5)]
k = int(input())
com = list(combinations(list(range(5)), 2))
ans = "Yay!"
for i in com:
if abs(a2e[i[0]] - a2e[i[1]]) > k:
ans = ":("
break
print(ans)
|
p02621 | s543789662 | Wrong Answer | a = int(input(">> "))
def calc(a):
step2 = a**2
step3 = a**3
return int(a+step2+step3)
print(calc(a)) |
p02983 | s437912247 | Accepted | l, r = map(int, input().split())
if r-l >= 2019:
print(0)
else:
ans = 2019
for i in range(l, r):
for j in range(l+1, r+1):
ans = min(ans, (i*j)%2019)
print(ans)
|
p02935 | s583864325 | Accepted | N = int(input())
V = list(map(int, input().split()))
if N == 2:
print((V[0]+ V[1])/2)
else:
V.sort()
kati = V[0]
for i in range(1, N):
kati = (kati + V[i]) / 2
print(kati) |
p02833 | s345398592 | Accepted |
import sys
sys.setrecursionlimit(1000000)
n = int(input())
def calc(n, p):
if n < p:
return 0
else:
return n//p + calc(n//p, p)
if n % 2 == 1:
print(0)
sys.exit()
'''
ans = 0
n = n // 2
while(n>0):
ans += n//5
n = n//5
print(ans)
'''
print(calc(n//2, 5))
|
p03861 | s537872554 | Accepted | a, b, x = map(int, input().split())
if a != 0:
print(b // x - (a - 1) // x)
else:
print(b // x + 1) |
p02777 | s078650158 | Wrong Answer | s, t = input().split()
a, b = map(int, input().split())
u = input()
if s == t:
a -= 1
else:
b -= 1
print(a, b) |
p03994 | s200773117 | Wrong Answer | s = list(input())
k = int(input())
for i in range(len(s)):
cost = ord('z') - ord(s[i]) + 1
c = s[i]
if cost <= k:
k -= cost
c = 'a'
s[i] = c
k %= 26
if k > 0:
c = chr(ord(s[i]) + k)
if ord(c) > ord('z'):
c = chr(ord('a') + (ord(c) - ord('z') - 1))
s[i] = c
print("".join(s)) |
p03386 | s073851685 | Accepted | import collections
a,b,k = map(int,input().split())
n = b-a +1
if n < 2*k :
for i in range(a,b+1):
print(i)
else :
for i in range(a,a+k):
print(i)
for j in range(b+1-k,b+1):
print(j) |
p03077 | s906174172 | Accepted | n, *d = map(int, open(0))
bn = min(d)
print((n+bn-1)//bn+4) |
p03803 | s067405671 | Wrong Answer | A, B = map(int, input().split())
if A == B:
print("Draw")
elif A == 1 and B != 1:
print("Alice")
elif B == 1 and A != 1:
print("Bod")
elif A > B:
print("Alice")
else:
print("Bob") |
p03475 | s571943901 | Wrong Answer | A=[0];S,F=0,1
for c,s,f in [map(int,input().split())for _ in "_"*(int(input())-1)][::-1]:A.append(A[-1]-(-max(s+c-S,0)//F)*F if S>0 else s+c);S,F=max(s,S),f
for a in A[::-1]:print(a) |
p02675 | s397133177 | Accepted | n = int(input())
n %= 10
if n == 3:
print('bon')
elif n == 0 or n == 1 or n == 6 or n == 8:
print('pon')
else:
print('hon')
|
p03860 | s192634854 | Accepted | a,s,c = input().split()
print("A"+s[0]+"C") |
p02819 | s170062247 | Accepted | x = int(input())
def is_prime(x):
i = 2
while i**2 <=x:
if x % i ==0:
return False
i +=1
return True
while is_prime(x)==False:
x +=1
print(x) |
p02682 | s663940853 | Accepted | A, B, C, K = map(int, input().split())
# 1 2 3 4
s = 0
if A < K:
s += A
if A + B < K:
s += (K - (A + B)) * -1
else:
s += K
print(s)
|
p02556 | s677470950 | Accepted | N = int(input())
L = [list(map(int, input().split())) for _ in range(N)]
L_1 = [l[0]+l[1] for l in L]
L_2 = [(10**9+1-l[0])+l[1] for l in L]
L_3 = [(10**9+1-l[1])+l[0] for l in L]
L_4 = [(10**9+1-l[0])+(10**9+1-l[1]) for l in L]
L_1.sort()
a = L_1[-1]-L_1[0]
L_2.sort()
b = L_2[-1]-L_2[0]
L_3.sort()
c = L_3[-1]-L_3[0]
L_4.sort()
d = L_4[-1]-L_4[0]
print(max(a,b,c,d)) |
p03759 | s894375756 | Wrong Answer | a,b,c = map(int,input().split())
if abs(b-a) == abs(c-b):
print("YES")
else:
print("NO") |
p03556 | s827230442 | Wrong Answer | N=int(input())
ans=1
for i in range(N):
if i*i<=N:
ans=i
else:
break
print(ans**2)
|
p03208 | s945269604 | Wrong Answer | n,k=map(int,input().split())
L=sorted([int(input()) for _ in range(n)])
print(min(L[-1]-L[-k], L[k-1]-L[0])) |
p02817 | s299928590 | Accepted | a,b = input().split()
print(b+a) |
p03555 | s856644528 | Wrong Answer | c_1=input()
c_2=input()
if c_1 == c_2[::-1]:
print('Yes')
else:
print('No') |
p02768 | s900959775 | Accepted | from functools import reduce
def main():
n, a, b = map(int,input().split())
mod = 10 ** 9 + 7
def f(k):
num = reduce(lambda x,y: x * y % mod, range(n, n-k, -1))
den = reduce(lambda x,y: x * y % mod, range(1, k+1))
return num * pow(den, mod-2, mod) % mod
ans = pow(2,n,mod) - f(a) - f(b) - 1
ans %= mod
print(ans)
if __name__ == '__main__':
main()
|
p03665 | s939340151 | Accepted | N, P = map(int, input().split())
a_li = list(map(int, input().split()))
ans = 0
o = 0
for a in a_li:
if a % 2 != 0:
o += 1
if o == 0:
if P == 1:
ans = 0
else:
ans = 2 ** N
else:
ans = 2 ** (N - 1)
print(ans)
|
p02953 | s501231524 | Accepted | #!/usr/bin/env python3
n = int(input())
h = list(map(int, input().split()))
m = 0
flag = True
for i in h:
if m > i + 1:
flag = False
break
if i > m:
m = i
print('Yes' if flag else 'No')
|
p03695 | s544337491 | Accepted | N = int(input())
A = [int(a) for a in input().split()]
maximum = 0
minimum = 0
used = [0]*9
for i in A:
i //= 400
if i >= 8:
maximum += 1
elif used[i] == 0:
maximum += 1
minimum += 1
used[i] = 1
if minimum == 0:
minimum += 1
print(minimum, maximum) |
p03323 | s579447858 | Accepted | a,b=map(int,input().split())
if a <= 8 and b <= 8:
print('Yay!')
else:
print(':(') |
p02603 | s909477544 | Accepted | n = int(input())
*A, = map(int, input().split())
ans = 1000
for i in range(n - 1):
ans += (ans // A[i]) * max(A[i + 1] - A[i], 0)
print(ans)
|
p02724 | s071276014 | Accepted | x = int(input())
gohyaku = x//500
amari = x-500*gohyaku
goen = amari//5
happy = gohyaku*1000 + goen*5
print(happy) |
p03645 | s940521786 | Accepted | N,M = map(int,input().split())
a_list=[]
pass_1= []
for i in range(M):
a = list(map(int,input().split()))
if(a[0]==1):
pass_1.append(a[1])
elif(a[1]==N):
a_list.append(a[0])
if list(set(pass_1) & set(a_list)):
print('POSSIBLE')
else:
print('IMPOSSIBLE') |
p03773 | s739430579 | Accepted | A, B = map(int, input().split())
print((A + B) % 24) |
p03861 | s005795735 | Accepted | a,b,x = map(int,input().split())
B = b//x
A = (a-1)//x
print(B-A) |
p03698 | s913031269 | Accepted | import sys
S = input()
B = [False] * 26
for s in S:
if B[ord(s) - ord('a')]:
print('no')
sys.exit()
else:
B[ord(s) - ord('a')] = True
print('yes')
|
p03723 | s378337044 | Accepted | import numpy as np
cookies = np.array([int(x) for x in input().split()])
if any(cookies%2):
ans = 0
elif cookies[0] == cookies[1] == cookies[2]:
ans = -1
else:
ans = 0
while True:
if not any(cookies%2):
cookies = cookies//2
ans += 1
continue
if all(cookies%2):
ans += 1
break
print(ans) |
p02946 | s864174949 | Accepted | k,x=map(int,input().split())
ans1=x-k+1
ans2=x+k
ans3=[x for x in range(ans1,ans2)]
print(*ans3)
|
p03632 | s772719258 | Accepted | A, B, C, D = map(int, input().split())
print(max(min(B, D) - max(A, C), 0)) |
p02994 | s538538965 | Accepted | n,l = map(int,input().split())
if l <= 0 <= n+l-1:
print((n+l)*(n+l-1)//2 - (-l)*(-l+1)//2)
elif n+l-1 < 0:
print((n-1)*(n+2*l-2)//2)
else:
print((n-1)*(n+2*l)//2)
|
p02689 | s193394661 | Wrong Answer | from collections import defaultdict
N ,M = map(int,input().split())
H = list(map(int,input().split()))
graph = defaultdict(set)
for _ in range(M-1):
A, B = map(int,input().split())
graph[A].add(B)
graph[B].add(A)
cnt = 0
for i in range(1,N+1):
t = H[i-1]
flg = 0
if all([H[j-1] < t for j in graph[i]]):
cnt += 1
print(cnt) |
p04045 | s614222014 | Accepted | n,k = map(int,input().split())
d = input().split()
x = n-1
while True:
x += 1
s = str(x)
f = 0
for t in d:
if t in s:
f = 1
if f == 0:
print(x)
break |
p03821 | s116907501 | Wrong Answer | from sys import stdin
def main():
readline = stdin.readline
N = int(readline())
L = [list(map(int, readline().split())) for _ in range(N)]
cnt = 0
for l in L[::-1]:
a = l[0] + cnt
b = l[1]
if a <= b:
cnt += b - a
else:
cnt += (b - a % b) % b
print(cnt)
if __name__ == "__main__":
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.