message
stringlengths 2
16.2k
| message_type
stringclasses 2
values | message_id
int64 0
1
| conversation_id
int64 575
109k
| cluster
float64 16
16
| __index_level_0__
int64 1.15k
217k
|
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
instruction
| 0
| 105,984
| 16
| 211,968
|
"Correct Solution:
```
N,*A=map(int,open(0).read().split())
M = max(A); m = min(A)
ans = []
if -m < M:
idx = A.index(M)
for i in range(N):
A[i] += A[idx]
ans.append((idx, i))
for i in range(1, N):
A[i] += A[i-1]
ans.append((i-1, i))
else:
idx = A.index(m)
for i in range(N):
A[i] += A[idx]
ans.append((idx, i))
for i in range(N-1, 0, -1):
A[i-1] += A[i]
ans.append((i, i-1))
#print(*A)
print(len(ans))
for x, y in ans:
print(x+1, y+1)
```
|
output
| 1
| 105,984
| 16
| 211,969
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
|
instruction
| 0
| 105,985
| 16
| 211,970
|
"Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
maxabs =(a[0])
maxidx = 0
for i in range(n):
if abs(a[i]) >abs(maxabs):
maxabs = a[i]
maxidx = i
res = []
for i in range(n):
if a[i]*maxabs<0:
a[i] += maxabs
res.append((maxidx+1,i+1))
if maxabs>0:
for i in range(1,n):
res.append((i,i+1))
elif maxabs<0:
for i in range(n,1,-1):
res.append((i,i-1))
print(len(res))
for x,y in res:
print(x,y)
```
|
output
| 1
| 105,985
| 16
| 211,971
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
max_A = -10**9
max_num = 0
min_A = 10**9
min_num = 0
for i in range(N):
if(max_A < A[i]):
max_A = A[i]
max_num = i
if(min_A > A[i]):
min_A = A[i]
min_num = i
if(max_A > 0 and min_A < 0):
if(abs(max_A) >= abs(min_A)):
print(2*N-1)
for i in range(N):
A[i] += max_A
print(max_num+1, i+1)
for i in range(N-1):
print(i+1, i+2)
else:
print(2*N-1)
for i in range(N):
A[i] += min_A
print(min_num+1, i+1)
for i in range(N-1, 0, -1):
print(i+1, i)
elif(min_A >= 0):
print(N-1)
for i in range(N-1):
print(i+1, i+2)
elif(max_A <= 0):
print(N-1)
for i in range(N-1, 0, -1):
print(i+1, i)
else:
print(0)
```
|
instruction
| 0
| 105,986
| 16
| 211,972
|
Yes
|
output
| 1
| 105,986
| 16
| 211,973
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
mina = min(A)
mini = A.index(mina)
maxa = max(A)
maxi = A.index(maxa)
if mina >= 0:
print(N-1)
for i in range(N-1):
print("{} {}".format(i+1, i+2))
elif maxa < 0:
print(N-1)
for i in range(N-1):
print("{} {}".format(N-i, N-i-1))
else:
if -mina < maxa:
print(2*N-1)
for i in range(N):
print("{} {}".format(maxi+1, i+1))
for i in range(N-1):
print("{} {}".format(i+1, i+2))
else:
print(2*N-1)
for i in range(N):
print("{} {}".format(mini+1, i+1))
for i in range(N-1):
print("{} {}".format(N-i, N-i-1))
```
|
instruction
| 0
| 105,987
| 16
| 211,974
|
Yes
|
output
| 1
| 105,987
| 16
| 211,975
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
if abs(max(A)) >= abs(min(A)):
max_idx = A.index(max(A))
print(2 * N - 1)
for i in range(N):
print(max_idx + 1, i + 1)
for i in range(N - 1):
print(i + 1, i + 2)
else:
min_idx = A.index(min(A))
print(2 * N - 1)
for i in range(N):
print(min_idx + 1, i + 1)
for i in range(N, 1, -1):
print(i, i - 1)
```
|
instruction
| 0
| 105,988
| 16
| 211,976
|
Yes
|
output
| 1
| 105,988
| 16
| 211,977
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
n = int(input())
l = list(map(int,input().split()))
ma = max(l)
mi = min(l)
ans = []
if abs(ma) >= abs(mi):
ind = l.index(ma)
if ind != 0:
ans.append([ind+1,1])
ans.append([ind+1,1])
for i in range(1,n):
ans.append([i,i+1])
ans.append([i,i+1])
else:
ind = l.index(mi)
if ind != n-1:
ans.append([ind+1,n])
ans.append([ind+1,n])
for i in range(n-2,-1,-1):
ans.append([i+2,i+1])
ans.append([i+2,i+1])
print(len(ans))
for i in ans:
print(*i)
```
|
instruction
| 0
| 105,989
| 16
| 211,978
|
Yes
|
output
| 1
| 105,989
| 16
| 211,979
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
n=int(input())
a=[int(i) for i in input().split()]
count=0
ans=[[0 for i in range(2)] for j in range(2*n)]
aaa=0
a_max=max(a)
a_min=min(a)
if abs(a_max)>=abs(a_min):
delta=a_max
else:
delta=a_min
if delta>0:
seifu=1
else:
seifu=-1
for i in range(n):
if delta==a[i]:
aaa=i+1
break
for i in range(n-1):
while a[i]>a[i+1]:
if seifu==1:
a[i+1]=a[i+1]+delta
ans[count][0], ans[count][1]=aaa, i+2
else:
a[i]=a[i]+delta
ans[count][0], ans[count][1]=aaa, i+1
count=count+1
a_max=max(a)
a_min=min(a)
if abs(a_max)>=abs(a_min):
delta=a_max
else:
delta=a_min
if delta>0:
seifu=1
else:
seifu=-1
print(count)
for i in range(count):
print(ans[i][0],ans[i][1])
```
|
instruction
| 0
| 105,990
| 16
| 211,980
|
No
|
output
| 1
| 105,990
| 16
| 211,981
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
key = 0
for a in A:
if abs(a) > abs(key):
key = a
m = 0
ans = []
if key > 0:
for i in range(N):
if A[i] < 0:
m += 1
A[i] += key
for i in range(1, N):
if A[i-1] > A[i]:
A[i] += A[i-1]
m += 1
ans.append([i, i+1])
print(m)
for x, y in ans:
print(x, y)
elif key < 0:
for i in range(N):
if A[i] > 0:
m += 1
A[i] += key
for i in range(N-1, 0, -1):
if A[i-1] > A[i]:
A[i-1] += A[i]
m += 1
ans.append([i, i+1])
print(m)
for x, y in ans:
print(x, y)
else:
print(0)
```
|
instruction
| 0
| 105,991
| 16
| 211,982
|
No
|
output
| 1
| 105,991
| 16
| 211,983
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
N = int(input())
A = list(map(int, input().split()))
M, Mi = 0, 0
for i, a in enumerate(A):
if abs(a) > M:
M = a
Mi = i
ans = []
if M > 0:
for i in range(N):
ans.append((Mi, i))
A[i] += M
for i in range(N - 1):
if A[i] > A[i + 1]:
ans.append((i, i + 1))
A[i + 1] += A[i]
else:
for i in range(N):
ans.append((Mi, i))
A[i] += M
for i in range(N - 1, 0, -1):
if A[i - 1] > A[i]:
ans.append((i, i - 1))
A[i - 1] += A[i]
print(len(ans))
for x, y in ans:
print(x + 1, y + 1)
```
|
instruction
| 0
| 105,992
| 16
| 211,984
|
No
|
output
| 1
| 105,992
| 16
| 211,985
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has an integer sequence, a, of length N. The i-th element of a (1-indexed) is a_{i}.
He can perform the following operation any number of times:
* Operation: Choose integers x and y between 1 and N (inclusive), and add a_x to a_y.
He would like to perform this operation between 0 and 2N times (inclusive) so that a satisfies the condition below. Show one such sequence of operations. It can be proved that such a sequence of operations always exists under the constraints in this problem.
* Condition: a_1 \leq a_2 \leq ... \leq a_{N}
Constraints
* 2 \leq N \leq 50
* -10^{6} \leq a_i \leq 10^{6}
* All input values are integers.
Input
Input is given from Standard Input in the following format:
N
a_1 a_2 ... a_{N}
Output
Let m be the number of operations in your solution. In the first line, print m. In the i-th of the subsequent m lines, print the numbers x and y chosen in the i-th operation, with a space in between. The output will be considered correct if m is between 0 and 2N (inclusive) and a satisfies the condition after the m operations.
Examples
Input
3
-2 5 -1
Output
2
2 3
3 3
Input
2
-1 -3
Output
1
2 1
Input
5
0 0 0 0 0
Output
0
Submitted Solution:
```
n=int(input())
a=list(map(int,input().split()))
print(2*n-1)
if abs(max(a))>=abs(min(a)):
b=a.index(max(a))
for i in range(n):
print(b+1,i)
for j in range(n-1):
print(j+1,j+2)
else:
b=a.index(min(a))
for i in range(n):
print(b+1,i+1)
for j in range(n-1,0,-1):
print(j+1,j)
```
|
instruction
| 0
| 105,993
| 16
| 211,986
|
No
|
output
| 1
| 105,993
| 16
| 211,987
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,817
| 16
| 213,634
|
"Correct Solution:
```
n,k = map(int, input().split())
mod = 10**9+7
dp = [[1] + [0 for i in range(k)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(1,k+1):
dp[i][j] = dp[i-1][j] + dp[i-1][j-1]
for i in range(k):
print(dp[n-k+1][i+1]*dp[k-1][i]%mod)
```
|
output
| 1
| 106,817
| 16
| 213,635
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,818
| 16
| 213,636
|
"Correct Solution:
```
from math import factorial as f
N, K = map(int,input().split())
WARU = 10**9+7
def nCr(n, r):
return f(n)//(f(r)*f(n-r))
for i in range(K):
if i <= N-K:
print((nCr(K-1, i) * nCr(N-K+1, i+1)) % WARU)
else:
print(0)
```
|
output
| 1
| 106,818
| 16
| 213,637
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,819
| 16
| 213,638
|
"Correct Solution:
```
n,k=map(int,input().split())
mod=10**9+7
fac=[1]*n
for i in range(n-1):
fac[i+1]=((i+2)*fac[i])
def comb(a,b):
if a==0:
return 1
if b==0 or b==a:
return 1
return (fac[a-1]//(fac[a-b-1]*fac[b-1]))%mod
for i in range(k):
print((comb(n-k+1,i+1)*comb(k-1,i))%mod)
```
|
output
| 1
| 106,819
| 16
| 213,639
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,820
| 16
| 213,640
|
"Correct Solution:
```
from math import factorial
N, K = map(int, input().split())
mod = 10**9 + 7
def cmb(n, r):
if n >= r:
return int(factorial(n) // (factorial(r) * factorial(n-r)))
else:
return 0
for i in range(1, K+1):
print(cmb(N-K+1, i) * cmb(K-1, i-1) % mod)
```
|
output
| 1
| 106,820
| 16
| 213,641
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,821
| 16
| 213,642
|
"Correct Solution:
```
def ncr(n,r,mod):
X = 1
Y = 1
for i in range(r):
X = (X*(n-i))%mod
Y = (Y*(i+1))%mod
return (X*pow(Y,mod-2,mod))%mod
N,K = map(int,input().split())
mod = pow(10,9)+7
for i in range(1,K+1):
ans = (ncr(K-1,i-1,mod)*ncr(N-K+1,i,mod))%mod
print(ans)
```
|
output
| 1
| 106,821
| 16
| 213,643
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,822
| 16
| 213,644
|
"Correct Solution:
```
import math
N,K=map(int,input().split())
def c(n,r):
return math.factorial(n)//(math.factorial(abs(n-r))*math.factorial(r))
for i in range(K):
if N-K<i:
print(0)
else:
red = c(N-K+1,i+1)
blue=c(K-1,i)
ans=(red*blue)%(10**9+7)
print(ans)
```
|
output
| 1
| 106,822
| 16
| 213,645
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,823
| 16
| 213,646
|
"Correct Solution:
```
M=10**9+7;N,K=map(int,input().split())
def c(n,k):
if k>n:return 0
m=d=1
for i in range(k):m*=n-i;d*=i+1
return m%M*pow(d%M,M-2,M)%M
for i in range(K):print(c(K-1,i)*c(N-K+1,i+1)%M)
```
|
output
| 1
| 106,823
| 16
| 213,647
|
Provide a correct Python 3 solution for this coding contest problem.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
|
instruction
| 0
| 106,824
| 16
| 213,648
|
"Correct Solution:
```
#!/usr/bin/env python3
from math import factorial as f
n, k = map(int, input().split())
mod = 10**9+7
for i in range(k):
try:
print(f(n - k + 1) * f(k - 1) // f(i + 1) // f(n - k - i) // f(i) // f(k - i - 1) % mod)
except ValueError:
print(0)
```
|
output
| 1
| 106,824
| 16
| 213,649
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
n, k = map(int, input().split())
a = n-k+1
for i in range(k):
print(a%(10**9+7))
a = a*((n-k-i)*(k-i-1))//(i+1)//(i+2)
```
|
instruction
| 0
| 106,825
| 16
| 213,650
|
Yes
|
output
| 1
| 106,825
| 16
| 213,651
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
mod=10**9+7
n,k=map(int,input().split())
mt=[1]
invt=[1]
for i in range(1,n+1):
mt.append((mt[-1]*i)%mod)
invt.append(pow(mt[-1], mod-2, mod))
for i in range(1,k+1):
a=mt[n-k+1]*invt[i]*invt[n-k-i+1]
b=mt[k-1]*invt[i-1]*invt[k-i]
print((a*b)%mod if n-k+1>=i else 0)
```
|
instruction
| 0
| 106,826
| 16
| 213,652
|
Yes
|
output
| 1
| 106,826
| 16
| 213,653
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
from math import factorial
n,k = map(int,input().split())
for i in range(k):
if i <= n-k:
blue = factorial(k-1)//(factorial(k-i-1)*factorial(i))
red = factorial(n-k+1)//(factorial(n-k-i)*factorial(i+1))
print((blue*red)%1000000007)
else:
print(0)
```
|
instruction
| 0
| 106,827
| 16
| 213,654
|
Yes
|
output
| 1
| 106,827
| 16
| 213,655
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
MOD=10**9+7
def com(n,k,mod):
res=1
tmp=1
for i in range(1,k+1):
res=res*(n-i+1)%mod
tmp=tmp*i%mod
a=pow(tmp,mod-2,mod)
return res*a%mod
N,K=map(int,input().split())
X=N-K
for i in range(1,K+1):
print(com(X+1,i,MOD)*com(K-1,i-1,MOD)%MOD)
```
|
instruction
| 0
| 106,828
| 16
| 213,656
|
Yes
|
output
| 1
| 106,828
| 16
| 213,657
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1,r,p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
return result
N, K =map(int, input().split())
blue = K
red = N - K
over = 10**9 + 7
for i in range(K):
if i == 0:
print(red+1)
elif i <= red:
print((cmb(red+1, i+1) % over) * (cmb(blue-1, i) % over))
else:
print(0)
```
|
instruction
| 0
| 106,829
| 16
| 213,658
|
No
|
output
| 1
| 106,829
| 16
| 213,659
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
N,K = map(int,input().split())
B = 1
R = N-K+1
i = 0
while B*R%(10**9+7) != 0:
print(B*R%(10**9+7))
B = B * (K-i-1) // (i+1)
R = R * (N-K-i) // (i+2)
i += 1
```
|
instruction
| 0
| 106,830
| 16
| 213,660
|
No
|
output
| 1
| 106,830
| 16
| 213,661
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
#132_D
n,k=map(int,input().split())
mod=10**9+7
f=[1 for i in range(n-k+2)]
f_inv=[1 for i in range(n-k+2)]
for i in range(1,n-k+2):
f[i]=f[i-1]*i%mod
f_inv[i]=pow(f[i],mod-2,mod)
def comb(n,k):
if k>n:
return 0
return f[n]*f_inv[k]*f_inv[n-k]%mod
for i in range(1,k+1):
print(comb(n-k+1,i)*comb(k-1,i-1)%mod)
```
|
instruction
| 0
| 106,831
| 16
| 213,662
|
No
|
output
| 1
| 106,831
| 16
| 213,663
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.
First, Snuke will arrange the N balls in a row from left to right.
Then, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.
How many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \leq i \leq K.
Constraints
* 1 \leq K \leq N \leq 2000
Input
Input is given from Standard Input in the following format:
N K
Output
Print K lines. The i-th line (1 \leq i \leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.
Examples
Input
5 3
Output
3
6
1
Input
2000 3
Output
1998
3990006
327341989
Submitted Solution:
```
n, k = list(map(int, input().split()))
mod = int(1e9 + 7)
def comb(a, b):
result = 1
for i in range(b):
result *= a-i
result //= i+1
result %= mod
return result
for i in range(1, k+1):
print(comb(n-k+1, i) * comb(k-1, i-1) % mod)
```
|
instruction
| 0
| 106,832
| 16
| 213,664
|
No
|
output
| 1
| 106,832
| 16
| 213,665
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,833
| 16
| 213,666
|
"Correct Solution:
```
N,A,B = list(map(int,input().split()))
another=1+1*N
ans =A
N -= A-1
ans += N//2 * (B-A)
ans += N%2
print(max(ans,another))
```
|
output
| 1
| 106,833
| 16
| 213,667
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,834
| 16
| 213,668
|
"Correct Solution:
```
k, a, b = map(int, input().split())
if b-a < 3 or k < a+1:
print(k+1)
else:
print(a + (k-a+1)//2*(b-a) + (k-a+1)%2)
```
|
output
| 1
| 106,834
| 16
| 213,669
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,835
| 16
| 213,670
|
"Correct Solution:
```
K, A, B = map(int, input().split())
K += 1
if B - A <= 2 or K < A + 2:
print(K)
else:
K -= A + 2
print(B + K // 2 * (B - A) + K % 2)
```
|
output
| 1
| 106,835
| 16
| 213,671
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,836
| 16
| 213,672
|
"Correct Solution:
```
K,A,B = map(int, input().split())
S=K+1
diff=B-A
t=((K-A+1)//2)
T=diff*t
odd=((K-A+1)%2)
print(max(T+odd+A,S))
```
|
output
| 1
| 106,836
| 16
| 213,673
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,837
| 16
| 213,674
|
"Correct Solution:
```
k,a,b = map(int,input().split())
if a+2 >= b or a >= k:
print(k+1)
else:
k -= a-1
print(a+ (b-a)*(k//2) + k%2)
```
|
output
| 1
| 106,837
| 16
| 213,675
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,838
| 16
| 213,676
|
"Correct Solution:
```
k,a,b = map(int,input().split())
bis = 1
bis = a
k -= (a-1)
print(max((b-a) * (k//2)+ 1 * (k % 2) + bis,k + bis))
#copy code
```
|
output
| 1
| 106,838
| 16
| 213,677
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,839
| 16
| 213,678
|
"Correct Solution:
```
k,a,b=map(int,input().split())
ans=1
yen=0
if b<=a+2 or k<=a:
ans+=k
else:
n=(k-a+1)//2
ans+=n*(b-a)+(k-2*n)
print(ans)
```
|
output
| 1
| 106,839
| 16
| 213,679
|
Provide a correct Python 3 solution for this coding contest problem.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
|
instruction
| 0
| 106,840
| 16
| 213,680
|
"Correct Solution:
```
k,a,b=map(int,input().split())
gain=b-a
if gain>=2:
k-=a-1
print(a+k//2*gain+k%2)
else:
print(k+1)
```
|
output
| 1
| 106,840
| 16
| 213,681
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
k,a,b=map(int,input().split())
if b-a<=2 or a>=k:
print(1+k)
exit()
bis=a
k-=a-1
bis+=k//2*(b-a)
if k%2==1:
bis+=1
print(bis)
```
|
instruction
| 0
| 106,841
| 16
| 213,682
|
Yes
|
output
| 1
| 106,841
| 16
| 213,683
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
k, a, b = map(int, input().split())
if b - a <= 2:
print(k + 1)
exit()
k -= a - 1
bis = a
print(a + ((b - a) * (k // 2)) + k % 2)
```
|
instruction
| 0
| 106,842
| 16
| 213,684
|
Yes
|
output
| 1
| 106,842
| 16
| 213,685
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
K,A,B=map(int,input().split());print(K+1if(B-A)<2or K+1<A else A+(B-A)*((K-A+1)//2)+(K+A+1)%2)
```
|
instruction
| 0
| 106,843
| 16
| 213,686
|
Yes
|
output
| 1
| 106,843
| 16
| 213,687
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
K,A,B=map(int,input().split())
K1=K-(A+1)
n=K1//2
print(max(K+1,((n+1)*B-n*A+K1%2)))
```
|
instruction
| 0
| 106,844
| 16
| 213,688
|
Yes
|
output
| 1
| 106,844
| 16
| 213,689
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
K , A , B = map(int, input().split())
if A >= B:
print(K+1)
elif A < B:
print(max((K//(A+2))*B +(K%(A+2))+1,K+1))
```
|
instruction
| 0
| 106,845
| 16
| 213,690
|
No
|
output
| 1
| 106,845
| 16
| 213,691
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
k, a, b = map(int, input().split())
if a < b - 2:
# k が a+2より大きい場合
if k > (a + 2):
# まずa+2回叩いて b 枚を得る
k2 = k - (a + 2)
res = b
# 残りの k2回を a枚を1円に，1円をB枚に交換の2回の操作をできるだけ繰り返す
# 2回の操作で (b-a)円増える
# この操作は k2//2 + 1 回行える
res += (k2//2 + 1) * (b - a)
# kがa+2より小さい場合は全部叩くしかない
else:
res = k + 1
else:
# a枚をb枚に交換しても増えなければ全部叩いた方が良い
res = k + 1
print(res)
```
|
instruction
| 0
| 106,846
| 16
| 213,692
|
No
|
output
| 1
| 106,846
| 16
| 213,693
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
arr = input().split()
K = int(arr[0])
A = int(arr[1])
B = int(arr[2])
n = 1 + K
x = B
K -= A+1
temp = int(K / 2)
x += temp * (B-A)
K -= temp * 2
while K > 0:
K -= 1
x += 1
print(max(x, n))
```
|
instruction
| 0
| 106,847
| 16
| 213,694
|
No
|
output
| 1
| 106,847
| 16
| 213,695
|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke has one biscuit and zero Japanese yen (the currency) in his pocket. He will perform the following operations exactly K times in total, in the order he likes:
* Hit his pocket, which magically increases the number of biscuits by one.
* Exchange A biscuits to 1 yen.
* Exchange 1 yen to B biscuits.
Find the maximum possible number of biscuits in Snuke's pocket after K operations.
Constraints
* 1 \leq K,A,B \leq 10^9
* K,A and B are integers.
Input
Input is given from Standard Input in the following format:
K A B
Output
Print the maximum possible number of biscuits in Snuke's pocket after K operations.
Examples
Input
4 2 6
Output
7
Input
7 3 4
Output
8
Input
314159265 35897932 384626433
Output
48518828981938099
Submitted Solution:
```
k,a,b = list(map(int,input().split()))
mon = 0
bis = 1
if(a <= b-1):
for i in range(k):
bis = bis + 1
else:
for i in range(k):
if(mon == 1):
mon = 0
bis = bis + b
elif(bis >= a and i < k-1):
mon = 1
bis = bis - a
else:
bis = bis + 1
print(bis)
```
|
instruction
| 0
| 106,848
| 16
| 213,696
|
No
|
output
| 1
| 106,848
| 16
| 213,697
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,849
| 16
| 213,698
|
"Correct Solution:
```
n,k=map(int,input().split())
x=list(map(int,input().split()))
ans=3*10**8
for i in range(n-k+1):
ans=min(ans,min(abs(x[i]),abs(x[k+i-1]))+x[k+i-1]-x[i])
print(ans)
```
|
output
| 1
| 106,849
| 16
| 213,699
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,850
| 16
| 213,700
|
"Correct Solution:
```
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = float("inf")
for i in range(n-k+1):
res = x[i+k-1] - x[i] + min(abs(x[i+k-1]), abs(x[i]))
ans = min(ans, res)
print(ans)
```
|
output
| 1
| 106,850
| 16
| 213,701
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,851
| 16
| 213,702
|
"Correct Solution:
```
N,K=map(int,input().split())
x=[int(i) for i in input().split()]
cost=10**13
for i in range(N-K+1):
c=x[i+K-1]-x[i]+min(abs(x[i]),abs(x[i+K-1]))
cost=min(cost,c)
print(cost)
```
|
output
| 1
| 106,851
| 16
| 213,703
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,852
| 16
| 213,704
|
"Correct Solution:
```
N, K = map(int, input().split())
x = list(map(int, input().split()))
ans = []
for i in range(N-K+1):
l = x[i]
r = x[i+K-1]
ans.append(min(abs(l)+abs(l-r), abs(r)+abs(l-r)))
print(min(ans))
```
|
output
| 1
| 106,852
| 16
| 213,705
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,853
| 16
| 213,706
|
"Correct Solution:
```
f = lambda:map(int,input().split())
n,k = f()
x = list(f())
d = 10**9
for i in range(n-k+1):
l,r = x[i],x[i+k-1]
d = [min(d,max(-l,r)),min(d,(r-l)+min(-l,r))][l<0<r]
print(d)
```
|
output
| 1
| 106,853
| 16
| 213,707
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,854
| 16
| 213,708
|
"Correct Solution:
```
N, K = map(int, input().split())
x = list(map(int, input().split()))
m = float("INF")
for i in range(N - K + 1):
m = min(m, x[i + K - 1] - x[i] + min(abs(x[i + K - 1]), abs(x[i])))
print(m)
```
|
output
| 1
| 106,854
| 16
| 213,709
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,855
| 16
| 213,710
|
"Correct Solution:
```
n, k = map(int, input().split())
X = list(map(int, input().split()))
ans = 10**9
for i in range(n-k+1):
l = X[i]
r = X[i+k-1]
tmp = min(abs(l)+abs(l-r), abs(r)+abs(l-r))
ans = min(tmp, ans)
print(ans)
```
|
output
| 1
| 106,855
| 16
| 213,711
|
Provide a correct Python 3 solution for this coding contest problem.
There are N candles placed on a number line. The i-th candle from the left is placed on coordinate x_i. Here, x_1 < x_2 < ... < x_N holds.
Initially, no candles are burning. Snuke decides to light K of the N candles.
Now, he is at coordinate 0. He can move left and right along the line with speed 1. He can also light a candle when he is at the same position as the candle, in negligible time.
Find the minimum time required to light K candles.
Constraints
* 1 \leq N \leq 10^5
* 1 \leq K \leq N
* x_i is an integer.
* |x_i| \leq 10^8
* x_1 < x_2 < ... < x_N
Input
Input is given from Standard Input in the following format:
N K
x_1 x_2 ... x_N
Output
Print the minimum time required to light K candles.
Examples
Input
5 3
-30 -10 10 20 50
Output
40
Input
3 2
10 20 30
Output
20
Input
1 1
0
Output
0
Input
8 5
-9 -7 -4 -3 1 2 3 4
Output
10
|
instruction
| 0
| 106,856
| 16
| 213,712
|
"Correct Solution:
```
N, K = map(int, input().split())
x = list(map(int, input().split()))
Min = 1e10
for i in range(N-K+1):
Min = min(Min, x[K+i-1]-x[i]+min(abs(x[i]),abs(x[K+i-1])))
print(Min)
```
|
output
| 1
| 106,856
| 16
| 213,713
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.