prefix stringlengths 65 1.8k | suffix stringclasses 839
values | solution stringlengths 6 859 | test_cases listlengths 0 100 | import_str listlengths 0 1 | demos listlengths 0 8 | entry_func stringclasses 158
values | data_id stringlengths 36 40 | doc_string stringclasses 164
values | dataset_name stringclasses 1
value | task_name stringclasses 1
value | compare_func listlengths 0 0 | src_lang stringclasses 1
value | tgt_lang stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | if grid[i][j] == 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L4 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | if grid[i][j] == 1:
temp = []
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L5 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | if grid[i][j] == 1:
temp = []
if i != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L6 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i %... | if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L7 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L9 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if grid[i][j] == 1:
temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L4_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | temp = []
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L5 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | temp = []
if i != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L6 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i %... | temp = []
if i != 0:
temp.append(grid[i - 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L7 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L9 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp = []
if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L5_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | if i != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L6 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i %... | if i != 0:
temp.append(grid[i - 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L7 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L9 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i != 0:
temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L6_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i %... | temp.append(grid[i - 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L7 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | temp.append(grid[i - 1][j])
if j != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L9 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i - 1][j])
if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L7_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | if j != 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L9 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | if j != 0:
temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % ... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % ... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % ... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % ... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if j != 0:
temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % ... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L9_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)... | temp.append(grid[i][j - 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L10 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(1)
else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L22 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | else:
ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L23 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | ans.append(val)
return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L24 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | return ans
| temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L25 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j - 1])
if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.app... | [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L10_L26 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L12 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L13 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L15 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
val = min(temp)
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L16 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... |
ans = []
for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L18 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | for i in range(k):
if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L20 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def minPath(grid, k):
"""
Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You... | if i % 2 == 0:
ans.append(1)
else:
ans.append(val)
return ans
| if i != n - 1:
temp.append(grid[i + 1][j])
if j != n - 1:
temp.append(grid[i][j + 1])
val = min(temp)
ans = []
for i in range(k):
| [
[
"[[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3",
"[1, 2, 1]"
],
[
"[[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1",
"[1]"
],
[
"[[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4",
"[1, 2, 1, 2]"
],
[
"[[6, 4, 13, 10], [5, 7, 12, 1], [3, 16, 11, 15], [8, 14, 9, 2]], 7",
"[... | [] | [
[
"[[1,2,3], [4,5,6], [7,8,9]], 3",
"[1, 2, 1]"
],
[
"[[5,9,3], [4,1,6], [7,8,2]], 1",
"[1]"
]
] | minPath | MultiLineInfilling/HumanEval/129/L12_L21 | Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and i... | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.