{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bigcodebench","formal_name":"BigCodeBench","introduction":"BigCodeBench poses 1,140 function-level tasks drawn across 139 libraries. It tests whether a model can compose several real APIs correctly rather than write one self-contained function.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://bigcode-bench.github.io/","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":"6e81726a-ed08-5e79-9c26-8d2d42355a78","task_key":"default--v0~2e1~2e0~5fhf--6e81726a-ed08-5e79-9c26-8d2d42355a78","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 6e81726a-ed08-5e79-9c26-8d2d42355a78","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import itertools\\nimport math\\ndef task_func(x):\\n\",\"complete_prompt\":\"import itertools\\nimport math\\n\\ndef task_func(x):\\n    \\\"\\\"\\\"\\n    Find the sub-sequence of a dictionary, x, with the minimum total length, where the keys are letters and the values are their lengths.\\n\\n    Parameters:\\n    - x (dict): The dictionary of letter lengths.\\n\\n    Returns:\\n    - list: The subsequence with the minimum total length.\\n\\n    Requirements:\\n    - itertools\\n    - math\\n\\n    Example:\\n    >>> task_func({'a': 1, 'b': 2, 'c': 3})\\n    ['a']\\n    >>> task_func({'a': 1, 'b': -2, 'c': -5, 'd': 4})\\n    ['b', 'c']\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Find the sub-sequence of a dictionary, x, with the minimum total length, where the keys are letters and the values are their lengths.\\nThe function should output with:\\n    list: The subsequence with the minimum total length.\\nYou should write self-contained code starting with:\\n```\\nimport itertools\\nimport math\\ndef task_func(x):\\n```\",\"libs\":\"['math', 'itertools']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}