data_source stringclasses 1
value | prompt listlengths 2 2 | ability stringclasses 1
value | reward_model dict | extra_info dict |
|---|---|---|---|---|
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/2\", \"entry_point\": \"similar_elements\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find the shared elements from the given two lists.\\nassert set(similar_elements((3, 4, 5, 6),(5, 7, 4, 10))) == set((4, 5))\\n\\\"\\\"\\\"\\n\", \"canonical_solution... | {
"split": "test",
"index": 0,
"task_id": "Mbpp/2",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/3\", \"entry_point\": \"is_not_prime\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to identify non-prime numbers.\\nassert is_not_prime(2) == False\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\nimport math\\ndef is_not_prime(n):\\n if n == 1:... | {
"split": "test",
"index": 1,
"task_id": "Mbpp/3",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/4\", \"entry_point\": \"heap_queue_largest\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find the n largest integers from a given list of numbers, returned in descending order.\\nassert heap_queue_largest( [25, 35, 22, 85, 14, 65, 75, 22, 58],3)==[85, 7... | {
"split": "test",
"index": 2,
"task_id": "Mbpp/4",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/6\", \"entry_point\": \"differ_At_One_Bit_Pos\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to check whether the two numbers differ at one bit position only or not.\\nassert differ_At_One_Bit_Pos(13,9) == True\\n\\\"\\\"\\\"\\n\", \"canonical_soluti... | {
"split": "test",
"index": 3,
"task_id": "Mbpp/6",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/7\", \"entry_point\": \"find_char_long\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find all words which are at least 4 characters long in a string.\\nassert set(find_char_long('Please move back to stream')) == set(['Please', 'move', 'back', 'stream'])... | {
"split": "test",
"index": 4,
"task_id": "Mbpp/7",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/8\", \"entry_point\": \"square_nums\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find squares of individual elements in a list.\\nassert square_nums([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])==[1, 4, 9, 16, 25, 36, 49, 64, 81, 100]\\n\\\"\\\"\\\"\\n\", \"canonic... | {
"split": "test",
"index": 5,
"task_id": "Mbpp/8",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/9\", \"entry_point\": \"find_Rotations\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to find the minimum number of rotations (greater than 0) required to get the same string.\\nassert find_Rotations(\\\"aaaa\\\") == 1\\n\\\"\\\"\\\"\\n\", \"canonica... | {
"split": "test",
"index": 6,
"task_id": "Mbpp/9",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/11\", \"entry_point\": \"remove_Occ\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to remove first and last occurrence of a given character from the string.\\nassert remove_Occ(\\\"hello\\\",\\\"l\\\") == \\\"heo\\\"\\n\\\"\\\"\\\"\\n\", \"canonical_... | {
"split": "test",
"index": 7,
"task_id": "Mbpp/11",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/12\", \"entry_point\": \"sort_matrix\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to sort a given matrix in ascending order according to the sum of its rows.\\nassert sort_matrix([[1, 2, 3], [2, 4, 5], [1, 1, 1]])==[[1, 1, 1], [1, 2, 3], [2, 4, 5]]\\n\\\"... | {
"split": "test",
"index": 8,
"task_id": "Mbpp/12",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/14\", \"entry_point\": \"find_Volume\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to find the volume of a triangular prism.\\nassert find_Volume(10,8,6) == 240\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef find_Volume(l,b,h) : \\n return... | {
"split": "test",
"index": 9,
"task_id": "Mbpp/14",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/16\", \"entry_point\": \"text_lowercase_underscore\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to that returns true if the input string contains sequences of lowercase letters joined with an underscore and false otherwise.\\nassert text_lowercase_undersc... | {
"split": "test",
"index": 10,
"task_id": "Mbpp/16",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/17\", \"entry_point\": \"square_perimeter\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function that returns the perimeter of a square given its side length as input.\\nassert square_perimeter(10)==40\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef square_pe... | {
"split": "test",
"index": 11,
"task_id": "Mbpp/17",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/18\", \"entry_point\": \"remove_dirty_chars\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to remove characters from the first string which are present in the second string.\\nassert remove_dirty_chars(\\\"probasscurve\\\", \\\"pros\\\") == 'bacuve'\\n\\\"\... | {
"split": "test",
"index": 12,
"task_id": "Mbpp/18",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/19\", \"entry_point\": \"test_duplicate\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find whether a given array of integers contains any duplicate element.\\nassert test_duplicate(([1,2,3,4,5]))==False\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\n... | {
"split": "test",
"index": 13,
"task_id": "Mbpp/19",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/20\", \"entry_point\": \"is_woodall\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to check if the given number is woodball or not.\\nassert is_woodall(383) == True\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef is_woodall(x): \\n\\tif not isinstance... | {
"split": "test",
"index": 14,
"task_id": "Mbpp/20",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/56\", \"entry_point\": \"check\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to check if a given number is one less than twice its reverse.\\nassert check(70) == False\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef check(n): \\n return ... | {
"split": "test",
"index": 15,
"task_id": "Mbpp/56",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/57\", \"entry_point\": \"find_Max_Num\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to find the largest number that can be formed with the given list of digits.\\nassert find_Max_Num([1,2,3]) == 321\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\n... | {
"split": "test",
"index": 16,
"task_id": "Mbpp/57",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/58\", \"entry_point\": \"opposite_Signs\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to check whether the given two integers have opposite sign or not.\\nassert opposite_Signs(1,-2) == True\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef oppo... | {
"split": "test",
"index": 17,
"task_id": "Mbpp/58",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/59\", \"entry_point\": \"is_octagonal\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find the nth octagonal number.\\nassert is_octagonal(5) == 65\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef is_octagonal(n): \\n\\treturn 3 * n * n - 2 * n \\n\"... | {
"split": "test",
"index": 18,
"task_id": "Mbpp/59",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/61\", \"entry_point\": \"count_Substrings\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to count the number of substrings with the sum of digits equal to their length.\\nassert count_Substrings('112112') == 6\\n\\\"\\\"\\\"\\n\", \"canonical_solutio... | {
"split": "test",
"index": 19,
"task_id": "Mbpp/61",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/62\", \"entry_point\": \"smallest_num\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to find smallest number in a list.\\nassert smallest_num([10, 20, 1, 45, 99]) == 1\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef smallest_num(xs):\\n assert... | {
"split": "test",
"index": 20,
"task_id": "Mbpp/62",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/63\", \"entry_point\": \"max_difference\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find the maximum difference between available pairs in the given tuple list.\\nassert max_difference([(3, 5), (1, 7), (10, 3), (1, 2)]) == 7\\n\\\"\\\"\\\"\\n\", \"can... | {
"split": "test",
"index": 21,
"task_id": "Mbpp/63",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/64\", \"entry_point\": \"subject_marks\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to sort a list of tuples using the second value of each tuple.\\nassert subject_marks([('English', 88), ('Science', 90), ('Maths', 97), ('Social sciences', 82)])==[('Socia... | {
"split": "test",
"index": 22,
"task_id": "Mbpp/64",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/65\", \"entry_point\": \"recursive_list_sum\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to flatten a list and sum all of its elements.\\nassert recursive_list_sum(([1, 2, [3,4],[5,6]]))==21\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef recursive_... | {
"split": "test",
"index": 23,
"task_id": "Mbpp/65",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/66\", \"entry_point\": \"pos_count\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to count the number of positive numbers in a list.\\nassert pos_count([1,-2,3,-4]) == 2\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef pos_count(l):\\n return l... | {
"split": "test",
"index": 24,
"task_id": "Mbpp/66",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/67\", \"entry_point\": \"bell_number\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a function to find the number of ways to partition a set of Bell numbers.\\nassert bell_number(2)==2\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef bell_number(n): \\n bell... | {
"split": "test",
"index": 25,
"task_id": "Mbpp/67",
"dataset": "evalplus/mbppplus"
} |
evalplus/mbppplus | [
{
"role": "system",
"content": "You are a helpful programming assistant. The user will ask you a question and you as the assistant solve it. The assistant first thinks how to solve the task through reasoning and then provides the user with the final answer. The reasoning process and answer are enclosed with... | Code | {
"style": "rule",
"ground_truth": "{\"task_id\": \"Mbpp/68\", \"entry_point\": \"is_Monotonic\", \"prompt\": \"\\\"\\\"\\\"\\nWrite a python function to check whether the given array is monotonic or not.\\nassert is_Monotonic([6, 5, 4, 4]) == True\\n\\\"\\\"\\\"\\n\", \"canonical_solution\": \"\\ndef is_Monotonic(... | {
"split": "test",
"index": 26,
"task_id": "Mbpp/68",
"dataset": "evalplus/mbppplus"
} |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 19