{"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":"4987d74d-d96e-52c5-bdcf-7bd4b3da467d","task_key":"sanitized--validation--597","task_revision_id":"1","upstream_id":"597","short_description":"Write a function to find kth element from the given two sorted arrays.","config":"sanitized","split":"validation","body":"{\"prompt\":\"Write a function to find kth element from the given two sorted arrays.\",\"test_list\":\"['assert find_kth([2, 3, 6, 7, 9], [1, 4, 8, 10], 5) == 6', 'assert find_kth([100, 112, 256, 349, 770], [72, 86, 113, 119, 265, 445, 892], 7) == 256', 'assert find_kth([3, 4, 7, 8, 10], [2, 5, 9, 11], 6) == 8']\"}","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":[]}