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 |
|---|---|---|---|---|---|
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n9 8 8 8 8 8 8 8 8 2\n9 8 8 8 8 8 8 8 8 2\n9 8 8 8 8 8 8 8 8 2\n9 8 0 8 8 8 8 8 8 2\n9 8 8 8 8 8 8 8 8 2\n9 8 8 8 0 8 8 8 8 2\n9 8 8 8 8 8 8 8 8 2\n9 8 8 8 8 8 8 8 8 2\n9 8 8 8 8 8 0 8... | {
"ground_truth": "4 8 8 8 8 8 8 8 8 6\n4 8 4 8 8 8 6 8 8 6\n4 8 8 8 4 8 8 8 8 6\n4 8 8 8 8 8 8 8 8 6\n4 8 8 4 8 8 8 8 8 6\n4 8 8 8 8 8 6 8 8 6\n4 8 8 4 8 8 8 8 8 6\n4 8 8 8 8 8 8 8 8 6\n4 8 8 8 8 6 8 8 6 6\n4 4 8 8 8 8 8 8 8 6",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
9 8 8 8 8 8 8 8 8 2
9 8 8 8 8 8 8 8 8 2
9 8 8 8 8 8 8 8 8 2
9 8 0 8 8 8 8 8 8 2
9 8 8 8 8 8 8 8 8 2
9 8 8 8 0 8 8 8 8 2
9 8 8 8 8 8 8 8 8 2
9 8 8 8 8 8 8 8 8 2
9 8 8 8 8 8 0 8 8 2
9 8 8 8 8 8 8 8 8 2
Output:
9 ... | 4 8 8 8 8 8 8 8 8 6
4 8 4 8 8 8 6 8 8 6
4 8 8 8 4 8 8 8 8 6
4 8 8 8 8 8 8 8 8 6
4 8 8 4 8 8 8 8 8 6
4 8 8 8 8 8 6 8 8 6
4 8 8 4 8 8 8 8 8 6
4 8 8 8 8 8 8 8 8 6
4 8 8 8 8 6 8 8 6 6
4 4 8 8 8 8 8 8 8 6 | 4 8 8 8 8 8 8 8 8 6
4 8 4 8 8 8 6 8 8 6
4 8 8 8 4 8 8 8 8 6
4 8 8 8 8 8 8 8 8 6
4 8 8 4 8 8 8 8 8 6
4 8 8 8 8 8 6 8 8 6
4 8 8 4 8 8 8 8 8 6
4 8 8 8 8 8 8 8 8 6
4 8 8 8 8 6 8 8 6 6
4 4 8 8 8 8 8 8 8 6 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n7 7 7 7 7 7 7 7 7 7 7 7 7 7\n7 7 7 7 7 7 1 1 7 7 7 7 7 7\n7 0 7 0 7 7 7 1 1 7 0 7 0 7\n7 7 0 7 7 7 1 1 7 7 7 0 7 7\n7 7 0 7 7 7 7 7 7 7 7 0 7 7\n7 7 7 7 7 7 7 7 7 7 7 7 7 7\n7 7 7 7 7... | {
"ground_truth": "7 9 9\n9 9 9\n7 9 7",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
7 7 7 7 7 7 7 7 7 7 7 7 7 7
7 7 7 7 7 7 1 1 7 7 7 7 7 7
7 0 7 0 7 7 7 1 1 7 0 7 0 7
7 7 0 7 7 7 1 1 7 7 7 0 7 7
7 7 0 7 7 7 7 7 7 7 7 0 7 7
7 7 7 7 7 7 7 7 7 7 7 7 7 7
7 7 7 7 7 9 7 9 7 7 7 7 7 7
1 1 7 7 7 7 9 ... | 7 9 9
9 9 9
7 9 7 | 7 9 9
9 9 9
7 9 7 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n2 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2 0 2\n2 2 2 2 2 2 7 7 2 2\n2 2 2 2 2 2 7 7 2 2\n2 2 2 2 2 2 7 2 2 2\n2 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2... | {
"ground_truth": "2 2 2 2 2 2 2 2 2 2\n2 2 2 2 0 2 0 2 2 2\n2 2 2 2 0 1 0 2 2 2\n2 2 0 0 0 1 0 0 0 2\n2 2 2 1 1 0 1 1 2 2\n2 2 0 0 0 1 0 0 0 2\n2 2 2 2 0 1 0 2 2 2\n2 2 2 2 0 2 0 2 2 2\n2 2 2 2 2 2 2 2 2 2\n2 2 2 2 2 2 2 2 2 2",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 0 2
2 2 2 2 2 2 7 7 2 2
2 2 2 2 2 2 7 7 2 2
2 2 2 2 2 2 7 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2
Output:
2 ... | 2 2 2 2 2 2 2 2 2 2
2 2 2 2 0 2 0 2 2 2
2 2 2 2 0 1 0 2 2 2
2 2 0 0 0 1 0 0 0 2
2 2 2 1 1 0 1 1 2 2
2 2 0 0 0 1 0 0 0 2
2 2 2 2 0 1 0 2 2 2
2 2 2 2 0 2 0 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2 | 2 2 2 2 2 2 2 2 2 2
2 2 2 2 0 2 0 2 2 2
2 2 2 2 0 1 0 2 2 2
2 2 0 0 0 1 0 0 0 2
2 2 2 1 1 0 1 1 2 2
2 2 0 0 0 1 0 0 0 2
2 2 2 2 0 1 0 2 2 2
2 2 2 2 0 2 0 2 2 2
2 2 2 2 2 2 2 2 2 2
2 2 2 2 2 2 2 2 2 2 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n0 6 6 6 5 6\n6 6 6 6 6 6\n6 6 2 6 6 6\n6 6 6 6 6 6\n6 6 6 6 5 6\n6 6 6 6 6 6\nOutput:\n0 6 5\n6 2 6\n6 6 5\n\nExample 2:\n\nInput:\n2 6 2 6 9 6\n6 6 6 6 6 6\n2 6 0 6 6 6\n6 6 6 6 6 6\... | {
"ground_truth": "9 3 3\n9 6 6\n1 0 0",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
0 6 6 6 5 6
6 6 6 6 6 6
6 6 2 6 6 6
6 6 6 6 6 6
6 6 6 6 5 6
6 6 6 6 6 6
Output:
0 6 5
6 2 6
6 6 5
Example 2:
Input:
2 6 2 6 9 6
6 6 6 6 6 6
2 6 0 6 6 6
6 6 6 6 6 6
0 6 6 6 6 6
6 6 6 6 6 6
Output:
2 2 9
2 0 6
... | 9 3 3
9 6 6
1 0 0 | 9 3 3
9 6 6
1 0 0 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n4 4 4 4 4 4 4 4 4 4\n4 4 4 4 4 4 4 8 8 4\n4 4 8 8 4 4 8 8 8 4\n4 8 8 8 4 4 4 4 4 4\n4 4 4 4 4 4 4 4 4 4\n4 4 4 0 0 4 4 4 4 4\n4 4 9 9 9 4 4 4 4 4\n4 4 4 4 4 8 8 4 4 4\n4 4 4 4 8 8 8 4... | {
"ground_truth": "4 4 4 4 4 4 4 4 4 4\n4 4 2 2 4 4 4 2 2 4\n4 1 1 2 1 4 1 1 2 1\n4 4 1 4 4 4 4 1 4 4\n4 4 4 4 4 4 4 4 4 4\n4 4 4 4 4 4 4 4 4 4\n4 4 2 2 4 4 4 4 4 4\n4 1 1 2 1 4 4 4 4 4\n4 4 1 4 4 4 4 4 4 4\n4 4 4 4 4 4 4 4 4 4",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 8 8 4
4 4 8 8 4 4 8 8 8 4
4 8 8 8 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4
4 4 4 0 0 4 4 4 4 4
4 4 9 9 9 4 4 4 4 4
4 4 4 4 4 8 8 4 4 4
4 4 4 4 8 8 8 4 4 4
4 4 4 4 4 4 4 4 4 4
Output:
4 ... | 4 4 4 4 4 4 4 4 4 4
4 4 2 2 4 4 4 2 2 4
4 1 1 2 1 4 1 1 2 1
4 4 1 4 4 4 4 1 4 4
4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4
4 4 2 2 4 4 4 4 4 4
4 1 1 2 1 4 4 4 4 4
4 4 1 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 | 4 4 4 4 4 4 4 4 4 4
4 4 2 2 4 4 4 2 2 4
4 1 1 2 1 4 1 1 2 1
4 4 1 4 4 4 4 1 4 4
4 4 4 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4
4 4 2 2 4 4 4 4 4 4
4 1 1 2 1 4 4 4 4 4
4 4 1 4 4 4 4 4 4 4
4 4 4 4 4 4 4 4 4 4 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n9 9 7 7 9 9 9 9 9\n9 9 7 7 9 9 9 9 9\n9 7 9 9 9 9 9 9 9\n9 9 9 9 9 9 2 9 9\n9 9 9 9 9 9 9 9 9\n2 9 9 9 2 9 9 9 9\n9 9 9 9 9 9 9 9 9\n9 9 9 9 9 9 9 9 9\n9 9 9 9 9 9 9 9 9\nOutput:\n9 7... | {
"ground_truth": "7 7 7\n7 9 7\n9 7 9\n7 7 7\n7 9 7\n9 7 9",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
9 9 7 7 9 9 9 9 9
9 9 7 7 9 9 9 9 9
9 7 9 9 9 9 9 9 9
9 9 9 9 9 9 2 9 9
9 9 9 9 9 9 9 9 9
2 9 9 9 2 9 9 9 9
9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9
9 9 9 9 9 9 9 9 9
Output:
9 7 7
9 7 7
7 9 9
9 7 7
9 7 7
7 9 9
9 7 ... | 7 7 7
7 9 7
9 7 9
7 7 7
7 9 7
9 7 9 | 7 7 7
7 9 7
9 7 9
7 7 7
7 9 7
9 7 9 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 8 0 0 0\n0 0 8 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 2 2 0 0 0\n0 0 0 0 0 2 2 0 0 8\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0... | {
"ground_truth": "0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 8 8 0 0 0 0 0\n0 0 2 2 0 0 0 0 0 0\n0 8 2 2 8 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 8 0 0 0
0 0 8 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 2 2 0 0 0
0 0 0 0 0 2 2 0 0 8
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
Output:
0 ... | 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 8 8 0 0 0 0 0
0 0 2 2 0 0 0 0 0 0
0 8 2 2 8 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 | 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 8 8 0 0 0 0 0
0 0 2 2 0 0 0 0 0 0
0 8 2 2 8 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n9 2 2 8\n2 9 8 2\n2 8 9 2\n8 2 2 9\n2 5 2 2\n2 5 2 2\n5 5 5 5\n2 5 2 2\nOutput:\n2 9 2 2 2 2 2 2 2 2 2 2 2 8 2 2\n2 9 2 2 2 2 2 2 2 2 2 2 2 8 2 2\n9 9 9 9 2 2 2 2 2 2 2 2 8 8 8 8\n2 9... | {
"ground_truth": "2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3\n3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3\n3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3\n2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3\n2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2\n2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2\n2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2\n2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2\n2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2\n2 ... | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
9 2 2 8
2 9 8 2
2 8 9 2
8 2 2 9
2 5 2 2
2 5 2 2
5 5 5 5
2 5 2 2
Output:
2 9 2 2 2 2 2 2 2 2 2 2 2 8 2 2
2 9 2 2 2 2 2 2 2 2 2 2 2 8 2 2
9 9 9 9 2 2 2 2 2 2 2 2 8 8 8 8
2 9 2 2 2 2 2 2 2 2 2 2 2 8 2 2
2 2 2 2 2 ... | 2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3
3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3
3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3
2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
... | 2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3
3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3
3 3 2 3 2 2 2 2 2 2 2 2 3 3 2 3
2 3 3 3 2 2 2 2 2 2 2 2 2 3 3 3
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 2 9 9 9 2 9 9 9 2 2 2 2
2 2 2 2 9 9 2 9 9 9 2 9 2 2 2 2
... |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n1 8 8 1 1 2 2 2 2 2\n1 8 8 1 1 2 2 1 1 2\n1 1 1 1 5 2 2 2 2 2\n1 1 1 1 1 1 1 1 1 1\n1 2 2 2 2 2 1 1 5 1\n1 2 2 2 2 2 1 1 1 1\n1 2 1 1 2 2 1 1 1 1\n1 2 1 1 2 2 1 9 9 1\n1 2 2 2 2 2 1 1... | {
"ground_truth": "0 1 1 2 2 2 2 2 2 2\n1 0 1 2 6 6 6 2 2 2\n1 1 1 2 2 2 2 2 2 2\n1 1 1 1 1 1 1 1 1 1\n1 1 1 1 1 0 1 0 1 1\n1 1 2 2 2 2 2 1 1 0\n1 1 2 2 2 2 2 1 1 1\n1 1 2 2 5 2 2 1 1 1\n0 1 2 5 5 5 2 1 1 1\n1 1 2 2 2 2 2 1 1 0",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
1 8 8 1 1 2 2 2 2 2
1 8 8 1 1 2 2 1 1 2
1 1 1 1 5 2 2 2 2 2
1 1 1 1 1 1 1 1 1 1
1 2 2 2 2 2 1 1 5 1
1 2 2 2 2 2 1 1 1 1
1 2 1 1 2 2 1 1 1 1
1 2 1 1 2 2 1 9 9 1
1 2 2 2 2 2 1 1 1 1
5 1 1 1 1 1 1 1 5 5
Output:
1 ... | 0 1 1 2 2 2 2 2 2 2
1 0 1 2 6 6 6 2 2 2
1 1 1 2 2 2 2 2 2 2
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 0 1 0 1 1
1 1 2 2 2 2 2 1 1 0
1 1 2 2 2 2 2 1 1 1
1 1 2 2 5 2 2 1 1 1
0 1 2 5 5 5 2 1 1 1
1 1 2 2 2 2 2 1 1 0 | 0 1 1 2 2 2 2 2 2 2
1 0 1 2 6 6 6 2 2 2
1 1 1 2 2 2 2 2 2 2
1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 0 1 0 1 1
1 1 2 2 2 2 2 1 1 0
1 1 2 2 2 2 2 1 1 1
1 1 2 2 5 2 2 1 1 1
0 1 2 5 5 5 2 1 1 1
1 1 2 2 2 2 2 1 1 0 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n8 8 8 8 8 1 1\n8 8 8 8 8 1 1\n8 8 1 1 8 8 8\n8 8 1 1 8 8 8\n8 8 8 8 8 8 8\n8 8 8 8 1 1 8\n1 1 8 8 1 1 8\n1 1 8 8 8 8 8\n8 8 8 1 1 8 8\n8 8 8 1 1 8 8\n8 8 8 8 8 8 8\n8 8 8 8 8 1 1\n8 8... | {
"ground_truth": "8 8 8 8 8 0 0\n8 8 8 8 8 0 0\n8 8 1 1 8 8 8\n8 8 1 1 8 8 8\n8 8 8 8 0 0 8\n8 8 8 8 0 0 8\n8 8 8 8 8 8 8\n8 1 1 8 8 8 8\n8 1 1 8 8 0 0\n8 8 8 8 8 0 0\n8 8 8 8 8 8 8\n8 8 8 8 1 1 8\n8 8 8 8 1 1 8\n8 0 0 8 8 8 8\n8 0 0 8 8 8 8",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
8 8 8 8 8 1 1
8 8 8 8 8 1 1
8 8 1 1 8 8 8
8 8 1 1 8 8 8
8 8 8 8 8 8 8
8 8 8 8 1 1 8
1 1 8 8 1 1 8
1 1 8 8 8 8 8
8 8 8 1 1 8 8
8 8 8 1 1 8 8
8 8 8 8 8 8 8
8 8 8 8 8 1 1
8 8 8 8 8 1 1
8 1 1 8 8 8 8
8 1 1 8 8 8 8
... | 8 8 8 8 8 0 0
8 8 8 8 8 0 0
8 8 1 1 8 8 8
8 8 1 1 8 8 8
8 8 8 8 0 0 8
8 8 8 8 0 0 8
8 8 8 8 8 8 8
8 1 1 8 8 8 8
8 1 1 8 8 0 0
8 8 8 8 8 0 0
8 8 8 8 8 8 8
8 8 8 8 1 1 8
8 8 8 8 1 1 8
8 0 0 8 8 8 8
8 0 0 8 8 8 8 | 8 8 8 8 8 0 0
8 8 8 8 8 0 0
8 8 1 1 8 8 8
8 8 1 1 8 8 8
8 8 8 8 0 0 8
8 8 8 8 0 0 8
8 8 8 8 8 8 8
8 1 1 8 8 8 8
8 1 1 8 8 0 0
8 8 8 8 8 0 0
8 8 8 8 8 8 8
8 8 8 8 1 1 8
8 8 8 8 1 1 8
8 0 0 8 8 8 8
8 0 0 8 8 8 8 |
arc_agi | [
{
"content": "Find the common rule that maps an input grid to an output grid, given the examples below.\n\nExample 1:\n\nInput:\n6 6 6 6 3 6 6 6 6 6\n6 6 1 6 6 6 6 6 6 6\n6 6 6 6 6 6 6 6 5 6\n6 6 6 6 6 6 6 6 6 6\n6 6 6 6 6 2 6 6 6 6\n6 6 6 6 6 6 6 6 6 6\n6 6 6 6 6 6 6 7 6 6\n6 6 6 6 6 6 6 6 6 6\n6 6 6 0 6 6 6 6... | {
"ground_truth": "3 5 0\n2 0 4\n9 1 3",
"style": "rule-lighteval/MATH_v2"
} | Find the common rule that maps an input grid to an output grid, given the examples below.
Example 1:
Input:
6 6 6 6 3 6 6 6 6 6
6 6 1 6 6 6 6 6 6 6
6 6 6 6 6 6 6 6 5 6
6 6 6 6 6 6 6 6 6 6
6 6 6 6 6 2 6 6 6 6
6 6 6 6 6 6 6 6 6 6
6 6 6 6 6 6 6 7 6 6
6 6 6 6 6 6 6 6 6 6
6 6 6 0 6 6 6 6 6 6
6 6 6 6 6 6 6 6 4 6
Output:
4 ... | 3 5 0
2 0 4
9 1 3 | 3 5 0
2 0 4
9 1 3 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-3 number 220020 to binary\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "1010001110",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 220020 to binary
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 1010001110 | 1010001110 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-6 number 103 to base-13\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "30",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-6 number 103 to base-13
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 30 | 30 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-10 number 418 to base-13\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "262",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-10 number 418 to base-13
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 262 | 262 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-8 number 426 to base-9\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "338",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-8 number 426 to base-9
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 338 | 338 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-3 number 1020200 to base-8\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "1615",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 1020200 to base-8
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 1615 | 1615 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-3 number 111100 to base-8\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "550",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 111100 to base-8
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 550 | 550 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-7 number 1431 to base-4\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "20301",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 1431 to base-4
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 20301 | 20301 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-7 number 125 to base-8\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "104",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 125 to base-8
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 104 | 104 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-15 number 23e to base-6\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "2205",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 23e to base-6
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 2205 | 2205 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-15 number 119 to base-10\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "249",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 119 to base-10
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 249 | 249 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the binary number 100010010 to hexadecimal\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "112",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the binary number 100010010 to hexadecimal
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 112 | 112 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-15 number 2c1 to hexadecimal\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "277",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 2c1 to hexadecimal
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 277 | 277 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-4 number 32213 to base-9\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "1248",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-4 number 32213 to base-9
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 1248 | 1248 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-5 number 332 to base-4\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "1130",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-5 number 332 to base-4
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 1130 | 1130 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-15 number 45e to base-10\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "989",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-15 number 45e to base-10
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 989 | 989 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-7 number 61 to base-11\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "3a",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-7 number 61 to base-11
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 3a | 3a |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-5 number 4334 to base-13\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "369",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-5 number 4334 to base-13
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 369 | 369 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-3 number 22111 to hexadecimal\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "e5",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-3 number 22111 to hexadecimal
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | e5 | e5 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-6 number 1243 to base-11\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "267",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-6 number 1243 to base-11
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 267 | 267 |
base_conversion | [
{
"content": "Your task is to convert a number between two different bases.\n\nIf the target base is > 10, use lowercase letters a-z for digits above 9.\n\nNow, convert the base-4 number 13322 to base-10\n\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "506",
"style": "rule-lighteval/MATH_v2"
} | Your task is to convert a number between two different bases.
If the target base is > 10, use lowercase letters a-z for digits above 9.
Now, convert the base-4 number 13322 to base-10
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 506 | 506 |
basic_arithmetic | [
{
"content": "Calculate -5 * -6.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "30",
"style": "rule-lighteval/MATH_v2"
} | Calculate -5 * -6.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 30 | 30 |
basic_arithmetic | [
{
"content": "Calculate 965 / 5.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "193",
"style": "rule-lighteval/MATH_v2"
} | Calculate 965 / 5.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 193 | 193 |
basic_arithmetic | [
{
"content": "Calculate 0 + -2 + -4 * 0 * 3.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-2",
"style": "rule-lighteval/MATH_v2"
} | Calculate 0 + -2 + -4 * 0 * 3.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -2 | -2 |
basic_arithmetic | [
{
"content": "Calculate -65 - -9292 + 5869 + -6236.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "8860",
"style": "rule-lighteval/MATH_v2"
} | Calculate -65 - -9292 + 5869 + -6236.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 8860 | 8860 |
basic_arithmetic | [
{
"content": "Calculate 9288 - 9128.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "160",
"style": "rule-lighteval/MATH_v2"
} | Calculate 9288 - 9128.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 160 | 160 |
basic_arithmetic | [
{
"content": "Calculate -( ( 4 + -9 * 8 ) + 9 ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "59",
"style": "rule-lighteval/MATH_v2"
} | Calculate -( ( 4 + -9 * 8 ) + 9 ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 59 | 59 |
basic_arithmetic | [
{
"content": "Calculate -( 463 / 1 ) - 10 - 562 - -849 - -869.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "683",
"style": "rule-lighteval/MATH_v2"
} | Calculate -( 463 / 1 ) - 10 - 562 - -849 - -869.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 683 | 683 |
basic_arithmetic | [
{
"content": "Calculate ( 393 + -683 ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-290",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( 393 + -683 ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -290 | -290 |
basic_arithmetic | [
{
"content": "Calculate ( ( 141 + 906 ) - 691 ) + -612 + 992.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "736",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( ( 141 + 906 ) - 691 ) + -612 + 992.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 736 | 736 |
basic_arithmetic | [
{
"content": "Calculate -40 * ( ( -98 + -92 ) ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "7600",
"style": "rule-lighteval/MATH_v2"
} | Calculate -40 * ( ( -98 + -92 ) ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 7600 | 7600 |
basic_arithmetic | [
{
"content": "Calculate ( -5 - -( ( -2 + -4 ) ) - -2 ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-9",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( -5 - -( ( -2 + -4 ) ) - -2 ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -9 | -9 |
basic_arithmetic | [
{
"content": "Calculate ( -( -56 * -33 + -87 ) * 13 ) - -67 - 30.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-22856",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( -( -56 * -33 + -87 ) * 13 ) - -67 - 30.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -22856 | -22856 |
basic_arithmetic | [
{
"content": "Calculate 5976 - -2823 - 816.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "7983",
"style": "rule-lighteval/MATH_v2"
} | Calculate 5976 - -2823 - 816.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 7983 | 7983 |
basic_arithmetic | [
{
"content": "Calculate 90 * 92.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "8280",
"style": "rule-lighteval/MATH_v2"
} | Calculate 90 * 92.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 8280 | 8280 |
basic_arithmetic | [
{
"content": "Calculate ( ( 1 * 9 + -8 * 8 ) ) - -( ( 8 - -4 ) ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-43",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( ( 1 * 9 + -8 * 8 ) ) - -( ( 8 - -4 ) ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -43 | -43 |
basic_arithmetic | [
{
"content": "Calculate -539 * -405.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "218295",
"style": "rule-lighteval/MATH_v2"
} | Calculate -539 * -405.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 218295 | 218295 |
basic_arithmetic | [
{
"content": "Calculate -( -89 - 4 ) * ( ( -96 / 48 ) / 1 ) / 2.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-93",
"style": "rule-lighteval/MATH_v2"
} | Calculate -( -89 - 4 ) * ( ( -96 / 48 ) / 1 ) / 2.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -93 | -93 |
basic_arithmetic | [
{
"content": "Calculate ( -( 6 / 3 ) * 9 ).\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-18",
"style": "rule-lighteval/MATH_v2"
} | Calculate ( -( 6 / 3 ) * 9 ).
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -18 | -18 |
basic_arithmetic | [
{
"content": "Calculate 655 - -43 * 623 + -684.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "26760",
"style": "rule-lighteval/MATH_v2"
} | Calculate 655 - -43 * 623 + -684.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | 26760 | 26760 |
basic_arithmetic | [
{
"content": "Calculate -17 - -17 * -92 - -8 - -83.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "-1490",
"style": "rule-lighteval/MATH_v2"
} | Calculate -17 - -17 * -92 - -8 - -83.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | -1490 | -1490 |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>++++++++++[<+++++++++++>-]<+.-.+++++.--------------.+++++++++++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "onset",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>++++++++++[<+++++++++++>-]<+.-.+++++.--------------.+++++++++++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | onset | onset |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>++++++++[<++++++++++++++>-]<.-----------.+++++++++++++.---------------.+++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
... | {
"ground_truth": "perch",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>++++++++[<++++++++++++++>-]<.-----------.+++++++++++++.---------------.+++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | perch | perch |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++++[<+++++++++++++>-]<.-------.----------.+.+++++++++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "under",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++++[<+++++++++++++>-]<.-------.----------.+.+++++++++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | under | under |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++++[<++++++++++++>-]<+.----.++++++++++..++++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "missy",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++++[<++++++++++++>-]<+.----.++++++++++..++++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | missy | missy |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>++++++++++[<+++++++++++>-]<+.+++++++++.---------------.-----.+.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "oxide",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>++++++++++[<+++++++++++>-]<+.+++++++++.---------------.-----.+.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | oxide | oxide |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++[<++++++++++++++>-]<.>++++[<++++>-]<.---------.------.++++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
... | {
"ground_truth": "brick",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++[<++++++++++++++>-]<.>++++[<++++>-]<.---------.------.++++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | brick | brick |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++++[<++++++++++++>-]<+.++.++++..++++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "mossy",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++++[<++++++++++++>-]<+.++.++++..++++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | mossy | mossy |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++++[<++++++++++++>-]<+.++.+++++++.-------------.----.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "movie",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++++[<++++++++++++>-]<+.++.+++++++.-------------.----.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | movie | movie |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>++++++++++[<++++++++++>-]<.+++++.+++++++++.++.+++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "dirty",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>++++++++++[<++++++++++>-]<.+++++.+++++++++.++.+++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | dirty | dirty |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>++++++++[<+++++++++++++>-]<-.+++++.---.+++++.++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "glint",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>++++++++[<+++++++++++++>-]<-.+++++.---.+++++.++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | glint | glint |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>++++++++++[<++++++++++++>-]<-.--------.+++..+++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "worry",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>++++++++++[<++++++++++++>-]<-.--------.+++..+++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | worry | worry |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++[<+++++++++++++++>-]<+.+++++.---..+++++++++++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "jolly",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++[<+++++++++++++++>-]<+.+++++.---..+++++++++++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | jolly | jolly |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>++++++++++[<+++++++++++>-]<+.+.-------.++++++++++++.--------.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "opium",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>++++++++++[<+++++++++++>-]<+.+.-------.++++++++++++.--------.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | opium | opium |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>++++++++[<++++++++++++++>-]<.++.---------.++++.++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "primo",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>++++++++[<++++++++++++++>-]<.++.---------.++++.++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | primo | primo |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++++[<+++++++++++++>-]<-.-----.+++.+.----.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "torso",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++++[<+++++++++++++>-]<-.-----.+++.+.----.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | torso | torso |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++++[<+++++++++++++>-]<+.-------------.+++++++++.>++++[<---->-]<-.+++++++++++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "us... | {
"ground_truth": "viral",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++++[<+++++++++++++>-]<+.-------------.+++++++++.>++++[<---->-]<-.+++++++++++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | viral | viral |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++++[<+++++++++++++>-]<+.>++++[<---->-]<-.+++++++++++++.+.--------------.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "us... | {
"ground_truth": "verse",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++++[<+++++++++++++>-]<+.>++++[<---->-]<-.+++++++++++++.+.--------------.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | verse | verse |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++++[<+++++++++++>-]<.+++++.+++++++.------.+++++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "choir",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++++[<+++++++++++>-]<.+++++.+++++++.------.+++++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | choir | choir |
bf | [
{
"content": "Consider the following BF (Brainf*ck) code. What would it output?\n\n>[-]>[-]<>+++++++++[<+++++++++++++>-]<--.++++.>+++[<------->-]<-.++++++++++++.+++.<\n\nProvide only the exact output of the code.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": "user"
}
] | {
"ground_truth": "swamp",
"style": "rule-lighteval/MATH_v2"
} | Consider the following BF (Brainf*ck) code. What would it output?
>[-]>[-]<>+++++++++[<+++++++++++++>-]<--.++++.>+++[<------->-]<-.++++++++++++.+++.<
Provide only the exact output of the code.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | swamp | swamp |
bf | [
{
"content": "This is a BF (Brainf*ck) computer program. What is the output?\n\n>[-]>[-]<>+++++++++[<++++++++++++>-]<+.------------.++++++++++++.-----------.+++++++++++++.<\n\nRespond only with the exact output of the program.\nWrite your final answer after 'FINAL ANSWER: ' tag inside \\boxed{.}.",
"role": ... | {
"ground_truth": "mambo",
"style": "rule-lighteval/MATH_v2"
} | This is a BF (Brainf*ck) computer program. What is the output?
>[-]>[-]<>+++++++++[<++++++++++++>-]<+.------------.++++++++++++.-----------.+++++++++++++.<
Respond only with the exact output of the program.
Write your final answer after 'FINAL ANSWER: ' tag inside \boxed{.}. | mambo | mambo |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "5",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | 5 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "3",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | 3 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "5",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | 5 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "3",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | 3 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "2",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | 2 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "6",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | 6 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "6",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | 6 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "2",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | 2 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "-1",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | -1 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "-1",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | -1 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "4",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 4 | 4 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "-1",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | -1 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "2",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 2 | 2 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "-1",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | -1 | -1 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "5",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 5 | 5 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "3",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 3 | 3 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "6",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | 6 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "4",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 4 | 4 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "6",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | 6 |
binary_alternation | [
{
"content": "Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.\n\nThe string is called alternating if no two adjacent characters are equal. For example, the strings \"010\" and \"1010\" are alternating, while the string \"0100\" is not.\n\nAn... | {
"ground_truth": "6",
"style": "rule-lighteval/MATH_v2"
} | Given a binary string, return the minimum number of character swaps to make it alternating, or -1 if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not.
Any two characters may be swapped,... | 6 | 6 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "1 1 0 1\n0 0 0 0\n1 1 1 0\n1 0 1 0",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 1
0 0 0 0
... | 1 1 0 1
0 0 0 0
1 1 1 0
1 0 1 0 | 1 1 0 1
0 0 0 0
1 1 1 0
1 0 1 0 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "1 0 1\n2 1 2\n1 0 1",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 0 1
1 1 1
1 0 ... | 1 0 1
2 1 2
1 0 1 | 1 0 1
2 1 2
1 0 1 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "0 1 1 2 1 2 1 0 1\n1 1 0 1 0 1 0 1 1\n1 0 1 1 0 1 0 1 0\n2 1 2 2 1 2 1 0 1\n2 2 2 1 0 1 1 0 1\n1 2 3 2 1 1 2 1 1\n0 1 2 2 1 0 1 1 0\n1 1 2 3 2 1 2 2 1\n0 0 1 2 3 2 3 3 2",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 1 1 1 1 1 0 ... | 0 1 1 2 1 2 1 0 1
1 1 0 1 0 1 0 1 1
1 0 1 1 0 1 0 1 0
2 1 2 2 1 2 1 0 1
2 2 2 1 0 1 1 0 1
1 2 3 2 1 1 2 1 1
0 1 2 2 1 0 1 1 0
1 1 2 3 2 1 2 2 1
0 0 1 2 3 2 3 3 2 | 0 1 1 2 1 2 1 0 1
1 1 0 1 0 1 0 1 1
1 0 1 1 0 1 0 1 0
2 1 2 2 1 2 1 0 1
2 2 2 1 0 1 1 0 1
1 2 3 2 1 1 2 1 1
0 1 2 2 1 0 1 1 0
1 1 2 3 2 1 2 2 1
0 0 1 2 3 2 3 3 2 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "3 2 1 1 0 1 1\n2 1 0 1 1 1 0\n1 0 1 2 1 0 1\n1 0 1 1 0 0 1\n1 0 0 1 1 0 1\n2 1 1 2 2 1 0\n3 2 2 2 1 0 1",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 1
1 ... | 3 2 1 1 0 1 1
2 1 0 1 1 1 0
1 0 1 2 1 0 1
1 0 1 1 0 0 1
1 0 0 1 1 0 1
2 1 1 2 2 1 0
3 2 2 2 1 0 1 | 3 2 1 1 0 1 1
2 1 0 1 1 1 0
1 0 1 2 1 0 1
1 0 1 1 0 0 1
1 0 0 1 1 0 1
2 1 1 2 2 1 0
3 2 2 2 1 0 1 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "1 1 0 0\n0 0 1 1\n0 1 2 2\n1 2 3 3",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 0
0 0 1 1
... | 1 1 0 0
0 0 1 1
0 1 2 2
1 2 3 3 | 1 1 0 0
0 0 1 1
0 1 2 2
1 2 3 3 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "3 2 2 1 0 1 0 1\n2 1 1 0 1 0 1 1\n1 0 1 1 2 1 0 0\n2 1 2 2 2 1 1 1\n2 2 3 2 1 0 0 1\n1 2 3 2 1 0 1 2\n0 1 2 1 0 1 2 3\n1 2 2 1 0 0 1 2",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1 0 1 0 1
... | 3 2 2 1 0 1 0 1
2 1 1 0 1 0 1 1
1 0 1 1 2 1 0 0
2 1 2 2 2 1 1 1
2 2 3 2 1 0 0 1
1 2 3 2 1 0 1 2
0 1 2 1 0 1 2 3
1 2 2 1 0 0 1 2 | 3 2 2 1 0 1 0 1
2 1 1 0 1 0 1 1
1 0 1 1 2 1 0 0
2 1 2 2 2 1 1 1
2 2 3 2 1 0 0 1
1 2 3 2 1 0 1 2
0 1 2 1 0 1 2 3
1 2 2 1 0 0 1 2 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "2 1 0 0 1 1 2 1\n2 1 0 1 1 0 1 0\n2 1 0 0 1 1 2 1\n1 0 1 0 1 0 1 0\n1 0 1 1 1 1 0 1\n1 0 1 1 0 1 1 2\n2 1 2 1 1 0 1 1\n3 2 1 0 0 1 1 0",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 0 0 1 1 1 1
... | 2 1 0 0 1 1 2 1
2 1 0 1 1 0 1 0
2 1 0 0 1 1 2 1
1 0 1 0 1 0 1 0
1 0 1 1 1 1 0 1
1 0 1 1 0 1 1 2
2 1 2 1 1 0 1 1
3 2 1 0 0 1 1 0 | 2 1 0 0 1 1 2 1
2 1 0 1 1 0 1 0
2 1 0 0 1 1 2 1
1 0 1 0 1 0 1 0
1 0 1 1 1 1 0 1
1 0 1 1 0 1 1 2
2 1 2 1 1 0 1 1
3 2 1 0 0 1 1 0 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "3 2 1 2\n2 1 0 1\n1 0 1 1\n2 1 1 0",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
1 1 1 1
1 1 0 1
... | 3 2 1 2
2 1 0 1
1 0 1 1
2 1 1 0 | 3 2 1 2
2 1 0 1
1 0 1 1
2 1 1 0 |
binary_matrix | [
{
"content": "Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.\n\nThe output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.\n\nFind the distance to the nearest 0 for each cell in the matr... | {
"ground_truth": "0 1 0 1 1 2 1 0 1 2\n1 2 1 0 0 1 0 1 2 3\n1 2 1 0 1 2 1 0 1 2\n0 1 2 1 2 2 1 0 1 2\n1 0 1 2 2 3 2 1 0 1\n1 1 2 2 1 2 1 0 0 0\n0 1 2 1 0 1 1 1 1 0\n1 2 2 1 0 1 0 1 2 1\n2 2 1 2 1 0 1 1 2 2\n2 1 0 1 1 0 1 0 1 2",
"style": "rule-lighteval/MATH_v2"
} | Given a square matrix, your job is to find the taxicab (Manhattan) distance of the nearest 0 for each cell.
The output should be a matrix of the same size as the input matrix, where each cell contains the distance to the nearest 0.
Find the distance to the nearest 0 for each cell in the matrix below:
0 1 0 1 1 1 1 0 ... | 0 1 0 1 1 2 1 0 1 2
1 2 1 0 0 1 0 1 2 3
1 2 1 0 1 2 1 0 1 2
0 1 2 1 2 2 1 0 1 2
1 0 1 2 2 3 2 1 0 1
1 1 2 2 1 2 1 0 0 0
0 1 2 1 0 1 1 1 1 0
1 2 2 1 0 1 0 1 2 1
2 2 1 2 1 0 1 1 2 2
2 1 0 1 1 0 1 0 1 2 | 0 1 0 1 1 2 1 0 1 2
1 2 1 0 0 1 0 1 2 3
1 2 1 0 1 2 1 0 1 2
0 1 2 1 2 2 1 0 1 2
1 0 1 2 2 3 2 1 0 1
1 1 2 2 1 2 1 0 0 0
0 1 2 1 0 1 1 1 1 0
1 2 2 1 0 1 0 1 2 1
2 2 1 2 1 0 1 1 2 2
2 1 0 1 1 0 1 0 1 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.