{"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":"91420c3f-ae88-5ee4-bee7-d0dfa8b1aec2","task_key":"default--v0~2e1~2e0~5fhf--91420c3f-ae88-5ee4-bee7-d0dfa8b1aec2","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 91420c3f-ae88-5ee4-bee7-d0dfa8b1aec2","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import bisect\\nimport random\\ndef task_func(num, list_length = 5, min_value = 0, max_value = 0):\\n\",\"complete_prompt\":\"import bisect\\nimport random\\n\\ndef task_func(num, list_length = 5, min_value = 0, max_value = 0):\\n    \\\"\\\"\\\"\\n    Insert a number into a randomly generated sorted list and return the new sorted list.\\n\\n    Parameters:\\n    num (int): The integer number to insert.\\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]: A new sorted list containing the original elements and the inserted number.\\n    \\n    Requirements:\\n    - bisect\\n    - random\\n\\n    Example:\\n    >>> random.seed(0)\\n    >>> task_func(4, 5, 100, 100)\\n    ([100, 100, 100, 100, 100], [4, 100, 100, 100, 100, 100])\\n    >>> task_func(15, 0, 10, 20)\\n    ([], [15])\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Insert a number into a randomly generated sorted list and return the new sorted list.\\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]: A new sorted list containing the original elements and the inserted number.\\nYou should write self-contained code starting with:\\n```\\nimport bisect\\nimport random\\ndef task_func(num, list_length = 5, min_value = 0, max_value = 0):\\n```\",\"libs\":\"['bisect', 'random']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}