id stringlengths 14 41 | task_type stringclasses 2
values | incontext_examples listlengths 3 3 | tool_test_set listlengths 0 8 | target_question stringlengths 0 1.04k | target_answer stringlengths 0 180 | tool_constraints dict | metadata dict |
|---|---|---|---|---|---|---|---|
knights_knaves-train-build-427 | build | [
{
"answer": "Ella is a devil, and Chloe is a devil.",
"question": "A very special island is inhabited only by angels and devils. Angels always tell the truth, and devils always lie. You meet 2 inhabitants: Ella, and Chloe. Ella said, \"Chloe is an angel.\" \"Chloe is an angel and Ella is an angel and Ella i... | [
{
"answer": "Owen is a sage, and Mason is a fool.",
"question": "A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 2 inhabitants: Owen, and Mason. As Owen put it, \"Mason is a fool\". Mason said, \"Owen is a sage if and only if Mason is a... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
isomorphic_strings-train-use-512 | use | [
{
"answer": "False",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a... | [] | Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | False | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} |
bitwise_arithmetic-train-use-505 | use | [
{
"answer": "0xcabe",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0x5a72 + 0x59b9) - (0x182d - ... | [] | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0x7ca7 * 0xe4cc) - (0x3910 << 0x2)) | 0x6f672cd4 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
tower_of_hanoi-train-build-68 | build | [
{
"answer": "[('A', 'C'), ('A', 'B'), ('C', 'B'), ('A', 'C'), ('B', 'A'), ('B', 'C'), ('A', 'C')]",
"question": "Solve the Tower of Hanoi puzzle with 3 disks. Move all disks from rod A to rod C using rod B as auxiliary. Provide the sequence of moves in the format: [(from_rod, to_rod), ...]. For example, (A,... | [
{
"answer": "[('A', 'C'), ('A', 'B'), ('C', 'B'), ('A', 'C'), ('B', 'A'), ('B', 'C'), ('A', 'C')]",
"question": "Solve the Tower of Hanoi puzzle with 3 disks. Move all disks from rod A to rod C using rod B as auxiliary. Provide the sequence of moves in the format: [(from_rod, to_rod), ...]. For example, (A,... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/tower_of_hanoi",
"task_name": "tower_of_hanoi"
} | ||
gcd-train-build-216 | build | [
{
"answer": "1",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 1515, 1005, 1576. Give only the GCD as your final answer."
},
{
"answer": "9",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 153, 99. Give only the GCD as your final answer."
},
{
... | [
{
"answer": "5",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 315, 410. Give only the GCD as your final answer."
},
{
"answer": "5",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 215, 130. Give only the GCD as your final answer."
},
{
"ans... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/gcd",
"task_name": "gcd"
} | ||
lcm-train-build-375 | build | [
{
"answer": "195",
"question": "Find the Least Common Multiple (LCM) of these numbers: 15, 39"
},
{
"answer": "1269",
"question": "Find the Least Common Multiple (LCM) of these numbers: 27, 47"
},
{
"answer": "147",
"question": "Find the Least Common Multiple (LCM) of these numbers: ... | [
{
"answer": "45",
"question": "Find the Least Common Multiple (LCM) of these numbers: 5, 45"
},
{
"answer": "9408",
"question": "Find the Least Common Multiple (LCM) of these numbers: 196, 192"
},
{
"answer": "15210",
"question": "Find the Least Common Multiple (LCM) of these numbers... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/lcm",
"task_name": "lcm"
} | ||
isomorphic_strings-train-build-819 | build | [
{
"answer": "True",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a ... | [
{
"answer": "False",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} | ||
isomorphic_strings-train-build-515 | build | [
{
"answer": "True",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a ... | [
{
"answer": "True",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} | ||
chain_sum-train-build-377 | build | [
{
"answer": "5",
"question": "State the final answer to the following arithmetic problem: 29 - 18 + 40 - 46 ="
},
{
"answer": "8902",
"question": "State the final answer to the following arithmetic problem: 9739 - 4192 + 3355 ="
},
{
"answer": "132",
"question": "State the final answ... | [
{
"answer": "-14",
"question": "State the final answer to the following arithmetic problem: 0 - 6 - 8 + 0 ="
},
{
"answer": "10",
"question": "State the final answer to the following arithmetic problem: 8 - 0 + 2 ="
},
{
"answer": "-132",
"question": "State the final answer to the fo... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} | ||
polynomial_equations-train-use-717 | use | [
{
"answer": "-2.5542, -0.1958, 0.0",
"question": "Solve for real l: 4*l**3 + 11*l**2 + 2*l = 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 ... | [] | Find the real value(s) of b in the equation: 3*b**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"), conv... | 0.0 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} |
lcm-train-use-57 | use | [
{
"answer": "24",
"question": "Find the Least Common Multiple (LCM) of these numbers: 4, 24"
},
{
"answer": "150",
"question": "Find the Least Common Multiple (LCM) of these numbers: 30, 25"
},
{
"answer": "6160",
"question": "Find the Least Common Multiple (LCM) of these numbers: 17... | [] | Find the Least Common Multiple (LCM) of these numbers: 122, 183, 94 | 17202 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/lcm",
"task_name": "lcm"
} |
count_bits-train-use-737 | use | [
{
"answer": "11",
"question": "How many 1 bits are there in the binary representation of the number 2560996?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 584097?"
},
{
"answer": "6",
"question": "How many 1 bits are there in t... | [] | How many 1 bits are there in the binary representation of the number 7146889? | 11 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} |
tower_of_hanoi-train-build-35 | build | [
{
"answer": "[('A', 'B'), ('A', 'C'), ('B', 'C'), ('A', 'B'), ('C', 'A'), ('C', 'B'), ('A', 'B'), ('A', 'C'), ('B', 'C'), ('B', 'A'), ('C', 'A'), ('B', 'C'), ('A', 'B'), ('A', 'C'), ('B', 'C')]",
"question": "Solve the Tower of Hanoi puzzle with 4 disks. Move all disks from rod A to rod C using rod B as aux... | [
{
"answer": "[('A', 'B'), ('A', 'C'), ('B', 'C'), ('A', 'B'), ('C', 'A'), ('C', 'B'), ('A', 'B'), ('A', 'C'), ('B', 'C'), ('B', 'A'), ('C', 'A'), ('B', 'C'), ('A', 'B'), ('A', 'C'), ('B', 'C')]",
"question": "Solve the Tower of Hanoi puzzle with 4 disks. Move all disks from rod A to rod C using rod B as aux... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/tower_of_hanoi",
"task_name": "tower_of_hanoi"
} | ||
bitwise_arithmetic-train-use-750 | use | [
{
"answer": "0xe439568",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0xa6b1 << 0x0) * (0x57a0 >... | [] | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
((0xdfdc << 0x0) + (0x6d2d - 0x32e)) | 0x149db | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
base_conversion-train-use-478 | use | [
{
"answer": "4e2",
"question": "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-14 number 654 to hexadecimal\n"
},
{
"answer": "1120222",
"question": "Your task is to convert a num... | [] | 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 1412 to base-12
| 998 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/base_conversion",
"task_name": "base_conversion"
} |
chain_sum-train-build-793 | build | [
{
"answer": "108",
"question": "State the final answer to the following arithmetic problem: 71 - 51 + 88 ="
},
{
"answer": "196",
"question": "State the final answer to the following arithmetic problem: 76 + 57 + 58 - 33 + 38 ="
},
{
"answer": "5592",
"question": "State the final ans... | [
{
"answer": "14102",
"question": "State the final answer to the following arithmetic problem: 2603 + 6510 + 4989 ="
},
{
"answer": "33",
"question": "State the final answer to the following arithmetic problem: 49 - 16 ="
},
{
"answer": "1511",
"question": "State the final answer to t... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} | ||
isomorphic_strings-train-use-422 | use | [
{
"answer": "True",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a ... | [] | Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | True | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} |
count_bits-train-build-104 | build | [
{
"answer": "10",
"question": "How many 1 bits are there in the binary representation of the number 338263?"
},
{
"answer": "11",
"question": "How many 1 bits are there in the binary representation of the number 7108240?"
},
{
"answer": "13",
"question": "How many 1 bits are there in... | [
{
"answer": "14",
"question": "How many 1 bits are there in the binary representation of the number 979645?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 203988?"
},
{
"answer": "13",
"question": "How many 1 bits are there in t... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
lcm-train-build-266 | build | [
{
"answer": "420",
"question": "Find the Least Common Multiple (LCM) of these numbers: 30, 28"
},
{
"answer": "4743",
"question": "Find the Least Common Multiple (LCM) of these numbers: 51, 153, 93"
},
{
"answer": "50",
"question": "Find the Least Common Multiple (LCM) of these numbe... | [
{
"answer": "13104",
"question": "Find the Least Common Multiple (LCM) of these numbers: 182, 144"
},
{
"answer": "14774",
"question": "Find the Least Common Multiple (LCM) of these numbers: 166, 178"
},
{
"answer": "4071",
"question": "Find the Least Common Multiple (LCM) of these n... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/lcm",
"task_name": "lcm"
} | ||
gcd-train-build-630 | build | [
{
"answer": "2",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 22, 432. Give only the GCD as your final answer."
},
{
"answer": "2",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 150, 244. Give only the GCD as your final answer."
},
{
"answ... | [
{
"answer": "6",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 126, 300. Give only the GCD as your final answer."
},
{
"answer": "3",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 90, 471. Give only the GCD as your final answer."
},
{
"answ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/gcd",
"task_name": "gcd"
} | ||
chain_sum-train-use-27 | use | [
{
"answer": "108",
"question": "State the final answer to the following arithmetic problem: 71 - 51 + 88 ="
},
{
"answer": "397",
"question": "State the final answer to the following arithmetic problem: 384 - 141 - 595 + 749 ="
},
{
"answer": "-66",
"question": "State the final answe... | [] | State the final answer to the following arithmetic problem: 789 - 505 + 310 + 198 = | 792 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} |
chain_sum-train-build-445 | build | [
{
"answer": "8",
"question": "State the final answer to the following arithmetic problem: 9 + 9 - 7 - 3 ="
},
{
"answer": "159",
"question": "State the final answer to the following arithmetic problem: 59 + 88 + 12 ="
},
{
"answer": "3913",
"question": "State the final answer to the ... | [
{
"answer": "192",
"question": "State the final answer to the following arithmetic problem: 81 - 15 + 28 + 98 ="
},
{
"answer": "9",
"question": "State the final answer to the following arithmetic problem: 5 + 4 + 0 + 0 ="
},
{
"answer": "-5",
"question": "State the final answer to t... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} | ||
knights_knaves-train-build-47 | build | [
{
"answer": "Lily is a sage, Emma is a sage, and Evelyn is a sage.",
"question": "A very special island is inhabited only by sages and fools. Sages always tell the truth, and fools always lie. You meet 3 inhabitants: Lily, Emma, and Evelyn. Lily remarked, \"if (Emma is a fool and Evelyn is a sage) then (Emm... | [
{
"answer": "Joseph is a sinner, and Sofia is a saint.",
"question": "A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: Joseph, and Sofia. Joseph asserted: \"Sofia is a sinner if and only if Sofia is a saint\". Sofia ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} | ||
chain_sum-train-build-981 | build | [
{
"answer": "197",
"question": "State the final answer to the following arithmetic problem: 45 + 34 + 37 + 81 ="
},
{
"answer": "174",
"question": "State the final answer to the following arithmetic problem: 96 - 11 + 89 ="
},
{
"answer": "-5",
"question": "State the final answer to ... | [
{
"answer": "121",
"question": "State the final answer to the following arithmetic problem: 63 + 62 - 23 + 19 ="
},
{
"answer": "14",
"question": "State the final answer to the following arithmetic problem: 7 + 7 ="
},
{
"answer": "1127",
"question": "State the final answer to the fo... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} | ||
spell_backward-train-use-293 | use | [
{
"answer": "nisoe",
"question": "Spell this word backward (example: sun -> nus): eosin"
},
{
"answer": "peZ",
"question": "Spell this word backward (example: sun -> nus): Zep"
},
{
"answer": "lekcuy",
"question": "Spell this word backward (example: sun -> nus): yuckel"
}
] | [] | Spell this word backward (example: sun -> nus): whipstaff | ffatspihw | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} |
gsm1k-train-build-598 | build | [
{
"answer": "25",
"question": "Tonya makes a batch of 30 cookies for her friends, but her brother ate 1/6 cookies before anyone else could. How many cookies does Tonya have left to share with her friends?"
},
{
"answer": "12096",
"question": "Brian decides to build sheds for all of his neighbors... | [
{
"answer": "8100",
"question": "Amy is a champion snowboarder defending her title. The competition's point system is based on 1 point per rotation degree successfully landed. If she lands 20 full rotation tricks and 5 half rotation tricks, how many points does she have?"
},
{
"answer": "86",
"q... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "",
"source": "ScaleAI/gsm1k",
"task_name": "gsm1k"
} | ||
ab-train-use-320 | use | [
{
"answer": "#B B# B# B#",
"question": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens. Example:\n\n B# A# #B #A B#\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules:\n\n A# #A ... becomes ... nothing\n A# #B ... becom... | [] | A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #B #A A# | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/ab",
"task_name": "ab"
} |
spell_backward-train-build-968 | build | [
{
"answer": "caS",
"question": "Spell this word backward (example: sun -> nus): Sac"
},
{
"answer": "ssoc",
"question": "Spell this word backward (example: sun -> nus): coss"
},
{
"answer": "labmyc",
"question": "Spell this word backward (example: sun -> nus): cymbal"
}
] | [
{
"answer": "renruf",
"question": "Spell this word backward (example: sun -> nus): furner"
},
{
"answer": "esiwllaw",
"question": "Spell this word backward (example: sun -> nus): wallwise"
},
{
"answer": "rallupma",
"question": "Spell this word backward (example: sun -> nus): ampulla... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/spell_backward",
"task_name": "spell_backward"
} | ||
lcm-train-use-19 | use | [
{
"answer": "90",
"question": "Find the Least Common Multiple (LCM) of these numbers: 10, 45"
},
{
"answer": "126",
"question": "Find the Least Common Multiple (LCM) of these numbers: 18, 21"
},
{
"answer": "280317",
"question": "Find the Least Common Multiple (LCM) of these numbers:... | [] | Find the Least Common Multiple (LCM) of these numbers: 45, 30 | 90 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/lcm",
"task_name": "lcm"
} |
isomorphic_strings-train-use-781 | use | [
{
"answer": "False",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a... | [] | Two strings are isomorphic if the characters in one string can be replaced to get the second string.
All occurrences of a character must be replaced with another character while preserving the order of characters.
No two characters may map to the same character, but a character may map to itself.
Return True if the ... | False | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} |
simple_integration-train-build-535 | build | [
{
"answer": "8*X**3/7 - 65*X**2/8 + C",
"question": "Find the indefinite integral: ∫ 24*X**2/7 - 65*X/4 dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multip... | [
{
"answer": "-9*X**3/2 + 3*X**2 + C",
"question": "Evaluate the indefinite integral: ∫ -27*X**2/2 + 6*X dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multip... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/simple_integration",
"task_name": "simple_integration"
} | ||
chinese_remainder-train-use-366 | use | [
{
"answer": "7352753",
"question": "Q: There is a box of no more than 8235319 strawberries. If we divide them equally among 173 bears, we have 80 left; if we divide them equally among 181 people, we have 171 left; if we divide them equally among 263 crocodiles, we have 62 left. How many strawberries are in ... | [] | Q: There is a truck of no more than 553289 pears. If we divide them equally among 11 elephants, we have 0 left; if we divide them equally among 179 elephants, we have 142 left; if we divide them equally among 281 lemurs, we have 56 left. How many pears are in the truck?
A: | 317867 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "",
"source": "tasksource/bigbench/chinese_remainder_theorem",
"task_name": "chinese_remainder"
} |
simple_integration-train-use-393 | use | [
{
"answer": "-8*x**3 - 58*x**2/45 + C",
"question": "Find the indefinite integral: ∫ -24*x**2 - 116*x/45 dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multi... | [] | Evaluate the indefinite integral: ∫ 2 - 4*X/9 dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-3*X**3*... | -2*X**2/9 + 2*X + C | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/simple_integration",
"task_name": "simple_integration"
} |
polynomial_multiplication-train-use-759 | use | [
{
"answer": "4*z**3 + 8*z**2",
"question": "Simplify this expression: -4*z*(-z**2 - 2*z)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication operation... | [] | Simplify this expression: 6*z**2*(4*z**2 - 5*z)
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-3*X**3*s... | 24*z**4 - 30*z**3 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} |
base_conversion-train-build-34 | build | [
{
"answer": "275",
"question": "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 11100110 to base-9\n"
},
{
"answer": "424",
"question": "Your task is to convert a number b... | [
{
"answer": "2086",
"question": "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 6c6 to base-9\n"
},
{
"answer": "304",
"question": "Your task is to convert a number betw... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/base_conversion",
"task_name": "base_conversion"
} | ||
chain_sum-train-use-93 | use | [
{
"answer": "99",
"question": "State the final answer to the following arithmetic problem: 16 + 83 - 98 + 98 ="
},
{
"answer": "43",
"question": "State the final answer to the following arithmetic problem: 34 - 39 + 48 ="
},
{
"answer": "120",
"question": "State the final answer to t... | [] | State the final answer to the following arithmetic problem: 819 + 570 - 560 = | 829 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} |
simple_integration-train-use-729 | use | [
{
"answer": "-22*X**3/5 + 23*X**2/9 + C",
"question": "Evaluate the indefinite integral: ∫ -66*X**2/5 + 46*X/9 dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all... | [] | Evaluate the indefinite integral: ∫ 2 dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-3*X**3*sin(X) -... | 2*X + C | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/simple_integration",
"task_name": "simple_integration"
} |
count_bits-train-build-548 | build | [
{
"answer": "7",
"question": "How many 1 bits are there in the binary representation of the number 550961?"
},
{
"answer": "9",
"question": "How many 1 bits are there in the binary representation of the number 9742601?"
},
{
"answer": "10",
"question": "How many 1 bits are there in t... | [
{
"answer": "13",
"question": "How many 1 bits are there in the binary representation of the number 5798231?"
},
{
"answer": "8",
"question": "How many 1 bits are there in the binary representation of the number 854043?"
},
{
"answer": "9",
"question": "How many 1 bits are there in t... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/count_bits",
"task_name": "count_bits"
} | ||
isomorphic_strings-train-build-31 | build | [
{
"answer": "True",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a ... | [
{
"answer": "False",
"question": "Two strings are isomorphic if the characters in one string can be replaced to get the second string.\n\nAll occurrences of a character must be replaced with another character while preserving the order of characters.\n\nNo two characters may map to the same character, but a... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/isomorphic_strings",
"task_name": "isomorphic_strings"
} | ||
gcd-train-build-224 | build | [
{
"answer": "11",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 1331, 506. Give only the GCD as your final answer."
},
{
"answer": "16",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 208, 448. Give only the GCD as your final answer."
},
{
"... | [
{
"answer": "1",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 95, 42. Give only the GCD as your final answer."
},
{
"answer": "9",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 432, 63. Give only the GCD as your final answer."
},
{
"answer... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/gcd",
"task_name": "gcd"
} | ||
polynomial_equations-train-use-188 | use | [
{
"answer": "-0.9487, 0.9487",
"question": "Solve the polynomial equation for real d:\n10*d**2 - 9 = 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 (l... | [] | Find the real value(s) of n in the equation: -21*n**2 + 15*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)/17... | 0.0, 0.7143 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} |
caesar_cipher-train-use-619 | use | [
{
"answer": "SHE IS DREAMING DREAMING",
"question": "Decrypt this Caesar cipher text: TIF JT ESFBNJOH ESFBNJOH. Provide only the decrypted text as your final answer."
},
{
"answer": "REDUCED TO THE CONDITION OF A DR",
"question": "Decrypt this Caesar cipher text: XKJAIKJ ZU ZNK IUTJOZOUT UL G JX... | [] | Decrypt this Caesar cipher text: AKQMVKM WXBQKIT AKQMVKM QA GWCZ AXMKQITBG. Provide only the decrypted text as your final answer. | SCIENCE OPTICAL SCIENCE IS YOUR SPECIALTY | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/caesar_cipher",
"task_name": "caesar_cipher"
} |
polynomial_equations-train-build-885 | build | [
{
"answer": "-1.8257, 1.8257",
"question": "Find the real value(s) of k in the equation: 20 - 6*k**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 ... | [
{
"answer": "-1.565, 1.065",
"question": "Solve the polynomial equation for real d:\n6*d**2 + 3*d - 10 = 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 for... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} | ||
caesar_cipher-train-use-413 | use | [
{
"answer": "THE AWAKENING IS TO TAKE PLACE HERE IN MY HOUSE",
"question": "Decrypt this Caesar cipher text: ESP LHLVPYTYR TD EZ ELVP AWLNP SPCP TY XJ SZFDP. Provide only the decrypted text as your final answer."
},
{
"answer": "WAS WITH DR",
"question": "Decrypt this Caesar cipher text: DHZ DPA... | [] | Decrypt this Caesar cipher text: J TIBMM EFQFOE PO ZPVS CFJOH IFSF. Provide only the decrypted text as your final answer. | I SHALL DEPEND ON YOUR BEING HERE | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/caesar_cipher",
"task_name": "caesar_cipher"
} |
gcd-train-use-481 | use | [
{
"answer": "3",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 1215, 1209. Give only the GCD as your final answer."
},
{
"answer": "1",
"question": "Find the Greatest Common Divisor (GCD) of these numbers: 459, 299. Give only the GCD as your final answer."
},
{
"a... | [] | Find the Greatest Common Divisor (GCD) of these numbers: 182, 247. Give only the GCD as your final answer. | 13 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/gcd",
"task_name": "gcd"
} |
lcm-train-use-690 | use | [
{
"answer": "2128",
"question": "Find the Least Common Multiple (LCM) of these numbers: 112, 133"
},
{
"answer": "112",
"question": "Find the Least Common Multiple (LCM) of these numbers: 16, 7"
},
{
"answer": "104397",
"question": "Find the Least Common Multiple (LCM) of these numbe... | [] | Find the Least Common Multiple (LCM) of these numbers: 38, 48 | 912 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/lcm",
"task_name": "lcm"
} |
bitwise_arithmetic-train-build-492 | build | [
{
"answer": "0x3a6f37af8250",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0xf28c * 0x6db6) * (0... | [
{
"answer": "-0x498204a7",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n(((0x14f3 - 0x5e8c) >> 0x2... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
bitwise_arithmetic-train-build-990 | build | [
{
"answer": "0x93ea77b9",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n(((0xf63d << 0x3) * (0x2673... | [
{
"answer": "0x5ebb7f",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0xf11 - 0x680) * (0xb0f >> ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
simple_integration-train-use-882 | use | [
{
"answer": "7*x**3/5 + C",
"question": "Evaluate the indefinite integral: ∫ 21*x**2/5 dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication operatio... | [] | Evaluate the indefinite integral: ∫ -183*X**2/8 - 5*X dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `... | -61*X**3/8 - 5*X**2/2 + C | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/simple_integration",
"task_name": "simple_integration"
} |
caesar_cipher-train-use-335 | use | [
{
"answer": "GENERAL INFORMATION ABOUT PROJECT ELECTRONIC WORKS PROFESSOR MICHAEL S",
"question": "Decrypt this Caesar cipher text: JHQHUDO LQIRUPDWLRQ DERXW SURMHFW HOHFWURQLF ZRUNV SURIHVVRU PLFKDHO V. Provide only the decrypted text as your final answer."
},
{
"answer": "TIME WENT ON",
"quest... | [] | Decrypt this Caesar cipher text: HVIG HVS GIPGQFWPSFG BCH CBZM VSOF HVS BSKG PIH GSS HVS CQQIFFSBQSG. Provide only the decrypted text as your final answer. | THUS THE SUBSCRIBERS NOT ONLY HEAR THE NEWS BUT SEE THE OCCURRENCES | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/caesar_cipher",
"task_name": "caesar_cipher"
} |
prime_factorization-train-build-540 | build | [
{
"answer": "13 × 23",
"question": "Find the prime factorization of 299. Write the factors separated by × (Example: for 12 the answer would be: 2 × 2 × 3)"
},
{
"answer": "3 × 3 × 83",
"question": "Find the prime factorization of 747. Write the factors separated by × (Example: for 12 the answer ... | [
{
"answer": "563",
"question": "Find the prime factorization of 563. Write the factors separated by × (Example: for 12 the answer would be: 2 × 2 × 3)"
},
{
"answer": "181",
"question": "Find the prime factorization of 181. Write the factors separated by × (Example: for 12 the answer would be: 2... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/prime_factorization",
"task_name": "prime_factorization"
} | ||
polynomial_multiplication-train-use-221 | use | [
{
"answer": "52*y**5",
"question": "Simplify this expression: 52*y**5\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication operations in your reasoning... | [] | Simplify this expression: 2*z*(-8*z**2 - 2*z)
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-3*X**3*sin... | -16*z**3 - 4*z**2 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} |
polynomial_equations-train-build-337 | build | [
{
"answer": "0.0, 3.0",
"question": "Solve for real g: -g**2 + 3*g = 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\" a... | [
{
"answer": "0.5, 4.0",
"question": "Determine the real value(s) of m that satisfies: 2*m**2 - 9*m + 4 = 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 for... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_equations",
"task_name": "polynomial_equations"
} | ||
simple_integration-train-use-716 | use | [
{
"answer": "-8*x**3 + 5*x**2/2 + C",
"question": "Calculate the antiderivative: ∫ -24*x**2 + 5*x dx\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplicati... | [] | Calculate the antiderivative: ∫ -9*X**2 - 20*X dx
When performing calculations, please follow these guidelines:
1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.
2. Always include the * symbol for all multiplication operations in your reasoning steps. For example, write `-3*X**3... | -3*X**3 - 10*X**2 + C | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/simple_integration",
"task_name": "simple_integration"
} |
chinese_remainder-train-build-391 | build | [
{
"answer": "1742378",
"question": "Q: There is a container of no more than 5590927 lemons. If we divide them equally among 149 monkeys, we have 121 left; if we divide them equally among 157 horses, we have 149 left; if we divide them equally among 239 people, we have 68 left. How many lemons are in the con... | [
{
"answer": "539808",
"question": "Q: There is a bag of no more than 754571 passionfruits. If we divide them equally among 31 cows, we have 5 left; if we divide them equally among 101 people, we have 64 left; if we divide them equally among 241 elephants, we have 209 left. How many passionfruits are in the ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "",
"source": "tasksource/bigbench/chinese_remainder_theorem",
"task_name": "chinese_remainder"
} | ||
ab-train-build-267 | build | [
{
"answer": "A# A# A# A# A# A#",
"question": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens. Example:\n\n B# A# #B #A B#\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules:\n\n A# #A ... becomes ... nothing\n A# #B ...... | [
{
"answer": "#A #B #A #B #A #A B# B#",
"question": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens. Example:\n\n B# A# #B #A B#\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules:\n\n A# #A ... becomes ... nothing\n A# ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/ab",
"task_name": "ab"
} | ||
polynomial_multiplication-train-build-65 | build | [
{
"answer": "-30*x**6 + 10*x**5",
"question": "Simplify this expression: 10*x**3*(-3*x**3 + x**2)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol for all multiplication ... | [
{
"answer": "-64*y**6 - 24*y**5 + 54*y**4",
"question": "Calculate the following: (-8*y**3 - 9*y**2)*(8*y**3 - 6*y**2)\nWhen performing calculations, please follow these guidelines:\n1. Use ** instead of ^ to represent exponents. For example, write 7*X**2 instead of 7*X^2.\n2. Always include the * symbol fo... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/polynomial_multiplication",
"task_name": "polynomial_multiplication"
} | ||
base_conversion-train-build-172 | build | [
{
"answer": "10210",
"question": "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-9 number 123 to base-3\n"
},
{
"answer": "13013",
"question": "Your task is to convert a number be... | [
{
"answer": "80",
"question": "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 1020 to base-9\n"
},
{
"answer": "100110101",
"question": "Your task is to convert a number ... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/base_conversion",
"task_name": "base_conversion"
} | ||
chain_sum-train-use-310 | use | [
{
"answer": "169",
"question": "State the final answer to the following arithmetic problem: 32 + 98 - 87 + 99 + 27 ="
},
{
"answer": "-9",
"question": "State the final answer to the following arithmetic problem: 6 - 8 - 7 ="
},
{
"answer": "12",
"question": "State the final answer to... | [] | State the final answer to the following arithmetic problem: 457 + 710 + 266 = | 1433 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} |
gsm1k-train-build-878 | build | [
{
"answer": "270",
"question": "Sam sells different pastries at his bakery. At the end of the week, he wanted to find his total profit. Each pastry costs him $3 to make, but he sells them for different prices. He sells muffins for $5, donuts for $4, and turnovers for $6. Sam finds that over the course of a ... | [
{
"answer": "147",
"question": "A group of students is planning a car wash fundraiser. They charge $8 for washing a car and $10 for washing an SUV. On the day of the fundraiser, they washed 12 cars and 10 SUVs. They plan to donate 25% of their total earnings to a charity and use the rest to fund their schoo... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "",
"source": "ScaleAI/gsm1k",
"task_name": "gsm1k"
} | ||
knights_knaves-train-use-605 | use | [
{
"answer": "Harper is a laggard, Evelyn is a pioneer, and Aurora is a pioneer.",
"question": "A very special island is inhabited only by pioneers and laggards. Pioneers always tell the truth, and laggards always lie. You meet 3 inhabitants: Harper, Evelyn, and Aurora. \"(if Aurora is a laggard then Evelyn ... | [] | A very special island is inhabited only by saints and sinners. Saints always tell the truth, and sinners always lie. You meet 2 inhabitants: David, and Liam. As David put it, "Liam is a sinner". Liam asserted: "Liam is a saint or David is a saint". So who is a saint and who is a sinner? (Format your answer like: "David... | David is a sinner, and Liam is a saint. | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/knights_knaves",
"task_name": "knights_knaves"
} |
bitwise_arithmetic-train-build-680 | build | [
{
"answer": "0x1aa98",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0xd54c << 0x0) << 0x1)"
},... | [
{
"answer": "0x9064",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0x2e39 + 0x622b) >> 0x0)"
}... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} | ||
ab-train-use-907 | use | [
{
"answer": "#A B# B# A#",
"question": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens. Example:\n\n B# A# #B #A B#\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules:\n\n A# #A ... becomes ... nothing\n A# #B ... becom... | [] | A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #A #A #B #B #A #B #A #A B# B# | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/ab",
"task_name": "ab"
} |
chain_sum-train-build-860 | build | [
{
"answer": "5",
"question": "State the final answer to the following arithmetic problem: 29 - 18 + 40 - 46 ="
},
{
"answer": "-3",
"question": "State the final answer to the following arithmetic problem: 6 - 0 - 2 - 7 ="
},
{
"answer": "1244",
"question": "State the final answer to ... | [
{
"answer": "53",
"question": "State the final answer to the following arithmetic problem: 60 - 39 + 32 ="
},
{
"answer": "172",
"question": "State the final answer to the following arithmetic problem: 85 + 87 ="
},
{
"answer": "-7037",
"question": "State the final answer to the foll... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/chain_sum",
"task_name": "chain_sum"
} | ||
bitwise_arithmetic-train-use-560 | use | [
{
"answer": "0x66126",
"question": "Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.\n((0xbb70 << 0x3) + (0x4da8 + 0... | [] | Please solve this problem. Assume there is arbitrary bit depth and that there are signed integers. If the answer is negative, reply as a negative value (ex., -0x3), not the two's-compliment form. Reply only with the final hexidecimal value.
(((0xbe76 * 0xd4a1) * (0x8c9b << 0x3)) + ((0x20db << 0x1) + (0xef7e >> 0x2))) | 0x2b716d0b1c325 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/bitwise_arithmetic",
"task_name": "bitwise_arithmetic"
} |
base_conversion-train-use-160 | use | [
{
"answer": "8a8",
"question": "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 695 to base-13\n"
},
{
"answer": "3320",
"question": "Your task is to convert a number bet... | [] | 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 100331 to base-13
| 656 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/base_conversion",
"task_name": "base_conversion"
} |
base_conversion-train-use-939 | use | [
{
"answer": "10001001010",
"question": "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-14 number 586 to binary\n"
},
{
"answer": "53",
"question": "Your task is to convert a numbe... | [] | 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 110010110 to base-10
| 406 | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "2",
"source": "theblackcat102/base_conversion",
"task_name": "base_conversion"
} |
ab-train-use-909 | use | [
{
"answer": "#B #A B# B#",
"question": "A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.\n\nAn A::B program is a sequence of tokens. Example:\n\n B# A# #B #A B#\n\nTo *compute* a program, we must rewrite neighbor tokens, using the rules:\n\n A# #A ... becomes ... nothing\n A# #B ... becom... | [] | A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To *compute* a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... be... | #B #B #A B# B# A# | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/ab",
"task_name": "ab"
} |
cryptarithm-train-build-296 | build | [
{
"answer": "{'B': 7, 'A': 8, 'S': 3, 'E': 2, 'L': 5, 'G': 1, 'M': 0}",
"question": "Solve the cryptarithmetic puzzle: BASE + BALL = GAMES. Each letter represents a unique digit (0-9), and leading letters (B, G) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A'... | [
{
"answer": "{'H': 5, 'A': 6, 'L': 4, 'F': 7, 'W': 1, 'O': 0, 'E': 2}",
"question": "Solve the cryptarithmetic puzzle: HALF + HALF = WHOLE. Each letter represents a unique digit (0-9), and leading letters (H, W) cannot be zero. Provide your answer as a dictionary mapping each letter to its digit, e.g., {'A'... | {
"argument_name": "question",
"function_name": "solve",
"return_format": "return only the final answer"
} | {
"difficulty": "3",
"source": "theblackcat102/cryptarithm",
"task_name": "cryptarithm"
} |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 60