{"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":"db6f9ac4-0dc4-537c-9d49-7c8591d8a62c","task_key":"full--train--757","task_revision_id":"1","upstream_id":"757","short_description":"Write a function to count the pairs of reverse strings in the given string list.","config":"full","split":"train","body":"{\"test_list\":\"['assert count_reverse_pairs([\\\"julia\\\", \\\"best\\\", \\\"tseb\\\", \\\"for\\\", \\\"ailuj\\\"])== \\\\'2\\\\'', 'assert count_reverse_pairs([\\\"geeks\\\", \\\"best\\\", \\\"for\\\", \\\"skeeg\\\"]) == \\\\'1\\\\'', 'assert count_reverse_pairs([\\\"makes\\\", \\\"best\\\", \\\"sekam\\\", \\\"for\\\", \\\"rof\\\"]) == \\\\'2\\\\' ']\",\"text\":\"Write a function to count the pairs of reverse strings in the given string list.\"}","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":[]}