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 = map(int,input().split())
A = list(map(int,input().split()))
per_dist = list(A[i+1]-A[i] for i in range(0,N-1))
last_dist = A[0] + K - A[N - 1]
per_dist = per_dist.append(last_dist)
max_dist = max(per_dist)
print(K - max_dist) | K,N = map(int,input().split())
A = list(map(int,input().split()))
per_dist = list(A[i+1]-A[i] for i in range(0,N-1))
last_dist = A[0] + K - A[N - 1]
type(last_dist)
per_dist.append(last_dist)
max_dist = max(per_dist)
print(K - max_dist) | [
"call.arguments.add"
] | 501,070 | 501,071 | u654697086 | python |
p02725 | def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = A[-1] - A[0]
for i in range(N-1):
d = A[i + 1] - A[i]
ans = max(ans, d)
print(K - ans)
if __name__ == '__main__':
main()
| def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
ans = K - A[-1] + A[0]
for i in range(N-1):
d = A[i + 1] - A[i]
ans = max(ans, d)
print(K - ans)
if __name__ == '__main__':
main()
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 501,072 | 501,073 | u838644735 | python |
p02725 | def count_section_by_zero(data):
count = 0
flg = False
start = 0
for i, d in enumerate(data):
if flg is False and d != 0:
count += 1
flg = True
if d == 0:
flg = False
return count
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(... | def count_section_by_zero(data):
count = 0
flg = False
start = 0
for i, d in enumerate(data):
if flg is False and d != 0:
count += 1
flg = True
if d == 0:
flg = False
return count
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(... | [
"call.remove"
] | 501,076 | 501,077 | u088552457 | python |
p02725 | def count_section_by_zero(data):
count = 0
flg = False
start = 0
for i, d in enumerate(data):
if flg is False and d != 0:
count += 1
flg = True
if d == 0:
flg = False
return count
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(... | def count_section_by_zero(data):
count = 0
flg = False
start = 0
for i, d in enumerate(data):
if flg is False and d != 0:
count += 1
flg = True
if d == 0:
flg = False
return count
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(... | [
"call.arguments.change",
"expression.operation.binary.change"
] | 501,078 | 501,077 | u088552457 | python |
p02725 | # coding:utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(k)
l = 0
for i in range(n):
l = max(l, a[i+1]-a[i])
print(k-l) | # coding:utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(k+a[0])
l = 0
for i in range(n):
l = max(l, a[i+1]-a[i])
print(k-l) | [
"expression.operation.binary.add"
] | 501,083 | 501,084 | u128661070 | python |
p02725 | # coding:utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
distance = []
for i in range(len(a)):
if i == len(a) - 1:
distance.append(k - a[i])
else:
distance.append(a[i+1] - a[i])
distance.sort()
print(sum(distance[:-1]))
| # coding:utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
distance = []
for i in range(len(a)):
if i == len(a) - 1:
distance.append(k+a[0] - a[i])
else:
distance.append(a[i+1] - a[i])
distance.sort()
print(sum(distance[:-1]))
| [
"expression.operation.binary.add"
] | 501,085 | 501,086 | u128661070 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
max = K-A[-1]+A[0]
for i in range(N-1):
if last < A[i+1]-A[i]:
max = A[i+1]-A[i]
print(K-max) | K,N=map(int,input().split())
A=list(map(int,input().split()))
max = K-A[-1]+A[0]
for i in range(N-1):
if max < A[i+1]-A[i]:
max = A[i+1]-A[i]
print(K-max) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 501,087 | 501,088 | u676458682 | python |
p02725 | k, n = map(int,input().split())
a = list(map(int,input().split()))
mm = k -a[-1] + a[0]
for i in range(n-1):
mm = max(mm, a[i+1]-a[i])
print(mm) | k, n = map(int,input().split())
a = list(map(int,input().split()))
mm = k -a[-1] + a[0]
for i in range(n-1):
mm = max(mm, a[i+1]-a[i])
print(k - mm) | [
"expression.operation.binary.add"
] | 501,103 | 501,104 | u703214333 | python |
p02725 | def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
shiftA = A[1:] + [K]
subA = [shiftA[i] - A[i] for i in range(N)]
maxA = max(subA)
subA.remove(maxA)
print(sum(subA))
if __name__ == '__main__':
main() | def main():
K, N = map(int, input().split())
A = list(map(int, input().split()))
shiftA = A[1:] + [K+A[0]]
subA = [shiftA[i] - A[i] for i in range(N)]
maxA = max(subA)
subA.remove(maxA)
print(sum(subA))
if __name__ == '__main__':
main() | [
"assignment.change"
] | 501,122 | 501,123 | u801049006 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=len(a)
diff=max(a)-min(a)
temp1=a[0]
for i in range(1,b):
temp2=a[i]
a[i]=a[i]-temp1
temp1=temp2
la=k-diff
a[0]=la
print(k-min(a)) | k,n=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=len(a)
diff=max(a)-min(a)
temp1=a[0]
for i in range(1,b):
temp2=a[i]
a[i]=a[i]-temp1
temp1=temp2
la=k-diff
a[0]=la
print(sum(a)-max(a))
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add",
"misc.opposites",
"identifier.change",
"call.function.change"
] | 501,124 | 501,125 | u106778233 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=len(a)
diff=max(a)-min(a)
temp1=a[0]
for i in range(1,b):
temp2=a[i]
a[i]=a[i]-temp1
temp1=temp2
la=k-diff
a[0]=la
print(min(a)) | k,n=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
b=len(a)
diff=max(a)-min(a)
temp1=a[0]
for i in range(1,b):
temp2=a[i]
a[i]=a[i]-temp1
temp1=temp2
la=k-diff
a[0]=la
print(sum(a)-max(a))
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 501,126 | 501,125 | u106778233 | python |
p02725 | K, N = list(map(int, input().split()))
an = list(map(int,input().split()))
min_list = []
for i in range(N):
if i == 0:
left = an[i] + K - an[-1]
right = an[i+1] - an[i]
elif i == N-1:
left = an[i] - an[i-1]
right = an[0] + K - an[N-1]
else:
left = an[i] - an[i-1]
... | K, N = list(map(int, input().split()))
an = list(map(int,input().split()))
min_list = []
for i in range(N):
if i == 0:
left = an[i] + K - an[-1]
right = an[i+1] - an[i]
elif i == N-1:
left = an[i] - an[i-1]
right = an[0] + K - an[N-1]
else:
left = an[i] - an[i-1]
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 501,131 | 501,132 | u314312196 | python |
p02725 | K,N =map(int,input().split())
list_A =input().strip().split()
list_B=[]
list_B.append(int(list_A[0])+(K-int(list_A[-1])))
for i in range(N-1):
list_B.append(int(list_A[i+1])-int(list_A[i]))
print(max(list_B)) | K,N =map(int,input().split())
list_A =input().strip().split()
list_B=[]
list_B.append(int(list_A[0])+(K-int(list_A[-1])))
for i in range(N-1):
list_B.append(int(list_A[i+1])-int(list_A[i]))
print(K-max(list_B)) | [
"expression.operation.binary.add"
] | 501,137 | 501,138 | u538537141 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
memo=A[0]
for i in range(N-1):
Bi=A[i+1]-A[i]
if Bi>memo:
memo=Bi
if memo<=K-A[N-1]:
print(A[N-1]-A[0])
else:
print(K-memo) | K,N=map(int,input().split())
A=list(map(int,input().split()))
memo=A[0]
for i in range(N-1):
Bi=A[i+1]-A[i]
if Bi>memo:
memo=Bi
if memo<=K-A[N-1]+A[0]:
print(A[N-1]-A[0])
else:
print(K-memo) | [
"control_flow.branch.if.condition.change"
] | 501,157 | 501,158 | u632609425 | python |
p02725 | n, k =map(int,input().split())
l=list(map(int,input().split()))
l.append(n)
d=[0 for i in range(k+1)]
for i in range(1,k+1):
d[i]=l[i]-l[i-1]
print(sum(d)-max(d)) | n, k =map(int,input().split())
l=list(map(int,input().split()))
l.append(n+l[0])
d=[0 for i in range(k+1)]
for i in range(1,k+1):
d[i]=l[i]-l[i-1]
print(sum(d)-max(d)) | [
"expression.operation.binary.add"
] | 501,163 | 501,164 | u732743460 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
dist = A[0] + (K-A[N-1])
for i in range(N-1):
if (dist < A[i+1]-A[i]):
dist = A[i+1]-A[i]
print(dist)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
dist = A[0] + (K-A[N-1])
for i in range(N-1):
if (dist < A[i+1]-A[i]):
dist = A[i+1]-A[i]
print(K - dist)
| [
"expression.operation.binary.add"
] | 501,165 | 501,166 | u452913314 | python |
p02725 | k, n = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
kyoris = []
for i in range(len(a)-1):
kyoris.append(abs(a[i]-a[i+1]))
lastkyori = (k - a[-1]) + a[0]
kyoris.append(lastkyori)
print(max(kyoris))
| k, n = [int(s) for s in input().split()]
a = [int(s) for s in input().split()]
kyoris = []
for i in range(len(a)-1):
kyoris.append(abs(a[i]-a[i+1]))
lastkyori = (k - a[-1]) + a[0]
kyoris.append(lastkyori)
print(k - max(kyoris))
| [
"expression.operation.binary.add"
] | 501,167 | 501,168 | u610314616 | python |
p02725 |
K, N = map(int, input().split())
A = [int(x) for x in input().split()]
B = [A[i] - A[i-1] for i in range(1, N)]
B.append(K - A[-1])
ans = sum(B) - max(B)
print(ans) | K, N = map(int, input().split())
A = [int(x) for x in input().split()]
B = [A[i] - A[i-1] for i in range(1, N)]
B.append(K - A[-1] + A[0])
ans = sum(B) - max(B)
print(ans) | [
"expression.operation.binary.add"
] | 501,173 | 501,174 | u591016708 | python |
p02725 | k, n = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
if i + 1 <= n - 1:
if arr[i + 1] - arr[i] > ans:
ans = arr[i + 1] - arr[i]
else:
if k - (arr[i] - arr[0]) > ans:
ans = arr[i] - arr[0]
print(k - ans) | k, n = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
if i + 1 <= n - 1:
if arr[i + 1] - arr[i] > ans:
ans = arr[i + 1] - arr[i]
else:
if k - (arr[i] - arr[0]) > ans:
ans = k - (arr[i] - arr[0])
print(k - ans) | [
"assignment.change"
] | 501,187 | 501,188 | u104005543 | python |
p02725 | k, n = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
if i + 1 <= n - 1:
if arr[i + 1] - arr[i] > ans:
ans = arr[i + 1] - arr[i]
else:
if k - (arr[i] - arr[0]) > ans:
ans = arr[i] - arr[0]
print(ans) | k, n = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
if i + 1 <= n - 1:
if arr[i + 1] - arr[i] > ans:
ans = arr[i + 1] - arr[i]
else:
if k - (arr[i] - arr[0]) > ans:
ans = k - (arr[i] - arr[0])
print(k - ans) | [
"assignment.change",
"expression.operation.binary.add"
] | 501,189 | 501,188 | u104005543 | python |
p02725 | k, n = map(int, input().split())
p = list(map(int, input().split()))
d = []
for i in range(n):
if i != n - 1:
d.append(p[i+1] - p[i])
else:
d.append(k - p[i])
a = sum(d) - max(d)
print(a)
| k, n = map(int, input().split())
p = list(map(int, input().split()))
d = []
for i in range(n):
if i != n - 1:
d.append(p[i+1] - p[i])
else:
d.append(k + p[0] - p[i])
a = sum(d) - max(d)
print(a)
| [
"expression.operation.binary.add"
] | 501,190 | 501,191 | u437860615 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
length = []
for i in range(n-1):
length.append(a[i+1] - a[i])
length.append(a[0] + k - a[n-1])
print(length)
max_length = max(length)
ans = k- max_length
print(ans) | k, n = map(int, input().split())
a = list(map(int, input().split()))
length = []
for i in range(n-1):
length.append(a[i+1] - a[i])
length.append(a[0] + k - a[n-1])
max_length = max(length)
ans = k- max_length
print(ans) | [
"call.remove"
] | 501,200 | 501,201 | u165368960 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
length = []
for i in range(n-1):
length.append(a[i+1] - a[i])
length.append(a[0] + 20 - a[n-1])
max_length = max(length)
ans = 20- max_length
print(ans) | k, n = map(int, input().split())
a = list(map(int, input().split()))
length = []
for i in range(n-1):
length.append(a[i+1] - a[i])
length.append(a[0] + k - a[n-1])
max_length = max(length)
ans = k- max_length
print(ans) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 501,202 | 501,201 | u165368960 | python |
p02725 | K,N = map(int, input().split())
A=list(map(int, input().split()))
Adist=[]
for i in range(N-1):
Adist.append(A[i+1]-A[i])
Adist.append(K-A[N-1])
Adist.pop(Adist.index(max(Adist)))
print(sum(Adist)) | K,N = map(int, input().split())
A=list(map(int, input().split()))
Adist=[]
for i in range(N-1):
Adist.append(A[i+1]-A[i])
Adist.append(K-A[N-1]+A[0])
Adist.pop(Adist.index(max(Adist)))
print(sum(Adist)) | [
"expression.operation.binary.add"
] | 501,207 | 501,208 | u608178601 | python |
p02725 | kn=list(map(int, input().split()))
a=list(map(int, input().split()))
k=kn[0]
n=kn[1]
maxdis=a[n-1]+a[0]
for i in range(n-1):
if maxdis<(a[i+1]-a[i]):
maxdis=(a[i+1]-a[i])
print(k-maxdis) | kn=list(map(int, input().split()))
a=list(map(int, input().split()))
k=kn[0]
n=kn[1]
maxdis=k-a[n-1]+a[0]
#print(maxdis)
for i in range(n-1):
if maxdis<(a[i+1]-a[i]):
maxdis=(a[i+1]-a[i])
#print(i)
#print(maxdis)
print(k-maxdis) | [
"assignment.change"
] | 501,209 | 501,210 | u927839462 | python |
p02725 | K, N = map(int, input().split())
fst = None
lst = None
pre = None
mx = 0
for a in sorted(map(int, input().split())):
lst = a
if fst is None:
fst = pre = a
continue
d = a - pre
if d > mx:
mx = d
pre = a
d = (K - lst) + fst
if d > mx:
mx = d
print(mx) | K, N = map(int, input().split())
fst = None
lst = None
pre = None
mx = 0
for a in sorted(map(int, input().split())):
lst = a
if fst is None:
fst = pre = a
continue
d = a - pre
if d > mx:
mx = d
pre = a
d = (K - lst) + fst
if d > mx:
mx = d
print(K - mx) | [
"expression.operation.binary.add"
] | 501,213 | 501,214 | u658801777 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
ans = k
for i in range(n):
if (i == 0):
tmp = a[-1] - a[0]
else:
tmp = k-a[i]+a[i-1]
if (tmp < ans):
ans = tmp
print(ans)
print(ans) | k, n = map(int, input().split())
a = list(map(int, input().split()))
ans = k
for i in range(n):
if (i == 0):
tmp = a[-1] - a[0]
else:
tmp = k-a[i]+a[i-1]
if (tmp < ans):
ans = tmp
print(ans) | [
"call.remove"
] | 501,221 | 501,222 | u469281291 | python |
p02725 | def main():
k,n = tuple([int(t)for t in input().split()])
a = [int(t)for t in input().split()]
l = 0
dist = []
for a_i in a[1:]:
dist.append(a_i-l)
l = a_i
dist.append(k-a[-1]+a[0])
print(k-max(dist))
if __name__ == "__main__":
main() | def main():
k,n = tuple([int(t)for t in input().split()])
a = [int(t)for t in input().split()]
l = a[0]
dist = []
for a_i in a[1:]:
dist.append(a_i-l)
l = a_i
dist.append(k-a[-1]+a[0])
print(k-max(dist))
if __name__ == "__main__":
main() | [] | 501,223 | 501,224 | u711238850 | python |
p02725 | K, N = map(int, input().split(' '))
A = list(map(int, input().split(' ')))
distance = [A[i+1] - A[i] for i in range(0, N-1)]
distance.append(K - A[N-1])
distance.remove(max(distance))
print(sum(distance)) | K, N = map(int, input().split(' '))
A = list(map(int, input().split(' ')))
distance = [A[i+1] - A[i] for i in range(0, N-1)]
distance.append(K - A[N-1] + A[0])
distance.remove(max(distance))
print(sum(distance))
| [
"expression.operation.binary.add"
] | 501,227 | 501,228 | u012955130 | python |
p02725 | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.append(n)
d=[]
for i in range(len(a)-1):
d.append([i,a[i+1]-a[i]])
d[-1][1]+=a[0]
l=sorted(d,key=lambda x:x[1])
o=l[-1][0]
if o==len(a)-1:
g=a[-2]-a[0]
else:
g=a[o]+n-a[o+1]
print(g) | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.append(n)
d=[]
for i in range(len(a)-1):
d.append([i,a[i+1]-a[i]])
d[-1][1]+=a[0]
l=sorted(d,key=lambda x:x[1])
o=l[-1][0]
if o==len(a)-2:
g=a[-2]-a[0]
else:
g=a[o]+n-a[o+1]
print(g) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 501,235 | 501,236 | u771538568 | python |
p02725 | k,n = map(int, input().split())
l = list(map(int, input().split()))
#print(k,n, l)
x = []
for i in range(1, n):
x .append(l[i]-l[i-1])
x = x + [k - l[-1]]
print(sum(x) - max(x))
| k,n = map(int, input().split())
l = list(map(int, input().split()))
#print(k,n, l)
x = []
for i in range(1, n):
x .append(l[i]-l[i-1])
#print(x)
x = x + [k - sum(x)]
#print(x)
print(sum(x) - max(x))
| [] | 501,237 | 501,238 | u680851063 | python |
p02725 | a=input()
a,b=a.split(" ")
a=int(a)
b=int(b)
c=input().split(" ")
d=0
for i in range(1,b):
d=max(int(c[i])-int(c[i-1]),d)
d=max(a-int(c[-1])+int(c[0]),d)
print(d)
| a=input()
a,b=a.split(" ")
a=int(a)
b=int(b)
c=input().split(" ")
d=0
for i in range(1,b):
d=max(int(c[i])-int(c[i-1]),d)
d=max(a-int(c[-1])+int(c[0]),d)
print(a-d)
| [
"expression.operation.binary.add"
] | 501,239 | 501,240 | u376450099 | python |
p02725 | def main():
K, N = map(int,input().split())
A = list(map(int,input().split()))
A.append(K)
B = []
for i in range(N):
B.append(A[i+1] - A[i]) # 内包表記
# Maxを抜く
tmp = max(B)
print(sum(B) - tmp)
main() | def main():
K, N = map(int,input().split())
A = list(map(int,input().split()))
A.append(K+A[0])
B = []
for i in range(N):
B.append(A[i+1] - A[i]) # 内包表記
# Maxを抜く
tmp = max(B)
print(sum(B) - tmp)
main() | [
"expression.operation.binary.add"
] | 501,241 | 501,242 | u903699277 | python |
p02725 | K, N = map(int, input().split())
*A, = map(int, input().split())
A = A + [K]
chk = [0] * N
for i in range(N):
chk[i] = A[i+1] - A[i]
chk.sort(reverse=True)
print(sum(chk[1:])) | K, N = map(int, input().split())
*A, = map(int, input().split())
A = A + [K+A[0]]
chk = [0] * N
for i in range(N):
chk[i] = A[i+1] - A[i]
chk.sort(reverse=True)
print(sum(chk[1:])) | [
"assignment.change"
] | 501,253 | 501,254 | u327532412 | python |
p02725 | inputNumber = input()
K = int(inputNumber.split(" ")[0])
N = int(inputNumber.split(" ")[1])
inputNumber = input()
A=inputNumber.split(" ")
A_Length=len(A)
for i in range(A_Length):
A[i] = int(A[i])
result=0
for i in range(A_Length):
if i == A_Length - 1:
if result < (K - A[i]) + A[0]:
r... | inputNumber = input()
K = int(inputNumber.split(" ")[0])
N = int(inputNumber.split(" ")[1])
inputNumber = input()
A=inputNumber.split(" ")
A_Length=len(A)
for i in range(A_Length):
A[i] = int(A[i])
result=0
for i in range(A_Length):
if i == A_Length - 1:
if result < (K - A[i]) + A[0]:
r... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"expression.operation.binary.remove"
] | 501,263 | 501,264 | u253866125 | python |
p02725 | k,n=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
l.append(20+l[0]);
maxdiff=0
for i in range(n):
if(l[i+1]-l[i]>maxdiff):
maxdiff=l[i+1]-l[i]
print(k-maxdiff)
| k,n=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
l.append(k+l[0]);
maxdiff=0
for i in range(n):
if(l[i+1]-l[i]>maxdiff):
maxdiff=l[i+1]-l[i]
print(k-maxdiff)
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 501,293 | 501,294 | u905592208 | python |
p02725 | K, N =map(int, input().split())
A = list(map(int, input().split()))
diff = []
for i in range(1, len(A)):
diff.append(A[i] - A[i-1])
diff.append(K - A[-1])
diff.remove(max(diff))
print(sum(diff)) | K, N =map(int, input().split())
A = list(map(int, input().split()))
diff = []
for i in range(1, len(A)):
diff.append(A[i] - A[i-1])
diff.append(K + A[0] - A[-1])
diff.remove(max(diff))
print(sum(diff)) | [
"expression.operation.binary.add"
] | 501,315 | 501,316 | u707712609 | python |
p02725 | k, n = map(int,input().split())
a = list(map(int,input().split()))
l = [k-a[n-1]]
for i in range(1,n):
l.append(a[i]-a[i-1])
l_max = max(l)
ans = sum(l)-l_max
print(ans)
| k, n = map(int,input().split())
a = list(map(int,input().split()))
l = [k+a[0]-a[n-1]]
for i in range(1,n):
l.append(a[i]-a[i-1])
l_max = max(l)
ans = sum(l)-l_max
print(ans)
| [
"assignment.change"
] | 501,325 | 501,326 | u603324902 | python |
p02725 | # -*- coding: utf-8 -*-
K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0])
distance_max = 0
for i in range(N):
if distance_max < A[i+1] - A[i]:
distance_max = A[i+1] - A[i]
print(K-distance_max)
| # -*- coding: utf-8 -*-
K, N = map(int, input().split())
A = list(map(int, input().split()))
A.append(A[0]+K)
distance_max = 0
for i in range(N):
if distance_max < A[i+1] - A[i]:
distance_max = A[i+1] - A[i]
print(K-distance_max)
| [
"expression.operation.binary.add"
] | 501,327 | 501,328 | u332386346 | python |
p02725 | K,N = map(int,input().split())
A = list(map(int,input().split()))
diff = []
for i in range(N-1):
Diff = A[i+1] -A[i]
diff.append(Diff)
diff.append(K-A[N-1]+A[0])
DIFF = sorted(diff)
print(DIFF)
del DIFF[-1]
print(sum(DIFF)) | K,N = map(int,input().split())
A = list(map(int,input().split()))
diff = []
for i in range(N-1):
Diff = A[i+1] -A[i]
diff.append(Diff)
diff.append(K-A[N-1]+A[0])
DIFF = sorted(diff)
del DIFF[-1]
print(sum(DIFF)) | [
"call.remove"
] | 501,335 | 501,336 | u981864683 | python |
p02725 | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(k + a[0])
b = []
for i in range(n):
b.append(a[i + 1] - a[i])
print(a[-2] - min(b))
| k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(k + a[0])
b = []
for i in range(n):
b.append(a[i + 1] - a[i])
print(sum(b) - max(b))
| [
"call.arguments.change",
"misc.opposites",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"io.output.change"
] | 501,345 | 501,346 | u530606147 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
B=[]
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(A[N-1]-A[0])
print(K-max(B)) | K, N = map(int, input().split())
A = list(map(int, input().split()))
B=[]
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(K-(A[N-1]-A[0]))
print(K-max(B)) | [
"call.arguments.add",
"call.arguments.change"
] | 501,362 | 501,363 | u519922200 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
B=[]
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(A[N-1]-A[0])
print(N-max(B)) | K, N = map(int, input().split())
A = list(map(int, input().split()))
B=[]
for i in range(N-1):
B.append(A[i+1]-A[i])
B.append(K-(A[N-1]-A[0]))
print(K-max(B)) | [
"call.arguments.add",
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 501,364 | 501,363 | u519922200 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
dA = [A[i+1] - A[i] for i in range(N-1)]
dA.append(K-A[-1])
sumdA = sum(dA)
maxdA = max(dA)
print(sumdA - maxdA) | K, N = map(int, input().split())
A = list(map(int, input().split()))
dA = [A[i+1] - A[i] for i in range(N-1)]
dA.append(K-A[-1]+A[0])
sumdA = sum(dA)
maxdA = max(dA)
print(sumdA - maxdA)
| [
"expression.operation.binary.add"
] | 501,371 | 501,372 | u372501464 | python |
p02725 | k, n = [int(elem) for elem in input().split()]
a_lst = [int(elem) for elem in input().split()]
diff = []
for i, a in enumerate(a_lst[:-1]):
diff.append(a_lst[i+1] - a)
diff.append((a_lst[0] + k) - a_lst[-1])
print(diff)
res = sum(diff) - max(diff)
print(res) | k, n = [int(elem) for elem in input().split()]
a_lst = [int(elem) for elem in input().split()]
diff = []
for i, a in enumerate(a_lst[:-1]):
diff.append(a_lst[i+1] - a)
diff.append((a_lst[0] + k) - a_lst[-1])
res = sum(diff) - max(diff)
print(res) | [
"call.remove"
] | 501,387 | 501,388 | u047197186 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
a = [A[i + 1] - A[i] for i in range(N - 1)]
a.append(K + A[0] - A[-1])
a.sort()
print(a)
print(sum(a[:-1]))
| K, N = map(int, input().split())
A = list(map(int, input().split()))
a = [A[i + 1] - A[i] for i in range(N - 1)]
a.append(K + A[0] - A[-1])
a.sort()
print(sum(a[:-1]))
| [
"call.remove"
] | 501,393 | 501,394 | u731368968 | python |
p02725 | m, n = map(int, input().split())
nums = list(map(int, input().split()))
a = 0
for i in range(n):
if i == n-1:
dif = m - nums[i]
else:
dif = nums[i+1] - nums[i]
a = max(a, dif)
print(m-a)
| m, n = map(int, input().split())
nums = list(map(int, input().split()))
a = 0
for i in range(n):
if i == n-1:
dif = m + nums[0] - nums[i]
else:
dif = nums[i+1] - nums[i]
a = max(a, dif)
print(m-a) | [
"assignment.change"
] | 501,398 | 501,399 | u934053315 | python |
p02725 | k,n = map(lambda x: int(x),input().split())
a = list(map(lambda x: int(x),input().split()))
a.append(k)
sabun = [a[i+1] -a[i] for i in range(n)]
print(sum(sorted(sabun)[:n-1]))
| k,n = map(lambda x: int(x),input().split())
a = list(map(lambda x: int(x),input().split()))
a.append(k+a[0])
sabun = [a[i+1] -a[i] for i in range(n)]
print(sum(sorted(sabun)[:n-1]))
| [
"expression.operation.binary.add"
] | 501,408 | 501,409 | u907668975 | python |
p02725 | K,N=map(int,input().split())
a_list=list(map(int,input().split()))
b_list=[]
for i in range(N-1):
X=a_list[i+1]-a_list[i]
b_list.append(abs(X))
b_list.append(K-a_list[-1]+a_list[0])
print(b_list)
print(K-max(b_list)) | K,N=map(int,input().split())
a_list=list(map(int,input().split()))
b_list=[]
for i in range(N-1):
X=a_list[i+1]-a_list[i]
b_list.append(abs(X))
b_list.append(K-a_list[-1]+a_list[0])
print(K-max(b_list)) | [
"call.remove"
] | 501,421 | 501,422 | u922769680 | python |
p02725 | import numpy as np
K, N = map(int, input().split(" "))
loc = list(map(int, input().split(" ")))
loc = np.array(loc)
dist = np.diff(loc)
np.append(dist,K - loc[N-1] + loc[0])
most_far = np.max(dist)
print(K-most_far) | import numpy as np
K, N = map(int, input().split(" "))
loc = list(map(int, input().split(" ")))
loc = np.array(loc)
dist = np.diff(loc)
dist = np.append(dist, K - loc[N - 1] + loc[0])
most_far = np.max(dist)
print(K - most_far)
| [
"assignment.add"
] | 501,441 | 501,442 | u612895604 | python |
p02725 | K,N=map(int,input().split())
*A,=map(int,input().split())
delta = [A[i+1]-A[i] for i in range(N-1)]
delta += [K-A[N-1]]
maxd = max(delta)
print(sum(delta)-maxd) | K,N=map(int,input().split())
*A,=map(int,input().split())
delta = [A[i+1]-A[i] for i in range(N-1)]
delta += [K-A[N-1]+A[0]]
maxd = max(delta)
print(sum(delta)-maxd) | [
"expression.operation.binary.add"
] | 501,443 | 501,444 | u272682534 | python |
p02725 |
K,N = input().split()
K = int(K)
N= int(N)
A = [int(x) for x in input().split()]
dis=[]
now = 0
for i in range(N):
dis.append(A[i] - now)
now = A[i]
dis.append(K - A[N -1])
distance = K - max(dis)
print(distance) | K,N = input().split()
K = int(K)
N= int(N)
A = [int(x) for x in input().split()]
dis=[]
now = 0
for i in range(N):
dis.append(A[i] - now)
now = A[i]
dis.append(K-A[N-1]+dis[0])
distance = K - max(dis)
print(distance) | [
"expression.operation.binary.add"
] | 501,449 | 501,450 | u767752954 | python |
p02725 | def calc(K, N, A):
B = [A[i + 1] - A[i] for i in range(N - 1)] + [A[0] + K - A[N - 1]]
print(B)
return K - max(B)
(K, N) = tuple([int(s) for s in input().split()])
A = [int(s) for s in input().split()]
print(calc(K, N, A)) | def calc(K, N, A):
B = [A[i + 1] - A[i] for i in range(N - 1)] + [A[0] + K - A[N - 1]]
return K - max(B)
(K, N) = tuple([int(s) for s in input().split()])
A = [int(s) for s in input().split()]
print(calc(K, N, A)) | [
"call.remove"
] | 501,455 | 501,456 | u703461446 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
lst = []
for i in range(0, len(a)-1) :
lst += [a[i + 1] - a[i]]
lst += [k - a[-1] + a[0]]
print(lst)
print(sum(lst) - max(lst))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
lst = []
for i in range(0, len(a)-1) :
lst += [a[i + 1] - a[i]]
lst += [k - a[-1] + a[0]]
print(sum(lst) - max(lst))
| [
"call.remove"
] | 501,457 | 501,458 | u797375364 | python |
p02725 | k,n = map(int,input().split())
lst_a = list(map(int,input().split()))
dis_max = 0
lo_last = lst_a[0]
for i in range(1,n):
ilo = lst_a[i]
dis_max = max(dis_max, ilo-lo_last)
lo_last = ilo
ilo = lst_a[0]
dis_max = max(dis_max, ilo-lo_last)
print(k-dis_max) | k,n = map(int,input().split())
lst_a = list(map(int,input().split()))
dis_max = 0
lo_last = lst_a[0]
for i in range(1,n):
ilo = lst_a[i]
dis_max = max(dis_max, ilo-lo_last)
lo_last = ilo
ilo = lst_a[0]
dis_max = max(dis_max, ilo+k-lo_last)
print(k-dis_max) | [
"assignment.change"
] | 501,461 | 501,462 | u435480265 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
d = 0
pre = a[0]
for i in a[1:]:
if i - pre > d:
d = i - pre
pre = i
if k - a[-1] + a[0] > d:
d = a[-1] - a[0]
print(k - d)
| k, n = map(int, input().split())
a = list(map(int, input().split()))
d = 0
pre = a[0]
for i in a[1:]:
if i - pre > d:
d = i - pre
pre = i
if k - a[-1] + a[0] > d:
d = k - a[-1] + a[0]
print(k - d)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 501,465 | 501,466 | u644516473 | python |
p02725 | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
k,n = mi()
a = li()
b = 0
tmp = 0
am = a[0]
for i in range(1,n):
tmp = a[i] -a[i-1]
am = max(am,tmp)
am = max(am,k - a[-1])
print(k-am)
| ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
k,n = mi()
a = li()
b = 0
tmp = 0
am = a[0]
for i in range(1,n):
tmp = a[i] -a[i-1]
am = max(am,tmp)
am = max(am,k - a[-1] + a[0])
print(k-am)
| [
"assignment.change"
] | 501,481 | 501,482 | u872887731 | python |
p02725 | K,N = map(int,input().split())
A = list(map(int,input().split()))
mx = K - A[N-1] +A[0]
for i in range(N-1):
if A[i+1] - A[i] > mx:
mx = A[i+1] - A[i]
ans = sum(A) - mx
print(ans)
| K,N = map(int,input().split())
A = list(map(int,input().split()))
mx = K - A[N-1] +A[0]
for i in range(N-1):
if A[i+1] - A[i] > mx:
mx = A[i+1] - A[i]
ans = K - mx
print(ans) | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 501,485 | 501,486 | u493555013 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = -1
for i in range(len(a)):
if i == (len(a)-1):
tmp = (a[0]+k) - a[i]
else:
tmp = a[i+1] - a[i]
if tmp > ans:
ans = tmp
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = -1
for i in range(len(a)):
if i == (len(a)-1):
tmp = (a[0]+k) - a[i]
else:
tmp = a[i+1] - a[i]
if tmp > ans:
ans = tmp
print(k-ans) | [
"expression.operation.binary.add"
] | 501,487 | 501,488 | u549383771 | python |
p02725 | # C
import numpy as np
K, N = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(sorted(A))
A_div = np.append(A[1:], np.array([K]))- A
print(np.sum(A_div)-np.max(A_div)) | # C
import numpy as np
K, N = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(sorted(A))
A_div = np.append(A[1:], np.array([K+A[0]])) - A
print(np.sum(A_div)-np.max(A_div)) | [
"assignment.change"
] | 501,496 | 501,497 | u239528020 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
a+=[k+a[0]]
s=0
for i in range(n):
s=max(s,a[i+1]-a[i])
print(s) | k,n=map(int,input().split())
a=list(map(int,input().split()))
a+=[k+a[0]]
s=0
for i in range(n):
s=max(s,a[i+1]-a[i])
print(k-s) | [
"expression.operation.binary.add"
] | 501,498 | 501,499 | u695644361 | python |
p02725 | import sys
K, N = [int(i) for i in sys.stdin.readline().strip().split(" ")]
A = [int(i) for i in sys.stdin.readline().strip().split(" ")]
s = 0
m = -1
a = []
for i in range(0, N-1):
n = A[i+1] - A[i]
m = max(m, n)
s += n
n = K-A[-1]
m = max(m, n)
s += n
print(s - m)
| import sys
K, N = [int(i) for i in sys.stdin.readline().strip().split(" ")]
A = [int(i) for i in sys.stdin.readline().strip().split(" ")]
s = 0
m = -1
a = []
for i in range(0, N-1):
n = A[i+1] - A[i]
m = max(m, n)
s += n
n = K-A[-1] + A[0]
m = max(m, n)
s += n
print(s - m)
| [
"assignment.change"
] | 501,500 | 501,501 | u506040989 | python |
p02725 | K, N = map(int,input().split())
A = list(map(int,input().split()))
L = []
for i in range(N):
if i == 0:
L.append(A[0]+(20-A[N-1]))
else:
L.append(A[i]-A[i-1])
print(K-max(L)) | K, N = map(int,input().split())
A = list(map(int,input().split()))
L = []
for i in range(N):
if i == 0:
L.append(A[0]+(K-A[N-1]))
else:
L.append(A[i]-A[i-1])
print(K-max(L)) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 501,507 | 501,508 | u542541293 | python |
p02725 | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
import numpy as np
k,n = mi()
a=np.array(li())
b = a[1:] - a[:n-1]
b_max = np.max(b)
c = a[0] + k-a[n-1]
print(max(b_max,c))
| ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
import numpy as np
k,n = mi()
a=np.array(li())
b = a[1:] - a[:n-1]
b_max = np.max(b)
c = a[0] + k-a[n-1]
print(k-max(b_max,c))
| [
"expression.operation.binary.add"
] | 501,509 | 501,510 | u117054186 | python |
p02725 | n= [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
lake = n[0]
num_ie = n[1]
kyori = []
for i in range(num_ie-1):
kyori.append(l[i+1]-l[i])
kyori.append(lake - l[num_ie-1] + l[0])
output = 0
output += sum(kyori)
output -= max(kyori)
print(kyori)
print(output) | n= [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
lake = n[0]
num_ie = n[1]
kyori = []
for i in range(num_ie-1):
kyori.append(l[i+1]-l[i])
kyori.append(lake - l[num_ie-1] + l[0])
output = 0
output += sum(kyori)
output -= max(kyori)
print(output)
| [
"call.remove"
] | 501,511 | 501,512 | u005815259 | python |
p02725 | K,N = map(int,input().split())
A = list(map(int,input().split()))
m = 0
for i in range(N-1):
l = A[i+1] - A[i]
if m <= l:
m = l
if m <= K-A[N-1]+A[0]:
m = K-A[N-1]+A[0]
print(m) | K,N = map(int,input().split())
A = list(map(int,input().split()))
m = 0
for i in range(N-1):
l = A[i+1] - A[i]
if m <= l:
m = l
if m <= K-A[N-1]+A[0]:
m = K-A[N-1]+A[0]
print(K-m) | [
"expression.operation.binary.add"
] | 501,513 | 501,514 | u273496671 | python |
p02725 | K,N = map(int,input().split())
A = list(map(int ,input().split()))
B = []
for a in range(len(A)):
if a != 0:
B.append(A[a-1] - A[a] + 20)
else:
B.append(A[len(A)-1] -A[a])
print(min(B)) | K,N = map(int,input().split())
A = list(map(int ,input().split()))
B = []
for a in range(len(A)):
if a != 0:
B.append(A[a-1] - A[a] + K)
else:
B.append(A[len(A)-1] -A[a])
print(min(B)) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 501,527 | 501,528 | u614628638 | python |
p02725 | k, n = map(int, input().split())
A = list(map(int, input().split()))
kyori = 0
if A[0] == 0:
kyori = k-A[-1]
else:
kyori = A[-1]-A[0]
for i in range(n-1):
kyori = max(kyori, A[i+1]-A[i])
print(k-kyori)
| k, n = map(int, input().split())
A = list(map(int, input().split()))
kyori = 0
if A[0] == 0:
kyori = k-A[-1]
else:
kyori = k-(A[-1]-A[0])
for i in range(n-1):
kyori = max(kyori, A[i+1]-A[i])
print(k-kyori)
| [
"assignment.change"
] | 501,549 | 501,550 | u189487046 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
b = [0 * n for i in range(n)]
for i in range(n-1):
b[i] = a[i+1] - a[i]
b[-1] = a[0] + (k - a[-1])
print(k - (k-max(b))) | k,n = map(int,input().split())
a = list(map(int,input().split()))
b = [0 * n for i in range(n)]
for i in range(n-1):
b[i] = a[i+1] - a[i]
b[-1] = a[0] + (k - a[-1])
print(k - max(b)) | [
"call.arguments.change"
] | 501,559 | 501,560 | u101839330 | python |
p02725 | # -*- coding: utf-8 -*-
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff_A = []
for n in range(N-1):
diff_A.append(A[n+1] - A[n])
diff_A.append(K - A[-1])
print(sum(diff_A)-max(diff_A))
| # -*- coding: utf-8 -*-
K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
diff_A = []
for n in range(N-1):
diff_A.append(A[n+1] - A[n])
diff_A.append(K - A[-1] + A[0])
print(sum(diff_A)-max(diff_A))
| [
"expression.operation.binary.add"
] | 501,563 | 501,564 | u366963613 | python |
p02725 | K,N=map(int, input().split())
A=list(map(int, input().split()))
K=[]
for i in range(N):
if i==N-1:
K.append((K-A[i])+A[1])
else:
K.append(A[i+1]-A[i])
print(N-max(K)) | K,N=map(int, input().split())
A=list(map(int, input().split()))
C=[]
for i in range(N):
if i==N-1:
C.append((K-A[i])+A[0])
else:
C.append(A[i+1]-A[i])
print(K-max(C)) | [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 501,567 | 501,568 | u748311048 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
sa = 0
for i in range(n - 1):
sa = max(sa,a[i + 1] - a[i])
sa = max(sa,k - a[n - 1])
print(k - sa) | k,n = map(int,input().split())
a = list(map(int,input().split()))
sa = 0
for i in range(n - 1):
sa = max(sa,a[i + 1] - a[i])
sa = max(sa,k+a[0] - a[n - 1])
print(k - sa) | [
"assignment.change"
] | 501,571 | 501,572 | u678503521 | python |
p02725 | k,n = map(int,input().split())
li = list(map(int,input().split()))
li_diff = []
for i in range(len(li) - 1):
li_diff.append(li[i + 1] - li[i])
li_diff.append(k - li[len(li) - 1])
ans = sum(li_diff) - max(li_diff)
print(ans) | k,n = map(int,input().split())
li = list(map(int,input().split()))
li_diff = []
for i in range(len(li) - 1):
li_diff.append(li[i + 1] - li[i])
li_diff.append(k + li[0] - li[len(li) - 1])
ans = sum(li_diff) - max(li_diff)
print(ans) | [
"expression.operation.binary.add"
] | 501,593 | 501,594 | u907549201 | python |
p02725 | # S = input()
# if S[2] == S[3] and S[4] == S[5]:
# print('Yes')
# else:
# print('No')
K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
x = K - A[-1] + A[0]
for i in range(N - 1):
x = max(A[i + 1] - A[i], x)
print(x)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
x = K - A[-1] + A[0]
for i in range(N - 1):
x = max(A[i + 1] - A[i], x)
print(K - x)
| [
"expression.operation.binary.add"
] | 501,604 | 501,605 | u500297289 | python |
p02725 | k, n = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
max = k -A[n-1] + A[0]
for i in range(n-1):
if (A[i + 1] - A[i]) > max:
max = (A[i + 1] - A[i])
print(max) | k, n = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
max = k -A[n-1] + A[0]
for i in range(n-1):
if (A[i + 1] - A[i]) > max:
max = (A[i + 1] - A[i])
print(k-max)
| [
"expression.operation.binary.add"
] | 501,606 | 501,607 | u396961814 | python |
p02725 |
k, n = map(int, input().split())
An = list(map(int,input().split()))
max_diff = 0
for i in range(1,n):
if i != 0:
max_diff = max(abs(An[i] - An[i-1]), max_diff)
max_diff = max(max_diff, k-An[n-1] + An[0])
print(max_diff) |
k, n = map(int, input().split())
An = list(map(int,input().split()))
max_diff = 0
for i in range(1,n):
if i != 0:
max_diff = max(abs(An[i] - An[i-1]), max_diff)
max_diff = max(max_diff, k-An[n-1] + An[0])
print(k-max_diff) | [
"expression.operation.binary.add"
] | 501,616 | 501,617 | u837286475 | python |
p02725 | 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 = min(m, A[i+1] - A[i])
print(K - m)
| 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])
print(K - m)
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 501,630 | 501,631 | u779728630 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
m = K - A[N-1] + A[0]
for i in range(N):
m = min(m, A[i+1] - A[i])
print(K - m) | 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])
print(K - m)
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 501,632 | 501,631 | u779728630 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
m = 10 ** 12
for i in range(1,len(a)-1):
r = k - abs(a[i] - a[i-1])
l = k - abs(a[i] - a[i+1])
print(r,l)
if min(r,l) <= m:
m = min(r,l)
r = abs(a[-1] - a[0])
l = k - abs(a[1] - a[0])
if min(r,l) <= m:
m = min(r,l)
r = k... | k, n = map(int, input().split())
a = list(map(int, input().split()))
m = 10 ** 12
for i in range(1,len(a)-1):
r = k - abs(a[i] - a[i-1])
l = k - abs(a[i] - a[i+1])
if min(r,l) <= m:
m = min(r,l)
r = abs(a[-1] - a[0])
l = k - abs(a[1] - a[0])
if min(r,l) <= m:
m = min(r,l)
r = k - abs(a[-1] - ... | [
"call.remove"
] | 501,635 | 501,636 | u106342872 | python |
p02725 | def main():
import sys
input=sys.stdin.readline
k,n=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(n-1):
m=max(m,A[i+1]-A[i])
m=max(m,A[0]+k-A[-1])
print(m)
if __name__ == '__main__':
main() | def main():
import sys
input=sys.stdin.readline
k,n=map(int,input().split())
A=list(map(int,input().split()))
m=0
for i in range(n-1):
m=max(m,A[i+1]-A[i])
m=max(m,A[0]+k-A[-1])
print(k-m)
if __name__ == '__main__':
main() | [
"expression.operation.binary.add"
] | 501,649 | 501,650 | u798316285 | python |
p02725 | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [A[i+1] - A[i] for i in range(len(A)-1)]
B.append(K-A[-1] + A[0])
print(B)
print(K - max(B)) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
B = [A[i+1] - A[i] for i in range(len(A)-1)]
B.append(K-A[-1] + A[0])
print(K - max(B)) | [
"call.remove"
] | 501,657 | 501,658 | u613292673 | python |
p02725 | k,n = map(int, input().split())
a = list(map(int, input().split()))
max_l = k-a[-1]+a[0]
for i in range(1,n):
if a[i] - a[i-1] > max_l:
max_l = a[i] - a[i-1]
print(max_l) | k,n = map(int, input().split())
a = list(map(int, input().split()))
max_l = k-a[-1]+a[0]
for i in range(1,n):
if a[i] - a[i-1] > max_l:
max_l = a[i] - a[i-1]
print(k-max_l) | [
"expression.operation.binary.add"
] | 501,663 | 501,664 | u134520518 | python |
p02725 | k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=A[0]-A[-1]+n
for i in range(n-1):
a=A[i+1]-A[i]
if a>ans:
ans=a
print(k-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):
a=A[i+1]-A[i]
if a>ans:
ans=a
print(k-ans)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 501,673 | 501,674 | u968846084 | python |
p02725 | k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=A[0]-A[-1]+n
for i in range(n-1):
a=A[i+1]-A[i]
if a>ans:
ans=a
print(k-a) | k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=A[0]-A[-1]+k
for i in range(n-1):
a=A[i+1]-A[i]
if a>ans:
ans=a
print(k-ans)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 501,675 | 501,674 | u968846084 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
ans=[]
for i in range(n-1):
ans.append(a[i+1]-a[i])
ans.append(k-a[-1])
ans.sort()
print(sum(ans[:-1])) |
k,n=map(int,input().split())
a=list(map(int,input().split()))
ans=[]
for i in range(n-1):
ans.append(a[i+1]-a[i])
ans.append(k-a[-1]+a[0])
#print(ans)
ans.sort()
print(sum(ans[:-1])) | [
"expression.operation.binary.add"
] | 501,684 | 501,685 | u664373116 | python |
p02725 | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
import numpy as np
d = np.diff(a)
d = np.append(d, k - a[-1] + a[0])
print(k - np.sum(np.sort(d)[:-1])) | k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
import numpy as np
d = np.diff(a)
d = np.append(d, k - a[-1] + a[0])
print(np.sum(np.sort(d)[:-1])) | [
"expression.operation.binary.remove"
] | 501,704 | 501,705 | u242196904 | python |
p02725 | def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = list(map(int, input().split()))
#a = [list(input().split()) for i in range(n)]
#a = [... | def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = list(map(int, input().split()))
#a = [list(input().split()) for i in range(n)]
#a = [... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 501,706 | 501,707 | u414458988 | python |
p02725 | hoge = input().split()
K = int(hoge[0])
N = int(hoge[1])
A_list = list(map(int,input().split()))
kankaku = []
for i in range(len(A_list) - 1):
kankaku.append(A_list[i+1] - A_list[i])
kankaku.append(A_list[0] - A_list[-1] + K)
print(kankaku)
_kankaku_max = max(kankaku)
print(K - _kankaku_max) | hoge = input().split()
K = int(hoge[0])
N = int(hoge[1])
A_list = list(map(int,input().split()))
kankaku = []
for i in range(len(A_list) - 1):
kankaku.append(A_list[i+1] - A_list[i])
kankaku.append(A_list[0] - A_list[-1] + K)
_kankaku_max = max(kankaku)
print(K - _kankaku_max) | [
"call.remove"
] | 501,725 | 501,726 | u408262366 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
dis=[k-a[n-1]+a[0]]
for i in range(n-1):
dis.append(a[i+1]-a[i])
dis.sort()
print(dis[n-1]) | k,n=map(int,input().split())
a=list(map(int,input().split()))
dis=[k-a[n-1]+a[0]]
for i in range(n-1):
dis.append(a[i+1]-a[i])
dis.sort()
print(k-dis[n-1]) | [
"expression.operation.binary.add"
] | 501,747 | 501,748 | u905974390 | python |
p02725 | k, n = map(int, input().split())
a = [int(i) for i in input().split(" ")]
d = [a[-1]-a[0]] + [20-(a[i]-a[i-1]) for i in range(1, n)]
print(min(d))
| k, n = map(int, input().split())
a = [int(i) for i in input().split(" ")]
d = [a[-1]-a[0]] + [k-(a[i]-a[i-1]) for i in range(1, n)]
print(min(d)) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 501,775 | 501,776 | u486065927 | python |
p02725 | import numpy as np
k, n = map(int, input().split())
a_list = [int(i) for i in input().split()]
a_list += [a_list[0]+k]
a_list = np.array(a_list)
dif = a_list[1:] - a_list[:-1]
dif_max = np.max(dif)
print(dif_max) | import numpy as np
k, n = map(int, input().split())
a_list = [int(i) for i in input().split()]
a_list += [a_list[0]+k]
a_list = np.array(a_list)
dif = a_list[1:] - a_list[:-1]
dif_max = np.max(dif)
print(k-dif_max) | [
"expression.operation.binary.add"
] | 501,785 | 501,786 | u608053762 | python |
p02725 | def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for... | def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 501,799 | 501,800 | u053856575 | python |
p02726 | N, X, Y= map(int, input().split())
K = [0]*(N-1)
for i in range(1,N):
for j in range(i+1, N+1):
idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])
K[idx] +=1
for value in K:
print(value) | N, X, Y= map(int, input().split())
K = [0]*(N-1)
for i in range(1,N):
for j in range(i+1, N+1):
idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])-1
K[idx] +=1
for value in K:
print(value) | [
"assignment.change"
] | 501,815 | 501,816 | u266014018 | python |
p02726 | N, X, Y= map(int, input().split())
K = [0]*N
for i in range(1,N):
for j in range(i+1, N+1):
idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])
K[idx] +=1
for value in K:
print(value) | N, X, Y= map(int, input().split())
K = [0]*(N-1)
for i in range(1,N):
for j in range(i+1, N+1):
idx = min([j-i, abs(X-i)+ abs(j-Y)+1, abs(Y-i) + 1 + abs(X-j)])-1
K[idx] +=1
for value in K:
print(value) | [
"assignment.change"
] | 501,817 | 501,816 | u266014018 | python |
p02726 | N, X, Y = map(int, input().split())
ans = [0]*(N-1)
def cal_dis(i, j):
return min(j-i, abs(i-X)+abs(j-Y)+1)
for i in range(1, N+1):
for j in range(i+1, N+1):
k = cal_dis(i, j)
ans[k] += 1
print('\n'.join(map(str, ans)))
| N, X, Y = map(int, input().split())
ans = [0]*(N-1)
def cal_dis(i, j):
return min(j-i, abs(i-X)+abs(j-Y)+1)
for i in range(1, N+1):
for j in range(i+1, N+1):
k = cal_dis(i, j)
ans[k-1] += 1
print('\n'.join(map(str, ans)))
| [
"expression.operation.binary.add"
] | 501,828 | 501,829 | u874320250 | python |
p02726 | N, X, Y = map(int, input().split())
t = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
t[min(j - i, abs(X - i) + 1 + abs(Y - j)) - 1] += 1
#print('\n'.join(map(str, t)))
print(*result, sep='\n')
| N, X, Y = map(int, input().split())
result = [0] * (N - 1)
for i in range(1, N):
for j in range(i + 1, N + 1):
result[min(j - i, abs(X - i) + 1 + abs(Y - j)) - 1] += 1
print(*result, sep='\n')
| [
"assignment.variable.change",
"identifier.change"
] | 501,836 | 501,837 | u347640436 | python |
p02726 | N, X, Y = map(int, input().split())
K = [0]*N
for i in range(1,N+1):
for j in range(i+1,N+1):
K[min(min(abs(X-i)+1,abs(Y-i))+abs(j-Y),abs(i-j))-1]+=1
for i in range(N):
print(K[i]) | N, X, Y = map(int, input().split())
K = [0]*(N-1)
for i in range(1,N+1):
for j in range(i+1,N+1):
K[min(min(abs(X-i)+1,abs(Y-i))+abs(j-Y),abs(i-j))-1]+=1
for i in range(N-1):
print(K[i]) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 501,866 | 501,867 | u465900169 | python |
p02726 | #!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
n, x, y = [int(x) for x in input().split()]
ans = [0 for k in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
ans[min(abs(i - j), abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j))] += 1
print(*(ans), sep='\n... | #!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
n, x, y = [int(x) for x in input().split()]
ans = [0 for k in range(n)]
for i in range(1, n + 1):
for j in range(i + 1, n + 1):
ans[min(abs(i - j), abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j))] += 1
print(*(ans[1:]), sep... | [] | 501,868 | 501,869 | u957513998 | python |
p02726 | import networkx as nx
n, x, y = map(int, input().split())
ans = [0] * (n - 1)
x -= 1
y -= 1
for i in range(n):
for j in range(n):
c = min(abs(i - j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
if c:
ans[c-1] += 1
for ai in ans:
print(ai//2)
| n, x, y = map(int, input().split())
ans = [0] * (n - 1)
x -= 1
y -= 1
for i in range(n):
for j in range(n):
c = min(abs(i - j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
if c:
ans[c-1] += 1
for ai in ans:
print(ai//2)
| [] | 501,881 | 501,882 | u867826040 | python |
p02726 | n, x, y = map(int, input().split())
ans = {}
for i in range(n-1):
ans[i+1] = 0
for i in range(n):
for j in range(i+1,n):
if i <= x-i:
if j <= x-1:
t=j-i
ans[t] += 1
elif j <= y-1:
t = min(j-i, (x-1)-i + 1 + (y-1) -j)
ans[t] += 1
else: #j > y-1
t = (x-1)-i... | n, x, y = map(int, input().split())
ans = {}
for i in range(n-1):
ans[i+1] = 0
for i in range(n):
for j in range(i+1,n):
if i <= x-1:
if j <= x-1:
t=j-i
ans[t] += 1
elif j <= y-1:
t = min(j-i, (x-1)-i + 1 + (y-1) -j)
ans[t] += 1
else: #j > y-1
t = (x-1)-i... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 501,890 | 501,891 | u197457087 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.