{"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":"c96730e7-e58c-53e7-8c3e-2849de60b1b9","task_key":"default--v0~2e1~2e0~5fhf--c96730e7-e58c-53e7-8c3e-2849de60b1b9","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf c96730e7-e58c-53e7-8c3e-2849de60b1b9","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import numpy as np\\nimport itertools\\ndef task_func(matrix):\\n\",\"complete_prompt\":\"import numpy as np\\nimport itertools\\n\\ndef task_func(matrix):\\n    \\\"\\\"\\\"\\n    Sorts a numeric 2D numpy array in ascending order and finds all unique combinations of two elements from the sorted array.\\n    \\n    Parameters:\\n    - matrix (numpy.array): A 2D numpy array of any shape (m, n), where m and n are non-negative integers.\\n    \\n    Returns:\\n    - tuple: A tuple containing two elements:\\n        1. numpy.array: A 1D array with all elements of the input array sorted in ascending order.\\n        2. list: A list of tuples, each containing a pair of elements from the sorted array, representing all unique combinations taken two at a time.\\n\\n    Requirements:\\n    - numpy\\n    - itertools\\n    \\n    Example:\\n    >>> task_func(np.array([[1, 3], [2, 4]]))\\n    (array([1, 2, 3, 4]), [(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)])\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Sorts a numeric 2D numpy array in ascending order and finds all unique combinations of two elements from the sorted array.\\nThe function should output with:\\n    tuple: A tuple containing two elements:\\n    1. numpy.array: A 1D array with all elements of the input array sorted in ascending order.\\n    2. list: A list of tuples, each containing a pair of elements from the sorted array, representing all unique combinations taken two at a time.\\nYou should write self-contained code starting with:\\n```\\nimport numpy as np\\nimport itertools\\ndef task_func(matrix):\\n```\",\"libs\":\"['numpy', 'itertools']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}