{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mbpp","formal_name":"MBPP","introduction":"Mostly Basic Python Problems asks for a short Python function from a one-sentence description, checked by assertions. The sanitized split is the hand-verified subset.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/google-research-datasets/mbpp","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"3e40b3dc-cdfd-543e-9a8c-d67395511b81","task_key":"full--test--416","task_revision_id":"1","upstream_id":"416","short_description":"Write a function to find the maximum sum we can make by dividing number in three…","config":"full","split":"test","body":"{\"test_list\":\"['assert breakSum(12) == 13', 'assert breakSum(24) == 27', 'assert breakSum(23) == 23']\",\"text\":\"Write a function to find the maximum sum we can make by dividing number in three parts recursively and summing them up together for the given number.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/google-research-datasets/mbpp","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}