{"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":"006b2c0c-7dda-5364-92ae-751646c8fce2","task_key":"default--test--286","task_revision_id":"2","upstream_id":"286","short_description":"Write a function to find the largest sum of a contiguous array in the modified…","config":"default","split":"test","body":"{\"prompt\":\"Write a function to find the largest sum of a contiguous array in the modified array which is formed by repeating the given array k times.\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}