{"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":"d0f83ea2-73be-55a2-a9e3-b19c4556efc2","task_key":"full--train--661","task_revision_id":"1","upstream_id":"661","short_description":"Write a function to find the maximum sum that can be formed which has no three…","config":"full","split":"train","body":"{\"test_list\":\"['assert max_sum_of_three_consecutive([100, 1000, 100, 1000, 1], 5) == 2101', 'assert max_sum_of_three_consecutive([3000, 2000, 1000, 3, 10], 5) == 5013', 'assert max_sum_of_three_consecutive([1, 2, 3, 4, 5, 6, 7, 8], 8) == 27']\",\"text\":\"Write a function to find the maximum sum that can be formed which has no three consecutive elements present.\"}","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":[]}