{"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":"ee65f9cd-8b06-5322-8083-046717be68ad","task_key":"default--v0~2e1~2e0~5fhf--ee65f9cd-8b06-5322-8083-046717be68ad","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf ee65f9cd-8b06-5322-8083-046717be68ad","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import random\\nimport bisect\\nfrom array import array\\ndef task_func(n=10, total=100):\\n\",\"complete_prompt\":\"import random\\nimport bisect\\nfrom array import array\\n\\n\\ndef task_func(n=10, total=100):\\n    \\\"\\\"\\\"\\n    Generates 'n' random integer numbers such that their sum equals 'total', sorts these numbers,\\n    and determines the position where a new random number can be inserted to maintain the sorted order.\\n    The function uses a retry mechanism to ensure the generated numbers sum up to 'total'.\\n\\n    Parameters:\\n    n (int): The number of random numbers to generate. Default is 10.\\n    total (int): The total sum of the generated numbers. Default is 100.\\n\\n    Returns:\\n    tuple: A tuple containing the sorted numbers as an array and the insertion position for a new number.\\n\\n    Requirements:\\n    - random\\n    - bisect\\n    - array.array\\n\\n    Examples:\\n    >>> sorted_nums, pos = task_func(5, 50)\\n    >>> len(sorted_nums) == 5\\n    True\\n    >>> sum(sorted_nums) == 50\\n    True\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generates 'n' random integer numbers such that their sum equals 'total', sorts these numbers, and determines the position where a new random number can be inserted to maintain the sorted order. The function uses a retry mechanism to ensure the generated numbers sum up to 'total'.\\nThe function should output with:\\n    tuple: A tuple containing the sorted numbers as an array and the insertion position for a new number.\\nYou should write self-contained code starting with:\\n```\\nimport random\\nimport bisect\\nfrom array import array\\ndef task_func(n=10, total=100):\\n```\",\"libs\":\"['bisect', 'random', 'array']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}