{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mbpp-plus","formal_name":"MBPP+","introduction":"MBPP+ takes the 378 problems of the sanitized MBPP set and multiplies their tests by roughly 35 times. It removes the same test-weakness inflation that HumanEval+ addresses.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/evalplus/evalplus","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"1be48115-cc38-5977-9709-89f1a023abbe","task_key":"default--test--300","task_revision_id":"2","upstream_id":"300","short_description":"Write a function to find the count of all binary sequences of length 2n such…","config":"default","split":"test","body":"{\"prompt\":\"Write a function to find the count of all binary sequences of length 2n such that sum of first n bits is same as sum of last n bits.\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}