question stringlengths 42 584 | image stringclasses 1
value | choices listlengths 0 0 | unit stringclasses 1
value | precision int64 0 0 | answer stringlengths 3 571 | question_type stringclasses 1
value | answer_type stringclasses 2
values | pid stringlengths 10 10 | query stringlengths 42 584 | metadata stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
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. | [] | none | 0 | 347 | free_form | integer | DAPO_00000 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 308 | free_form | integer | DAPO_00001 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 376 | free_form | integer | DAPO_00002 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 361 | free_form | integer | DAPO_00003 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 373 | free_form | integer | DAPO_00004 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 322 | free_form | integer | DAPO_00005 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 346 | free_form | integer | DAPO_00006 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 343 | free_form | integer | DAPO_00007 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 192 | free_form | integer | DAPO_00008 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 276 | free_form | integer | DAPO_00009 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 265 | free_form | integer | DAPO_00010 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 347 | free_form | integer | DAPO_00011 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 300 | free_form | integer | DAPO_00012 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 373 | free_form | integer | DAPO_00013 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 339 | free_form | integer | DAPO_00014 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 296 | free_form | integer | DAPO_00015 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 362 | free_form | integer | DAPO_00016 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 312 | free_form | integer | DAPO_00017 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 370 | free_form | integer | DAPO_00018 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 291 | free_form | integer | DAPO_00019 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 322 | free_form | integer | DAPO_00020 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 374 | free_form | integer | DAPO_00021 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 325 | free_form | integer | DAPO_00022 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 353 | free_form | integer | DAPO_00023 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 293 | free_form | integer | DAPO_00024 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 322 | free_form | integer | DAPO_00025 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 229 | free_form | integer | DAPO_00026 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 334 | free_form | integer | DAPO_00027 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 310 | free_form | integer | DAPO_00028 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 224 | free_form | integer | DAPO_00029 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 347 | free_form | integer | DAPO_00030 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 295 | free_form | integer | DAPO_00031 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 350 | free_form | integer | DAPO_00032 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 308 | free_form | integer | DAPO_00033 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 210 | free_form | integer | DAPO_00034 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 284 | free_form | integer | DAPO_00035 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 312 | free_form | integer | DAPO_00036 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 247 | free_form | integer | DAPO_00037 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 353 | free_form | integer | DAPO_00038 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 303 | free_form | integer | DAPO_00039 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 336 | free_form | integer | DAPO_00040 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 306 | free_form | integer | DAPO_00041 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 237 | free_form | integer | DAPO_00042 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 326 | free_form | integer | DAPO_00043 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 300 | free_form | integer | DAPO_00044 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 372 | free_form | integer | DAPO_00045 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 324 | free_form | integer | DAPO_00046 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 306 | free_form | integer | DAPO_00047 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 268 | free_form | integer | DAPO_00048 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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. | [] | none | 0 | 264 | free_form | integer | DAPO_00049 | 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. | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 294 | free_form | integer | DAPO_00050 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 382 | free_form | integer | DAPO_00051 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 449 | free_form | integer | DAPO_00052 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 415 | free_form | integer | DAPO_00053 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 392 | free_form | integer | DAPO_00054 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 315 | free_form | integer | DAPO_00055 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 346 | free_form | integer | DAPO_00056 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 273 | free_form | integer | DAPO_00057 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 337 | free_form | integer | DAPO_00058 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 435 | free_form | integer | DAPO_00059 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 386 | free_form | integer | DAPO_00060 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 451 | free_form | integer | DAPO_00061 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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
Fin... | [] | none | 0 | 506 | free_form | integer | DAPO_00062 | 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
Fin... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 343 | free_form | integer | DAPO_00063 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 448 | free_form | integer | DAPO_00064 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 348 | free_form | integer | DAPO_00065 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 452 | free_form | integer | DAPO_00066 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 298 | free_form | integer | DAPO_00067 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 371 | free_form | integer | DAPO_00068 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 402 | free_form | integer | DAPO_00069 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 307 | free_form | integer | DAPO_00070 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 347 | free_form | integer | DAPO_00071 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 306 | free_form | integer | DAPO_00072 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 468 | free_form | integer | DAPO_00073 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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
Fi... | [] | none | 0 | 554 | free_form | integer | DAPO_00074 | 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
Fi... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 m... | [] | none | 0 | 271 | free_form | integer | DAPO_00075 | 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 m... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 394 | free_form | integer | DAPO_00076 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 291 | free_form | integer | DAPO_00077 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 m... | [] | none | 0 | 322 | free_form | integer | DAPO_00078 | 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 m... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 357 | free_form | integer | DAPO_00079 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 281 | free_form | integer | DAPO_00080 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 365 | free_form | integer | DAPO_00081 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 418 | free_form | integer | DAPO_00082 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 428 | free_form | integer | DAPO_00083 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 384 | free_form | integer | DAPO_00084 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 343 | free_form | integer | DAPO_00085 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 302 | free_form | integer | DAPO_00086 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 356 | free_form | integer | DAPO_00087 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 402 | free_form | integer | DAPO_00088 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 365 | free_form | integer | DAPO_00089 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 372 | free_form | integer | DAPO_00090 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 450 | free_form | integer | DAPO_00091 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 269 | free_form | integer | DAPO_00092 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 ... | [] | none | 0 | 417 | free_form | integer | DAPO_00093 | 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 ... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 402 | free_form | integer | DAPO_00094 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 t... | [] | none | 0 | 352 | free_form | integer | DAPO_00095 | 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 t... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 342 | free_form | integer | DAPO_00096 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 419 | free_form | integer | DAPO_00097 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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... | [] | none | 0 | 455 | free_form | integer | DAPO_00098 | 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... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... | |
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 th... | [] | none | 0 | 345 | free_form | integer | DAPO_00099 | 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 th... | {"split": "testmini", "language": "English", "img_width": 0, "img_height": 0, "source": "Custom-DAPO-OR", "category": "math-targeted-vqa", "task_type": "route optimization / TSP", "visual_context_type": "none", "grade": "college", "reasoning_skills": ["combinatorial optimization", "TSP", "arithmetic"], "reward_style": ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.