{"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":"e47a7fa6-93cc-5547-96fa-2872fee48a7b","task_key":"default--v0~2e1~2e0~5fhf--e47a7fa6-93cc-5547-96fa-2872fee48a7b","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf e47a7fa6-93cc-5547-96fa-2872fee48a7b","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import heapq\\nimport random\\ndef task_func(k, list_length = 5, min_value = 0, max_value = 100):\\n\",\"complete_prompt\":\"import heapq\\nimport random\\n\\ndef task_func(k, list_length = 5, min_value = 0, max_value = 100):\\n    \\\"\\\"\\\"\\n    Find the k smallest numbers in a randomly generated list using heapq.\\n\\n    Parameters:\\n    k (int): The number of smallest elements to find.\\n    list_length (int): The length of the randomly generated list of integers.\\n    min_value (int): The minimum value for randomly generated integers.\\n    max_value (int): The maximum value for randomly generated integers.\\n\\n    Returns:\\n    tuple: A tuple containing two lists: \\n        - list[int]: The randomly generated list of integers with the specified length.\\n        - list[int]: The k smallest numbers found using heapq.\\n\\n    Requirements:\\n    - heapq\\n    - random\\n\\n    Example:\\n    >>> random.seed(0)\\n    >>> rand_list, least_k = task_func(3)\\n    >>> least_k[0] in rand_list\\n    True\\n    >>> rand_list, least_k = task_func(3,5,100,100)\\n    >>> print(least_k)\\n    [100, 100, 100]\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Find the k smallest numbers in a randomly generated list using heapq.\\nThe function should output with:\\n    tuple: A tuple containing two lists:\\n    list[int]: The randomly generated list of integers with the specified length.\\n    list[int]: The k smallest numbers found using heapq.\\nYou should write self-contained code starting with:\\n```\\nimport heapq\\nimport random\\ndef task_func(k, list_length = 5, min_value = 0, max_value = 100):\\n```\",\"libs\":\"['random', 'heapq']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}