data_source stringclasses 104
values | prompt listlengths 1 1 | reward_model dict | question stringlengths 82 6.87k | solution stringlengths 1 5.65k | answer stringlengths 1 5.65k |
|---|---|---|---|---|---|
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the smallest number of the following candidates: 438,938,236.688 438,938,232.647 438938244.485000\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside... | {
"ground_truth": "438938232.647",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the smallest number of the following candidates: 438,938,236.688 438,938,232.647 438938244.485000
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 438938232.647 | 438938232.647 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the largest number of the following candidates: 9.878832144809999e+08 987,883,208.4059999\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed... | {
"ground_truth": "987883214.481",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the largest number of the following candidates: 9.878832144809999e+08 987,883,208.4059999
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 987883214.481 | 987883214.481 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the largest number of the following candidates: 4.736724145390000e+08 473,672,415.005\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.... | {
"ground_truth": "473672415.005",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the largest number of the following candidates: 4.736724145390000e+08 473,672,415.005
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 473672415.005 | 473672415.005 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the smallest number of the following candidates: 367752845.947000 3.677528480530000e+08\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.... | {
"ground_truth": "367752845.947",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the smallest number of the following candidates: 367752845.947000 3.677528480530000e+08
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 367752845.947 | 367752845.947 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the smallest number of the following candidates: 205724793.257000 205724796.096000 205,724,802.187\n\nWrite your final answer after 'FINAL ANSWER: ' tag insid... | {
"ground_truth": "205724793.257",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the smallest number of the following candidates: 205724793.257000 205724796.096000 205,724,802.187
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 205724793.257 | 205724793.257 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the largest number of the following candidates: 84610222.238000 84,610,225.24900001 8.461022142800000e+07\n\nWrite your final answer after 'FINAL ANSWER: ' ta... | {
"ground_truth": "84610225.24900001",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the largest number of the following candidates: 84610222.238000 84,610,225.24900001 8.461022142800000e+07
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 84610225.24900001 | 84610225.24900001 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the largest number of the following candidates: 283,421,574.202 283421567.285000 283421568.795000 2.834215738720000e+08\n\nWrite your final answer after 'FINA... | {
"ground_truth": "283421574.202",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the largest number of the following candidates: 283,421,574.202 283421567.285000 283421568.795000 2.834215738720000e+08
Write your final answer after 'FINAL ANSWER: ' tag inside \boxe... | 283421574.202 | 283421574.202 |
number_format | [
{
"content": "Your task is to pick the largest/smallest number out of several options.\n\nYour output should be only the number of interest.\n\nNow, pick the smallest number of the following candidates: 181706006.723000 181,706,001.058 181,706,014.864 181,706,002.59 181706012.803000\n\nWrite your final answer a... | {
"ground_truth": "181706001.058",
"style": "rule-lighteval/MATH_v2"
} | Your task is to pick the largest/smallest number out of several options.
Your output should be only the number of interest.
Now, pick the smallest number of the following candidates: 181706006.723000 181,706,001.058 181,706,014.864 181,706,002.59 181706012.803000
Write your final answer after 'FINAL ANSWER: ' tag in... | 181706001.058 | 181706001.058 |
number_sequence | [
{
"content": "3, 6, 12, 24, 48, 96, 192, 384, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "768",
"style": "rule-lighteval/MATH_v2"
} | 3, 6, 12, 24, 48, 96, 192, 384, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 768 | 768 |
number_sequence | [
{
"content": "8, 14, 20, 26, 32, 38, 44, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "50",
"style": "rule-lighteval/MATH_v2"
} | 8, 14, 20, 26, 32, 38, 44, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 50 | 50 |
number_sequence | [
{
"content": "8, 4, 2, 1, 0, 0, 0, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "0",
"style": "rule-lighteval/MATH_v2"
} | 8, 4, 2, 1, 0, 0, 0, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 0 | 0 |
number_sequence | [
{
"content": "-6, 15, -6, 15, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-6",
"style": "rule-lighteval/MATH_v2"
} | -6, 15, -6, 15, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -6 | -6 |
number_sequence | [
{
"content": "10, 2, -6, -14, -22, -30, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-38",
"style": "rule-lighteval/MATH_v2"
} | 10, 2, -6, -14, -22, -30, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -38 | -38 |
number_sequence | [
{
"content": "9, 4, 6, 5, 5, 5, 5, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "5",
"style": "rule-lighteval/MATH_v2"
} | 9, 4, 6, 5, 5, 5, 5, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 5 | 5 |
number_sequence | [
{
"content": "-8, -16, -32, -64, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-128",
"style": "rule-lighteval/MATH_v2"
} | -8, -16, -32, -64, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -128 | -128 |
number_sequence | [
{
"content": "4, 2, 1, 0, 0, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "0",
"style": "rule-lighteval/MATH_v2"
} | 4, 2, 1, 0, 0, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 0 | 0 |
number_sequence | [
{
"content": "7, 7, 14, 21, 35, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "56",
"style": "rule-lighteval/MATH_v2"
} | 7, 7, 14, 21, 35, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 56 | 56 |
number_sequence | [
{
"content": "7, 14, 28, 56, 112, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "224",
"style": "rule-lighteval/MATH_v2"
} | 7, 14, 28, 56, 112, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 224 | 224 |
number_sequence | [
{
"content": "10, 10, 20, 30, 50, 80, 130, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "210",
"style": "rule-lighteval/MATH_v2"
} | 10, 10, 20, 30, 50, 80, 130, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 210 | 210 |
number_sequence | [
{
"content": "-4, -6, -10, -18, -34, -66, -130, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-258",
"style": "rule-lighteval/MATH_v2"
} | -4, -6, -10, -18, -34, -66, -130, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -258 | -258 |
number_sequence | [
{
"content": "2, 1, 0, 0, 0, 0, 0, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "0",
"style": "rule-lighteval/MATH_v2"
} | 2, 1, 0, 0, 0, 0, 0, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 0 | 0 |
number_sequence | [
{
"content": "1, 0, 0, 0, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "0",
"style": "rule-lighteval/MATH_v2"
} | 1, 0, 0, 0, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 0 | 0 |
number_sequence | [
{
"content": "8, 16, 32, 64, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "128",
"style": "rule-lighteval/MATH_v2"
} | 8, 16, 32, 64, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 128 | 128 |
number_sequence | [
{
"content": "-1, -4, -8, -15, -26, -44, -73, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-120",
"style": "rule-lighteval/MATH_v2"
} | -1, -4, -8, -15, -26, -44, -73, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -120 | -120 |
number_sequence | [
{
"content": "9, 2, 2, 1, 0, 0, 0, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "0",
"style": "rule-lighteval/MATH_v2"
} | 9, 2, 2, 1, 0, 0, 0, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 0 | 0 |
number_sequence | [
{
"content": "5, 19, 33, 47, 61, 75, 89, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "103",
"style": "rule-lighteval/MATH_v2"
} | 5, 19, 33, 47, 61, 75, 89, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 103 | 103 |
number_sequence | [
{
"content": "-6, -14, -28, -50, -86, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-144",
"style": "rule-lighteval/MATH_v2"
} | -6, -14, -28, -50, -86, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -144 | -144 |
number_sequence | [
{
"content": "-1, -2, -4, -8, -16, -32, ?\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-64",
"style": "rule-lighteval/MATH_v2"
} | -1, -2, -4, -8, -16, -32, ?
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -64 | -64 |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -95.0, -51.0, 47.29, 48.13\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert ... | {
"ground_truth": "['-95.0', '-51.0', '47.29', '48.13']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -95.0, -51.0, 47.29, 48.13
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square... | ['-95.0', '-51.0', '47.29', '48.13'] | ['-95.0', '-51.0', '47.29', '48.13'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -43.0, 91.9, 34.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert all numb... | {
"ground_truth": "['91.9', '34.0', '-43.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -43.0, 91.9, 34.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square bracket... | ['91.9', '34.0', '-43.0'] | ['91.9', '34.0', '-43.0'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: 4.0, 72.0, -24.1, -94.0, 14.0, -68.66, 37.8, 38.7, 18.2\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59',... | {
"ground_truth": "['72.0', '38.7', '37.8', '18.2', '14.0', '4.0', '-24.1', '-68.66', '-94.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: 4.0, 72.0, -24.1, -94.0, 14.0, -68.66, 37.8, 38.7, 18.2
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Con... | ['72.0', '38.7', '37.8', '18.2', '14.0', '4.0', '-24.1', '-68.66', '-94.0'] | ['72.0', '38.7', '37.8', '18.2', '14.0', '4.0', '-24.1', '-68.66', '-94.0'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -16.5, -83.6, -95.7, -97.8, 61.5, 71.08, -92.85\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] in... | {
"ground_truth": "['-97.8', '-95.7', '-92.85', '-83.6', '-16.5', '61.5', '71.08']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -16.5, -83.6, -95.7, -97.8, 61.5, 71.08, -92.85
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all ... | ['-97.8', '-95.7', '-92.85', '-83.6', '-16.5', '61.5', '71.08'] | ['-97.8', '-95.7', '-92.85', '-83.6', '-16.5', '61.5', '71.08'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -20.0, 17.0, 27.0, 17.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert all... | {
"ground_truth": "['-20.0', '17.0', '17.0', '27.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -20.0, 17.0, 27.0, 17.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square br... | ['-20.0', '17.0', '17.0', '27.0'] | ['-20.0', '17.0', '17.0', '27.0'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -87.49, -9.3, -48.5, -22.0, 59.02, -95.0, -99.9, 45.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '... | {
"ground_truth": "['59.02', '45.0', '-9.3', '-22.0', '-48.5', '-87.49', '-95.0', '-99.9']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -87.49, -9.3, -48.5, -22.0, 59.02, -95.0, -99.9, 45.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Conve... | ['59.02', '45.0', '-9.3', '-22.0', '-48.5', '-87.49', '-95.0', '-99.9'] | ['59.02', '45.0', '-9.3', '-22.0', '-48.5', '-87.49', '-95.0', '-99.9'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -73.62, 6.96, -61.5, -66.87, -78.5, -55.92, 11.31, -69.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59',... | {
"ground_truth": "['-78.5', '-73.62', '-69.0', '-66.87', '-61.5', '-55.92', '6.96', '11.31']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -73.62, 6.96, -61.5, -66.87, -78.5, -55.92, 11.31, -69.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Con... | ['-78.5', '-73.62', '-69.0', '-66.87', '-61.5', '-55.92', '6.96', '11.31'] | ['-78.5', '-73.62', '-69.0', '-66.87', '-61.5', '-55.92', '6.96', '11.31'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -31.0, -35.3, 2.0, 35.97\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert a... | {
"ground_truth": "['35.97', '2.0', '-31.0', '-35.3']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -31.0, -35.3, 2.0, 35.97
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square ... | ['35.97', '2.0', '-31.0', '-35.3'] | ['35.97', '2.0', '-31.0', '-35.3'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: 71.1, 27.0, 38.5, -83.0, -55.12, -83.0, -31.0, 95.9, -56.0, 94.5\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '4... | {
"ground_truth": "['95.9', '94.5', '71.1', '38.5', '27.0', '-31.0', '-55.12', '-56.0', '-83.0', '-83.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: 71.1, 27.0, 38.5, -83.0, -55.12, -83.0, -31.0, 95.9, -56.0, 94.5
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
... | ['95.9', '94.5', '71.1', '38.5', '27.0', '-31.0', '-55.12', '-56.0', '-83.0', '-83.0'] | ['95.9', '94.5', '71.1', '38.5', '27.0', '-31.0', '-55.12', '-56.0', '-83.0', '-83.0'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: 67.7, -68.0, 66.5, 85.3, 9.7, 46.29\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2... | {
"ground_truth": "['85.3', '67.7', '66.5', '46.29', '9.7', '-68.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: 67.7, -68.0, 66.5, 85.3, 9.7, 46.29
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in ... | ['85.3', '67.7', '66.5', '46.29', '9.7', '-68.0'] | ['85.3', '67.7', '66.5', '46.29', '9.7', '-68.0'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -89.1, 2.5, -19.0, -68.2, 66.1, -12.0, -93.2\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] inst... | {
"ground_truth": "['66.1', '2.5', '-12.0', '-19.0', '-68.2', '-89.1', '-93.2']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -89.1, 2.5, -19.0, -68.2, 66.1, -12.0, -93.2
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all nu... | ['66.1', '2.5', '-12.0', '-19.0', '-68.2', '-89.1', '-93.2'] | ['66.1', '2.5', '-12.0', '-19.0', '-68.2', '-89.1', '-93.2'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -8.7, -3.46, 4.11, -9.0, 72.0, 82.3\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2.... | {
"ground_truth": "['-9.0', '-8.7', '-3.46', '4.11', '72.0', '82.3']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -8.7, -3.46, 4.11, -9.0, 72.0, 82.3
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in t... | ['-9.0', '-8.7', '-3.46', '4.11', '72.0', '82.3'] | ['-9.0', '-8.7', '-3.46', '4.11', '72.0', '82.3'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -12.2, -3.4, -23.9, -33.99, -24.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. C... | {
"ground_truth": "['-33.99', '-24.0', '-23.9', '-12.2', '-3.4']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -12.2, -3.4, -23.9, -33.99, -24.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the... | ['-33.99', '-24.0', '-23.9', '-12.2', '-3.4'] | ['-33.99', '-24.0', '-23.9', '-12.2', '-3.4'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: 98.0, -70.01, -39.0, 49.4\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert a... | {
"ground_truth": "['-70.01', '-39.0', '49.4', '98.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: 98.0, -70.01, -39.0, 49.4
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square ... | ['-70.01', '-39.0', '49.4', '98.0'] | ['-70.01', '-39.0', '49.4', '98.0'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -5.27, -39.77, 97.7\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert all num... | {
"ground_truth": "['-39.77', '-5.27', '97.7']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -5.27, -39.77, 97.7
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square bracke... | ['-39.77', '-5.27', '97.7'] | ['-39.77', '-5.27', '97.7'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -26.45, -96.14, -35.8\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n## 2. Convert all ... | {
"ground_truth": "['-26.45', '-35.8', '-96.14']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -26.45, -96.14, -35.8
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers in the square bra... | ['-26.45', '-35.8', '-96.14'] | ['-26.45', '-35.8', '-96.14'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -58.86, 96.0, -91.8, -18.9, 61.1, 93.35\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\n... | {
"ground_truth": "['96.0', '93.35', '61.1', '-18.9', '-58.86', '-91.8']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -58.86, 96.0, -91.8, -18.9, 61.1, 93.35
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numbers... | ['96.0', '93.35', '61.1', '-18.9', '-58.86', '-91.8'] | ['96.0', '93.35', '61.1', '-18.9', '-58.86', '-91.8'] |
number_sorting | [
{
"content": "Sort these numbers in descending order: -83.08, 89.0, -72.8, 42.87, 24.3, -24.35\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead\... | {
"ground_truth": "['89.0', '42.87', '24.3', '-24.35', '-72.8', '-83.08']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in descending order: -83.08, 89.0, -72.8, 42.87, 24.3, -24.35
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all number... | ['89.0', '42.87', '24.3', '-24.35', '-72.8', '-83.08'] | ['89.0', '42.87', '24.3', '-24.35', '-72.8', '-83.08'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -43.0, -46.9, -6.6, 95.0, 58.0, 33.0, -69.0\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instea... | {
"ground_truth": "['-69.0', '-46.9', '-43.0', '-6.6', '33.0', '58.0', '95.0']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -43.0, -46.9, -6.6, 95.0, 58.0, 33.0, -69.0
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instead
## 2. Convert all numb... | ['-69.0', '-46.9', '-43.0', '-6.6', '33.0', '58.0', '95.0'] | ['-69.0', '-46.9', '-43.0', '-6.6', '33.0', '58.0', '95.0'] |
number_sorting | [
{
"content": "Sort these numbers in ascending order: -64.0, 61.9, -41.33, -94.5, -28.1, -8.0, -33.0, 78.76, -82.0, -32.5\nPlease follow the instruction below:\n## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', ... | {
"ground_truth": "['-94.5', '-82.0', '-64.0', '-41.33', '-33.0', '-32.5', '-28.1', '-8.0', '61.9', '78.76']",
"style": "rule-lighteval/MATH_v2"
} | Sort these numbers in ascending order: -64.0, 61.9, -41.33, -94.5, -28.1, -8.0, -33.0, 78.76, -82.0, -32.5
Please follow the instruction below:
## 1. Let all your answers be a list of numbers. Instead of reporting your answer as -69, -13, 1, 7, 11, 43, 59, 61, use ['-69', '-13', '1', '7', '11', '43', '59', '61'] instea... | ['-94.5', '-82.0', '-64.0', '-41.33', '-33.0', '-32.5', '-28.1', '-8.0', '61.9', '78.76'] | ['-94.5', '-82.0', '-64.0', '-41.33', '-33.0', '-32.5', '-28.1', '-8.0', '61.9', '78.76'] |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "ahha",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | ahha | ahha |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "hyh",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | hyh | hyh |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "nsdjjjdsn",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | nsdjjjdsn | nsdjjjdsn |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "kghahgk",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | kghahgk | kghahgk |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "kppk",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | kppk | kppk |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "booggoob",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | booggoob | booggoob |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "dshyyhsd",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | dshyyhsd | dshyyhsd |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "iyyi",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | iyyi | iyyi |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "wjxsttsxjw",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | wjxsttsxjw | wjxsttsxjw |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "voggov",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | voggov | voggov |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "bsmlmsb",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | bsmlmsb | bsmlmsb |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "lsyysl",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | lsyysl | lsyysl |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "lhphl",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | lhphl | lhphl |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "zffz",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | zffz | zffz |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "mqm",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | mqm | mqm |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "jtj",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | jtj | jtj |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "fqyyqf",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | fqyyqf | fqyyqf |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "cqllqc",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | cqllqc | cqllqc |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "hefpfeh",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | hefpfeh | hefpfeh |
palindrome_generation | [
{
"content": "Your task is, given a list of letters, to form a valid palindrome.\n\nA palindrome is a phrase that reads the same forwards and backwards.\n\nIf there are multiple possible answers, only respond with one of them. You must use all the letters provided.\n\nYour output should be a single string, with... | {
"ground_truth": "efxhuuhxfe",
"style": "rule-lighteval/MATH_v2"
} | Your task is, given a list of letters, to form a valid palindrome.
A palindrome is a phrase that reads the same forwards and backwards.
If there are multiple possible answers, only respond with one of them. You must use all the letters provided.
Your output should be a single string, with no spaces or punctuation.
... | efxhuuhxfe | efxhuuhxfe |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"a\", \"g\", \"e\", \"g\", \"v\", \"c\", \"k\", \"a\", \"k\", \"c\", \"g\", \"n\", \"n\", \"r\", \"w\"], [\"a\", \"g\", \"e\", \"g\", \"v\", \"c\", \"k\", \"a\", \"k\", \"c\", \"g\", \"nn\", \"r\", \"w\"], [\"a\", \"g\", \"e\", \"g\", \"v\", \"c\", \"kak\", \"c\", \"g\", \"n\", \"n\", \"r\", \"w... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["a", "g", "e", "g", "v", "c", "k", "a", "k", "c", "g", "n", "n", "r", "w"], ["a", "g", "e", "g", "v", "c", "k", "a", "k", "c", "g", "nn", "r", "w"], ["a", "g", "e", "g", "v", "c", "kak", "c", "g", "n", "n", "r", "w"], ["a", "g", "e", "g", "v", "c", "kak", "c", "g", "nn", "r", "w"], ["a", "g", "e", "g", "v", "ckakc", ... | [["a", "g", "e", "g", "v", "c", "k", "a", "k", "c", "g", "n", "n", "r", "w"], ["a", "g", "e", "g", "v", "c", "k", "a", "k", "c", "g", "nn", "r", "w"], ["a", "g", "e", "g", "v", "c", "kak", "c", "g", "n", "n", "r", "w"], ["a", "g", "e", "g", "v", "c", "kak", "c", "g", "nn", "r", "w"], ["a", "g", "e", "g", "v", "ckakc", ... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"s\", \"e\", \"s\", \"j\", \"j\"], [\"s\", \"e\", \"s\", \"jj\"], [\"ses\", \"j\", \"j\"], [\"ses\", \"jj\"]]",
"style": "rule-lighteval/MATH_v2"
} | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["s", "e", "s", "j", "j"], ["s", "e", "s", "jj"], ["ses", "j", "j"], ["ses", "jj"]] | [["s", "e", "s", "j", "j"], ["s", "e", "s", "jj"], ["ses", "j", "j"], ["ses", "jj"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"o\", \"w\", \"f\", \"w\", \"o\", \"f\", \"a\", \"a\", \"f\", \"s\", \"d\"], [\"o\", \"w\", \"f\", \"w\", \"o\", \"f\", \"aa\", \"f\", \"s\", \"d\"], [\"o\", \"w\", \"f\", \"w\", \"o\", \"faaf\", \"s\", \"d\"], [\"o\", \"wfw\", \"o\", \"f\", \"a\", \"a\", \"f\", \"s\", \"d\"], [\"o\", \"wfw\", \... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["o", "w", "f", "w", "o", "f", "a", "a", "f", "s", "d"], ["o", "w", "f", "w", "o", "f", "aa", "f", "s", "d"], ["o", "w", "f", "w", "o", "faaf", "s", "d"], ["o", "wfw", "o", "f", "a", "a", "f", "s", "d"], ["o", "wfw", "o", "f", "aa", "f", "s", "d"], ["o", "wfw", "o", "faaf", "s", "d"], ["owfwo", "f", "a", "a", "f", "s"... | [["o", "w", "f", "w", "o", "f", "a", "a", "f", "s", "d"], ["o", "w", "f", "w", "o", "f", "aa", "f", "s", "d"], ["o", "w", "f", "w", "o", "faaf", "s", "d"], ["o", "wfw", "o", "f", "a", "a", "f", "s", "d"], ["o", "wfw", "o", "f", "aa", "f", "s", "d"], ["o", "wfw", "o", "faaf", "s", "d"], ["owfwo", "f", "a", "a", "f", "s"... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"m\", \"c\", \"c\", \"m\", \"a\", \"p\", \"a\", \"d\", \"z\"], [\"m\", \"c\", \"c\", \"m\", \"apa\", \"d\", \"z\"], [\"m\", \"cc\", \"m\", \"a\", \"p\", \"a\", \"d\", \"z\"], [\"m\", \"cc\", \"m\", \"apa\", \"d\", \"z\"], [\"mccm\", \"a\", \"p\", \"a\", \"d\", \"z\"], [\"mccm\", \"apa\", \"d\", ... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["m", "c", "c", "m", "a", "p", "a", "d", "z"], ["m", "c", "c", "m", "apa", "d", "z"], ["m", "cc", "m", "a", "p", "a", "d", "z"], ["m", "cc", "m", "apa", "d", "z"], ["mccm", "a", "p", "a", "d", "z"], ["mccm", "apa", "d", "z"]] | [["m", "c", "c", "m", "a", "p", "a", "d", "z"], ["m", "c", "c", "m", "apa", "d", "z"], ["m", "cc", "m", "a", "p", "a", "d", "z"], ["m", "cc", "m", "apa", "d", "z"], ["mccm", "a", "p", "a", "d", "z"], ["mccm", "apa", "d", "z"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"b\", \"p\", \"p\", \"b\", \"q\", \"q\"], [\"b\", \"p\", \"p\", \"b\", \"qq\"], [\"b\", \"pp\", \"b\", \"q\", \"q\"], [\"b\", \"pp\", \"b\", \"qq\"], [\"bppb\", \"q\", \"q\"], [\"bppb\", \"qq\"]]",
"style": "rule-lighteval/MATH_v2"
} | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["b", "p", "p", "b", "q", "q"], ["b", "p", "p", "b", "qq"], ["b", "pp", "b", "q", "q"], ["b", "pp", "b", "qq"], ["bppb", "q", "q"], ["bppb", "qq"]] | [["b", "p", "p", "b", "q", "q"], ["b", "p", "p", "b", "qq"], ["b", "pp", "b", "q", "q"], ["b", "pp", "b", "qq"], ["bppb", "q", "q"], ["bppb", "qq"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"n\", \"l\", \"i\", \"q\", \"i\", \"l\", \"k\", \"b\", \"b\", \"k\"], [\"n\", \"l\", \"i\", \"q\", \"i\", \"l\", \"k\", \"bb\", \"k\"], [\"n\", \"l\", \"i\", \"q\", \"i\", \"l\", \"kbbk\"], [\"n\", \"l\", \"iqi\", \"l\", \"k\", \"b\", \"b\", \"k\"], [\"n\", \"l\", \"iqi\", \"l\", \"k\", \"bb\", ... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["n", "l", "i", "q", "i", "l", "k", "b", "b", "k"], ["n", "l", "i", "q", "i", "l", "k", "bb", "k"], ["n", "l", "i", "q", "i", "l", "kbbk"], ["n", "l", "iqi", "l", "k", "b", "b", "k"], ["n", "l", "iqi", "l", "k", "bb", "k"], ["n", "l", "iqi", "l", "kbbk"], ["n", "liqil", "k", "b", "b", "k"], ["n", "liqil", "k", "bb", "... | [["n", "l", "i", "q", "i", "l", "k", "b", "b", "k"], ["n", "l", "i", "q", "i", "l", "k", "bb", "k"], ["n", "l", "i", "q", "i", "l", "kbbk"], ["n", "l", "iqi", "l", "k", "b", "b", "k"], ["n", "l", "iqi", "l", "k", "bb", "k"], ["n", "l", "iqi", "l", "kbbk"], ["n", "liqil", "k", "b", "b", "k"], ["n", "liqil", "k", "bb", "... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"d\", \"w\", \"d\", \"h\", \"y\", \"g\", \"y\", \"h\", \"e\", \"z\", \"z\", \"e\", \"p\"], [\"d\", \"w\", \"d\", \"h\", \"y\", \"g\", \"y\", \"h\", \"e\", \"zz\", \"e\", \"p\"], [\"d\", \"w\", \"d\", \"h\", \"y\", \"g\", \"y\", \"h\", \"ezze\", \"p\"], [\"d\", \"w\", \"d\", \"h\", \"ygy\", \"h\"... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["d", "w", "d", "h", "y", "g", "y", "h", "e", "z", "z", "e", "p"], ["d", "w", "d", "h", "y", "g", "y", "h", "e", "zz", "e", "p"], ["d", "w", "d", "h", "y", "g", "y", "h", "ezze", "p"], ["d", "w", "d", "h", "ygy", "h", "e", "z", "z", "e", "p"], ["d", "w", "d", "h", "ygy", "h", "e", "zz", "e", "p"], ["d", "w", "d", "h",... | [["d", "w", "d", "h", "y", "g", "y", "h", "e", "z", "z", "e", "p"], ["d", "w", "d", "h", "y", "g", "y", "h", "e", "zz", "e", "p"], ["d", "w", "d", "h", "y", "g", "y", "h", "ezze", "p"], ["d", "w", "d", "h", "ygy", "h", "e", "z", "z", "e", "p"], ["d", "w", "d", "h", "ygy", "h", "e", "zz", "e", "p"], ["d", "w", "d", "h",... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"k\", \"d\", \"k\", \"t\", \"q\", \"t\"], [\"k\", \"d\", \"k\", \"tqt\"], [\"kdk\", \"t\", \"q\", \"t\"], [\"kdk\", \"tqt\"]]",
"style": "rule-lighteval/MATH_v2"
} | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["k", "d", "k", "t", "q", "t"], ["k", "d", "k", "tqt"], ["kdk", "t", "q", "t"], ["kdk", "tqt"]] | [["k", "d", "k", "t", "q", "t"], ["k", "d", "k", "tqt"], ["kdk", "t", "q", "t"], ["kdk", "tqt"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"j\", \"h\", \"j\", \"t\", \"i\", \"i\", \"t\", \"i\", \"r\", \"c\", \"r\", \"i\"], [\"j\", \"h\", \"j\", \"t\", \"i\", \"i\", \"t\", \"i\", \"rcr\", \"i\"], [\"j\", \"h\", \"j\", \"t\", \"i\", \"i\", \"t\", \"ircri\"], [\"j\", \"h\", \"j\", \"t\", \"i\", \"iti\", \"r\", \"c\", \"r\", \"i\"], [\... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["j", "h", "j", "t", "i", "i", "t", "i", "r", "c", "r", "i"], ["j", "h", "j", "t", "i", "i", "t", "i", "rcr", "i"], ["j", "h", "j", "t", "i", "i", "t", "ircri"], ["j", "h", "j", "t", "i", "iti", "r", "c", "r", "i"], ["j", "h", "j", "t", "i", "iti", "rcr", "i"], ["j", "h", "j", "t", "ii", "t", "i", "r", "c", "r", "i"],... | [["j", "h", "j", "t", "i", "i", "t", "i", "r", "c", "r", "i"], ["j", "h", "j", "t", "i", "i", "t", "i", "rcr", "i"], ["j", "h", "j", "t", "i", "i", "t", "ircri"], ["j", "h", "j", "t", "i", "iti", "r", "c", "r", "i"], ["j", "h", "j", "t", "i", "iti", "rcr", "i"], ["j", "h", "j", "t", "ii", "t", "i", "r", "c", "r", "i"],... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"o\", \"g\", \"h\", \"g\", \"o\", \"g\", \"m\", \"g\"], [\"o\", \"g\", \"h\", \"g\", \"o\", \"gmg\"], [\"o\", \"g\", \"h\", \"gog\", \"m\", \"g\"], [\"o\", \"ghg\", \"o\", \"g\", \"m\", \"g\"], [\"o\", \"ghg\", \"o\", \"gmg\"], [\"oghgo\", \"g\", \"m\", \"g\"], [\"oghgo\", \"gmg\"]]",
"style":... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["o", "g", "h", "g", "o", "g", "m", "g"], ["o", "g", "h", "g", "o", "gmg"], ["o", "g", "h", "gog", "m", "g"], ["o", "ghg", "o", "g", "m", "g"], ["o", "ghg", "o", "gmg"], ["oghgo", "g", "m", "g"], ["oghgo", "gmg"]] | [["o", "g", "h", "g", "o", "g", "m", "g"], ["o", "g", "h", "g", "o", "gmg"], ["o", "g", "h", "gog", "m", "g"], ["o", "ghg", "o", "g", "m", "g"], ["o", "ghg", "o", "gmg"], ["oghgo", "g", "m", "g"], ["oghgo", "gmg"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"x\", \"m\", \"y\", \"n\", \"y\", \"m\", \"e\", \"z\", \"z\"], [\"x\", \"m\", \"y\", \"n\", \"y\", \"m\", \"e\", \"zz\"], [\"x\", \"m\", \"yny\", \"m\", \"e\", \"z\", \"z\"], [\"x\", \"m\", \"yny\", \"m\", \"e\", \"zz\"], [\"x\", \"mynym\", \"e\", \"z\", \"z\"], [\"x\", \"mynym\", \"e\", \"zz\"]... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["x", "m", "y", "n", "y", "m", "e", "z", "z"], ["x", "m", "y", "n", "y", "m", "e", "zz"], ["x", "m", "yny", "m", "e", "z", "z"], ["x", "m", "yny", "m", "e", "zz"], ["x", "mynym", "e", "z", "z"], ["x", "mynym", "e", "zz"]] | [["x", "m", "y", "n", "y", "m", "e", "z", "z"], ["x", "m", "y", "n", "y", "m", "e", "zz"], ["x", "m", "yny", "m", "e", "z", "z"], ["x", "m", "yny", "m", "e", "zz"], ["x", "mynym", "e", "z", "z"], ["x", "mynym", "e", "zz"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"l\", \"l\", \"y\", \"n\", \"n\", \"y\", \"s\", \"w\", \"w\", \"s\", \"f\", \"t\", \"i\", \"t\"], [\"l\", \"l\", \"y\", \"n\", \"n\", \"y\", \"s\", \"w\", \"w\", \"s\", \"f\", \"tit\"], [\"l\", \"l\", \"y\", \"n\", \"n\", \"y\", \"s\", \"ww\", \"s\", \"f\", \"t\", \"i\", \"t\"], [\"l\", \"l\", \... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["l", "l", "y", "n", "n", "y", "s", "w", "w", "s", "f", "t", "i", "t"], ["l", "l", "y", "n", "n", "y", "s", "w", "w", "s", "f", "tit"], ["l", "l", "y", "n", "n", "y", "s", "ww", "s", "f", "t", "i", "t"], ["l", "l", "y", "n", "n", "y", "s", "ww", "s", "f", "tit"], ["l", "l", "y", "n", "n", "y", "swws", "f", "t", "i", "... | [["l", "l", "y", "n", "n", "y", "s", "w", "w", "s", "f", "t", "i", "t"], ["l", "l", "y", "n", "n", "y", "s", "w", "w", "s", "f", "tit"], ["l", "l", "y", "n", "n", "y", "s", "ww", "s", "f", "t", "i", "t"], ["l", "l", "y", "n", "n", "y", "s", "ww", "s", "f", "tit"], ["l", "l", "y", "n", "n", "y", "swws", "f", "t", "i", "... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"o\", \"m\", \"m\", \"o\", \"j\", \"o\", \"j\"], [\"o\", \"m\", \"m\", \"o\", \"joj\"], [\"o\", \"m\", \"m\", \"ojo\", \"j\"], [\"o\", \"mm\", \"o\", \"j\", \"o\", \"j\"], [\"o\", \"mm\", \"o\", \"joj\"], [\"o\", \"mm\", \"ojo\", \"j\"], [\"ommo\", \"j\", \"o\", \"j\"], [\"ommo\", \"joj\"]]",
... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["o", "m", "m", "o", "j", "o", "j"], ["o", "m", "m", "o", "joj"], ["o", "m", "m", "ojo", "j"], ["o", "mm", "o", "j", "o", "j"], ["o", "mm", "o", "joj"], ["o", "mm", "ojo", "j"], ["ommo", "j", "o", "j"], ["ommo", "joj"]] | [["o", "m", "m", "o", "j", "o", "j"], ["o", "m", "m", "o", "joj"], ["o", "m", "m", "ojo", "j"], ["o", "mm", "o", "j", "o", "j"], ["o", "mm", "o", "joj"], ["o", "mm", "ojo", "j"], ["ommo", "j", "o", "j"], ["ommo", "joj"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"d\", \"d\", \"v\", \"x\", \"v\", \"j\"], [\"d\", \"d\", \"vxv\", \"j\"], [\"dd\", \"v\", \"x\", \"v\", \"j\"], [\"dd\", \"vxv\", \"j\"]]",
"style": "rule-lighteval/MATH_v2"
} | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["d", "d", "v", "x", "v", "j"], ["d", "d", "vxv", "j"], ["dd", "v", "x", "v", "j"], ["dd", "vxv", "j"]] | [["d", "d", "v", "x", "v", "j"], ["d", "d", "vxv", "j"], ["dd", "v", "x", "v", "j"], ["dd", "vxv", "j"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"p\", \"h\", \"o\", \"n\", \"o\", \"h\", \"c\", \"c\", \"b\", \"q\", \"s\", \"q\", \"b\"], [\"p\", \"h\", \"o\", \"n\", \"o\", \"h\", \"c\", \"c\", \"b\", \"qsq\", \"b\"], [\"p\", \"h\", \"o\", \"n\", \"o\", \"h\", \"c\", \"c\", \"bqsqb\"], [\"p\", \"h\", \"o\", \"n\", \"o\", \"h\", \"cc\", \"b\... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["p", "h", "o", "n", "o", "h", "c", "c", "b", "q", "s", "q", "b"], ["p", "h", "o", "n", "o", "h", "c", "c", "b", "qsq", "b"], ["p", "h", "o", "n", "o", "h", "c", "c", "bqsqb"], ["p", "h", "o", "n", "o", "h", "cc", "b", "q", "s", "q", "b"], ["p", "h", "o", "n", "o", "h", "cc", "b", "qsq", "b"], ["p", "h", "o", "n", "o"... | [["p", "h", "o", "n", "o", "h", "c", "c", "b", "q", "s", "q", "b"], ["p", "h", "o", "n", "o", "h", "c", "c", "b", "qsq", "b"], ["p", "h", "o", "n", "o", "h", "c", "c", "bqsqb"], ["p", "h", "o", "n", "o", "h", "cc", "b", "q", "s", "q", "b"], ["p", "h", "o", "n", "o", "h", "cc", "b", "qsq", "b"], ["p", "h", "o", "n", "o"... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"p\", \"a\", \"p\", \"n\", \"n\"], [\"p\", \"a\", \"p\", \"nn\"], [\"pap\", \"n\", \"n\"], [\"pap\", \"nn\"]]",
"style": "rule-lighteval/MATH_v2"
} | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["p", "a", "p", "n", "n"], ["p", "a", "p", "nn"], ["pap", "n", "n"], ["pap", "nn"]] | [["p", "a", "p", "n", "n"], ["p", "a", "p", "nn"], ["pap", "n", "n"], ["pap", "nn"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"f\", \"f\", \"b\", \"b\", \"k\", \"y\", \"y\", \"k\", \"z\", \"z\", \"z\", \"k\", \"s\", \"k\"], [\"f\", \"f\", \"b\", \"b\", \"k\", \"y\", \"y\", \"k\", \"z\", \"z\", \"z\", \"ksk\"], [\"f\", \"f\", \"b\", \"b\", \"k\", \"y\", \"y\", \"k\", \"z\", \"zz\", \"k\", \"s\", \"k\"], [\"f\", \"f\", \... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["f", "f", "b", "b", "k", "y", "y", "k", "z", "z", "z", "k", "s", "k"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "z", "z", "ksk"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "zz", "k", "s", "k"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "zz", "ksk"], ["f", "f", "b", "b", "k", "y", "y", "k", "zz", "z", "k"... | [["f", "f", "b", "b", "k", "y", "y", "k", "z", "z", "z", "k", "s", "k"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "z", "z", "ksk"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "zz", "k", "s", "k"], ["f", "f", "b", "b", "k", "y", "y", "k", "z", "zz", "ksk"], ["f", "f", "b", "b", "k", "y", "y", "k", "zz", "z", "k"... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"u\", \"a\", \"w\", \"w\", \"a\", \"v\", \"a\", \"a\"], [\"u\", \"a\", \"w\", \"w\", \"a\", \"v\", \"aa\"], [\"u\", \"a\", \"w\", \"w\", \"ava\", \"a\"], [\"u\", \"a\", \"ww\", \"a\", \"v\", \"a\", \"a\"], [\"u\", \"a\", \"ww\", \"a\", \"v\", \"aa\"], [\"u\", \"a\", \"ww\", \"ava\", \"a\"], [\"u... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["u", "a", "w", "w", "a", "v", "a", "a"], ["u", "a", "w", "w", "a", "v", "aa"], ["u", "a", "w", "w", "ava", "a"], ["u", "a", "ww", "a", "v", "a", "a"], ["u", "a", "ww", "a", "v", "aa"], ["u", "a", "ww", "ava", "a"], ["u", "awwa", "v", "a", "a"], ["u", "awwa", "v", "aa"]] | [["u", "a", "w", "w", "a", "v", "a", "a"], ["u", "a", "w", "w", "a", "v", "aa"], ["u", "a", "w", "w", "ava", "a"], ["u", "a", "ww", "a", "v", "a", "a"], ["u", "a", "ww", "a", "v", "aa"], ["u", "a", "ww", "ava", "a"], ["u", "awwa", "v", "a", "a"], ["u", "awwa", "v", "aa"]] |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"p\", \"i\", \"p\", \"v\", \"v\", \"x\", \"z\", \"z\", \"x\"], [\"p\", \"i\", \"p\", \"v\", \"v\", \"x\", \"zz\", \"x\"], [\"p\", \"i\", \"p\", \"v\", \"v\", \"xzzx\"], [\"p\", \"i\", \"p\", \"vv\", \"x\", \"z\", \"z\", \"x\"], [\"p\", \"i\", \"p\", \"vv\", \"x\", \"zz\", \"x\"], [\"p\", \"i\", ... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["p", "i", "p", "v", "v", "x", "z", "z", "x"], ["p", "i", "p", "v", "v", "x", "zz", "x"], ["p", "i", "p", "v", "v", "xzzx"], ["p", "i", "p", "vv", "x", "z", "z", "x"], ["p", "i", "p", "vv", "x", "zz", "x"], ["p", "i", "p", "vv", "xzzx"], ["pip", "v", "v", "x", "z", "z", "x"], ["pip", "v", "v", "x", "zz", "x"], ["pip",... | [["p", "i", "p", "v", "v", "x", "z", "z", "x"], ["p", "i", "p", "v", "v", "x", "zz", "x"], ["p", "i", "p", "v", "v", "xzzx"], ["p", "i", "p", "vv", "x", "z", "z", "x"], ["p", "i", "p", "vv", "x", "zz", "x"], ["p", "i", "p", "vv", "xzzx"], ["pip", "v", "v", "x", "z", "z", "x"], ["pip", "v", "v", "x", "zz", "x"], ["pip",... |
palindrome_partitioning | [
{
"content": "Given a string, partition it such that every substring is a palindrome.\n\nA palindrome is a word that reads the same backward as forward.\n\nYou may return all possible palindrome partitioning in any order.\n\nYour output should be a list of lists, where each list represents a palindrome partitio... | {
"ground_truth": "[[\"o\", \"o\", \"h\", \"z\", \"h\", \"p\", \"j\", \"m\", \"j\", \"i\", \"f\", \"i\"], [\"o\", \"o\", \"h\", \"z\", \"h\", \"p\", \"j\", \"m\", \"j\", \"ifi\"], [\"o\", \"o\", \"h\", \"z\", \"h\", \"p\", \"jmj\", \"i\", \"f\", \"i\"], [\"o\", \"o\", \"h\", \"z\", \"h\", \"p\", \"jmj\", \"ifi\"], [\... | Given a string, partition it such that every substring is a palindrome.
A palindrome is a word that reads the same backward as forward.
You may return all possible palindrome partitioning in any order.
Your output should be a list of lists, where each list represents a palindrome partition, e.g. [["a","a","b"],["aa"... | [["o", "o", "h", "z", "h", "p", "j", "m", "j", "i", "f", "i"], ["o", "o", "h", "z", "h", "p", "j", "m", "j", "ifi"], ["o", "o", "h", "z", "h", "p", "jmj", "i", "f", "i"], ["o", "o", "h", "z", "h", "p", "jmj", "ifi"], ["o", "o", "hzh", "p", "j", "m", "j", "i", "f", "i"], ["o", "o", "hzh", "p", "j", "m", "j", "ifi"], ["o... | [["o", "o", "h", "z", "h", "p", "j", "m", "j", "i", "f", "i"], ["o", "o", "h", "z", "h", "p", "j", "m", "j", "ifi"], ["o", "o", "h", "z", "h", "p", "jmj", "i", "f", "i"], ["o", "o", "h", "z", "h", "p", "jmj", "ifi"], ["o", "o", "hzh", "p", "j", "m", "j", "i", "f", "i"], ["o", "o", "hzh", "p", "j", "m", "j", "ifi"], ["o... |
polynomial_equations | [
{
"content": "Find the real value(s) of w in the equation: -127*w = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Find the real value(s) of w in the equation: -127*w = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), conv... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Determine the real value(s) of b that satisfies: 86*b**2 - 2*b - 13 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(45... | {
"ground_truth": "-0.3773, 0.4006",
"style": "rule-lighteval/MATH_v2"
} | Determine the real value(s) of b that satisfies: 86*b**2 - 2*b - 13 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4... | -0.3773, 0.4006 | -0.3773, 0.4006 |
polynomial_equations | [
{
"content": "Determine the real value(s) of p that satisfies: 71*p**3 - 2*p - 29 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(45... | {
"ground_truth": "0.7546",
"style": "rule-lighteval/MATH_v2"
} | Determine the real value(s) of p that satisfies: 71*p**3 - 2*p - 29 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4... | 0.7546 | 0.7546 |
polynomial_equations | [
{
"content": "Solve for real d: 98 - 94*d**2 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u = 2 - sqrt(4560)/17... | {
"ground_truth": "-1.0211, 1.0211",
"style": "rule-lighteval/MATH_v2"
} | Solve for real d: 98 - 94*d**2 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), convert them to decimal f... | -1.0211, 1.0211 | -1.0211, 1.0211 |
polynomial_equations | [
{
"content": "Solve for real c: 106*c**2 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u = 2 - sqrt(4560)/172\")... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Solve for real c: 106*c**2 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), convert them to decimal form ... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Find the real value(s) of n in the equation: 138*n = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Find the real value(s) of n in the equation: 138*n = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), conve... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Solve the polynomial equation for real t:\n27*t**2 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Solve the polynomial equation for real t:
27*t**2 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), conver... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Solve for real c: 97*c**2 + 98*c + 7 = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u = 2 - sqrt(45... | {
"ground_truth": "-0.933, -0.0774",
"style": "rule-lighteval/MATH_v2"
} | Solve for real c: 97*c**2 + 98*c + 7 = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), convert them to dec... | -0.933, -0.0774 | -0.933, -0.0774 |
polynomial_equations | [
{
"content": "Find the real value(s) of t in the equation: -28*t = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Find the real value(s) of t in the equation: -28*t = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), conve... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Determine the real value(s) of h that satisfies: -71*h**3 + 182*h = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560... | {
"ground_truth": "-1.6011, 0.0, 1.6011",
"style": "rule-lighteval/MATH_v2"
} | Determine the real value(s) of h that satisfies: -71*h**3 + 182*h = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(456... | -1.6011, 0.0, 1.6011 | -1.6011, 0.0, 1.6011 |
polynomial_equations | [
{
"content": "Find the real value(s) of k in the equation: 34*k = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and \"u ... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Find the real value(s) of k in the equation: 34*k = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), conver... | 0.0 | 0.0 |
polynomial_equations | [
{
"content": "Determine the real value(s) of v that satisfies: -85*v = 0\nIn solving equations, please follow these instructions:\n1. Provide all answers as comma-separated decimal values. For example: \"-0.3773, 0.4005\"\n2. For solutions that can be expressed in exact form (like \"u = 2 + sqrt(4560)/172\" and... | {
"ground_truth": "0.0",
"style": "rule-lighteval/MATH_v2"
} | Determine the real value(s) of v that satisfies: -85*v = 0
In solving equations, please follow these instructions:
1. Provide all answers as comma-separated decimal values. For example: "-0.3773, 0.4005"
2. For solutions that can be expressed in exact form (like "u = 2 + sqrt(4560)/172" and "u = 2 - sqrt(4560)/172"), c... | 0.0 | 0.0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.