{"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":"14377770-bb81-5eb5-95d5-26b5d6f9fc68","task_key":"full--train--971","task_revision_id":"1","upstream_id":"971","short_description":"Write a function to find the maximum number of segments of lengths a, b and c…","config":"full","split":"train","body":"{\"test_list\":\"['assert maximum_segments(7, 5, 2, 5) == 2', 'assert maximum_segments(17, 2, 1, 3) == 17', 'assert maximum_segments(18, 16, 3, 6) == 6']\",\"text\":\"Write a function to find the maximum number of segments of lengths a, b and c that can be formed from n.\"}","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":[]}