{"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":"36706a0d-7658-5178-9a68-22dea596d8ae","task_key":"full--validation--515","task_revision_id":"1","upstream_id":"515","short_description":"Write a function to check if there is a subset with sum divisible by m.","config":"full","split":"validation","body":"{\"test_list\":\"['assert modular_sum([3, 1, 7, 5], 4, 6) == True', 'assert modular_sum([1, 7], 2, 5) == False', 'assert modular_sum([1, 6], 2, 5) == False']\",\"text\":\"Write a function to check if there is a subset with sum divisible by m.\"}","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":[]}