Dataset Viewer
Auto-converted to Parquet Duplicate
problem_id
int64
0
24
trajectory_id
int64
0
159
question
stringclasses
25 values
messages
stringlengths
2.76k
23.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.86k
23.3k
0
0
There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...
[{"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": "There are n cities in Berland, eac...
0
true
true
{"inputs": ["7 3 3\n2 3 1\n", "14 5 6\n4 4 2 2 1\n", "3 1 1\n2\n", "6 3 3\n1 2 2\n", "11 6 4\n1 2 2 1 3 1\n", "21 10 9\n2 1 3 1 1 1 3 2 3 3\n", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5\n", "200000 4 90823\n63010 23084 77424 36481\n", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 2...
false
================================================================================ Question: There are n cities in Berland, each of them has a ... Reward: 0.00 | Terminated: True ================================================================================ [SYSTEM] You are a helpful coding assistant. Solve the given ...
0
1
There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...
[{"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": "There are n cities in Berland, eac...
0.333333
true
false
{"inputs": ["7 3 3\n2 3 1\n", "14 5 6\n4 4 2 2 1\n", "3 1 1\n2\n", "6 3 3\n1 2 2\n", "11 6 4\n1 2 2 1 3 1\n", "21 10 9\n2 1 3 1 1 1 3 2 3 3\n", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5\n", "200000 4 90823\n63010 23084 77424 36481\n", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 2...
true
================================================================================ Question: There are n cities in Berland, each of them has a ... Reward: 0.33 | Terminated: True ================================================================================ [SYSTEM] You are a helpful coding assistant. Solve the given ...
0
2
There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...
[{"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": "There are n cities in Berland, eac...
0.333333
true
false
{"inputs": ["7 3 3\n2 3 1\n", "14 5 6\n4 4 2 2 1\n", "3 1 1\n2\n", "6 3 3\n1 2 2\n", "11 6 4\n1 2 2 1 3 1\n", "21 10 9\n2 1 3 1 1 1 3 2 3 3\n", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5\n", "200000 4 90823\n63010 23084 77424 36481\n", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 2...
true
================================================================================ Question: There are n cities in Berland, each of them has a ... Reward: 0.33 | Terminated: True ================================================================================ [SYSTEM] You are a helpful coding assistant. Solve the given ...
0
3
There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...
[{"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": "There are n cities in Berland, eac...
0
true
true
{"inputs": ["7 3 3\n2 3 1\n", "14 5 6\n4 4 2 2 1\n", "3 1 1\n2\n", "6 3 3\n1 2 2\n", "11 6 4\n1 2 2 1 3 1\n", "21 10 9\n2 1 3 1 1 1 3 2 3 3\n", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5\n", "200000 4 90823\n63010 23084 77424 36481\n", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 2...
false
================================================================================ Question: There are n cities in Berland, each of them has a ... Reward: 0.00 | Terminated: True ================================================================================ [SYSTEM] You are a helpful coding assistant. Solve the given ...
0
4
There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads. That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cit...
[{"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": "There are n cities in Berland, eac...
0.066667
true
false
{"inputs": ["7 3 3\n2 3 1\n", "14 5 6\n4 4 2 2 1\n", "3 1 1\n2\n", "6 3 3\n1 2 2\n", "11 6 4\n1 2 2 1 3 1\n", "21 10 9\n2 1 3 1 1 1 3 2 3 3\n", "51 16 31\n1 3 3 3 4 4 3 5 4 1 3 3 3 2 3 5\n", "200000 4 90823\n63010 23084 77424 36481\n", "6390 29 1740\n407 261 213 375 118 127 276 322 353 166 120 308 178 261 270 275 157 2...
true
================================================================================ Question: There are n cities in Berland, each of them has a ... Reward: 0.07 | Terminated: True ================================================================================ [SYSTEM] You are a helpful coding assistant. Solve the given ...
0
5
"There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capita(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED)
0.266667
true
false
"{\"inputs\": [\"7 3 3\\n2 3 1\\n\", \"14 5 6\\n4 4 2 2 1\\n\", \"3 1 1\\n2\\n\", \"6 3 3\\n1 2 2\\n(...TRUNCATED)
true
"================================================================================\nQuestion: There a(...TRUNCATED)
0
6
"There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capita(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED)
0
true
true
"{\"inputs\": [\"7 3 3\\n2 3 1\\n\", \"14 5 6\\n4 4 2 2 1\\n\", \"3 1 1\\n2\\n\", \"6 3 3\\n1 2 2\\n(...TRUNCATED)
false
"================================================================================\nQuestion: There a(...TRUNCATED)
0
7
"There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capita(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED)
0
true
true
"{\"inputs\": [\"7 3 3\\n2 3 1\\n\", \"14 5 6\\n4 4 2 2 1\\n\", \"3 1 1\\n2\\n\", \"6 3 3\\n1 2 2\\n(...TRUNCATED)
false
"================================================================================\nQuestion: There a(...TRUNCATED)
0
8
"There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capita(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED)
0
true
true
"{\"inputs\": [\"7 3 3\\n2 3 1\\n\", \"14 5 6\\n4 4 2 2 1\\n\", \"3 1 1\\n2\\n\", \"6 3 3\\n1 2 2\\n(...TRUNCATED)
false
"================================================================================\nQuestion: There a(...TRUNCATED)
0
9
"There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capita(...TRUNCATED)
"[{\"role\": \"system\", \"content\": \"You are a helpful coding assistant.\\nSolve the given progra(...TRUNCATED)
0.066667
true
false
"{\"inputs\": [\"7 3 3\\n2 3 1\\n\", \"14 5 6\\n4 4 2 2 1\\n\", \"3 1 1\\n2\\n\", \"6 3 3\\n1 2 2\\n(...TRUNCATED)
true
"================================================================================\nQuestion: There a(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
7