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()))
a.append(a[-1]+k)
l=0
for i in range(n):
l=max(l,a[i+1]-a[i])
s=k-l
print(s) | k,n=map(int,input().split())
a=list(map(int,input().split()))
a.append(a[0]+k)
l=0
for i in range(n):
l=max(l,a[i+1]-a[i])
s=k-l
print(s) | [
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.unary.remove"
] | 499,744 | 499,745 | u768256617 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
m = []
for i in range(n):
m.append(m, a[i+1] - a[i])
print(k - max(m)) | k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
m = []
for i in range(n):
m.append(a[i+1] - a[i])
print(k - max(m)) | [
"call.arguments.change"
] | 499,752 | 499,753 | u167647458 | python |
p02725 | k,n=map(int,input().split())
houses=list(map(int,input().split()))
houses.sort()
maxx=-float('INF')
for i in range(n-1):
if houses[i+1]-houses[i]>maxx:
maxx=houses[i+1]-houses[i]
maxx=max([maxx,k-(houses[-1]-houses[0])])
print(maxx)
| k,n=map(int,input().split())
houses=list(map(int,input().split()))
houses.sort()
maxx=-float('INF')
for i in range(n-1):
if houses[i+1]-houses[i]>maxx:
maxx=houses[i+1]-houses[i]
maxx=max([maxx,k-(houses[-1]-houses[0])])
print(k-maxx)
| [
"expression.operation.binary.add"
] | 499,754 | 499,755 | u373858851 | python |
p02725 | # import sys
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import copy
# import bisect
# import numpy as np
# from scipy.special import comb
# def my_input(): return sys.stdin.readline().rstrip()
# sys.setrecursionlimit(100000)
# INF = 100100100... | # import sys
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import copy
# import bisect
# import numpy as np
# from scipy.special import comb
# def my_input(): return sys.stdin.readline().rstrip()
# sys.setrecursionlimit(100000)
# INF = 100100100... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 499,766 | 499,767 | u163783894 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
dist=[A[0]+K-A[-1]]+[A[i]-A[i-1] for i in range(1,N)]
print(k-max(dist)) | K,N=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
dist=[A[0]+K-A[-1]]+[A[i]-A[i-1] for i in range(1,N)]
print(K-max(dist)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 499,774 | 499,775 | u093861603 | python |
p02725 | K,N=map(int,input().split())
A=list(map(int,input().split()))
for i in range(1,N):
dis=0
tmp=A[i]-A[i-1]
dis=max(dis,tmp)
tmp=K+A[0]-A[N-1]
dis=max(dis,tmp)
print(K-dis) | K,N=map(int,input().split())
A=list(map(int,input().split()))
dis=0
for i in range(1,N):
tmp=A[i]-A[i-1]
dis=max(dis,tmp)
tmp=K+A[0]-A[N-1]
dis=max(dis,tmp)
print(K-dis) | [
"assignment.add",
"assignment.remove"
] | 499,780 | 499,781 | u524534026 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
longest = 0
for i in range(N):
longest = max(longest, A[i + 1] - A[i])
longest = max(longest, A[0] + K - A[-1])
print(K - longest) | K, N = map(int, input().split())
A = list(map(int, input().split()))
longest = 0
for i in range(N - 1):
longest = max(longest, A[i + 1] - A[i])
longest = max(longest, A[0] + K - A[-1])
print(K - longest) | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 499,784 | 499,785 | u536034761 | python |
p02725 | def main():
k, n = map(int, input().split())
As = list(map(int, input().split()))
diffs = [0]*n
for i in range(n):
if i == n-1:
diffs[i] = k - As[i]
else:
diffs[i] = As[i+1] - As[i]
diffs.remove(max(diffs))
ans = sum(diffs)
print(ans)
if __name__ ==... | def main():
k, n = map(int, input().split())
As = list(map(int, input().split()))
diffs = [0]*n
for i in range(n):
if i == n-1:
diffs[i] = k+As[0] - As[i]
else:
diffs[i] = As[i+1] - As[i]
diffs.remove(max(diffs))
ans = sum(diffs)
print(ans)
if __nam... | [
"assignment.change"
] | 499,786 | 499,787 | u044964932 | python |
p02725 | k,n = map(int, input().split())
a = list(map(int, input().split()))
l = [0]*n
l[-1] = k-a[-1]
for i in range(n-1):
l[i] = a[i+1] - a[i]
print(sum(sorted(l)[:-1])) | k,n = map(int, input().split())
a = list(map(int, input().split()))
l = [0]*n
l[-1] = k+a[0] - a[-1]
for i in range(n-1):
l[i] = a[i+1]-a[i]
print(sum(sorted(l)[:-1])) | [
"assignment.change"
] | 499,799 | 499,800 | u188827677 | python |
p02725 | k,n = map(int, input().split())
a = list(map(int, input().split()))
l = [0]*n
l[-1] = k-a[-1]
for i in range(n-1):
l[i] = a[i+1] - a[i]
print(sum(sorted(l)[:-1])) | k,n = map(int, input().split())
a = list(map(int, input().split()))
l = [0]*n
l[-1] = k+a[0]-a[-1]
for i in range(n-1):
l[i] = a[i+1] - a[i]
print(sum(sorted(l)[:-1])) | [
"assignment.change"
] | 499,799 | 499,801 | u188827677 | python |
p02725 | #C
k, n = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = []
for i in range(len(a)):
if i == 0:
b.append(k - a[len(a)] + a[0])
else:
b.append(a[i] - a[i - 1])
print(k - max(b)) | #C
k, n = [int(_) for _ in input().split()]
a = [int(_) for _ in input().split()]
b = []
for i in range(len(a)):
if i == 0:
b.append(k - a[len(a) - 1] + a[0])
else:
b.append(a[i] - a[i - 1])
print(k - max(b)) | [
"expression.operation.binary.add"
] | 499,802 | 499,803 | u019075898 | python |
p02725 | #!/usr/bin/env python
def input():
return sys.stdin.readline()[:-1]
def main():
K, N = map(int, input().split())
A = tuple(map(int, input().split()))
tmp = 0
for i in range(N-1):
tmp = max(tmp, A[i+1] - A[i])
tmp = max(tmp, (K-A[N-1]+A[0]))
print(K-tmp)
if __name__ == '__main__':
... | #!/usr/bin/env python
import sys
def input():
return sys.stdin.readline()[:-1]
def main():
K, N = map(int, input().split())
A = tuple(map(int, input().split()))
tmp = 0
for i in range(N-1):
tmp = max(tmp, A[i+1] - A[i])
tmp = max(tmp, (K-A[N-1]+A[0]))
print(K-tmp)
if __name__ == '... | [] | 499,804 | 499,805 | u580920947 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
m = 0
for i in range(1, len(A)):
if A[i]-A[i-1]>m:
m=A[i]-A[i-1]
if K-A[-1]+A[1]>m:
print(A[-1]-A[1])
else:
print(K-m)
| K, N = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
m = 0
for i in range(1, len(A)):
if A[i]-A[i-1]>m:
m=A[i]-A[i-1]
if K-A[-1]+A[0]>m:
print(A[-1]-A[0])
else:
print(K-m)
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 499,808 | 499,809 | u531599639 | python |
p02725 | k,n = list(map(int, input().split()))
a_vector = list(map(int, input().split()))
tonari_dif = 0
for i in range(1,n):
tonari_dif = max(tonari_dif, a_vector[i] - a_vector[i-1])
true_tonari_dif = max(tonari_dif, a_vector[0]+(200-a_vector[-1]))
print(k-true_tonari_dif)
| k,n = list(map(int, input().split()))
a_vector = list(map(int, input().split()))
tonari_dif = 0
for i in range(1,n):
tonari_dif = max(tonari_dif, a_vector[i] - a_vector[i-1])
# print(tonari_dif)
true_tonari_dif = max(tonari_dif, a_vector[0]+(k-a_vector[-1]))
print(k-true_tonari_dif)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 499,810 | 499,811 | u655663334 | python |
p02725 | # Traveling Salesman around Lake https://atcoder.jp/contests/abc160/tasks/abc160_c
N,K= map(int, input().split())
Travel_List=list(map(int,input().split()))
for i in range(K):
Travel_List.append(Travel_List[i]+N)
Answer =0
for i in range(K):
print(i)
Temp = Travel_List[i+K-1]-Travel_List[i]
if (i==0)... | # Traveling Salesman around Lake https://atcoder.jp/contests/abc160/tasks/abc160_c
N,K= map(int, input().split())
Travel_List=list(map(int,input().split()))
for i in range(K):
Travel_List.append(Travel_List[i]+N)
Answer =0
for i in range(K):
Temp = Travel_List[i+K-1]-Travel_List[i]
if (i==0) or (Temp<Ans... | [
"call.remove"
] | 499,816 | 499,817 | u773686010 | python |
p02725 | K, N = map(int, input().split())
L = list(map(int, input().split()))
sa = [L[i+1]-L[i] for i in range(N-1)]
sa += K-L[N-1]+L[0]
ans = K-max(sa)
print(ans) | K, N = list(map(int, input().split()))
L = list(map(int, input().split()))
sa = [L[i+1]-L[i] for i in range(N-1)]
sa += [K-L[N-1]+L[0]]
ans = K-max(sa)
print(ans)
| [
"call.add",
"call.arguments.change"
] | 499,824 | 499,825 | u991134049 | python |
p02725 | k,n=map(int,input().split())
hoge=list(map(int,input().split()))
ans=hoge[0]+k-hoge[-1]
for i in range(n-1):
ans=max(ans,hoge[i+1]-hoge[i])
print(ans) | k,n=map(int,input().split())
hoge=list(map(int,input().split()))
ans=hoge[0]+k-hoge[-1]
for i in range(n-1):
ans=max(ans,hoge[i+1]-hoge[i])
print(k-ans) | [
"expression.operation.binary.add"
] | 499,830 | 499,831 | u777028980 | python |
p02725 | k, n = map(int, input().split())
A = input().split()
a = [int(i) for i in A]
kyori = k + a[0] - a[n-1]
for i in range(n):
if kyori < a[i] - a[i-1]:
kyori = a[i] - a[i-1]
print(kyori) | k, n = map(int, input().split())
A = input().split()
a = [int(i) for i in A]
kyori = k + a[0] - a[n-1]
for i in range(n):
if kyori < a[i] - a[i-1]:
kyori = a[i] - a[i-1]
print(k-kyori) | [
"expression.operation.binary.add"
] | 499,836 | 499,837 | u973549339 | python |
p02725 | k, n = map(int, input().split())
array = list(map(int,input().split()))
max_length = 0
sum_length = 0
for i in range(n - 1):
length = array[i + 1] - array[i]
sum_length += length
if length > max_length:
max_length = length
last_length = k - array[n - 1]
sum_length += last_length
max_length = max(max_length, l... | k, n = map(int, input().split())
array = list(map(int,input().split()))
max_length = 0
sum_length = 0
for i in range(n - 1):
length = array[i + 1] - array[i]
sum_length += length
if length > max_length:
max_length = length
last_length = k - array[n - 1] + array[0]
sum_length += last_length
max_length = max(ma... | [
"assignment.change"
] | 499,838 | 499,839 | u268674745 | python |
p02725 | X = input().split()
K = int(X[0])
N = int(X[1])
Y = input().split()
Z = []
for i in range(N):
Z.append(int(Y[i]))
result = Z[0]+ K - Z[N-1]
for i in range(N):
if result < Z[i] - Z[i-1]:
result = Z[i] - Z[i -1]
i = i + 1
print(result)
| X = input().split()
K = int(X[0])
N = int(X[1])
Y = input().split()
Z = []
for i in range(N):
Z.append(int(Y[i]))
result = Z[0]+ K - Z[N-1]
for i in range(N):
if result < Z[i] - Z[i-1]:
result = Z[i] - Z[i -1]
i = i + 1
print(K - result)
| [
"expression.operation.binary.add"
] | 499,840 | 499,841 | u163894803 | python |
p02725 | K, N = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
A.extend([K])
diff = []
for i in range(N):
diff.append(A[i+1] - A[i])
sum_d = sum(sorted(diff)[:N-1])
print(sum_d) | K, N = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
A.extend([K+A[0]])
diff = []
for i in range(N):
diff.append(A[i+1] - A[i])
sum_d = sum(sorted(diff)[:N-1])
print(sum_d) | [
"expression.operation.binary.add"
] | 499,847 | 499,848 | u616468898 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-sum(a))
ans = k-max(a)
print(ans) | #!/usr/bin/env python3
k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"assignment.add"
] | 499,849 | 499,850 | u111392182 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-sum(a))
ans = max(a)
print(ans) | #!/usr/bin/env python3
k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"assignment.add",
"assignment.change"
] | 499,851 | 499,850 | u111392182 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-max(a))
ans = max(a)
print(ans) | #!/usr/bin/env python3
k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"call.arguments.add",
"call.arguments.change"
] | 499,852 | 499,850 | u111392182 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-sum(a))
ans = k-max(a)
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"assignment.add"
] | 499,849 | 499,853 | u111392182 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-sum(a))
ans = max(a)
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"assignment.add",
"assignment.change"
] | 499,851 | 499,853 | u111392182 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]-a[n-1]
a.append(k-max(a))
ans = max(a)
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = 0
a.reverse()
for i in range(n-1):
a[i]-=a[i+1]
a[n-1] = 0
a.append(k-sum(a))
ans = k-max(a)
print(ans) | [
"call.arguments.add",
"call.arguments.change"
] | 499,852 | 499,853 | u111392182 | python |
p02725 | 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(max_gap)
print(K-max_gap) | 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) | [
"call.remove"
] | 499,854 | 499,855 | u444722572 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
distance = []
for i in range(len(a) - 1):
distance.append(a[i + 1] - a[i])
distance.append(k - a[n - 1] + a[0])
print(max(distance))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
distance = []
for i in range(len(a) - 1):
distance.append(a[i + 1] - a[i])
distance.append(k - a[n - 1] + a[0])
print(k - max(distance))
| [
"expression.operation.binary.add"
] | 499,865 | 499,866 | u308237681 | python |
p02725 | K,N=map(int,input().split())
A=[int(x) for x in input().split()]
m=[]
if N==2:
if A[1]-A[0]<=K/2:
ans=A[1]-A[0]
else:
ans=K+A[0]-A[1]
else:
for i in range(N-2):
m.append(A[i+1]-A[i])
m.append(K+A[0]-A[N-1])
ans=K-max(m)
print(ans) | K,N=map(int,input().split())
A=[int(x) for x in input().split()]
m=[]
if N==2:
if A[1]-A[0]<=K/2:
ans=A[1]-A[0]
else:
ans=K+A[0]-A[1]
else:
for i in range(N-1):
m.append(A[i+1]-A[i])
m.append(K+A[0]-A[N-1])
ans=K-max(m)
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 499,869 | 499,870 | u640922335 | python |
p02725 | n,k=map(int,input().split())
max=0
l=list(map(int,input().split()))
for i in range(k-1):
s=l[i+1]-l[i]
if s>max:
max=s
s=n-l[-1]+l[0]
if s>max:
max=s
print(max) | n,k=map(int,input().split())
max=0
l=list(map(int,input().split()))
for i in range(k-1):
s=l[i+1]-l[i]
if s>max:
max=s
s=n-l[-1]+l[0]
if s>max:
max=s
print(n-max) | [
"expression.operation.binary.add"
] | 499,871 | 499,872 | u275392848 | python |
p02725 | inputs = [int(i) for i in input().split()]
K,N = inputs[0],inputs[1]
input_lines = [int(i) for i in input().split()]
max_range = input_lines[0]+(K-input_lines[-1])
for i in range(N):
if i!=N-1:
torange = input_lines[i+1]-input_lines[i]
if torange>max_range:
max_range = torange
print(ma... | inputs = [int(i) for i in input().split()]
K,N = inputs[0],inputs[1]
input_lines = [int(i) for i in input().split()]
max_range = input_lines[0]+(K-input_lines[-1])
for i in range(N):
if i!=N-1:
torange = input_lines[i+1]-input_lines[i]
if torange>max_range:
max_range = torange
print(K-... | [
"expression.operation.binary.add"
] | 499,873 | 499,874 | u535171899 | python |
p02725 | p, n = map(int, input().split())
l = list(map(int, input().split()))
m = p - l[-1] + l[0]
for i in range(1, n):
m = max(m, l[i] - l[i - 1])
print(m)
| p, n = map(int, input().split())
l = list(map(int, input().split()))
m = p - l[-1] + l[0]
for i in range(1, n):
m = max(m, l[i] - l[i - 1])
print(p-m)
| [
"expression.operation.binary.add"
] | 499,885 | 499,886 | u412760429 | python |
p02725 | p, n = map(int, input().split())
l = list(map(int, input().split()))
m = max(p - l[-1], l[0])
for i in range(1, n):
m = max(m, l[i] - l[i - 1])
print(m)
| p, n = map(int, input().split())
l = list(map(int, input().split()))
m = p - l[-1] + l[0]
for i in range(1, n):
m = max(m, l[i] - l[i - 1])
print(p-m)
| [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 499,887 | 499,886 | u412760429 | python |
p02725 | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
a.append(k)
max_value = -1
ans = 0
for i in range(1, n+1):
tmp_d = a[i] - a[i-1]
ans += tmp_d
max_value = max(max_value, tmp_d)
ans -= max_value
print(ans) | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
a.append(k+a[0])
max_value = -1
ans = 0
for i in range(1, n+1):
tmp_d = a[i] - a[i-1]
ans += tmp_d
max_value = max(max_value, tmp_d)
ans -= max_value
print(ans) | [
"expression.operation.binary.add"
] | 499,892 | 499,893 | u864551836 | python |
p02725 | K, N =map(int,input().split())
A_n =list(map(int,input().split()))
A_n.sort()
maxd =A_n[N-1]- A_n[0]
for i in range(N-1):
maxd =max(maxd,A_n[i+1]-A_n[i])
print(K-maxd) | K, N =map(int,input().split())
A_n =list(map(int,input().split()))
A_n.sort()
maxd =K -A_n[N-1]+ A_n[0]
for i in range(N-1):
maxd =max(maxd,A_n[i+1]-A_n[i])
print(K-maxd) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 499,896 | 499,897 | u113631524 | python |
p02725 | k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=-1
for i in range(n-1):
ans=max(ans,A[i+1]-A[i])
print(sum(A)- max(ans,k-(A[n-1]-A[0])))
| k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=-1
for i in range(n-1):
ans=max(ans,A[i+1]-A[i])
print(k- max(ans,k-(A[n-1]-A[0])))
| [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 499,915 | 499,916 | u023229441 | python |
p02725 | k,n=map(int,input().split())
A-list(map(int,input().split()))
ans=-1
for i in range(n-1):
ans=max(ans,A[i+1]-A[i])
print(sum(A)- max(ans,k-(A[n-1]-A[0]))) | k,n=map(int,input().split())
A=list(map(int,input().split()))
ans=-1
for i in range(n-1):
ans=max(ans,A[i+1]-A[i])
print(k- max(ans,k-(A[n-1]-A[0])))
| [
"expression.operation.binary.change",
"call.arguments.change",
"io.output.change"
] | 499,917 | 499,916 | u023229441 | python |
p02725 | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
diffs = list()
max_diff = 0
for i in range(n):
diff = 0
if i == n-1:
diff = k + a[0] - a[i]
else:
diff = a[i+1] - a[i]
if max_diff < diff:
max_diff = diff
diffs.append(diff)
sum(diffs) - max_diff | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
diffs = list()
max_diff = 0
for i in range(n):
diff = 0
if i == n-1:
diff = k + a[0] - a[i]
else:
diff = a[i+1] - a[i]
if max_diff < diff:
max_diff = diff
diffs.append(diff)
print(sum(diffs) - max_d... | [
"call.add",
"call.arguments.change"
] | 499,942 | 499,943 | u474484450 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
diff = []
for i, a in enumerate(A[1:]):
diff.append(a-A[i])
diff.append(K-A[N-1]+A[0])
print(max(diff))
| K, N = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
diff = []
for i, a in enumerate(A[1:]):
diff.append(a-A[i])
diff.append(K-A[N-1]+A[0])
print(K-max(diff))
| [
"expression.operation.binary.add"
] | 499,953 | 499,954 | u971096161 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
a_sub = [0] * (n - 1)
for i in range(n):
a_sub[i] = a[i+1] - a[i]
print(k - max(a_sub))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
a_sub = [0] * (n)
for i in range(n):
a_sub[i] = a[i+1] - a[i]
print(k - max(a_sub))
| [
"expression.operation.binary.remove"
] | 499,955 | 499,956 | u665038048 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
a_sub = [0] * (n - 1)
for i in range(n-1):
a_sub[i] = a[i+1] - a[i]
print(k - max(a_sub))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
a.append(a[0] + k)
a_sub = [0] * (n)
for i in range(n):
a_sub[i] = a[i+1] - a[i]
print(k - max(a_sub))
| [
"expression.operation.binary.remove"
] | 499,957 | 499,956 | u665038048 | python |
p02725 | import sys
import numpy as np
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
de... | import sys
import numpy as np
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
de... | [
"assignment.add"
] | 499,958 | 499,959 | u624696727 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = a[n-1] + a[0]
for i in range(n-1):
ans = min(ans, k - a[i+1] + a[i])
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = a[n-1] - a[0]
for i in range(n-1):
ans = min(ans, k - a[i+1] + a[i])
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 499,970 | 499,971 | u934868410 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = k - a[n-1] + a[0]
for i in range(n-1):
ans = min(ans, a[i+1] - a[i])
print(ans) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = a[n-1] - a[0]
for i in range(n-1):
ans = min(ans, k - a[i+1] + a[i])
print(ans) | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 499,972 | 499,971 | u934868410 | python |
p02725 | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = N - A[N - 1] + A[0]
ans = N - max(B)
print(ans)
| K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = K - A[N - 1] + A[0]
ans = K - max(B)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 499,975 | 499,976 | u183256664 | python |
p02725 | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = N - A[N - 1] + a[0]
ans = N - max(B)
print(ans)
| K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = K - A[N - 1] + A[0]
ans = K - max(B)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 499,977 | 499,976 | u183256664 | python |
p02725 | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = N - A[N] + a[0]
ans = N - max(B)
print(ans) | K, N = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A)
B = [0 for i in range(N)]
for i in range(N-1):
B[i] = A[i + 1] - A[i]
B[N - 1] = K - A[N - 1] + A[0]
ans = K - max(B)
print(ans) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 499,978 | 499,976 | u183256664 | python |
p02725 | def main():
k, n = map(int,input().split())
a = list(map(int,input().split()))
mx = 0
cnt = 0
for i in range(1,n):
tmp = a[i] - a[i - 1]
if tmp > mx:
mx = tmp
cnt += tmp
tmp = k - a[-1]
if tmp > mx :
mx = tmp
cnt = cnt + tmp - mx
print(cn... | def main():
k, n = map(int,input().split())
a = list(map(int,input().split()))
mx = 0
cnt = 0
for i in range(1,n):
tmp = a[i] - a[i - 1]
if tmp > mx:
mx = tmp
cnt += tmp
tmp = k - a[-1] + a[0]
if tmp > mx :
mx = tmp
cnt = cnt + tmp - mx
p... | [
"assignment.change"
] | 499,979 | 499,980 | u321035578 | python |
p02725 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, N = na... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
K, N = na... | [
"expression.operation.binary.add"
] | 499,991 | 499,992 | u177411511 | python |
p02725 | k, n = map(int, input().split())
*a, = map(int, input().split())
diffs = [a[i + 1] - a[i] if i < n - 1 else k - a[i] for i in range(n)]
diffs.sort()
print(sum(diffs[:-1])) | k, n = map(int, input().split())
*a, = map(int, input().split())
diffs = [a[i + 1] - a[i] if i < n - 1 else k - a[i] + a[0] for i in range(n)]
diffs.sort()
print(sum(diffs[:-1])) | [
"assignment.change"
] | 500,009 | 500,010 | u228232845 | python |
p02725 | import sys
k,n=map(int,sys.stdin.readline().split())
a=list(map(int,sys.stdin.readline().split()))
max=0
for i in range(n):
if i==0:
pre=a[i]
else:
now=a[i]
if now-pre>max:
max=now-pre
pre=now
if k-pre+a[0]>max:
max=k-pre+a[0]
print(max)
| import sys
k,n=map(int,sys.stdin.readline().split())
a=list(map(int,sys.stdin.readline().split()))
max=0
for i in range(n):
if i==0:
pre=a[i]
else:
now=a[i]
if now-pre>max:
max=now-pre
pre=now
if k-pre+a[0]>max:
max=k-pre+a[0]
print(k-max)
| [
"expression.operation.binary.add"
] | 500,017 | 500,018 | u544212192 | python |
p02725 | K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N]>max:
max=K+houselist[0]-houselist[N]
if max==0:
print(0)
else:
print(K-max)
| K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N-1]>max:
max=K+houselist[0]-houselist[N-1]
if max==0:
print(0)
else:
print(K-max)
| [
"control_flow.branch.if.condition.change"
] | 500,027 | 500,028 | u046158516 | python |
p02725 | K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N-1):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N-1]>max:
max=K+houselist[0]-houselist[N-1]
if max==0:
print(0)
else:
print(K-max)
| K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N-1]>max:
max=K+houselist[0]-houselist[N-1]
if max==0:
print(0)
else:
print(K-max)
| [
"expression.operation.binary.remove"
] | 500,029 | 500,028 | u046158516 | python |
p02725 | K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N-1):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N]>max:
max=K+houselist[0]-houselist[N]
if max==0:
print(0)
else:
print(K-max) | K, N = map(int, input().split())
houselist = list(map(int, input().split()))
max=0
for i in range(1,N):
if houselist[i]-houselist[i-1]>max:
max=houselist[i]-houselist[i-1]
if K+houselist[0]-houselist[N-1]>max:
max=K+houselist[0]-houselist[N-1]
if max==0:
print(0)
else:
print(K-max)
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 500,030 | 500,028 | u046158516 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
b = []
b.append(k - a[n-1] - a[0])
for i in range(n-1):
b.append(a[i + 1] - a[i])
print(k - max(b)) | k, n = map(int, input().split())
a = list(map(int, input().split()))
b = []
b.append(k - a[n-1] + a[0])
for i in range(n-1):
b.append(a[i + 1] - a[i])
print(k - max(b)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,031 | 500,032 | u000040786 | python |
p02725 | KN = list(map(int, input().split()))
dis = list(map(int, input().split()))
lists = []
for i in range(KN[1]-1):
lists.append(dis[i+1]-dis[i])
lists.append(KN[0]+dis[0]-dis[KN[1]-1])
print(lists)
print(KN[0]-max(lists)) | KN = list(map(int, input().split()))
dis = list(map(int, input().split()))
lists = []
for i in range(KN[1]-1):
lists.append(dis[i+1]-dis[i])
lists.append(KN[0]+dis[0]-dis[KN[1]-1])
print(KN[0]-max(lists)) | [
"call.remove"
] | 500,037 | 500,038 | u275577311 | python |
p02725 | #!/usr/bin/env python3
# coding: utf-8
# import sys
# import pprint
# import numpy as np
# import code
import functools
if __debug__:
debug = lambda *x: None
else:
import logging
logger = logging.getLogger()
logger.setLevel(logging.DEBUG)
ch = logging.StreamHandler()
ch.setLevel(logging.DEBUG)
... | #!/usr/bin/env python3
# coding: utf-8
# import sys
# import pprint
# import numpy as np
# import code
import functools
if __debug__:
debug = lambda *x: None
else:
import logging
logger = logging.getLogger()
logger.setLevel(logging.DEBUG)
ch = logging.StreamHandler()
ch.setLevel(logging.DEBUG)
... | [
"identifier.change",
"call.function.change"
] | 500,039 | 500,040 | u391540332 | python |
p02725 | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
t = 0
id = 0
l = 0
for i in range(n):
if i < n - 1:
d = abs(a[i] - a[i + 1])
else:
d = k - a[n - 1] + a[0]
if t < d:
t = d
id = i + 1 if i < n - 1 else 0
for i in range(n - 1):
l += abs(a[(i + id) ... | k, n = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
t = 0
id = 0
l = 0
for i in range(n):
if i < n - 1:
d = abs(a[i] - a[i + 1])
else:
d = k - a[n - 1] + a[0]
if t < d:
t = d
id = i + 1 if i < n - 1 else 0
for i in range(n - 1):
l += abs(a[(i + id) ... | [
"expression.operation.binary.change"
] | 500,054 | 500,055 | u319311571 | python |
p02725 |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
righ... |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
right... | [
"assignment.remove"
] | 500,070 | 500,071 | u874000404 | python |
p02725 |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
right... |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
right... | [
"assignment.remove"
] | 500,072 | 500,071 | u874000404 | python |
p02725 |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
righ... |
def quick_sort(arr):
left = []
right = []
if len(arr) <= 1:
return arr
# データの状態に左右されないためにrandom.choice()を用いることもある。
# ref = random.choice(arr)
ref = arr[0]
ref_count = 0
for ele in arr:
if ele < ref:
left.append(ele)
elif ele > ref:
right... | [
"expression.operation.binary.add"
] | 500,073 | 500,071 | u874000404 | python |
p02725 | n,k, = list(map(int,input().split()))
arr = list(map(int,input().split()))
max_d = k-arr[-1] + arr[0]
for i in range(n):
max_d = max(max_d,arr[i+1]-arr[i])
print(k-max_d)
| k,n = list(map(int,input().split()))
arr = list(map(int,input().split()))
max_d = k-arr[-1] + arr[0]
for i in range(n-1):
max_d = max(max_d,arr[i+1]-arr[i])
print(k-max_d)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 500,076 | 500,077 | u598888192 | python |
p02725 | n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
max_d = k-arr[-1] + arr[0]
for i in range(n):
max_d = max(max_d,arr[i+1]-arr[i])
print(k-max_d) | k,n = list(map(int,input().split()))
arr = list(map(int,input().split()))
max_d = k-arr[-1] + arr[0]
for i in range(n-1):
max_d = max(max_d,arr[i+1]-arr[i])
print(k-max_d)
| [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 500,078 | 500,077 | u598888192 | python |
p02725 | a,b = map(int,input().split())
aaa = [int(i) for i in input().split()]
aaa.append(aaa[0] + a)
result = [c1 - c0 for c0,c1 in zip(aaa,aaa[0:])]
print(a - max(result)) | a,b = map(int,input().split())
aaa = [int(i) for i in input().split()]
aaa.append(aaa[0] + a)
result = [c1 - c0 for c0,c1 in zip(aaa,aaa[1:])]
print(a - max(result)) | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 500,089 | 500,090 | u834983620 | python |
p02725 | k,n=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
ans=max(ans,a[i+1]-a[i])
ans=max(ans,k-a[-1])
print(k-ans) | k,n=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
ans=max(ans,a[i+1]-a[i])
ans=max(ans,a[0]+k-a[-1])
print(k-ans) | [
"assignment.change"
] | 500,093 | 500,094 | u618107373 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
new = []
for i in range(N-1):
new.append(A[i+1]-A[i])
new.append(K + A[0] - A[-1])
new.sort()
print(sum(new[:y-1])) | K, N = map(int, input().split())
A = list(map(int, input().split()))
new = []
for i in range(N-1):
new.append(A[i+1]-A[i])
new.append(K + A[0] - A[-1])
new.sort()
print(sum(new[:-1])) | [
"call.arguments.change"
] | 500,097 | 500,098 | u763383823 | python |
p02725 | import numpy as np
K, N = map(int, input().split())
A = list(map(int, input().split()))
new = []
for i in range(N-1):
new.append(A[i+1]-A[i])
new.append(K + A[0] - A[-1])
new.sort()
print(sum(new[:y-1])) | K, N = map(int, input().split())
A = list(map(int, input().split()))
new = []
for i in range(N-1):
new.append(A[i+1]-A[i])
new.append(K + A[0] - A[-1])
new.sort()
print(sum(new[:-1])) | [
"call.arguments.change"
] | 500,099 | 500,098 | u763383823 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
d = a[0]+20-a[n-1]
for i in range(n-1):
t = a[i+1] - a[i]
d = max(t, d)
print(k-d)
| k, n = map(int, input().split())
a = list(map(int, input().split()))
d = a[0]+k-a[n-1]
for i in range(n-1):
t = a[i+1] - a[i]
d = max(t, d)
print(k-d)
| [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 500,105 | 500,106 | u441599836 | python |
p02725 | import sys
read = sys.stdin.buffer.read
K, N, *A = map(int, read.split())
max_distance = K + (A[0] - A[-1])
for i in range(1, N):
max_distance = max(max_distance, A[i] - A[i - 1])
print(K - max_distance) | import sys
read = sys.stdin.buffer.read
K, N, *A = map(int, read().split())
max_distance = K + (A[0] - A[-1])
for i in range(1, N):
max_distance = max(max_distance, A[i] - A[i - 1])
print(K - max_distance) | [
"call.add"
] | 500,107 | 500,108 | u892882715 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, intput().split()))
max_distance = K + (A[0] - A[-1])
for i in range(1, N):
max_distance = max(max_distance, A[i] - A[i - 1])
print(K - max_distance) | K, N = map(int, input().split())
A = list(map(int, input().split()))
max_distance = K + (A[0] - A[-1])
for i in range(1, N):
max_distance = max(max_distance, A[i] - A[i - 1])
print(K - max_distance) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 500,109 | 500,110 | u892882715 | python |
p02725 | # coding: utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
max = 0
for i in range(n-1):
l = a[i+1] - a[i]
if l > max:
max = l
l = a[0] - a[n-1] + 20
if l > max:
max = l
print(k - max) | # coding: utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
max = 0
for i in range(n-1):
l = a[i+1] - a[i]
if l > max:
max = l
l = a[0] - a[n-1] + k
if l > max:
max = l
print(k - max) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 500,113 | 500,114 | u366836739 | python |
p02725 | # coding: utf-8
import itertools
k, n = map(int, input().split())
a = list(map(int, input().split()))
max = 0
for i in range(n-1):
l = a[i+1] - a[i]
if l > max:
max = l
l = a[0] - a[n-1] + 20
if l > max:
max = l
print(k - max) | # coding: utf-8
k, n = map(int, input().split())
a = list(map(int, input().split()))
max = 0
for i in range(n-1):
l = a[i+1] - a[i]
if l > max:
max = l
l = a[0] - a[n-1] + k
if l > max:
max = l
print(k - max) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 500,115 | 500,114 | u366836739 | python |
p02725 | K,N = map(int,input().split())
A = list(map(int,input().split()))
max_distance = K + (A[0] + A[-1])
for i in range(1,N):
max_distance = max(max_distance, A[i] - A[i-1])
print(K - max_distance) | K,N = map(int,input().split())
A = list(map(int,input().split()))
max_distance = K + (A[0] - A[-1])
for i in range(1,N):
max_distance = max(max_distance, A[i] - A[i-1])
print(K - max_distance) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 500,116 | 500,117 | u995419623 | python |
p02725 | k, n = map(int,input().split())
a = list(map(int,input().split()))
end = a[0] + k - a[n-1]
b = []
b.append(end)
for i in range(0,n-1):
diff = a[i+1] - a[i]
b.append(diff)
b.sort(reverse=True)
print(k-max) | k, n = map(int,input().split())
a = list(map(int,input().split()))
end = a[0] + k - a[n-1]
b = []
b.append(end)
for i in range(0,n-1):
diff = a[i+1] - a[i]
b.append(diff)
b.sort(reverse=True)
max = b[0]
print(k-max) | [
"assignment.add"
] | 500,129 | 500,130 | u806779442 | python |
p02725 | K,N = input().split()
K = int(K)
N = int(N)
A = []
for i in input().split():
A.append(int(i))
mergin = []
for i in range(len(A)-1):
mergin.append(A[i+1]-A[i])
mergin.append(A[0]+20-A[-1])
mergin.sort()
print(K-mergin[-1])
| K,N = input().split()
K = int(K)
N = int(N)
A = []
for i in input().split():
A.append(int(i))
mergin = []
for i in range(len(A)-1):
mergin.append(A[i+1]-A[i])
mergin.append(A[0]+K-A[-1])
mergin.sort()
print(K-mergin[-1])
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,139 | 500,140 | u658223739 | python |
p02725 | date0=input().rstrip().split(" ")
date1=input().rstrip().split(" ")
list0=[]
list1=[]
for i in range(int(date0[1])):
list0.append(int(date1[i]))
#print(list0)
list0=sorted(list0)
#print(list0)
for j in range(int(date0[1])-1):
list1.append(list0[j+1]-list0[j])
list1.append(int(date0[0])-list0[int(date0[1])-1])
list1... | date0=input().rstrip().split(" ")
date1=input().rstrip().split(" ")
list0=[]
list1=[]
for i in range(int(date0[1])):
list0.append(int(date1[i]))
list0=sorted(list0)
for j in range(int(date0[1])-1):
list1.append(list0[j+1]-list0[j])
list1.append(int(date0[0])-list0[int(date0[1])-1]+list0[0])
list1=sorted(list1,rever... | [
"expression.operation.binary.add"
] | 500,141 | 500,142 | u654517927 | python |
p02725 | k, n = map(int, input().split())
list_a = list(map(int, input().split()))
x = 0
longest = 0
for a in list_a:
if a - x > longest:
longest = a - x
x = a - x
if longest < list_a[0] + (k - list_a[n-1]):
longest = list_a[0] + (k - list_a[n-1])
print(k-longest) | k, n = map(int, input().split())
list_a = list(map(int, input().split()))
x = 0
longest = 0
for a in list_a:
if a - x > longest:
longest = a - x
x = a
if longest < list_a[0] + (k - list_a[n-1]):
longest = list_a[0] + (k - list_a[n-1])
print(k-longest) | [
"expression.operation.binary.remove"
] | 500,157 | 500,158 | u644568755 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
max_dist = 0
for i in range(N - 1):
if i == N - 1:
dist = A[0] + K - A[i]
else:
dist = A[i+1] - A[i]
if dist > max_dist:
max_dist = 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):
if i == N - 1:
dist = A[0] + K - A[i]
else:
dist = A[i+1] - A[i]
if dist > max_dist:
max_dist = dist
print(K - max_dist) | [
"expression.operation.binary.remove"
] | 500,159 | 500,160 | u766566560 | python |
p02725 | kn = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(kn[0])
dist = []
for i in range(1, kn[1]+1):
dist.append(a[i]-a[i-1])
dist[dist.index(max(dist))] = 0
print(sum(dist)) | kn = list(map(int, input().split()))
a = list(map(int, input().split()))
a.append(kn[0]+a[0])
dist = []
for i in range(1, kn[1]+1):
dist.append(a[i]-a[i-1])
dist[dist.index(max(dist))] = 0
print(sum(dist)) | [
"expression.operation.binary.add"
] | 500,163 | 500,164 | u789199177 | python |
p02725 | K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
print(sa)
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| [
"call.remove"
] | 500,168 | 500,169 | u699696451 | python |
p02725 | K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i + 1 < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 500,170 | 500,169 | u699696451 | python |
p02725 | K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i + 1 < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
print(sa)
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"call.remove"
] | 500,171 | 500,169 | u699696451 | python |
p02725 | K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N-1):
if i + 1 < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| K, N = map(int,input().split())
A = list(map(int,input().split()))
gap = []
for i in range(N):
if i < N - 1:
sa = A[i+1] - A[i]
else:
sa = A[0] + (K - A[N-1])
gap.append(sa)
i += 1
dist = max(gap)
ans = K - dist
print(ans)
| [
"expression.operation.binary.remove",
"control_flow.loop.for.condition.change"
] | 500,172 | 500,169 | u699696451 | python |
p02725 | def main():
k, n = map(int, input().split())
a = list(map(int, input().split()))
max_d = k - a[-1]
for i in range(n - 1):
max_d = max(max_d, a[i + 1] - a[i])
print(k - max_d)
if __name__ == "__main__":
main()
| def main():
k, n = map(int, input().split())
a = list(map(int, input().split()))
max_d = k - a[-1] + a[0]
for i in range(n - 1):
max_d = max(max_d, a[i + 1] - a[i])
print(k - max_d)
if __name__ == "__main__":
main()
| [
"assignment.change"
] | 500,173 | 500,174 | u084889225 | 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((K - A[N-1]) + A[0])
print(d)
d.remove(max(d))
print(sum(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])
d.remove(max(d))
print(sum(d)) | [
"call.remove"
] | 500,177 | 500,178 | u283782321 | python |
p02725 | K, N = map(int, input().split())
A = list(map(int, input().split()))
res = abs(A[0]-A[N-1])
for i in range(N-1):
res = max(abs(A[i]-A[i+1]), res)
print(K-res) | K, N = map(int, input().split())
A = list(map(int, input().split()))
res = A[0] - A[N-1] + K
for i in range(N-1):
res = max(abs(A[i]-A[i+1]), res)
print(K-res) | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 500,180 | 500,181 | u642012866 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
m = 0
for i in range(n-1):
d = a[i+1] - a[i]
m = max(m, d)
d_last = k - a[n-1]
m = max(m, d_last)
res = k - m
print(res) | k, n = map(int, input().split())
a = list(map(int, input().split()))
m = 0
for i in range(n-1):
d = a[i+1] - a[i]
m = max(m, d)
d_last = k - a[n-1] + a[0]
m = max(m, d_last)
res = k - m
print(res) | [
"assignment.change"
] | 500,198 | 500,199 | u723345499 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
dist = []
kankaku_max = 0
for i in range(n-1):
dist.append(a[i+1]-a[i])
a.append(a[0]+(k-a[-1]))
for i in dist:
kankaku_max = max(kankaku_max,i)
print(k-kankaku_max) | k,n = map(int,input().split())
a = list(map(int,input().split()))
dist = []
kankaku_max = 0
for i in range(n-1):
dist.append(a[i+1]-a[i])
dist.append(a[0]+(k-a[-1]))
for i in dist:
kankaku_max = max(kankaku_max,i)
print(k-kankaku_max) | [
"identifier.change"
] | 500,208 | 500,209 | u738898077 | python |
p02725 | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = [0]*n
for i in range(n-1):
ans[i] = a[i+1] - a[i]
ans[-1] = (k-a[-1])
print(k - max(ans) ) | k,n = map(int,input().split())
a = list(map(int,input().split()))
ans = [0]*n
for i in range(n-1):
ans[i] = a[i+1] - a[i]
ans[-1] = (k-a[-1]+a[0])
print(k - max(ans) ) | [
"assignment.change"
] | 500,210 | 500,211 | u738898077 | python |
p02725 | import sys
i = []
for line in sys.stdin.readlines():
i.append(line.rstrip().split(" "))
list_i1 = [int(s) for s in i[1]]
a = 0
distance = []
for list_i1[a] in list_i1:
if a > len(list_i1)-2:
break
distance.append(list_i1[a+1] - list_i1[a])
a += 1
for b in distance:
b += b
distance.append(int(i[0][0]... | import sys
i = []
for line in sys.stdin.readlines():
i.append(line.rstrip().split(" "))
list_i1 = [int(s) for s in i[1]]
a = 0
distance = []
for list_i1[a] in list_i1:
if a > len(list_i1)-2:
break
distance.append(list_i1[a+1] - list_i1[a])
a += 1
c = 0
for b in distance:
c += b
distance.append(int(i[0]... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 500,212 | 500,213 | u238928527 | python |
p02725 | k, n = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ma = 0
for i in range(n - 1):
tmp = a[i + 1] - a[i]
if ma < tmp:
ma = tmp
print(max(ma, a[0] + (k - a[-1])))
| k, n = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ma = 0
for i in range(n - 1):
tmp = a[i + 1] - a[i]
if ma < tmp:
ma = tmp
print(k - max(ma, a[0] + (k - a[-1])))
| [
"expression.operation.binary.add"
] | 500,217 | 500,218 | u523130469 | python |
p02725 | k,n = map(int, input().split())
an = list(map(int, input().split()))
an.append(an[0]+k)
a = an[0]
for i in range(n+1):
temp = an[i]
an[i] -= a
a = temp
print(20-max(an)) | k,n = map(int, input().split())
an = list(map(int, input().split()))
an.append(an[0]+k)
a = an[0]
for i in range(n+1):
temp = an[i]
an[i] -= a
a = temp
print(k-max(an)) | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 500,219 | 500,220 | u250664216 | 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[0] + k - A[n-1])
print(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(A[0] + k - A[n-1])
print(sum(B) - max(B)) | [
"expression.operation.binary.add"
] | 500,221 | 500,222 | u515674295 | python |
p02725 | n, k = map(int, input().split(" "))
houses = list(map(int, input().split(" ")))
print(houses)
dif_houses = [houses[x+1]-houses[x] for x in range(k-1)]
dif_houses.append(houses[0]-houses[k-1]+n)
max_dif = max(dif_houses)
print(n-max_dif) | n, k = map(int, input().split(" "))
houses = list(map(int, input().split(" ")))
dif_houses = [houses[x+1]-houses[x] for x in range(k-1)]
dif_houses.append(houses[0]-houses[k-1]+n)
max_dif = max(dif_houses)
print(n-max_dif) | [
"call.remove"
] | 500,225 | 500,226 | u474561976 | python |
p02725 | a,b= map(int,input().split(" "))
ar = list(map(int,input().split(" ")))
ar.append(a)
count = 0
mx = 0
for i in range(len(ar)-1):
count += ar[i+1] - ar[i]
if mx < ar[i+1] - ar[i]:
mx = ar[i+1] - ar[i]
print(count - mx) | a,b= map(int,input().split(" "))
ar = list(map(int,input().split(" ")))
ar.append(a+ar[0])
count = 0
mx = 0
for i in range(len(ar)-1):
count += ar[i+1] - ar[i]
if mx < ar[i+1] - ar[i]:
mx = ar[i+1] - ar[i]
print(count - mx) | [
"expression.operation.binary.add"
] | 500,227 | 500,228 | u848647227 | python |
p02725 | arrayNM = list(map(int, input().split()))
array = list(map(int, input().split()))
route = [array[0] + arrayNM[0] - array[arrayNM[1] - 1]]
for i in range(1,arrayNM[1]):
route.append(array[i] - array[i-1])
Max = max(route)
maxIndex = route.index(Max)
distance = 0
for i in range(0,maxIndex):
distance += route[i]
... | arrayNM = list(map(int, input().split()))
array = list(map(int, input().split()))
route = [array[0] + arrayNM[0] - array[arrayNM[1] - 1]]
for i in range(1,arrayNM[1]):
route.append(array[i] - array[i-1])
Max = max(route)
maxIndex = route.index(Max)
distance = 0
for i in range(0,maxIndex):
distance += route[i]
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 500,241 | 500,242 | u878212264 | python |
p02725 | arrayNM = list(map(int, input().split()))
array = list(map(int, input().split()))
route = [array[0] + arrayNM[0] - array[arrayNM[1] - 1]]
for i in range(1,arrayNM[1]):
route.append(array[i] - array[i-1])
Max = max(route)
maxIndex = route.index(Max)
distance = 0
for i in range(0,maxIndex):
distance += route[i]
... | arrayNM = list(map(int, input().split()))
array = list(map(int, input().split()))
route = [array[0] + arrayNM[0] - array[arrayNM[1] - 1]]
for i in range(1,arrayNM[1]):
route.append(array[i] - array[i-1])
Max = max(route)
maxIndex = route.index(Max)
distance = 0
for i in range(0,maxIndex):
distance += route[i]
... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.remove"
] | 500,243 | 500,242 | u878212264 | python |
p02725 | import numpy as np
k,n = map(int, input().split())
a = list(map(int, input().split()))
b = np.zeros(n)
for i in range(0,n-1):
b[i] = a[i+1] -a[i]
b[n-1] = k - a[n-1] + a[0]
print(a,b)
ans = k - max(b)
print(int(ans)) | import numpy as np
k,n = map(int, input().split())
a = list(map(int, input().split()))
b = np.zeros(n)
for i in range(0,n-1):
b[i] = a[i+1] -a[i]
b[n-1] = k - a[n-1] + a[0]
ans = k - max(b)
print(int(ans)) | [
"call.remove"
] | 500,248 | 500,249 | u589913372 | python |
p02725 | k, n = map(int, input().split())
a_list = list(map(int, input().split()))
d_list = [a_list[0] + k - a_list[n - 1]]
for i in range(0, n - 1):
d_list.append(a_list[i + 1] - a_list[i])
print(d_list)
ans = sum(d_list) - max(d_list)
print(ans) | k, n = map(int, input().split())
a_list = list(map(int, input().split()))
d_list = [a_list[0] + k - a_list[n - 1]]
for i in range(0, n - 1):
d_list.append(a_list[i + 1] - a_list[i])
ans = sum(d_list) - max(d_list)
print(ans) | [
"call.remove"
] | 500,256 | 500,257 | u264312747 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.