problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02725 | k,n=int(input().split())
a = list(map(int,input().split()))
m = k-a[n-1]+a[0]
for i in range(n-1):
m = max(m,a[i+1]-m[n])
x = k-m
print(x) | k,n=map(int,input().split())
a = list(map(int,input().split()))
m = k-a[n-1]+a[0]
for i in range(n-1):
m = max(m,a[i+1]-a[i])
x = k-m
print(x) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add",
"call.arguments.change",
"expression.operation.binary.change",
"variable_access.subscript.index.change"
] | 500,258 | 500,259 | u069273180 | python |
p02725 | import sys
k, n = map(int, sys.stdin.readline().split())
a = [int(i) for i in sys.stdin.readline().split()]
a.sort()
max_dist = 0
for i in range(1, n):
max_dist = max(a[i] - a[i - 1], max_dist)
if len(a) != 0:
max_dist = max(a[0] - a[-1], max_dist)
sys.stdout.write(str(k - max_dist)) | import sys
k, n = map(int, sys.stdin.readline().split())
a = [int(i) for i in sys.stdin.readline().split()]
a.sort()
max_dist = 0
for i in range(1, n):
max_dist = max(a[i] - a[i - 1], max_dist)
if len(a) != 0:
max_dist = max(a[0] + k - a[-1], max_dist)
sys.stdout.write(str(k - max_dist)) | [
"assignment.change"
] | 500,262 | 500,263 | u470215724 | python |
p02725 | kp = list(map(int, input().rsplit()))
A = list(map(int, input().rsplit()))
max_range = kp[0]-A[-1]+A[0]
for idx in range(len(A)):
dif = A[idx+1]-A[idx]
if dif >max_range:
max_range = dif
print(kp[0] - max_range)
| kp = list(map(int, input().rsplit()))
A = list(map(int, input().rsplit()))
max_range = kp[0]-A[-1]+A[0]
for idx in range(len(A)-1):
dif = A[idx+1]-A[idx]
if dif >max_range:
max_range = dif
print(kp[0] - max_range) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 500,283 | 500,284 | u350412774 | python |
p02725 | k, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
max = k - a[len(a) - 1] + a[0]
for i in range(len(a) - 1):
t = a[i + 1] - a[i]
if(t > max): max = t
print(max) | k, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
max = k - a[len(a) - 1] + a[0]
for i in range(len(a) - 1):
t = a[i + 1] - a[i]
if(t > max): max = t
print(k - max) | [
"expression.operation.binary.add"
] | 500,312 | 500,313 | u067694718 | python |
p02725 | k, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
max = a[len(a) - 1] - a[0]
for i in range(len(a) - 1):
t = a[i + 1] - a[i]
if(t > max): max = t
print(max) | k, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
max = k - a[len(a) - 1] + a[0]
for i in range(len(a) - 1):
t = a[i + 1] - a[i]
if(t > max): max = t
print(k - max) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 500,314 | 500,313 | u067694718 | python |
p02725 | K, N, *A = map(int, open(0).read().split())
A.append(K)
B = [b - a for a, b in zip(A, A[1:])]
print(sum(B) - max(B)) | K, N, *A = map(int, open(0).read().split())
A.append(K + A[0])
B = [b - a for a, b in zip(A, A[1:])]
print(sum(B) - max(B)) | [
"expression.operation.binary.add"
] | 500,315 | 500,316 | u606045429 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A.append(A[0]+K)
dif = 0
for i in range(1, N+1):
dif = max(dif, A[i] - A[i-1])
print(dif)
print(K-dif)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
A.append(A[0]+K)
dif = 0
for i in range(1, N+1):
dif = max(dif, A[i] - A[i-1])
#print(dif)
print(K-dif)
| [
"call.remove"
] | 500,326 | 500,327 | u316233444 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
r = a[0] + (k - a[n - 1])
for i in range(1, n - 1):
if a[i] - a[i -1] > r:
r = a[i] - a[i -1]
print(k - r) | k, n = map(int, input().split())
a = list(map(int, input().split()))
r = a[0] + (k - a[n - 1])
for i in range(1, n):
if a[i] - a[i -1] > r:
r = a[i] - a[i -1]
print(k - r) | [
"expression.operation.binary.remove"
] | 500,341 | 500,342 | u073374639 | python |
p02725 | K, N = map(int, input().split())
As = map(int, input().split())
dists = []
for base, switch in zip(As[:-1], As[1:]):
dists.append(switch - base)
dists.append(As[0]+(K-As[-1]))
print(K - max(dists)) | K, N = list(map(int, input().split()))
As = list(map(int, input().split()))
dists = []
for base, switch in zip(As[:-1], As[1:]):
dists.append(switch - base)
dists.append(As[0]+(K-As[-1]))
print(K - max(dists)) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 500,357 | 500,358 | u132049876 | python |
p02725 | import sys
def input():
return sys.stdin.readline().strip()
def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = [K - A[i] + A[i - 1] for i in range(1, N)]
print(min(ans), A[-1] - A[0])
main()
| import sys
def input():
return sys.stdin.readline().strip()
def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = [K - A[i] + A[i - 1] for i in range(1, N)]
print(min(min(ans), A[-1] - A[0]))
main()
| [
"call.arguments.add",
"call.arguments.change"
] | 500,368 | 500,369 | u346812984 | python |
p02725 | import sys
def input():
return sys.stdin.readline().strip()
def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = [K - A[i] + A[i - 1] for i in range(1, N)]
print(min(ans), A[-1] - A[0])
| import sys
def input():
return sys.stdin.readline().strip()
def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = [K - A[i] + A[i - 1] for i in range(1, N)]
print(min(min(ans), A[-1] - A[0]))
main()
| [
"call.arguments.add",
"call.arguments.change",
"call.add"
] | 500,370 | 500,369 | u346812984 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
distances = [0] * n
for i in range(n - 1):
distances[i] = a[i] - a[i + 1]
distances[n - 1] = k - a[n - 1] + a[0]
print(k - max(distances))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
distances = [0] * n
for i in range(n - 1):
distances[i] = a[i + 1] - a[i]
distances[n - 1] = k - a[n - 1] + a[0]
print(k - max(distances))
| [
"expression.operation.binary.remove"
] | 500,371 | 500,372 | u068142202 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
d = [k-a[-1]+a[0]]
for i in range(n-1):
d.append(a[i+1]-a[i])
print(a-max(dist))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
d = [k-a[-1]+a[0]]
for i in range(n-1):
d.append(a[i+1]-a[i])
print(k-max(d))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,373 | 500,374 | u516927307 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
max_d = A[1] - A[0]
for i in range(n):
d = A[i+1] - A[i]
if max_d < d:
max_d = d
print(K - max_d)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
max_d = A[1] - A[0]
for i in range(N):
d = A[i+1] - A[i]
if max_d < d:
max_d = d
print(K - max_d)
| [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 500,375 | 500,376 | u408375121 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
max_d = A[1] - A[0]
for i in range(n-1):
d = A[i+1] - A[i]
if max_d < d:
max_d = d
print(K - max_d) | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
max_d = A[1] - A[0]
for i in range(N):
d = A[i+1] - A[i]
if max_d < d:
max_d = d
print(K - max_d)
| [
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.remove"
] | 500,377 | 500,376 | u408375121 | python |
p02725 | k,n=map(int,input().split())
l=list(map(int,input().split()))
l.append(l[0]+k)
a=10**10
for i in range(n):
a=min(a,l[i+1]-l[i])
print(k-a) | k,n=map(int,input().split())
l=list(map(int,input().split()))
l.append(l[0]+k)
a=0
for i in range(n):
a=max(a,l[i+1]-l[i])
print(k-a)
| [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"misc.opposites",
"identifier.change",
"call.function.change"
] | 500,401 | 500,402 | u223904637 | python |
p02725 | KN=list(map(int,input().strip().split()))
K=KN[0]
N=KN[1]
A_list=list(map(int,input().strip().split()))
Dis_list=[A_list[n]-A_list[n-1] for n in range(1,N)]
Dis_list.append(K-(A_list[N-1]-A_list[0]))
min_distance=K-max(Dis_list)
print(Dis_list)
print(min_distance)
| KN=list(map(int,input().strip().split()))
K=KN[0]
N=KN[1]
A_list=list(map(int,input().strip().split()))
Dis_list=[A_list[n]-A_list[n-1] for n in range(1,N)]
Dis_list.append(K-(A_list[N-1]-A_list[0]))
min_distance=K-max(Dis_list)
print(min_distance)
| [
"call.remove"
] | 500,407 | 500,408 | u613920660 | python |
p02725 | #どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
from bis... | #どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate
#from itertools import product
from bis... | [
"expression.operation.binary.add"
] | 500,426 | 500,427 | u863442865 | python |
p02725 | k,n=map(int,input().split())
list=list(input().split())
dif_list=[]
for i in range(n):
if i == 0:
dif_list.append(k-list[-1]+list[0])
else:
dif_list.append(list[i]-list[i-1])
print(k-max(dif_list)) | k,n=map(int,input().split())
list=list(map(int,input().split()))
dif_list=[]
for i in range(n):
if i == 0:
dif_list.append(k-list[-1]+list[0])
else:
dif_list.append(list[i]-list[i-1])
print(k-max(dif_list)) | [
"call.add",
"call.arguments.change"
] | 500,450 | 500,451 | u884679979 | python |
p02725 | K,N = map(int,input().split())
len = []
a = [int(x) for x in input().split()]
for i in range(N):
if i == N-1:
if a[0] == 0:
len.append(K - a[i])
else:
len.append(a[i] - a[0])
else:
len.append(a[i+1] - a[i])
len.sort(reverse=True)
print(K-len[0]) | K,N = map(int,input().split())
len = []
a = [int(x) for x in input().split()]
for i in range(N):
if i == N-1:
if a[0] == 0:
len.append(K - a[i])
else:
len.append((K - a[i]) + a[0])
else:
len.append(a[i+1] - a[i])
len.sort(reverse=True)
print(K-len[0]) | [
"call.arguments.change",
"expression.operation.binary.change"
] | 500,464 | 500,465 | u143051858 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
D=[A[0]-A[-1]+K]
for i in range(N-1):
D.append(A[i+1]-A[i])
print(K-max(D)) | K,N = map(int,input().split())
A = list(map(int,input().split()))
D=[A[0]-A[-1]+K]
for i in range(N-1):
D.append(A[i+1]-A[i])
print(K-max(D)) | [
"assignment.variable.change",
"identifier.change"
] | 500,468 | 500,469 | u151365505 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
d=[]
for i in range(N-1):
d.append(A[i+1]-A[i])
d.append(20-A[N-1]+A[0])
print(K-max(d)) | K,N=map(int,input().split())
A=list(map(int,input().split()))
d=[]
for i in range(N-1):
d.append(A[i+1]-A[i])
d.append(K-A[N-1]+A[0])
print(K-max(d)) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,483 | 500,484 | u454472984 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
maxD = 0
for n in range(N):
maxD = min(maxD, A[n+1] - A[n])
print(K-maxD) | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
maxD = 0
for n in range(N):
maxD = max(maxD, A[n+1] - A[n])
print(K-maxD) | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 500,489 | 500,490 | u347640436 | python |
p02725 | #C traveling salesman around lake
k,n = map(int, input().split())
a = list(map(int, input().split()))
print(a)
ans = 0
for i in range(n-1):
if a[i+1] - a[i] > ans:
ans = a[i+1] - a[i]
last = a[0] + k - a[n-1]
if last > ans:
ans = last
print(k-ans) | #C traveling salesman around lake
k,n = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(n-1):
if a[i+1] - a[i] > ans:
ans = a[i+1] - a[i]
last = a[0] + k - a[n-1]
if last > ans:
ans = last
print(k-ans) | [
"call.remove"
] | 500,494 | 500,495 | u823398800 | python |
p02725 | k,n,*a=map(int,open(0).read().split())
a+=[k+a[0]]
print(min(y-x for x,y in zip(a,a[1:]))) | k,n,*a=map(int,open(0).read().split())
a+=[k+a[0]]
print(k-max(y-x for x,y in zip(a,a[1:]))) | [
"call.arguments.change",
"io.output.change"
] | 500,496 | 500,497 | u670180528 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
maxdist = 0
for i in range(n-1):
maxdist = max(maxdist, a[i+1] - a[i])
maxdist = max(maxdist, a[-1] - a[0])
print(k - maxdist) | k, n = map(int, input().split())
a = list(map(int, input().split()))
maxdist = 0
for i in range(n-1):
maxdist = max(maxdist, a[i+1] - a[i])
maxdist = max(maxdist, (k - a[-1]) + a[0])
print(k - maxdist) | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,526 | 500,527 | u215065194 | python |
p02725 | K, N=map(int, input().split())
A=list(map(int, input().split()))
A_length_max = K-A[N-1]+A[0]
for i in range (N-2):
A_length_max=max(A_length_max, A[i+1]-A[i])
print(K-A_length_max) | K, N=map(int, input().split())
A=list(map(int, input().split()))
A_length_max = K-A[N-1]+A[0]
for i in range (N-1): #0, 1, 2, ...N-2
A_length_max=max(A_length_max, A[i+1]-A[i])
print(K-A_length_max) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 500,529 | 500,530 | u209313313 | python |
p02725 | k,_,*a=map(int,open(0).read().split());a.append(k);b=[y-x for x,y in zip(a,a[1:])];print(sum(b)-max(b)) | k,_,*a=map(int,open(0).read().split());a.append(k+a[0]);b=[y-x for x,y in zip(a,a[1:])];print(sum(b)-max(b)) | [
"expression.operation.binary.add"
] | 500,545 | 500,546 | u450983668 | python |
p02725 | import numpy as np
K, N = map(int, input().split())
A = np.array(list(map(int, input().split())))
diff = A[1:] - A[:-1]
diff = np.append(diff, K - A[-1])
# print('diff', diff)
ans = diff.sum() - diff.max()
print(ans)
| import numpy as np
K, N = map(int, input().split())
A = np.array(list(map(int, input().split())))
diff = A[1:] - A[:-1]
diff = np.append(diff, K + A[0] - A[-1])
# print('diff', diff)
ans = diff.sum() - diff.max()
print(ans)
| [
"assignment.change"
] | 500,557 | 500,558 | u903005414 | python |
p02725 | # coding: utf-8
K, N = map(int, input().split())
A = list(map(int, input().split()))
# print(K, N)
# print("A:", A)
A = A + [K + A[0]]
# print("A:", A)
lst = [A[i + 1] - A[i] for i in range(N - 1)]
# print(lst)
print(K - max(lst)) | # coding: utf-8
K, N = map(int, input().split())
A = list(map(int, input().split()))
# print(K, N)
# print("A:", A)
A = A + [K + A[0]]
# print("A:", A)
lst = [A[i + 1] - A[i] for i in range(N)]
# print(lst)
print(K - max(lst))
| [
"expression.operation.binary.remove"
] | 500,563 | 500,564 | u102223485 | python |
p02725 |
KN = input("").split()
A = input("").split()
K = int(KN[0])
N = int(KN[1])
A_0 = int(A[0])
A_N = int(A[N-1])
L = A_0
for j in range(N-1):
A_i = int(A[j+1])
A_m = int(A[j])
if A_i - A_m > L:
L = A_i - A_m
if L > K - A_N + A_0:
print(K-L)
else:
print(K - A_N + A_0) | KN = input("").split()
A = input("").split()
K = int(KN[0])
N = int(KN[1])
A_0 = int(A[0])
A_N = int(A[N-1])
L = A_0
for j in range(N-1):
A_i = int(A[j+1])
A_m = int(A[j])
if A_i - A_m > L:
L = A_i - A_m
if L > K - A_N + A_0:
print(K-L)
else:
print(A_N - A_0)
| [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,568 | 500,569 | u735091636 | python |
p02725 |
KN = input("").split()
A = input("").split()
K = int(KN[0])
N = int(KN[1])
A_0 = int(A[0])
A_N = int(A[N-1])
L = A_0
for j in range(N-1):
A_i = int(A[j+1])
A_m = int(A[j])
if A_i - A_m > L:
L == A_i - A_m
if L > K - A_N + A_0:
print(K-L)
else:
print(K - A_N + A_0)
| KN = input("").split()
A = input("").split()
K = int(KN[0])
N = int(KN[1])
A_0 = int(A[0])
A_N = int(A[N-1])
L = A_0
for j in range(N-1):
A_i = int(A[j+1])
A_m = int(A[j])
if A_i - A_m > L:
L = A_i - A_m
if L > K - A_N + A_0:
print(K-L)
else:
print(A_N - A_0)
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,570 | 500,569 | u735091636 | python |
p02725 | I = input().split()
K = int(I[0])
N = int(I[1])
I = input().split()
A = [ int(I[0]) ]
L = [ A[0] ]
for i in range(1,N):
A.append( int(I[i]) )
L.append( A[i] - A[i-1] )
L[0] = A[0]+(K-A[N-1])
L.sort()
print(L[N-1])
| I = input().split()
K = int(I[0])
N = int(I[1])
I = input().split()
A = [ int(I[0]) ]
L = [ A[0] ]
for i in range(1,N):
A.append( int(I[i]) )
L.append( A[i] - A[i-1] )
L[0] = A[0]+(K-A[N-1])
L.sort()
print(K - L[N-1])
| [
"expression.operation.binary.add"
] | 500,592 | 500,593 | u537142137 | python |
p02725 | I = input().split()
K = int(I[0])
N = int(I[1])
I = input().split()
A = [ int(I[0]) ]
L = [ A[0] ]
for i in range(1,N):
A.append( int(I[i]) )
L.append( A[i] - A[i-1] )
L[0] = A[0]+(K-A[N-1])
A.sort()
print(L[N-1])
| I = input().split()
K = int(I[0])
N = int(I[1])
I = input().split()
A = [ int(I[0]) ]
L = [ A[0] ]
for i in range(1,N):
A.append( int(I[i]) )
L.append( A[i] - A[i-1] )
L[0] = A[0]+(K-A[N-1])
L.sort()
print(K - L[N-1])
| [
"identifier.change"
] | 500,594 | 500,593 | u537142137 | python |
p02725 | import sys
from copy import deepcopy
from math import ceil, floor
from collections import deque, Counter, defaultdict
from math import gcd
input = lambda: sys.stdin.readline().rstrip()
def eprint(s):
sys.stderr.write('DEBUG: {}'.format(s))
return
def cal(a,b,k):
return min(abs(a-b), k-abs(a-b))
def cal2(... | import sys
from copy import deepcopy
from math import ceil, floor
from collections import deque, Counter, defaultdict
from math import gcd
input = lambda: sys.stdin.readline().rstrip()
def eprint(s):
sys.stderr.write('DEBUG: {}'.format(s))
return
def cal(a,b,k):
return min(abs(a-b), k-abs(a-b))
def cal2(... | [
"call.arguments.change"
] | 500,595 | 500,596 | u593934357 | python |
p02725 | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if A[0]==0:
lastlength = K-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = A[N-1]-A[0]
if lastleng... | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if A[0]==0:
lastlength = K-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = K-A[N-1]+A[0]
if lastle... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 500,599 | 500,600 | u863964720 | python |
p02725 | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if A[0]==0:
lastlength = 20-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = A[N-1]-A[0]
if lastlen... | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if A[0]==0:
lastlength = K-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = K-A[N-1]+A[0]
if lastle... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"io.output.change"
] | 500,601 | 500,600 | u863964720 | python |
p02725 | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if a[0]==0:
lastlength = 20-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = A[N-1]-A[0]
if lastlen... | K,N = map(int, input().split())
A = [int(N) for N in input().split()]
#print(A[0])
max1 = 0
max2 = 0
for i in range(0,N-1):
max1 = A[i+1]-A[i]
if max1>max2:
max2=max1
if A[0]==0:
lastlength = K-A[N-1]
if lastlength >max2:
max2=lastlength
else:
lastlength = K-A[N-1]+A[0]
if lastle... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"io.output.change"
] | 500,602 | 500,600 | u863964720 | python |
p02725 | k,n = map(int,input().split())
s = list(map(int,input().split()))
longest = 0
for i in range(n-1):
long = s[i+1] - s[i]
if long > longest:
longest = long
if longest >= k - s[n-1] + s[0]:
print(k - longest)
else:
print(k - s[n-1] + s[0]) | k, n = map(int, input().split())
s = list(map(int, input().split()))
longest = 0
for i in range(n - 1):
long = s[i + 1] - s[i]
if long > longest:
longest = long
if longest >= k - s[n - 1] + s[0]:
print(k - longest)
else:
print(s[n - 1] - s[0]) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,603 | 500,604 | u624613992 | python |
p02725 | #!/usr/bin/env python3
k, n = map(int, input().split())
A = list(map(int, input().split()))
A += [A[0] + K]
max_gap = max(y - x for x, y in zip(A, A[1:]))
print(K - max_gap) | #!/usr/bin/env python3
K, N = map(int, input().split())
A = list(map(int, input().split()))
A += [A[0] + K]
max_gap = max(y - x for x, y in zip(A, A[1:]))
print(K - max_gap) | [
"assignment.variable.change",
"identifier.change"
] | 500,617 | 500,618 | u767995501 | python |
p02725 | k,n = map(int, input().split())
l_1 = [int(x) for x in input().split()]
l_2 = []
for i in range(n-1):
dis = l_1[i+1]-l_1[i]
l_2.append(dis)
dis = k-l_1[n-1]+l_1[0]
l_2.append(dis)
print(l_2)
ans = k-max(l_2)
print(ans) | k,n = map(int, input().split())
l_1 = [int(x) for x in input().split()]
l_2 = []
for i in range(n-1):
dis = l_1[i+1]-l_1[i]
l_2.append(dis)
dis = k-l_1[n-1]+l_1[0]
l_2.append(dis)
#print(l_2)
ans = k-max(l_2)
print(ans) | [
"call.remove"
] | 500,641 | 500,642 | u945157177 | python |
p02725 | k, n = list(map(int,input().split()))
a = list(map(int,input().split()))
max_d = 0
a.append(a[0] + k)
print(a)
for idx, i in enumerate(a[:-1]):
if max_d < a[idx + 1] - i:
max_d = a[idx + 1] - i
print(k - max_d) | k, n = list(map(int,input().split()))
a = list(map(int,input().split()))
max_d = 0
a.append(a[0] + k)
for idx, i in enumerate(a[:-1]):
if max_d < a[idx + 1] - i:
max_d = a[idx + 1] - i
print(k - max_d) | [
"call.remove"
] | 500,649 | 500,650 | u936735179 | python |
p02725 | K,N = map(int, input().split())
A = list(map(int,input().split()))
l_s = []
check = 0
for i in range(0,N):
if(A[i] == 0):
check =1
if(check == 1):
for i in range(1,N):
l_s.append(A[i]-A[i-1])
l_s.append(K-A[N-1])
num = 0
ans = 99999999999999999
for i in range(0,N):
nu... | K,N = map(int, input().split())
A = list(map(int,input().split()))
l_s = []
check = 0
for i in range(0,N):
if(A[i] == 0):
check =1
if(check == 1):
for i in range(1,N):
l_s.append(A[i]-A[i-1])
l_s.append(K-A[N-1])
num = 0
ans = 99999999999999999
for i in range(0,N):
nu... | [
"call.remove"
] | 500,653 | 500,654 | u845148770 | python |
p02725 | from collections import deque
K, N = map(int, input().split())
S=deque(list(map(int, input().split())))
ans = [S[-1] - S[0]]
for i in range(N-1):
ans.append(S[i]- S[i+1] + 20)
print(min(ans))
| from collections import deque
K, N = map(int, input().split())
S=deque(list(map(int, input().split())))
ans = [S[-1] - S[0]]
for i in range(N-1):
ans.append(S[i]- S[i+1] + K)
print(min(ans))
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,661 | 500,662 | u851319680 | python |
p02725 | k,n = map(int,input().split())
l= list(map(int,input().split()))
li = []
for i in range(n):
if i != n-1:
li.append(l[n-i-1]-l[n-i-2])
else:
li.append(k-l[n-1]-l[0])
li.sort(reverse=True)
print(k-li[0]) | k,n = map(int,input().split())
l= list(map(int,input().split()))
li = []
for i in range(n):
if i != n-1:
li.append(l[n-i-1]-l[n-i-2])
else:
li.append(k-l[n-1]+l[0])
li.sort(reverse=True)
print(k-li[0]) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,669 | 500,670 | u793010149 | python |
p02725 | k,n = map(int,input().split())
l= list(map(int,input().split()))
li = []
for i in range(n):
if i != n-1:
li.append(l[n-i-1]-l[n-i-2])
else:
li.append(l[n-1]-l[0])
li.sort(reverse=True)
print(k-li[0])
| k,n = map(int,input().split())
l= list(map(int,input().split()))
li = []
for i in range(n):
if i != n-1:
li.append(l[n-i-1]-l[n-i-2])
else:
li.append(k-l[n-1]+l[0])
li.sort(reverse=True)
print(k-li[0]) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,671 | 500,670 | u793010149 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
result = 0
mx = -float("inf")
for i in range(N-1):
mx = max(mx, A[i+1] - A[i])
mx = max(mx, K - A[-1])
result = K - mx
print(result) | K, N = map(int, input().split())
A = list(map(int, input().split()))
result = 0
mx = -float("inf")
for i in range(N-1):
mx = max(mx, A[i+1] - A[i])
mx = max(mx, K - A[-1] + A[0])
result = K - mx
print(result) | [
"assignment.change"
] | 500,684 | 500,685 | u578647703 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
if a[0] == 0:
dis = [k - a[n-1]]
else:
dis = [a[n-1] - a[0]]
for i in range(n-1):
dis.append(a[i+1]-a[i])
print(k - max(dis))
| k,n = map(int,input().split())
a = list(map(int,input().split()))
if a[0] == 0:
dis = [k - a[n-1]]
else:
dis = [k - a[n-1] + a[0]]
for i in range(n-1):
dis.append(a[i+1] - a[i])
print(k - max(dis))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 500,686 | 500,687 | u041382530 | python |
p02725 | K,N = input().split()
A = input().split()
a_list = list(A)
dist = 0
dist_list = []
max = 0
sum = 0
for i in range(len(a_list)):
if i == len(a_list) - 1:
dist = int(K) - abs(int(a_list[i]) - int(a_list[0]))
else:
dist = abs(int(a_list[i]) - int(a_list[i + 1]))
if i != 0:
if max < dist:
su... | K,N = input().split()
A = input().split()
a_list = list(A)
dist = 0
dist_list = []
max = 0
sum = 0
for i in range(len(a_list)):
if i == len(a_list) - 1:
dist = int(K) - abs(int(a_list[i]) - int(a_list[0]))
else:
dist = abs(int(a_list[i]) - int(a_list[i + 1]))
if i != 0:
if max < dist:
su... | [
"call.remove"
] | 500,688 | 500,689 | u701638736 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(N-1):
if m<(A[i+1]-A[i]):
m=(A[i+1]-A[i])
if m<(K-A[-1]+A[0]):
print(K-A[-1]+A[0])
else:
print(K-m) | K,N=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(N-1):
if m<(A[i+1]-A[i]):
m=(A[i+1]-A[i])
if m<(K-A[-1]+A[0]):
print(A[-1]-A[0])
else:
print(K-m) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,712 | 500,713 | u440161695 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(N-1):
if m<(A[i+1]-A[i]):
m=(A[i+1]-A[i])
if m<(K-A[-1]+A[0]):
print(K-A[-1]+A[0])
else:
print(m) | K,N=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(N-1):
if m<(A[i+1]-A[i]):
m=(A[i+1]-A[i])
if m<(K-A[-1]+A[0]):
print(A[-1]-A[0])
else:
print(K-m) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,714 | 500,713 | u440161695 | python |
p02725 | K, N = list(map(int, input().split()))
A = [0] * N
A = list(map(int, input().split()))
sorted_A = sorted(A)
sorted_A = [i - sorted_A[0] for i in sorted_A]
print(sorted_A)
dis = []
for i in range(len(sorted_A)-1):
dis.append(abs(sorted_A[i] - sorted_A[i+1]))
last_dis = abs(sorted_A[-1] - sorted_A[0])
if(last_di... | K, N = list(map(int, input().split()))
A = [0] * N
A = list(map(int, input().split()))
sorted_A = sorted(A)
sorted_A = [i - sorted_A[0] for i in sorted_A]
dis = []
for i in range(len(sorted_A)-1):
dis.append(abs(sorted_A[i] - sorted_A[i+1]))
last_dis = abs(sorted_A[-1] - sorted_A[0])
if(last_dis >= K/2):
la... | [
"call.remove"
] | 500,715 | 500,716 | u985374340 | python |
p02725 | def main():
input1 = input()
input2 = input()
k , n = map(int , input1.split())
al = list(map(int , input2.split()))
arg = [[k,n],al]
ans = process(arg)
print(ans)
def process(arg):
ans = 0
ensyu = arg[0][0]
kensu = arg[0][1]
aida = list()
for x in range(arg[0][1]):
... | def main():
input1 = input()
input2 = input()
k , n = map(int , input1.split())
al = list(map(int , input2.split()))
arg = [[k,n],al]
ans = process(arg)
print(ans)
def process(arg):
ans = 0
ensyu = arg[0][0]
kensu = arg[0][1]
aida = list()
for x in range(arg[0][1]):
... | [
"assignment.add"
] | 500,719 | 500,720 | u086869007 | python |
p02725 | #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N, K = iim()
A = list(iim())
d1 = 0
for i in range(K-1):
d2 = A[i+1] - A[i]
d1 = max(d1, d2)
d1 = max(d1, N-A[-1]+A[0])
print(d1)
if __name__ == "__main__":
resolve()
| #!python3
iim = lambda: map(int, input().rstrip().split())
def resolve():
N, K = iim()
A = list(iim())
d1 = 0
for i in range(K-1):
d2 = A[i+1] - A[i]
d1 = max(d1, d2)
d1 = max(d1, N-A[-1]+A[0])
print(N-d1)
if __name__ == "__main__":
resolve()
| [
"expression.operation.binary.add"
] | 500,736 | 500,737 | u348805958 | python |
p02725 | K,N=input().split()
A=input().split()
n=0
m=1
S=list()
for i in range(int(N)-1):
S.append(int(A[n+1])-int(A[n]))
n=n+1
S.append(int(A[0])+(int(K)-int(A[-1])))
ans=int(K)-int(max(S))
print(ans)
print(S)
| K,N=input().split()
A=input().split()
n=0
m=1
S=list()
for i in range(int(N)-1):
S.append(int(A[n+1])-int(A[n]))
n=n+1
S.append(int(A[0])+(int(K)-int(A[-1])))
ans=int(K)-int(max(S))
print(ans) | [
"call.remove"
] | 500,747 | 500,748 | u345132740 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
p=[]
for i in range(n-1):
p.append(a[i+1]-a[i])
if a[0]==0:p.append(k-a[n-1])
else:p.append(a[n-1]-a[0])
print(k-max(p))
| k,n=map(int,input().split())
a=list(map(int,input().split()))
p=[]
for i in range(n-1):
p.append(a[i+1]-a[i])
if a[0]==0:p.append(k-a[n-1])
else:p.append(k-a[n-1]+a[0])
#print(p)
print(k-max(p))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,749 | 500,750 | u172147273 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
p=[]
for i in range(n-1):
p.append(a[i+1]-a[i])
if a[0]==0:p.append(20-a[n-1])
else:p.append(a[n-1]-a[0])
print(k-max(p))
| k,n=map(int,input().split())
a=list(map(int,input().split()))
p=[]
for i in range(n-1):
p.append(a[i+1]-a[i])
if a[0]==0:p.append(k-a[n-1])
else:p.append(k-a[n-1]+a[0])
#print(p)
print(k-max(p))
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 500,751 | 500,750 | u172147273 | python |
p02725 | a=input().split(' ')
b=input().split(' ')
c=0
for i in int(a[1]):
if i != int(a[1])-1:
if int(b[i+1]) - int(b[i]) > c:
c = int(b[i+1]) - int(b[i])
else:
if int(a[0]) - int(b[-1])+ int(b[0]) > c:
c = int(a[0]) - int(b[-1])+ int(b[0])
print(int(a[0])-c)
| a=input().split(' ')
b=input().split(' ')
c=0
for i in range(int(a[1])):
if i != int(a[1])-1:
if int(b[i+1]) - int(b[i]) > c:
c = int(b[i+1]) - int(b[i])
else:
if int(a[0]) - int(b[-1])+ int(b[0]) > c:
c = int(a[0]) - int(b[-1])+ int(b[0])
print(int(a[0])-c)
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 500,752 | 500,753 | u549494450 | python |
p02725 | a=input().split(' ')
b=input().split(' ')
c=0
for i in int(a[1]):
if i != a[1]-1:
if int(b[i+1]) - int(b[i]) > c:
c = int(b[i+1]) - int(b[i])
else:
if int(a[0]) - int(b[-1])+ int(b[0]) > c:
c = int(a[0]) - int(b[-1])+ int(b[0])
print(int(a[0])-c) | a=input().split(' ')
b=input().split(' ')
c=0
for i in range(int(a[1])):
if i != int(a[1])-1:
if int(b[i+1]) - int(b[i]) > c:
c = int(b[i+1]) - int(b[i])
else:
if int(a[0]) - int(b[-1])+ int(b[0]) > c:
c = int(a[0]) - int(b[-1])+ int(b[0])
print(int(a[0])-c)
| [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 500,754 | 500,753 | u549494450 | python |
p02725 | import numpy as np
tmp =list(map(int, input().split()))
num=list(map(int, input().split()))
num.append(tmp[0])
print(np.diff(num).sum()-np.diff(num).max())
| import numpy as np
tmp =list(map(int, input().split()))
num=list(map(int, input().split()))
num.append(num[0]+tmp[0])
print(np.diff(num).sum()-np.diff(num).max())
| [
"expression.operation.binary.add"
] | 500,758 | 500,759 | u813993459 | python |
p02725 | (n,m)=map(int,input().split())
a=input().split()
a=list(map(int,a))
l=[]
k=0
a=sorted(a)
for i in range(m-1):
d=abs(a[i]-a[i+1])
k=k+d
l.append(d)
# k=k-d
c=n-k
print(c)
l=sorted(l)
l1=sum(l)
print(l1-l[-1]) | (n,m)=map(int,input().split())
a=input().split()
a=list(map(int,a))
l=[]
k=0
a=sorted(a)
for i in range(m-1):
d=abs(a[i]-a[i+1])
k=k+d
l.append(d)
# k=k-d
c=n-k
l.append(c)
l=sorted(l)
l1=sum(l)
print(l1-l[-1]) | [
"io.output.change"
] | 500,762 | 500,763 | u907446975 | python |
p02725 | kn = input().split()
a = input().split()
al = [int(i) for i in a]
k = int(kn[0])
n = kn[1]
ml = 20 - abs(al[len(al)-1] - al[0])
for i in range(len(al)-1):
ml = max(ml,abs(al[i]-(al[i+1])))
print(k-ml)
| kn = input().split()
a = input().split()
al = [int(i) for i in a]
k = int(kn[0])
n = kn[1]
ml = k - abs(al[len(al)-1] - al[0])
for i in range(len(al)-1):
ml = max(ml,abs(al[i]-(al[i+1])))
print(k-ml)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 500,780 | 500,781 | u966542724 | python |
p02725 | #ANS
temp=input()
temp2=temp.split(" ")
K=int(temp2[0])
N=int(temp2[1])
temp3=input()
A=temp3.split(" ")
A=[int(i) for i in A]
A.append(K)
D=list()
#D.append(A[0])
for i in range(N):
D.append(A[i+1]-A[i])
maxind=D.index(max(D))
sumd=0
for i in range(N):
if(i!=maxind):
sumd+=D[i]
print(sumd) | #ANS
temp=input()
temp2=temp.split(" ")
K=int(temp2[0])
N=int(temp2[1])
temp3=input()
A=temp3.split(" ")
A=[int(i) for i in A]
A.append(K+A[0])
#if K=A[N-1]:
# A.append(K)
#else:
# A.append()
D=list()
#D.append(A[0])
for i in range(N):
D.append(A[i+1]-A[i])
maxind=D.index(max(D))
sumd=0
for i in range(N):
... | [
"expression.operation.binary.add"
] | 500,784 | 500,785 | u569155866 | python |
p02725 | k, n = map(int, input().split())
a = [int(x) for x in input().split()]
a_ = [x - a[0] for x in a] + [k]
d = [y - x for x, y in zip(a, a[1:])]
print(k - max(d)) | k, n = map(int, input().split())
a = [int(x) for x in input().split()]
a_ = [x - a[0] for x in a] + [k]
d = [y - x for x, y in zip(a_, a_[1:])]
print(k - max(d)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 500,797 | 500,798 | u833933988 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
sa = []
for i in range(1,n):
sa_ = a[i]-a[i-1]
sa.append(sa_)
#print(sa)
sa.append(k-max(a))
ans = sum(sa)-max(sa)
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
sa = []
for i in range(1,n):
sa_ = a[i]-a[i-1]
sa.append(sa_)
sa.append(k-max(a)+min(a))
ans = sum(sa)-max(sa)
# print(sa)
# print(k)
# print(sum(sa))
print(ans) | [
"expression.operation.binary.add"
] | 500,814 | 500,815 | u991269553 | python |
p02725 | K,N = map(int,input().split())
house = list(map(int,input().split()))
inter = []
for i in range(N-1):
inter.append(house[i+1]-house[i])
inter.append((20-house[N-1])+house[0])
print(K-max(inter)) | K,N = map(int,input().split())
house = list(map(int,input().split()))
inter = []
for i in range(N-1):
inter.append(house[i+1]-house[i])
inter.append((K-house[N-1])+house[0])
print(K-max(inter)) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,826 | 500,827 | u479674982 | python |
p02725 | K, N, *A = map(int, open(0).read().split())
B = []
for i in range(N - 1):
B.append(A[i + 1] - A[i])
B.append(K - A[-1] + A[0])
print(B)
print(K - max(B))
| K, N, *A = map(int, open(0).read().split())
B = []
for i in range(N - 1):
B.append(A[i + 1] - A[i])
B.append(K - A[-1] + A[0])
print(K - max(B))
| [
"call.remove"
] | 500,828 | 500,829 | u647287452 | python |
p02725 | _in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(1,n-2):
dis = _i[i+1]- _i[i]
if dis>mdis:
mdis = dis
print(k-mdis) | _in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(1,n):
dis = _i[i] - _i[i-1]
if dis>mdis:
mdis = dis
print(k-mdis) | [
"expression.operation.binary.remove"
] | 500,830 | 500,831 | u489153633 | python |
p02725 | k, n = map(int, input().split())
l = list(map(int, input().split()))
m = []
for i in range(n- 1):
m.append(l[i + 1] - l[i])
m.append(k - l[n - 1])
m.sort()
print(sum(m) - m[n - 1]) | k, n = map(int, input().split())
l = list(map(int, input().split()))
m = []
for i in range(n- 1):
m.append(l[i + 1] - l[i])
m.append(k - l[n - 1] + l[0])
m.sort()
print(sum(m) - m[n - 1]) | [
"expression.operation.binary.add"
] | 500,832 | 500,833 | u163874353 | python |
p02725 | kn = list(map(int, input().split()))
a= list(map(int, input().split()))
l=[]
l.append(kn[0]-a[-1])
for i in range(kn[1]-1):
l.append(a[i+1]-a[i])
print(kn[0]-max(l))
| kn = list(map(int, input().split()))
a= list(map(int, input().split()))
l=[]
l.append(kn[0]-a[-1]+a[0])
for i in range(kn[1]-1):
l.append(a[i+1]-a[i])
print(kn[0]-max(l))
| [
"expression.operation.binary.add"
] | 500,834 | 500,835 | u428416104 | python |
p02725 | kn = list(map(int, input().split()))
a= list(map(int, input().split()))
l=[]
l.append(kn[0]-a[-1])
for i in range(kn[1]-1):
l.append(a[i+1]-a[i])
print(kn[0]-max(l)) | kn = list(map(int, input().split()))
a= list(map(int, input().split()))
l=[]
l.append(kn[0]-a[-1]+a[0])
for i in range(kn[1]-1):
l.append(a[i+1]-a[i])
print(kn[0]-max(l))
| [
"expression.operation.binary.add"
] | 500,836 | 500,835 | u428416104 | python |
p02725 | k,n=input().split();
a=input().split();
k=int(k);
n=int(n);
by=0;
for i in range(n):
a[i]=int(a[i]);
for i in range(n-1):
if a[i+1]-a[i]>by:
by=a[i+1]-a[i];
if (k-a[n-1])+a[0]>by :
by=(k-a[n-1])+a[0];
print(by);
| k,n=input().split();
a=input().split();
k=int(k);
n=int(n);
by=0;
for i in range(n):
a[i]=int(a[i]);
for i in range(n-1):
if a[i+1]-a[i]>by:
by=a[i+1]-a[i];
if (k-a[n-1])+a[0]>by :
by=(k-a[n-1])+a[0];
print(k-by);
| [
"expression.operation.binary.add"
] | 500,851 | 500,852 | u197045432 | python |
p02725 | K , N = map(int, input().split())
A = sorted(list(map(int, input().split())))
B = []
max = K - A[-1] + A[0]
B.append(max)
ind = 0
for i in range(1, N, 1):
_max = A[i] - A[i-1]
B.append(_max)
if _max < 0:
_max = K + _max
if _max > max:
max = _max
ind = i
dis1 = 0
for i in range(1, N, 1):
if i + ind >= N:
d... | K , N = map(int, input().split())
A = sorted(list(map(int, input().split())))
B = []
max = K - A[-1] + A[0]
B.append(max)
ind = 0
for i in range(1, N):
_max = A[i] - A[i-1]
B.append(_max)
if _max < 0:
_max = K + _max
if _max > max:
max = _max
ind = i
dis1 = 0
for i in range(1, N):
if i + ind >= N:
dis1 +... | [
"call.arguments.change"
] | 500,879 | 500,880 | u899457989 | python |
p02725 | input_first = input()
input_second = input()
split_input_first = input_first.split()
split_input_second = input_second.split()
k = int(split_input_first[0])
n = int(split_input_first[1])
distance_list = []
for i in range(n):
if i == n - 1:
distance_list.append(k + int(split_input_second[0]) - int(split_i... | input_first = input()
input_second = input()
split_input_first = input_first.split()
split_input_second = input_second.split()
k = int(split_input_first[0])
n = int(split_input_first[1])
distance_list = []
for i in range(n):
if i == n - 1:
distance_list.append(k + int(split_input_second[0]) - int(split_i... | [
"assignment.add"
] | 500,890 | 500,891 | u907026104 | python |
p02725 |
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
return(int(input().rstrip()))
def inlt():
return(list(map(int,input().rstrip().split())))
def insr():
s = input().rstrip()
return(s[:len(s) - 1])
def invr():
return(map(int,input().rstrip().split()))
######################... |
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
return(int(input().rstrip()))
def inlt():
return(list(map(int,input().rstrip().split())))
def insr():
s = input().rstrip()
return(s[:len(s) - 1])
def invr():
return(map(int,input().rstrip().split()))
######################... | [
"assignment.change"
] | 500,905 | 500,906 | u763424241 | python |
p02725 | import sys
sys.setrecursionlimit(4100000)
k,n = map(int,input().split())
a = list(map(int,input().split()))
b = []
for v in range(n-1):
b.append(a[v+1]-a[v])
b.append(k-a[n-1]+a[0])
print(b)
anss = max(b)
ans = k - anss
print(str(ans)) | import sys
sys.setrecursionlimit(4100000)
k,n = map(int,input().split())
a = list(map(int,input().split()))
b = []
for v in range(n-1):
b.append(a[v+1]-a[v])
b.append(k-a[n-1]+a[0])
anss = max(b)
ans = k - anss
print(str(ans)) | [
"call.remove"
] | 500,915 | 500,916 | u620464724 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
max_dist = 0
for i in range(n-1):
cur_dist = a[i+1] - a[i]
if cur_dist > max_dist:
max_dist = cur_dist
cur_dist = 20 + a[0] - a[-1]
if cur_dist > max_dist:
max_dist = cur_dist
print(k - max_dist)
| k, n = map(int, input().split())
a = list(map(int, input().split()))
max_dist = 0
for i in range(n-1):
cur_dist = a[i+1] - a[i]
if cur_dist > max_dist:
max_dist = cur_dist
cur_dist = k + a[0] - a[-1]
if cur_dist > max_dist:
max_dist = cur_dist
print(k - max_dist)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 500,917 | 500,918 | u706186040 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int, input().split(' ')))
x = k - a[-1]
for i in range(n-1):
y = a[i+1]-a[i]
if y > x:
x = y
print(k-x) | k,n = map(int,input().split())
a = list(map(int, input().split(' ')))
x = k - a[-1] + a[0]
for i in range(n-1):
y = a[i+1]-a[i]
if y > x:
x = y
print(k-x) | [
"assignment.change"
] | 500,927 | 500,928 | u180528413 | python |
p02725 | def main():
K,N = map(int,input().split())
A = list(map(int,input().split()))
Aa = []
for i in range(1,N):
Aa.append(A[i]-A[i-1])
Aa.append(K-A[N-1]+A[0])
print(Aa)
print(sum(Aa)-max(Aa))
if __name__ == "__main__":
main() | def main():
K,N = map(int,input().split())
A = list(map(int,input().split()))
Aa = []
for i in range(1,N):
Aa.append(A[i]-A[i-1])
Aa.append(K-A[N-1]+A[0])
print(sum(Aa)-max(Aa))
if __name__ == "__main__":
main() | [
"call.remove"
] | 500,931 | 500,932 | u891504219 | python |
p02725 | def main():
K,N = map(int,input().split())
A = list(map(int,input().split()))
Aa = []
for i in range(1,N):
Aa.append(A[i]-A[i-1])
Aa.append(K-A[N-1])
print(sum(Aa)-max(Aa))
if __name__ == "__main__":
main() | def main():
K,N = map(int,input().split())
A = list(map(int,input().split()))
Aa = []
for i in range(1,N):
Aa.append(A[i]-A[i-1])
Aa.append(K-A[N-1]+A[0])
print(sum(Aa)-max(Aa))
if __name__ == "__main__":
main() | [
"expression.operation.binary.add"
] | 500,933 | 500,932 | u891504219 | python |
p02725 | KN=list(map(int,input().split()))
L=list(map(int,input().split()))
K=KN[0]
N=KN[1]
M=0
for i in range(N-1):
if (L[i+1]-L[i])>M:
M=L[i+1]-L[i]
if (K-L[N-1]+L[0])>M:
M=K-L[N-1]+L[0]
print(M) | KN=list(map(int,input().split()))
L=list(map(int,input().split()))
K=KN[0]
N=KN[1]
M=0
for i in range(N-1):
if (L[i+1]-L[i])>M:
M=L[i+1]-L[i]
if (K-L[N-1]+L[0])>M:
M=K-L[N-1]+L[0]
print(K-M) | [
"expression.operation.binary.add"
] | 500,948 | 500,949 | u235274878 | python |
p02725 | k,n = map(int, input().split())
A = [int(x) for x in input().split()]
c=[]
for i in range(n-1):
c.append(A[i+1]-A[i])
c.append(k-A[n-1])
print(k-max(c)) | k,n = map(int, input().split())
A = [int(x) for x in input().split()]
c=[]
for i in range(n-1):
c.append(A[i+1]-A[i])
c.append(k-A[n-1]+A[0])
print(k-max(c)) | [
"expression.operation.binary.add"
] | 500,954 | 500,955 | u026731851 | python |
p02725 | K,N=map(int,input().split())
mtrx=list(map(int,input().split()))
mtrx.append(K+mtrx[0])
length = []
for i in range(len(mtrx)-1):
length.append(mtrx[i+1]-mtrx[i])
print(length)
print(K-max(length)) | K,N=map(int,input().split())
mtrx=list(map(int,input().split()))
mtrx.append(K+mtrx[0])
length = []
for i in range(len(mtrx)-1):
length.append(mtrx[i+1]-mtrx[i])
print(K-max(length)) | [
"call.remove"
] | 500,960 | 500,961 | u638847754 | python |
p02725 | K,N=map(int,input().split())
mtrx=list(map(int,input().split()))
mtrx.append(K)
length = []
for i in range(len(mtrx)-1):
length.append(mtrx[i+1]-mtrx[i])
print(K-max(length)) | K,N=map(int,input().split())
mtrx=list(map(int,input().split()))
mtrx.append(K+mtrx[0])
length = []
for i in range(len(mtrx)-1):
length.append(mtrx[i+1]-mtrx[i])
print(K-max(length)) | [
"expression.operation.binary.add"
] | 500,962 | 500,961 | u638847754 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
maxi = 0
for i in range(1, n):
x = a[i] - a[i-1]
maxi = max(maxi, x)
x = a[-1] - a[0]
if k - x < x:
x = k - x
maxi = max(maxi, x)
print(maxi) | k, n = map(int, input().split())
a = list(map(int, input().split()))
maxi = 0
for i in range(1, n):
x = a[i] - a[i-1]
maxi = max(maxi, x)
x = a[-1] - a[0]
if k - x < x:
x = k - x
maxi = max(maxi, x)
print(k - maxi) | [
"expression.operation.binary.add"
] | 500,976 | 500,977 | u029576659 | python |
p02725 | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
x_plus = [K-A[-1]+A[0]] + [A[i+1] - A[i] for i in range(N-1)]
print(max(x_plus)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
x_plus = [K-A[-1]+A[0]] + [A[i+1] - A[i] for i in range(N-1)]
print(K - max(x_plus))
| [
"expression.operation.binary.add"
] | 500,978 | 500,979 | u599004729 | python |
p02725 | k,n=list(map(int,input().split()))
sales=list(map(int,input().split()))
sales.append(sales[0]+k)
max_dis=0
for i in range(n):
max_dis=max(max_dis,sales[i+1]-sales[i])
print(max_dis)
print(k-max_dis) | k,n=list(map(int,input().split()))
sales=list(map(int,input().split()))
sales.append(sales[0]+k)
max_dis=0
for i in range(n):
max_dis=max(max_dis,sales[i+1]-sales[i])
print(k-max_dis) | [
"call.remove"
] | 500,999 | 501,000 | u320511454 | python |
p02725 | k,n=list(map(int,input().split()))
sales=list(map(int,input().split()))
sales.append(sales[0])
max_dis=0
for i in range(n):
max_dis=max(max_dis,sales[i+1]-sales[i])
print(k-max_dis) | k,n=list(map(int,input().split()))
sales=list(map(int,input().split()))
sales.append(sales[0]+k)
max_dis=0
for i in range(n):
max_dis=max(max_dis,sales[i+1]-sales[i])
print(k-max_dis) | [
"expression.operation.binary.add"
] | 501,001 | 501,000 | u320511454 | python |
p02725 | import numpy as np
K, N = map(int, input().strip().split())
A = list(map(int, input().strip().split()))
# min_=10**6
dA=np.diff(A)
np.append(dA,A[0]+K-A[-1])
skip_dist=np.max(dA)
ans=K-skip_dist
print(ans) | import numpy as np
K, N = map(int, input().strip().split())
A = list(map(int, input().strip().split()))
# min_=10**6
dA=np.diff(A)
dA=np.append(dA,A[0]+K-A[-1])
skip_dist=max(dA)
ans=K-skip_dist
print(ans) | [
"assignment.add"
] | 501,002 | 501,003 | u970133396 | python |
p02725 | import numpy as np
K, N = map(int, input().strip().split())
A = list(map(int, input().strip().split()))
# min_=10**6
dA=np.diff(A)
np.append(dA,A[0]+K-A[-1])
skip_dist=max(dA)
ans=K-skip_dist
print(ans) | import numpy as np
K, N = map(int, input().strip().split())
A = list(map(int, input().strip().split()))
# min_=10**6
dA=np.diff(A)
dA=np.append(dA,A[0]+K-A[-1])
skip_dist=max(dA)
ans=K-skip_dist
print(ans) | [
"assignment.add"
] | 501,004 | 501,003 | u970133396 | python |
p02725 | K, N = map(int, input().split())
A = input().split()
A = [int(val) for val in A]
A_org = min(A)
A = [val - A_org for val in A]
A.sort()
dist = []
for i in range(len(A)):
if i != len(A)-1:
dist.append(A[i+1]-A[i])
else:
dist.append(K-A[i])
print(max(dist)-min(dist)) | K, N = map(int, input().split())
A = input().split()
A = [int(val) for val in A]
A_org = min(A)
A = [val - A_org for val in A]
A.sort()
dist = []
for i in range(len(A)):
if i != len(A)-1:
dist.append(A[i+1]-A[i])
else:
dist.append(K-A[i])
print(K - max(dist)) | [
"expression.operation.binary.remove"
] | 501,009 | 501,010 | u814885356 | python |
p02725 | K, N = map(int, input().split())
A = input().split()
A = [int(val) for val in A]
A_org = min(A)
A = [val - A_org for val in A]
A.sort()
dist = []
for i in range(len(A)):
if i != len(A)-1:
dist.append(A[i+1]-A[i])
else:
dist.append(K-A[i])
print(max(dist)) | K, N = map(int, input().split())
A = input().split()
A = [int(val) for val in A]
A_org = min(A)
A = [val - A_org for val in A]
A.sort()
dist = []
for i in range(len(A)):
if i != len(A)-1:
dist.append(A[i+1]-A[i])
else:
dist.append(K-A[i])
print(K - max(dist)) | [
"expression.operation.binary.add"
] | 501,011 | 501,010 | u814885356 | python |
p02725 | K, N = list(map(int, input().split()))
houses = list(map(int, input().split()))
distances = []
for i in range(N-1):
distances.append(houses[i+1] - houses[i])
distances = [K-houses[N-1]] + distances
distances.remove(max(distances))
print(sum(distances)) | K, N = list(map(int, input().split()))
houses = list(map(int, input().split()))
distances = []
for i in range(N-1):
distances.append(houses[i+1] - houses[i])
distances = [K-sum(distances)] + distances
distances.remove(max(distances))
print(sum(distances)) | [] | 501,014 | 501,015 | u202400119 | python |
p02725 | a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
ans.append(s[i+1]-s[i])
ans.append(a-s[b]+s[0])
print(a-max(ans))
| a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
ans.append(s[i+1]-s[i])
ans.append(a-s[b-1]+s[0])
print(a-max(ans))
| [
"expression.operation.binary.add"
] | 501,016 | 501,017 | u129961029 | python |
p02725 | a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
ans.append(s[i]-s[i-1])
ans.append(a-s[b]+s[0])
print(a-max(ans))
| a,b=map(int,input().split())
s=list(map(int,input().split()))
ans=[]
for i in range(b-1):
ans.append(s[i+1]-s[i])
ans.append(a-s[b-1]+s[0])
print(a-max(ans))
| [
"expression.operation.binary.remove"
] | 501,018 | 501,017 | u129961029 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
rec = list()
rec.append(K - A[-1])
for i, _ in enumerate(A[:-1]):
rec.append(A[i+1] - A[i])
sum = 0
for r in rec:
sum += r
max_r = max(rec)
print(sum - max_r)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
rec = list()
rec.append(A[0] + K - A[-1])
for i, _ in enumerate(A[:-1]):
rec.append(A[i+1] - A[i])
sum = 0
for r in rec:
sum += r
max_r = max(rec)
print(sum - max_r)
| [
"expression.operation.binary.add"
] | 501,030 | 501,031 | u254634413 | python |
p02725 | k,n = map(int,input().split())
a=list(map(int,input().split()))
ans=(a[0]-a[-1])+k
for i in range(n-1):
ans=max(a[i+1]-a[i],ans)
print(ans) | k,n = map(int,input().split())
a=list(map(int,input().split()))
ans=(a[0]-a[-1])+k
for i in range(n-1):
ans=max(a[i+1]-a[i],ans)
print(k-ans) | [
"expression.operation.binary.add"
] | 501,032 | 501,033 | u867826040 | python |
p02725 | k,n=map(int,input().split())
a=[]
a=list(map(int,input().split()))
dis=[]
dis.append(a[0]+(k-a[n-1]))
for i in range(n-1):
dis.append(a[i+1]-a[i])
print(min(dis)) | k,n=map(int,input().split())
a=[]
a=list(map(int,input().split()))
dis=[]
dis.append(a[0]+(k-a[n-1]))
for i in range(n-1):
dis.append(a[i+1]-a[i])
print(k-max(dis))
| [
"call.arguments.change",
"io.output.change"
] | 501,051 | 501,052 | u967835038 | python |
p02725 | k,n=map(int,input().split())
a=[]
a=list(map(int,input().split()))
dis=[]
dis.append(a[0]+(k-a[n-1]))
for i in range(n-1):
dis.append(a[i+1]-a[i])
print(max(dis)) | k,n=map(int,input().split())
a=[]
a=list(map(int,input().split()))
dis=[]
dis.append(a[0]+(k-a[n-1]))
for i in range(n-1):
dis.append(a[i+1]-a[i])
print(k-max(dis))
| [
"expression.operation.binary.add"
] | 501,053 | 501,052 | u967835038 | python |
p02725 | def main():
K, N = [int(_) for _ in input().split()]
A = list(map(int, input().split()))
mx = 0
for i in range(N-1):
dis = A[i+1]-A[i]
if dis > mx:
mx = dis
se = A[N-1] - A[0]
if (K-(se)) > mx:
mx = K - se
print(mx)
main() | def main():
K, N = [int(_) for _ in input().split()]
A = list(map(int, input().split()))
mx = 0
for i in range(N-1):
dis = A[i+1] - A[i]
if dis > mx:
mx = dis
se = A[N-1] - A[0]
if K-se > mx:
mx = K - se
print(K - mx)
main() | [
"control_flow.branch.if.condition.change"
] | 501,061 | 501,062 | u571395477 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.