problem_id int64 0 24 | trajectory_id int64 0 159 | question stringclasses 25
values | messages stringlengths 2.19k 28.7k | final_reward float64 0 1 | terminated bool 1
class | truncated bool 2
classes | tests stringclasses 25
values | is_successful bool 2
classes | rendered stringlengths 2.31k 28.2k |
|---|---|---|---|---|---|---|---|---|---|
0 | 0 | Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1
, where |V| is the... | [{"role": "system", "content": "You are a helpful coding assistant.\nSolve the given programming problem and provide your solution.\n\nFirst, think about the problem step by step.\nThen, provide your final solution wrapped in ```python``` code blocks.\n"}, {"role": "user", "content": "Find the sum of the weights of edg... | 0.6 | true | false | {"inputs": ["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3", "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n1 5 8\n3 5 3", "4 6 0\n0 1 1\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1... | true | ================================================================================
Question: Find the sum of the weights of edges of the Minimu...
Reward: 0.60 | Terminated: True
================================================================================
[SYSTEM]
You are a helpful coding assistant.
Solve the given ... |
0 | 1 | Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1
, where |V| is the... | [{"role": "system", "content": "You are a helpful coding assistant.\nSolve the given programming problem and provide your solution.\n\nFirst, think about the problem step by step.\nThen, provide your final solution wrapped in ```python``` code blocks.\n"}, {"role": "user", "content": "Find the sum of the weights of edg... | 0 | true | false | {"inputs": ["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3", "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n1 5 8\n3 5 3", "4 6 0\n0 1 1\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1... | false | ================================================================================
Question: Find the sum of the weights of edges of the Minimu...
Reward: 0.00 | Terminated: True
================================================================================
[SYSTEM]
You are a helpful coding assistant.
Solve the given ... |
0 | 2 | Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1
, where |V| is the... | [{"role": "system", "content": "You are a helpful coding assistant.\nSolve the given programming problem and provide your solution.\n\nFirst, think about the problem step by step.\nThen, provide your final solution wrapped in ```python``` code blocks.\n"}, {"role": "user", "content": "Find the sum of the weights of edg... | 0 | true | true | {"inputs": ["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3", "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n1 5 8\n3 5 3", "4 6 0\n0 1 1\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1... | false | ================================================================================
Question: Find the sum of the weights of edges of the Minimu...
Reward: 0.00 | Terminated: True
================================================================================
[SYSTEM]
You are a helpful coding assistant.
Solve the given ... |
0 | 3 | Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1
, where |V| is the... | [{"role": "system", "content": "You are a helpful coding assistant.\nSolve the given programming problem and provide your solution.\n\nFirst, think about the problem step by step.\nThen, provide your final solution wrapped in ```python``` code blocks.\n"}, {"role": "user", "content": "Find the sum of the weights of edg... | 0 | true | false | {"inputs": ["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3", "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n1 5 8\n3 5 3", "4 6 0\n0 1 1\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1... | false | ================================================================================
Question: Find the sum of the weights of edges of the Minimu...
Reward: 0.00 | Terminated: True
================================================================================
[SYSTEM]
You are a helpful coding assistant.
Solve the given ... |
0 | 4 | Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given weighted directed graph G = (V, E).
Constraints
* 1 ≤ |V| ≤ 100
* 0 ≤ |E| ≤ 1,000
* 0 ≤ wi ≤ 10,000
* G has arborescence(s) with the root r
Input
|V| |E| r
s0 t0 w0
s1 t1 w1
:
s|E|-1 t|E|-1 w|E|-1
, where |V| is the... | [{"role": "system", "content": "You are a helpful coding assistant.\nSolve the given programming problem and provide your solution.\n\nFirst, think about the problem step by step.\nThen, provide your final solution wrapped in ```python``` code blocks.\n"}, {"role": "user", "content": "Find the sum of the weights of edg... | 0.866667 | true | false | {"inputs": ["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n2 5 8\n3 5 3", "4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5", "6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1 6\n1 3 2\n3 4 3\n4 2 2\n1 5 8\n3 5 3", "4 6 0\n0 1 1\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1... | true | ================================================================================
Question: Find the sum of the weights of edges of the Minimu...
Reward: 0.87 | Terminated: True
================================================================================
[SYSTEM]
You are a helpful coding assistant.
Solve the given ... |
0 | 5 | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED) | 0.266667 | true | false | "{\"inputs\": [\"4 6 0\\n0 1 3\\n0 2 2\\n2 0 1\\n2 3 1\\n3 0 1\\n3 1 5\", \"6 10 0\\n0 2 7\\n0 1 1\\(...TRUNCATED) | true | "================================================================================\nQuestion: Find th(...TRUNCATED) |
0 | 6 | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED) | 0.2 | true | false | "{\"inputs\": [\"4 6 0\\n0 1 3\\n0 2 2\\n2 0 1\\n2 3 1\\n3 0 1\\n3 1 5\", \"6 10 0\\n0 2 7\\n0 1 1\\(...TRUNCATED) | true | "================================================================================\nQuestion: Find th(...TRUNCATED) |
0 | 7 | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED) | 0.866667 | true | false | "{\"inputs\": [\"4 6 0\\n0 1 3\\n0 2 2\\n2 0 1\\n2 3 1\\n3 0 1\\n3 1 5\", \"6 10 0\\n0 2 7\\n0 1 1\\(...TRUNCATED) | true | "================================================================================\nQuestion: Find th(...TRUNCATED) |
0 | 8 | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED) | 0 | true | false | "{\"inputs\": [\"4 6 0\\n0 1 3\\n0 2 2\\n2 0 1\\n2 3 1\\n3 0 1\\n3 1 5\", \"6 10 0\\n0 2 7\\n0 1 1\\(...TRUNCATED) | false | "================================================================================\nQuestion: Find th(...TRUNCATED) |
0 | 9 | "Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED) | 0 | true | false | "{\"inputs\": [\"4 6 0\\n0 1 3\\n0 2 2\\n2 0 1\\n2 3 1\\n3 0 1\\n3 1 5\", \"6 10 0\\n0 2 7\\n0 1 1\\(...TRUNCATED) | false | "================================================================================\nQuestion: Find th(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9