{"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":"71be4aa0-77ca-53cd-b820-57a61b3f633b","task_key":"default--v0~2e1~2e0~5fhf--71be4aa0-77ca-53cd-b820-57a61b3f633b","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 71be4aa0-77ca-53cd-b820-57a61b3f633b","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import numpy as np\\nfrom itertools import combinations\\ndef task_func(array1, array2):\\n\",\"complete_prompt\":\"import numpy as np\\nfrom itertools import combinations\\n\\ndef task_func(array1, array2):\\n    \\\"\\\"\\\"\\n    Calculate the maximum Euclidean distance between all possible pairs of points \\n    formed by combining elements from two input arrays.\\n\\n    Each point is formed by combining one element from the first array and one \\n    element from the second array. The function then calculates the Euclidean \\n    distance between each pair of points and returns the maximum distance found.\\n\\n    Parameters:\\n    - array1 (numpy.array): A one-dimensional numpy array.\\n    - array2 (numpy.array): A one-dimensional numpy array. The length of array2 should be \\n                          the same as array1.\\n\\n    Returns:\\n    - max_distance (float): The maximum Euclidean distance between any two points formed by combining \\n           elements from array1 and array2. If the arrays are empty, the function\\n           returns 0.\\n\\n    Raises:\\n    - ValueError: If the input arrays have different lengths.\\n\\n    Requirements:\\n    - numpy\\n    - itertools\\n\\n    Example:\\n    >>> array1 = np.array([2, 3, 4])\\n    >>> array2 = np.array([1, 5, 2])\\n    >>> task_func(array1, array2)\\n    4.123105625617661\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Calculate the maximum Euclidean distance between all possible pairs of points formed by combining elements from two input arrays. Each point is formed by combining one element from the first array and one element from the second array. The function then calculates the Euclidean distance between each pair of points and returns the maximum distance found.\\nThe function should raise the exception for: ValueError: If the input arrays have different lengths.\\nThe function should output with:\\n    max_distance (float): The maximum Euclidean distance between any two points formed by combining\\n    elements from array1 and array2. If the arrays are empty, the function\\n    returns 0.\\nYou should write self-contained code starting with:\\n```\\nimport numpy as np\\nfrom itertools import combinations\\ndef task_func(array1, array2):\\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":[]}