prompt
stringlengths 42
584
| solution
stringlengths 3
571
| data_source
stringclasses 1
value | source_prompt
listlengths 1
1
| ability
stringclasses 1
value | reward_model
dict | extra_info
dict |
|---|---|---|---|---|---|---|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 187 mins, B: 120 mins
A -> GHY: 146 mins, B: 133 mins
B -> GHY: 190 mins, A: 81 mins
Find the most optimal tour.
|
347
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 187 mins, B: 120 mins\nA -> GHY: 146 mins, B: 133 mins\nB -> GHY: 190 mins, A: 81 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "347",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 0
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 52 mins, B: 144 mins
A -> GHY: 94 mins, B: 189 mins
B -> GHY: 67 mins, A: 151 mins
Find the most optimal tour.
|
308
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 52 mins, B: 144 mins\nA -> GHY: 94 mins, B: 189 mins\nB -> GHY: 67 mins, A: 151 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "308",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 1
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 189 mins, B: 145 mins
A -> GHY: 140 mins, B: 87 mins
B -> GHY: 171 mins, A: 91 mins
Find the most optimal tour.
|
376
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 189 mins, B: 145 mins\nA -> GHY: 140 mins, B: 87 mins\nB -> GHY: 171 mins, A: 91 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "376",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 2
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 160 mins, B: 89 mins
A -> GHY: 139 mins, B: 137 mins
B -> GHY: 140 mins, A: 133 mins
Find the most optimal tour.
|
361
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 160 mins, B: 89 mins\nA -> GHY: 139 mins, B: 137 mins\nB -> GHY: 140 mins, A: 133 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "361",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 3
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 92 mins, B: 112 mins
A -> GHY: 78 mins, B: 176 mins
B -> GHY: 194 mins, A: 183 mins
Find the most optimal tour.
|
373
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 92 mins, B: 112 mins\nA -> GHY: 78 mins, B: 176 mins\nB -> GHY: 194 mins, A: 183 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "373",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 4
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 100 mins, B: 183 mins
A -> GHY: 56 mins, B: 188 mins
B -> GHY: 118 mins, A: 83 mins
Find the most optimal tour.
|
322
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 100 mins, B: 183 mins\nA -> GHY: 56 mins, B: 188 mins\nB -> GHY: 118 mins, A: 83 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "322",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 5
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 199 mins, B: 70 mins
A -> GHY: 196 mins, B: 116 mins
B -> GHY: 180 mins, A: 80 mins
Find the most optimal tour.
|
346
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 199 mins, B: 70 mins\nA -> GHY: 196 mins, B: 116 mins\nB -> GHY: 180 mins, A: 80 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "346",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 6
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 194 mins, B: 77 mins
A -> GHY: 159 mins, B: 114 mins
B -> GHY: 189 mins, A: 107 mins
Find the most optimal tour.
|
343
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 194 mins, B: 77 mins\nA -> GHY: 159 mins, B: 114 mins\nB -> GHY: 189 mins, A: 107 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "343",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 7
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 80 mins, B: 76 mins
A -> GHY: 51 mins, B: 56 mins
B -> GHY: 56 mins, A: 177 mins
Find the most optimal tour.
|
192
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 80 mins, B: 76 mins\nA -> GHY: 51 mins, B: 56 mins\nB -> GHY: 56 mins, A: 177 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "192",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 8
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 123 mins, B: 42 mins
A -> GHY: 191 mins, B: 181 mins
B -> GHY: 66 mins, A: 43 mins
Find the most optimal tour.
|
276
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 123 mins, B: 42 mins\nA -> GHY: 191 mins, B: 181 mins\nB -> GHY: 66 mins, A: 43 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "276",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 9
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 96 mins
A -> GHY: 104 mins, B: 83 mins
B -> GHY: 101 mins, A: 198 mins
Find the most optimal tour.
|
265
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 81 mins, B: 96 mins\nA -> GHY: 104 mins, B: 83 mins\nB -> GHY: 101 mins, A: 198 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "265",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 10
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 134 mins, B: 69 mins
A -> GHY: 81 mins, B: 132 mins
B -> GHY: 133 mins, A: 197 mins
Find the most optimal tour.
|
347
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 134 mins, B: 69 mins\nA -> GHY: 81 mins, B: 132 mins\nB -> GHY: 133 mins, A: 197 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "347",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 11
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 137 mins, B: 79 mins
A -> GHY: 137 mins, B: 114 mins
B -> GHY: 157 mins, A: 84 mins
Find the most optimal tour.
|
300
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 137 mins, B: 79 mins\nA -> GHY: 137 mins, B: 114 mins\nB -> GHY: 157 mins, A: 84 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "300",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 12
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 48 mins, B: 193 mins
A -> GHY: 144 mins, B: 141 mins
B -> GHY: 184 mins, A: 183 mins
Find the most optimal tour.
|
373
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 48 mins, B: 193 mins\nA -> GHY: 144 mins, B: 141 mins\nB -> GHY: 184 mins, A: 183 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "373",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 13
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 128 mins, B: 178 mins
A -> GHY: 65 mins, B: 159 mins
B -> GHY: 52 mins, A: 194 mins
Find the most optimal tour.
|
339
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 128 mins, B: 178 mins\nA -> GHY: 65 mins, B: 159 mins\nB -> GHY: 52 mins, A: 194 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "339",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 14
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 122 mins, B: 72 mins
A -> GHY: 93 mins, B: 68 mins
B -> GHY: 106 mins, A: 150 mins
Find the most optimal tour.
|
296
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 122 mins, B: 72 mins\nA -> GHY: 93 mins, B: 68 mins\nB -> GHY: 106 mins, A: 150 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "296",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 15
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 145 mins, B: 180 mins
A -> GHY: 123 mins, B: 170 mins
B -> GHY: 107 mins, A: 59 mins
Find the most optimal tour.
|
362
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 145 mins, B: 180 mins\nA -> GHY: 123 mins, B: 170 mins\nB -> GHY: 107 mins, A: 59 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "362",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 16
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 190 mins, B: 100 mins
A -> GHY: 145 mins, B: 174 mins
B -> GHY: 88 mins, A: 67 mins
Find the most optimal tour.
|
312
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 190 mins, B: 100 mins\nA -> GHY: 145 mins, B: 174 mins\nB -> GHY: 88 mins, A: 67 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "312",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 17
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 110 mins, B: 120 mins
A -> GHY: 156 mins, B: 124 mins
B -> GHY: 136 mins, A: 106 mins
Find the most optimal tour.
|
370
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 110 mins, B: 120 mins\nA -> GHY: 156 mins, B: 124 mins\nB -> GHY: 136 mins, A: 106 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "370",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 18
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 133 mins, B: 131 mins
A -> GHY: 187 mins, B: 98 mins
B -> GHY: 60 mins, A: 76 mins
Find the most optimal tour.
|
291
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 133 mins, B: 131 mins\nA -> GHY: 187 mins, B: 98 mins\nB -> GHY: 60 mins, A: 76 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "291",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 19
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 122 mins, B: 150 mins
A -> GHY: 51 mins, B: 161 mins
B -> GHY: 166 mins, A: 121 mins
Find the most optimal tour.
|
322
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 122 mins, B: 150 mins\nA -> GHY: 51 mins, B: 161 mins\nB -> GHY: 166 mins, A: 121 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "322",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 20
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 174 mins, B: 178 mins
A -> GHY: 77 mins, B: 61 mins
B -> GHY: 151 mins, A: 119 mins
Find the most optimal tour.
|
374
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 174 mins, B: 178 mins\nA -> GHY: 77 mins, B: 61 mins\nB -> GHY: 151 mins, A: 119 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "374",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 21
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 148 mins, B: 169 mins
A -> GHY: 150 mins, B: 40 mins
B -> GHY: 137 mins, A: 123 mins
Find the most optimal tour.
|
325
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 148 mins, B: 169 mins\nA -> GHY: 150 mins, B: 40 mins\nB -> GHY: 137 mins, A: 123 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "325",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 22
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 132 mins, B: 189 mins
A -> GHY: 116 mins, B: 53 mins
B -> GHY: 168 mins, A: 81 mins
Find the most optimal tour.
|
353
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 132 mins, B: 189 mins\nA -> GHY: 116 mins, B: 53 mins\nB -> GHY: 168 mins, A: 81 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "353",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 23
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 105 mins, B: 178 mins
A -> GHY: 47 mins, B: 148 mins
B -> GHY: 54 mins, A: 68 mins
Find the most optimal tour.
|
293
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 105 mins, B: 178 mins\nA -> GHY: 47 mins, B: 148 mins\nB -> GHY: 54 mins, A: 68 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "293",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 24
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 53 mins, B: 58 mins
A -> GHY: 186 mins, B: 80 mins
B -> GHY: 189 mins, A: 164 mins
Find the most optimal tour.
|
322
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 53 mins, B: 58 mins\nA -> GHY: 186 mins, B: 80 mins\nB -> GHY: 189 mins, A: 164 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "322",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 25
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 44 mins, B: 74 mins
A -> GHY: 180 mins, B: 119 mins
B -> GHY: 66 mins, A: 177 mins
Find the most optimal tour.
|
229
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 44 mins, B: 74 mins\nA -> GHY: 180 mins, B: 119 mins\nB -> GHY: 66 mins, A: 177 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "229",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 26
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 63 mins, B: 125 mins
A -> GHY: 92 mins, B: 154 mins
B -> GHY: 191 mins, A: 117 mins
Find the most optimal tour.
|
334
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 63 mins, B: 125 mins\nA -> GHY: 92 mins, B: 154 mins\nB -> GHY: 191 mins, A: 117 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "334",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 27
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 152 mins, B: 193 mins
A -> GHY: 155 mins, B: 76 mins
B -> GHY: 82 mins, A: 129 mins
Find the most optimal tour.
|
310
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 152 mins, B: 193 mins\nA -> GHY: 155 mins, B: 76 mins\nB -> GHY: 82 mins, A: 129 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "310",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 28
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 184 mins, B: 51 mins
A -> GHY: 104 mins, B: 134 mins
B -> GHY: 73 mins, A: 69 mins
Find the most optimal tour.
|
224
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 184 mins, B: 51 mins\nA -> GHY: 104 mins, B: 134 mins\nB -> GHY: 73 mins, A: 69 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "224",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 29
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 146 mins, B: 177 mins
A -> GHY: 81 mins, B: 106 mins
B -> GHY: 97 mins, A: 89 mins
Find the most optimal tour.
|
347
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 146 mins, B: 177 mins\nA -> GHY: 81 mins, B: 106 mins\nB -> GHY: 97 mins, A: 89 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "347",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 30
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 73 mins, B: 79 mins
A -> GHY: 173 mins, B: 120 mins
B -> GHY: 102 mins, A: 146 mins
Find the most optimal tour.
|
295
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 73 mins, B: 79 mins\nA -> GHY: 173 mins, B: 120 mins\nB -> GHY: 102 mins, A: 146 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "295",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 31
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 156 mins, B: 133 mins
A -> GHY: 54 mins, B: 160 mins
B -> GHY: 181 mins, A: 163 mins
Find the most optimal tour.
|
350
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 156 mins, B: 133 mins\nA -> GHY: 54 mins, B: 160 mins\nB -> GHY: 181 mins, A: 163 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "350",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 32
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 71 mins, B: 45 mins
A -> GHY: 166 mins, B: 161 mins
B -> GHY: 76 mins, A: 101 mins
Find the most optimal tour.
|
308
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 71 mins, B: 45 mins\nA -> GHY: 166 mins, B: 161 mins\nB -> GHY: 76 mins, A: 101 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "308",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 33
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 85 mins, B: 95 mins
A -> GHY: 173 mins, B: 85 mins
B -> GHY: 40 mins, A: 186 mins
Find the most optimal tour.
|
210
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 85 mins, B: 95 mins\nA -> GHY: 173 mins, B: 85 mins\nB -> GHY: 40 mins, A: 186 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "210",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 34
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 64 mins, B: 130 mins
A -> GHY: 87 mins, B: 158 mins
B -> GHY: 62 mins, A: 180 mins
Find the most optimal tour.
|
284
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 64 mins, B: 130 mins\nA -> GHY: 87 mins, B: 158 mins\nB -> GHY: 62 mins, A: 180 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "284",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 35
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 82 mins, B: 82 mins
A -> GHY: 121 mins, B: 162 mins
B -> GHY: 133 mins, A: 109 mins
Find the most optimal tour.
|
312
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 82 mins, B: 82 mins\nA -> GHY: 121 mins, B: 162 mins\nB -> GHY: 133 mins, A: 109 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "312",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 36
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 173 mins, B: 82 mins
A -> GHY: 103 mins, B: 83 mins
B -> GHY: 100 mins, A: 62 mins
Find the most optimal tour.
|
247
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 173 mins, B: 82 mins\nA -> GHY: 103 mins, B: 83 mins\nB -> GHY: 100 mins, A: 62 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "247",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 37
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 112 mins, B: 97 mins
A -> GHY: 108 mins, B: 178 mins
B -> GHY: 63 mins, A: 156 mins
Find the most optimal tour.
|
353
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 112 mins, B: 97 mins\nA -> GHY: 108 mins, B: 178 mins\nB -> GHY: 63 mins, A: 156 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "353",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 38
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 128 mins, B: 57 mins
A -> GHY: 146 mins, B: 151 mins
B -> GHY: 189 mins, A: 100 mins
Find the most optimal tour.
|
303
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 128 mins, B: 57 mins\nA -> GHY: 146 mins, B: 151 mins\nB -> GHY: 189 mins, A: 100 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "303",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 39
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 63 mins, B: 68 mins
A -> GHY: 140 mins, B: 190 mins
B -> GHY: 83 mins, A: 189 mins
Find the most optimal tour.
|
336
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 63 mins, B: 68 mins\nA -> GHY: 140 mins, B: 190 mins\nB -> GHY: 83 mins, A: 189 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "336",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 40
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 101 mins, B: 46 mins
A -> GHY: 154 mins, B: 139 mins
B -> GHY: 66 mins, A: 123 mins
Find the most optimal tour.
|
306
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 101 mins, B: 46 mins\nA -> GHY: 154 mins, B: 139 mins\nB -> GHY: 66 mins, A: 123 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "306",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 41
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 78 mins, B: 137 mins
A -> GHY: 122 mins, B: 83 mins
B -> GHY: 76 mins, A: 103 mins
Find the most optimal tour.
|
237
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 78 mins, B: 137 mins\nA -> GHY: 122 mins, B: 83 mins\nB -> GHY: 76 mins, A: 103 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "237",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 42
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 182 mins, B: 89 mins
A -> GHY: 169 mins, B: 49 mins
B -> GHY: 122 mins, A: 68 mins
Find the most optimal tour.
|
326
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 182 mins, B: 89 mins\nA -> GHY: 169 mins, B: 49 mins\nB -> GHY: 122 mins, A: 68 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "326",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 43
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 78 mins
A -> GHY: 163 mins, B: 176 mins
B -> GHY: 166 mins, A: 59 mins
Find the most optimal tour.
|
300
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 109 mins, B: 78 mins\nA -> GHY: 163 mins, B: 176 mins\nB -> GHY: 166 mins, A: 59 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "300",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 44
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 161 mins, B: 187 mins
A -> GHY: 40 mins, B: 86 mins
B -> GHY: 190 mins, A: 145 mins
Find the most optimal tour.
|
372
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 161 mins, B: 187 mins\nA -> GHY: 40 mins, B: 86 mins\nB -> GHY: 190 mins, A: 145 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "372",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 45
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 192 mins, B: 53 mins
A -> GHY: 129 mins, B: 57 mins
B -> GHY: 192 mins, A: 142 mins
Find the most optimal tour.
|
324
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 192 mins, B: 53 mins\nA -> GHY: 129 mins, B: 57 mins\nB -> GHY: 192 mins, A: 142 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "324",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 46
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 147 mins, B: 75 mins
A -> GHY: 156 mins, B: 170 mins
B -> GHY: 182 mins, A: 75 mins
Find the most optimal tour.
|
306
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 147 mins, B: 75 mins\nA -> GHY: 156 mins, B: 170 mins\nB -> GHY: 182 mins, A: 75 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "306",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 47
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 68 mins, B: 59 mins
A -> GHY: 52 mins, B: 92 mins
B -> GHY: 167 mins, A: 157 mins
Find the most optimal tour.
|
268
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 68 mins, B: 59 mins\nA -> GHY: 52 mins, B: 92 mins\nB -> GHY: 167 mins, A: 157 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "268",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 48
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 57 mins, B: 108 mins
A -> GHY: 107 mins, B: 83 mins
B -> GHY: 124 mins, A: 196 mins
Find the most optimal tour.
|
264
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 57 mins, B: 108 mins\nA -> GHY: 107 mins, B: 83 mins\nB -> GHY: 124 mins, A: 196 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "264",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 49
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 187 mins, B: 86 mins, C: 75 mins
A -> GHY: 65 mins, B: 90 mins, C: 192 mins
B -> GHY: 60 mins, A: 182 mins, C: 122 mins
C -> GHY: 146 mins, A: 69 mins, B: 175 mins
Find the most optimal tour.
|
294
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 187 mins, B: 86 mins, C: 75 mins\nA -> GHY: 65 mins, B: 90 mins, C: 192 mins\nB -> GHY: 60 mins, A: 182 mins, C: 122 mins\nC -> GHY: 146 mins, A: 69 mins, B: 175 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "294",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 50
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 58 mins, B: 145 mins, C: 139 mins
A -> GHY: 184 mins, B: 199 mins, C: 75 mins
B -> GHY: 78 mins, A: 115 mins, C: 69 mins
C -> GHY: 56 mins, A: 176 mins, B: 192 mins
Find the most optimal tour.
|
382
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 58 mins, B: 145 mins, C: 139 mins\nA -> GHY: 184 mins, B: 199 mins, C: 75 mins\nB -> GHY: 78 mins, A: 115 mins, C: 69 mins\nC -> GHY: 56 mins, A: 176 mins, B: 192 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "382",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 51
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 157 mins, B: 181 mins, C: 54 mins
A -> GHY: 199 mins, B: 168 mins, C: 177 mins
B -> GHY: 67 mins, A: 92 mins, C: 192 mins
C -> GHY: 169 mins, A: 176 mins, B: 104 mins
Find the most optimal tour.
|
449
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 157 mins, B: 181 mins, C: 54 mins\nA -> GHY: 199 mins, B: 168 mins, C: 177 mins\nB -> GHY: 67 mins, A: 92 mins, C: 192 mins\nC -> GHY: 169 mins, A: 176 mins, B: 104 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "449",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 52
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 44 mins, B: 158 mins, C: 182 mins
A -> GHY: 160 mins, B: 64 mins, C: 115 mins
B -> GHY: 117 mins, A: 123 mins, C: 193 mins
C -> GHY: 188 mins, A: 184 mins, B: 139 mins
Find the most optimal tour.
|
415
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 44 mins, B: 158 mins, C: 182 mins\nA -> GHY: 160 mins, B: 64 mins, C: 115 mins\nB -> GHY: 117 mins, A: 123 mins, C: 193 mins\nC -> GHY: 188 mins, A: 184 mins, B: 139 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "415",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 53
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 66 mins, B: 53 mins, C: 196 mins
A -> GHY: 171 mins, B: 89 mins, C: 49 mins
B -> GHY: 160 mins, A: 178 mins, C: 116 mins
C -> GHY: 171 mins, A: 140 mins, B: 117 mins
Find the most optimal tour.
|
392
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 66 mins, B: 53 mins, C: 196 mins\nA -> GHY: 171 mins, B: 89 mins, C: 49 mins\nB -> GHY: 160 mins, A: 178 mins, C: 116 mins\nC -> GHY: 171 mins, A: 140 mins, B: 117 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "392",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 54
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 77 mins, C: 56 mins
A -> GHY: 136 mins, B: 104 mins, C: 70 mins
B -> GHY: 57 mins, A: 88 mins, C: 175 mins
C -> GHY: 80 mins, A: 136 mins, B: 132 mins
Find the most optimal tour.
|
315
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 109 mins, B: 77 mins, C: 56 mins\nA -> GHY: 136 mins, B: 104 mins, C: 70 mins\nB -> GHY: 57 mins, A: 88 mins, C: 175 mins\nC -> GHY: 80 mins, A: 136 mins, B: 132 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "315",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 55
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 162 mins, B: 95 mins, C: 54 mins
A -> GHY: 101 mins, B: 41 mins, C: 186 mins
B -> GHY: 114 mins, A: 127 mins, C: 151 mins
C -> GHY: 179 mins, A: 160 mins, B: 64 mins
Find the most optimal tour.
|
346
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 162 mins, B: 95 mins, C: 54 mins\nA -> GHY: 101 mins, B: 41 mins, C: 186 mins\nB -> GHY: 114 mins, A: 127 mins, C: 151 mins\nC -> GHY: 179 mins, A: 160 mins, B: 64 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "346",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 56
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 111 mins, C: 126 mins
A -> GHY: 52 mins, B: 178 mins, C: 49 mins
B -> GHY: 56 mins, A: 128 mins, C: 177 mins
C -> GHY: 196 mins, A: 151 mins, B: 87 mins
Find the most optimal tour.
|
273
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 81 mins, B: 111 mins, C: 126 mins\nA -> GHY: 52 mins, B: 178 mins, C: 49 mins\nB -> GHY: 56 mins, A: 128 mins, C: 177 mins\nC -> GHY: 196 mins, A: 151 mins, B: 87 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "273",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 57
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 45 mins, B: 90 mins, C: 111 mins
A -> GHY: 82 mins, B: 50 mins, C: 146 mins
B -> GHY: 84 mins, A: 55 mins, C: 166 mins
C -> GHY: 76 mins, A: 110 mins, B: 144 mins
Find the most optimal tour.
|
337
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 45 mins, B: 90 mins, C: 111 mins\nA -> GHY: 82 mins, B: 50 mins, C: 146 mins\nB -> GHY: 84 mins, A: 55 mins, C: 166 mins\nC -> GHY: 76 mins, A: 110 mins, B: 144 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "337",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 58
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 120 mins, B: 95 mins, C: 186 mins
A -> GHY: 82 mins, B: 71 mins, C: 143 mins
B -> GHY: 199 mins, A: 68 mins, C: 80 mins
C -> GHY: 168 mins, A: 178 mins, B: 148 mins
Find the most optimal tour.
|
435
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 120 mins, B: 95 mins, C: 186 mins\nA -> GHY: 82 mins, B: 71 mins, C: 143 mins\nB -> GHY: 199 mins, A: 68 mins, C: 80 mins\nC -> GHY: 168 mins, A: 178 mins, B: 148 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "435",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 59
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 126 mins, B: 137 mins, C: 60 mins
A -> GHY: 128 mins, B: 199 mins, C: 110 mins
B -> GHY: 91 mins, A: 114 mins, C: 128 mins
C -> GHY: 88 mins, A: 190 mins, B: 84 mins
Find the most optimal tour.
|
386
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 126 mins, B: 137 mins, C: 60 mins\nA -> GHY: 128 mins, B: 199 mins, C: 110 mins\nB -> GHY: 91 mins, A: 114 mins, C: 128 mins\nC -> GHY: 88 mins, A: 190 mins, B: 84 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "386",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 60
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 124 mins, B: 137 mins, C: 144 mins
A -> GHY: 51 mins, B: 97 mins, C: 157 mins
B -> GHY: 176 mins, A: 112 mins, C: 168 mins
C -> GHY: 183 mins, A: 95 mins, B: 190 mins
Find the most optimal tour.
|
451
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 124 mins, B: 137 mins, C: 144 mins\nA -> GHY: 51 mins, B: 97 mins, C: 157 mins\nB -> GHY: 176 mins, A: 112 mins, C: 168 mins\nC -> GHY: 183 mins, A: 95 mins, B: 190 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "451",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 61
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 173 mins, B: 128 mins, C: 122 mins
A -> GHY: 138 mins, B: 127 mins, C: 78 mins
B -> GHY: 196 mins, A: 133 mins, C: 176 mins
C -> GHY: 169 mins, A: 169 mins, B: 113 mins
Find the most optimal tour.
|
506
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 173 mins, B: 128 mins, C: 122 mins\nA -> GHY: 138 mins, B: 127 mins, C: 78 mins\nB -> GHY: 196 mins, A: 133 mins, C: 176 mins\nC -> GHY: 169 mins, A: 169 mins, B: 113 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "506",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 62
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 72 mins, B: 180 mins, C: 103 mins
A -> GHY: 121 mins, B: 137 mins, C: 68 mins
B -> GHY: 61 mins, A: 51 mins, C: 80 mins
C -> GHY: 122 mins, A: 138 mins, B: 142 mins
Find the most optimal tour.
|
343
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 72 mins, B: 180 mins, C: 103 mins\nA -> GHY: 121 mins, B: 137 mins, C: 68 mins\nB -> GHY: 61 mins, A: 51 mins, C: 80 mins\nC -> GHY: 122 mins, A: 138 mins, B: 142 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "343",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 63
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 98 mins, B: 46 mins, C: 94 mins
A -> GHY: 189 mins, B: 159 mins, C: 109 mins
B -> GHY: 150 mins, A: 189 mins, C: 81 mins
C -> GHY: 197 mins, A: 132 mins, B: 109 mins
Find the most optimal tour.
|
448
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 98 mins, B: 46 mins, C: 94 mins\nA -> GHY: 189 mins, B: 159 mins, C: 109 mins\nB -> GHY: 150 mins, A: 189 mins, C: 81 mins\nC -> GHY: 197 mins, A: 132 mins, B: 109 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "448",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 64
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 111 mins, B: 126 mins, C: 149 mins
A -> GHY: 182 mins, B: 198 mins, C: 118 mins
B -> GHY: 48 mins, A: 92 mins, C: 150 mins
C -> GHY: 190 mins, A: 130 mins, B: 71 mins
Find the most optimal tour.
|
348
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 111 mins, B: 126 mins, C: 149 mins\nA -> GHY: 182 mins, B: 198 mins, C: 118 mins\nB -> GHY: 48 mins, A: 92 mins, C: 150 mins\nC -> GHY: 190 mins, A: 130 mins, B: 71 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "348",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 65
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 89 mins, B: 51 mins, C: 44 mins
A -> GHY: 177 mins, B: 197 mins, C: 197 mins
B -> GHY: 111 mins, A: 125 mins, C: 180 mins
C -> GHY: 160 mins, A: 167 mins, B: 106 mins
Find the most optimal tour.
|
452
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 89 mins, B: 51 mins, C: 44 mins\nA -> GHY: 177 mins, B: 197 mins, C: 197 mins\nB -> GHY: 111 mins, A: 125 mins, C: 180 mins\nC -> GHY: 160 mins, A: 167 mins, B: 106 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "452",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 66
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 134 mins, B: 53 mins, C: 103 mins
A -> GHY: 132 mins, B: 98 mins, C: 41 mins
B -> GHY: 89 mins, A: 91 mins, C: 50 mins
C -> GHY: 113 mins, A: 123 mins, B: 153 mins
Find the most optimal tour.
|
298
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 134 mins, B: 53 mins, C: 103 mins\nA -> GHY: 132 mins, B: 98 mins, C: 41 mins\nB -> GHY: 89 mins, A: 91 mins, C: 50 mins\nC -> GHY: 113 mins, A: 123 mins, B: 153 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "298",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 67
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 157 mins, B: 48 mins, C: 73 mins
A -> GHY: 190 mins, B: 145 mins, C: 124 mins
B -> GHY: 124 mins, A: 111 mins, C: 115 mins
C -> GHY: 88 mins, A: 112 mins, B: 94 mins
Find the most optimal tour.
|
371
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 157 mins, B: 48 mins, C: 73 mins\nA -> GHY: 190 mins, B: 145 mins, C: 124 mins\nB -> GHY: 124 mins, A: 111 mins, C: 115 mins\nC -> GHY: 88 mins, A: 112 mins, B: 94 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "371",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 68
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 90 mins, B: 76 mins, C: 47 mins
A -> GHY: 180 mins, B: 136 mins, C: 151 mins
B -> GHY: 132 mins, A: 178 mins, C: 71 mins
C -> GHY: 180 mins, A: 87 mins, B: 69 mins
Find the most optimal tour.
|
402
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 90 mins, B: 76 mins, C: 47 mins\nA -> GHY: 180 mins, B: 136 mins, C: 151 mins\nB -> GHY: 132 mins, A: 178 mins, C: 71 mins\nC -> GHY: 180 mins, A: 87 mins, B: 69 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "402",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 69
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 46 mins, B: 185 mins, C: 133 mins
A -> GHY: 69 mins, B: 122 mins, C: 64 mins
B -> GHY: 88 mins, A: 181 mins, C: 52 mins
C -> GHY: 147 mins, A: 188 mins, B: 109 mins
Find the most optimal tour.
|
307
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 46 mins, B: 185 mins, C: 133 mins\nA -> GHY: 69 mins, B: 122 mins, C: 64 mins\nB -> GHY: 88 mins, A: 181 mins, C: 52 mins\nC -> GHY: 147 mins, A: 188 mins, B: 109 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "307",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 70
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 160 mins, B: 80 mins, C: 139 mins
A -> GHY: 196 mins, B: 106 mins, C: 143 mins
B -> GHY: 54 mins, A: 126 mins, C: 100 mins
C -> GHY: 125 mins, A: 48 mins, B: 198 mins
Find the most optimal tour.
|
347
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 160 mins, B: 80 mins, C: 139 mins\nA -> GHY: 196 mins, B: 106 mins, C: 143 mins\nB -> GHY: 54 mins, A: 126 mins, C: 100 mins\nC -> GHY: 125 mins, A: 48 mins, B: 198 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "347",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 71
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 95 mins, B: 183 mins, C: 111 mins
A -> GHY: 132 mins, B: 43 mins, C: 102 mins
B -> GHY: 61 mins, A: 156 mins, C: 119 mins
C -> GHY: 96 mins, A: 91 mins, B: 62 mins
Find the most optimal tour.
|
306
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 95 mins, B: 183 mins, C: 111 mins\nA -> GHY: 132 mins, B: 43 mins, C: 102 mins\nB -> GHY: 61 mins, A: 156 mins, C: 119 mins\nC -> GHY: 96 mins, A: 91 mins, B: 62 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "306",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 72
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 176 mins, B: 184 mins, C: 189 mins
A -> GHY: 166 mins, B: 75 mins, C: 88 mins
B -> GHY: 138 mins, A: 48 mins, C: 78 mins
C -> GHY: 148 mins, A: 138 mins, B: 88 mins
Find the most optimal tour.
|
468
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 176 mins, B: 184 mins, C: 189 mins\nA -> GHY: 166 mins, B: 75 mins, C: 88 mins\nB -> GHY: 138 mins, A: 48 mins, C: 78 mins\nC -> GHY: 148 mins, A: 138 mins, B: 88 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "468",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 73
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 155 mins, B: 155 mins, C: 192 mins
A -> GHY: 171 mins, B: 134 mins, C: 170 mins
B -> GHY: 122 mins, A: 148 mins, C: 133 mins
C -> GHY: 132 mins, A: 136 mins, B: 117 mins
Find the most optimal tour.
|
554
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 155 mins, B: 155 mins, C: 192 mins\nA -> GHY: 171 mins, B: 134 mins, C: 170 mins\nB -> GHY: 122 mins, A: 148 mins, C: 133 mins\nC -> GHY: 132 mins, A: 136 mins, B: 117 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "554",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 74
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 82 mins, B: 69 mins, C: 177 mins
A -> GHY: 163 mins, B: 85 mins, C: 89 mins
B -> GHY: 147 mins, A: 61 mins, C: 45 mins
C -> GHY: 59 mins, A: 66 mins, B: 128 mins
Find the most optimal tour.
|
271
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 82 mins, B: 69 mins, C: 177 mins\nA -> GHY: 163 mins, B: 85 mins, C: 89 mins\nB -> GHY: 147 mins, A: 61 mins, C: 45 mins\nC -> GHY: 59 mins, A: 66 mins, B: 128 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "271",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 75
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 115 mins, B: 53 mins, C: 98 mins
A -> GHY: 96 mins, B: 106 mins, C: 59 mins
B -> GHY: 149 mins, A: 155 mins, C: 197 mins
C -> GHY: 127 mins, A: 179 mins, B: 85 mins
Find the most optimal tour.
|
394
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 115 mins, B: 53 mins, C: 98 mins\nA -> GHY: 96 mins, B: 106 mins, C: 59 mins\nB -> GHY: 149 mins, A: 155 mins, C: 197 mins\nC -> GHY: 127 mins, A: 179 mins, B: 85 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "394",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 76
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 184 mins, B: 136 mins, C: 78 mins
A -> GHY: 43 mins, B: 50 mins, C: 61 mins
B -> GHY: 143 mins, A: 127 mins, C: 151 mins
C -> GHY: 73 mins, A: 170 mins, B: 43 mins
Find the most optimal tour.
|
291
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 184 mins, B: 136 mins, C: 78 mins\nA -> GHY: 43 mins, B: 50 mins, C: 61 mins\nB -> GHY: 143 mins, A: 127 mins, C: 151 mins\nC -> GHY: 73 mins, A: 170 mins, B: 43 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "291",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 77
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 109 mins, B: 162 mins, C: 93 mins
A -> GHY: 52 mins, B: 154 mins, C: 51 mins
B -> GHY: 106 mins, A: 90 mins, C: 85 mins
C -> GHY: 47 mins, A: 75 mins, B: 87 mins
Find the most optimal tour.
|
322
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 109 mins, B: 162 mins, C: 93 mins\nA -> GHY: 52 mins, B: 154 mins, C: 51 mins\nB -> GHY: 106 mins, A: 90 mins, C: 85 mins\nC -> GHY: 47 mins, A: 75 mins, B: 87 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "322",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 78
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 52 mins, B: 159 mins, C: 189 mins
A -> GHY: 128 mins, B: 71 mins, C: 93 mins
B -> GHY: 49 mins, A: 186 mins, C: 187 mins
C -> GHY: 67 mins, A: 100 mins, B: 163 mins
Find the most optimal tour.
|
357
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 52 mins, B: 159 mins, C: 189 mins\nA -> GHY: 128 mins, B: 71 mins, C: 93 mins\nB -> GHY: 49 mins, A: 186 mins, C: 187 mins\nC -> GHY: 67 mins, A: 100 mins, B: 163 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "357",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 79
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 176 mins, B: 83 mins, C: 93 mins
A -> GHY: 61 mins, B: 101 mins, C: 53 mins
B -> GHY: 72 mins, A: 87 mins, C: 109 mins
C -> GHY: 58 mins, A: 185 mins, B: 182 mins
Find the most optimal tour.
|
281
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 176 mins, B: 83 mins, C: 93 mins\nA -> GHY: 61 mins, B: 101 mins, C: 53 mins\nB -> GHY: 72 mins, A: 87 mins, C: 109 mins\nC -> GHY: 58 mins, A: 185 mins, B: 182 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "281",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 80
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 108 mins, B: 67 mins, C: 173 mins
A -> GHY: 89 mins, B: 167 mins, C: 49 mins
B -> GHY: 106 mins, A: 198 mins, C: 159 mins
C -> GHY: 51 mins, A: 100 mins, B: 112 mins
Find the most optimal tour.
|
365
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 108 mins, B: 67 mins, C: 173 mins\nA -> GHY: 89 mins, B: 167 mins, C: 49 mins\nB -> GHY: 106 mins, A: 198 mins, C: 159 mins\nC -> GHY: 51 mins, A: 100 mins, B: 112 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "365",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 81
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 107 mins, B: 52 mins, C: 92 mins
A -> GHY: 164 mins, B: 188 mins, C: 134 mins
B -> GHY: 195 mins, A: 189 mins, C: 58 mins
C -> GHY: 77 mins, A: 144 mins, B: 143 mins
Find the most optimal tour.
|
418
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 107 mins, B: 52 mins, C: 92 mins\nA -> GHY: 164 mins, B: 188 mins, C: 134 mins\nB -> GHY: 195 mins, A: 189 mins, C: 58 mins\nC -> GHY: 77 mins, A: 144 mins, B: 143 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "418",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 82
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 51 mins, B: 177 mins, C: 136 mins
A -> GHY: 164 mins, B: 196 mins, C: 94 mins
B -> GHY: 190 mins, A: 66 mins, C: 132 mins
C -> GHY: 91 mins, A: 128 mins, B: 123 mins
Find the most optimal tour.
|
428
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 51 mins, B: 177 mins, C: 136 mins\nA -> GHY: 164 mins, B: 196 mins, C: 94 mins\nB -> GHY: 190 mins, A: 66 mins, C: 132 mins\nC -> GHY: 91 mins, A: 128 mins, B: 123 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "428",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 83
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 179 mins, B: 105 mins, C: 190 mins
A -> GHY: 52 mins, B: 88 mins, C: 161 mins
B -> GHY: 58 mins, A: 60 mins, C: 152 mins
C -> GHY: 58 mins, A: 185 mins, B: 182 mins
Find the most optimal tour.
|
384
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 179 mins, B: 105 mins, C: 190 mins\nA -> GHY: 52 mins, B: 88 mins, C: 161 mins\nB -> GHY: 58 mins, A: 60 mins, C: 152 mins\nC -> GHY: 58 mins, A: 185 mins, B: 182 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "384",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 84
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 152 mins, B: 131 mins, C: 161 mins
A -> GHY: 120 mins, B: 68 mins, C: 78 mins
B -> GHY: 45 mins, A: 46 mins, C: 70 mins
C -> GHY: 88 mins, A: 101 mins, B: 141 mins
Find the most optimal tour.
|
343
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 152 mins, B: 131 mins, C: 161 mins\nA -> GHY: 120 mins, B: 68 mins, C: 78 mins\nB -> GHY: 45 mins, A: 46 mins, C: 70 mins\nC -> GHY: 88 mins, A: 101 mins, B: 141 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "343",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 85
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 199 mins, B: 45 mins, C: 97 mins
A -> GHY: 67 mins, B: 111 mins, C: 86 mins
B -> GHY: 50 mins, A: 154 mins, C: 123 mins
C -> GHY: 195 mins, A: 67 mins, B: 89 mins
Find the most optimal tour.
|
302
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 199 mins, B: 45 mins, C: 97 mins\nA -> GHY: 67 mins, B: 111 mins, C: 86 mins\nB -> GHY: 50 mins, A: 154 mins, C: 123 mins\nC -> GHY: 195 mins, A: 67 mins, B: 89 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "302",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 86
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 192 mins, B: 122 mins, C: 96 mins
A -> GHY: 174 mins, B: 79 mins, C: 65 mins
B -> GHY: 105 mins, A: 115 mins, C: 120 mins
C -> GHY: 93 mins, A: 76 mins, B: 64 mins
Find the most optimal tour.
|
356
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 192 mins, B: 122 mins, C: 96 mins\nA -> GHY: 174 mins, B: 79 mins, C: 65 mins\nB -> GHY: 105 mins, A: 115 mins, C: 120 mins\nC -> GHY: 93 mins, A: 76 mins, B: 64 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "356",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 87
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 118 mins, B: 174 mins, C: 96 mins
A -> GHY: 130 mins, B: 187 mins, C: 178 mins
B -> GHY: 72 mins, A: 69 mins, C: 104 mins
C -> GHY: 190 mins, A: 185 mins, B: 107 mins
Find the most optimal tour.
|
402
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 118 mins, B: 174 mins, C: 96 mins\nA -> GHY: 130 mins, B: 187 mins, C: 178 mins\nB -> GHY: 72 mins, A: 69 mins, C: 104 mins\nC -> GHY: 190 mins, A: 185 mins, B: 107 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "402",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 88
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 78 mins, B: 121 mins, C: 157 mins
A -> GHY: 181 mins, B: 42 mins, C: 174 mins
B -> GHY: 145 mins, A: 118 mins, C: 184 mins
C -> GHY: 61 mins, A: 150 mins, B: 115 mins
Find the most optimal tour.
|
365
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 78 mins, B: 121 mins, C: 157 mins\nA -> GHY: 181 mins, B: 42 mins, C: 174 mins\nB -> GHY: 145 mins, A: 118 mins, C: 184 mins\nC -> GHY: 61 mins, A: 150 mins, B: 115 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "365",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 89
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 146 mins, B: 99 mins, C: 172 mins
A -> GHY: 92 mins, B: 50 mins, C: 45 mins
B -> GHY: 124 mins, A: 62 mins, C: 121 mins
C -> GHY: 166 mins, A: 162 mins, B: 132 mins
Find the most optimal tour.
|
372
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 146 mins, B: 99 mins, C: 172 mins\nA -> GHY: 92 mins, B: 50 mins, C: 45 mins\nB -> GHY: 124 mins, A: 62 mins, C: 121 mins\nC -> GHY: 166 mins, A: 162 mins, B: 132 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "372",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 90
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 165 mins, B: 157 mins, C: 63 mins
A -> GHY: 169 mins, B: 198 mins, C: 61 mins
B -> GHY: 61 mins, A: 104 mins, C: 192 mins
C -> GHY: 147 mins, A: 128 mins, B: 191 mins
Find the most optimal tour.
|
450
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 165 mins, B: 157 mins, C: 63 mins\nA -> GHY: 169 mins, B: 198 mins, C: 61 mins\nB -> GHY: 61 mins, A: 104 mins, C: 192 mins\nC -> GHY: 147 mins, A: 128 mins, B: 191 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "450",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 91
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 108 mins, B: 130 mins, C: 47 mins
A -> GHY: 156 mins, B: 49 mins, C: 159 mins
B -> GHY: 47 mins, A: 178 mins, C: 107 mins
C -> GHY: 55 mins, A: 126 mins, B: 187 mins
Find the most optimal tour.
|
269
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 108 mins, B: 130 mins, C: 47 mins\nA -> GHY: 156 mins, B: 49 mins, C: 159 mins\nB -> GHY: 47 mins, A: 178 mins, C: 107 mins\nC -> GHY: 55 mins, A: 126 mins, B: 187 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "269",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 92
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 126 mins, B: 158 mins, C: 159 mins
A -> GHY: 144 mins, B: 181 mins, C: 152 mins
B -> GHY: 42 mins, A: 191 mins, C: 54 mins
C -> GHY: 56 mins, A: 176 mins, B: 160 mins
Find the most optimal tour.
|
417
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 126 mins, B: 158 mins, C: 159 mins\nA -> GHY: 144 mins, B: 181 mins, C: 152 mins\nB -> GHY: 42 mins, A: 191 mins, C: 54 mins\nC -> GHY: 56 mins, A: 176 mins, B: 160 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "417",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 93
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 80 mins, B: 79 mins, C: 74 mins
A -> GHY: 190 mins, B: 107 mins, C: 188 mins
B -> GHY: 89 mins, A: 93 mins, C: 102 mins
C -> GHY: 166 mins, A: 132 mins, B: 173 mins
Find the most optimal tour.
|
402
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 80 mins, B: 79 mins, C: 74 mins\nA -> GHY: 190 mins, B: 107 mins, C: 188 mins\nB -> GHY: 89 mins, A: 93 mins, C: 102 mins\nC -> GHY: 166 mins, A: 132 mins, B: 173 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "402",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 94
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 139 mins, B: 134 mins, C: 176 mins
A -> GHY: 106 mins, B: 195 mins, C: 79 mins
B -> GHY: 73 mins, A: 113 mins, C: 74 mins
C -> GHY: 149 mins, A: 111 mins, B: 61 mins
Find the most optimal tour.
|
352
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 139 mins, B: 134 mins, C: 176 mins\nA -> GHY: 106 mins, B: 195 mins, C: 79 mins\nB -> GHY: 73 mins, A: 113 mins, C: 74 mins\nC -> GHY: 149 mins, A: 111 mins, B: 61 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "352",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 95
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 81 mins, B: 77 mins, C: 89 mins
A -> GHY: 133 mins, B: 55 mins, C: 182 mins
B -> GHY: 106 mins, A: 193 mins, C: 90 mins
C -> GHY: 116 mins, A: 131 mins, B: 89 mins
Find the most optimal tour.
|
342
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 81 mins, B: 77 mins, C: 89 mins\nA -> GHY: 133 mins, B: 55 mins, C: 182 mins\nB -> GHY: 106 mins, A: 193 mins, C: 90 mins\nC -> GHY: 116 mins, A: 131 mins, B: 89 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "342",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 96
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 139 mins, B: 127 mins, C: 93 mins
A -> GHY: 56 mins, B: 80 mins, C: 180 mins
B -> GHY: 110 mins, A: 91 mins, C: 68 mins
C -> GHY: 132 mins, A: 199 mins, B: 183 mins
Find the most optimal tour.
|
419
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 139 mins, B: 127 mins, C: 93 mins\nA -> GHY: 56 mins, B: 80 mins, C: 180 mins\nB -> GHY: 110 mins, A: 91 mins, C: 68 mins\nC -> GHY: 132 mins, A: 199 mins, B: 183 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "419",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 97
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 189 mins, B: 86 mins, C: 152 mins
A -> GHY: 154 mins, B: 186 mins, C: 182 mins
B -> GHY: 129 mins, A: 69 mins, C: 178 mins
C -> GHY: 118 mins, A: 122 mins, B: 191 mins
Find the most optimal tour.
|
455
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 189 mins, B: 86 mins, C: 152 mins\nA -> GHY: 154 mins, B: 186 mins, C: 182 mins\nB -> GHY: 129 mins, A: 69 mins, C: 178 mins\nC -> GHY: 118 mins, A: 122 mins, B: 191 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "455",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 98
}
|
A helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:
GHY -> A: 143 mins, B: 127 mins, C: 44 mins
A -> GHY: 173 mins, B: 168 mins, C: 57 mins
B -> GHY: 163 mins, A: 91 mins, C: 151 mins
C -> GHY: 70 mins, A: 134 mins, B: 51 mins
Find the most optimal tour.
|
345
|
math_dapo
|
[
{
"content": "Solve the following problem step by step. The last line of your response should be of the form 'Answer: ...'. Remember to put your answer on its own line after 'Answer:'.\n\nA helicopter must start and end at GHY and visit the remaining cities exactly once. The flying times (in minutes) between the cities are:\nGHY -> A: 143 mins, B: 127 mins, C: 44 mins\nA -> GHY: 173 mins, B: 168 mins, C: 57 mins\nB -> GHY: 163 mins, A: 91 mins, C: 151 mins\nC -> GHY: 70 mins, A: 134 mins, B: 51 mins\nFind the most optimal tour.",
"role": "user"
}
] |
MATH
|
{
"ground_truth": "345",
"style": "rule-lighteval/MATH_v2"
}
|
{
"index": 99
}
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 7