problem_id int64 | trajectory_id int64 | question string | messages string | num_turns int64 | final_reward float64 | terminated bool | truncated bool | tests string | num_public_tests int64 | is_successful bool | turn_wise_finish_reason list | turn_wise_truncated_by_token_limit list | num_assistant_messages_truncated int64 | num_assistant_messages_not_truncated int64 | rendered string |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | 0 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 1 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.066667 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 2 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"length"
] | [
true
] | 1 | 0 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 3 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 4 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"length"
] | [
true
] | 1 | 0 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 5 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"length"
] | [
true
] | 1 | 0 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 6 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.133333 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"length"
] | [
true
] | 1 | 0 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 7 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.133333 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 8 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
0 | 9 | "There are N towns, numbered 1,2,\\ldots,N, arranged in a line in this order.\nThere are N-1 roads c(...TRUNCATED) | "[{\"role\": \"system\", \"content\": \"You are an expert competitive programmer.\\n\\nYou will be g(...TRUNCATED) | 1 | 0.2 | true | false | "{\"inputs\": [\"5 4 2\\n4 2\\n1 3\\n3 5\\n2 4\\n1 3\\n2 4\", \"7 6 3\\n1 5\\n2 4\\n4 6\\n7 1\\n5 3\(...TRUNCATED) | 0 | false | [
"stop"
] | [
false
] | 0 | 1 | "================================================================================\nQuestion: There a(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 28