{"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":"b14b4107-512d-5e39-ba3a-3a26677769ad","task_key":"default--v0~2e1~2e0~5fhf--b14b4107-512d-5e39-ba3a-3a26677769ad","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf b14b4107-512d-5e39-ba3a-3a26677769ad","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import random\\nfrom itertools import combinations\\nimport math\\ndef task_func(n):\\n\",\"complete_prompt\":\"import random\\nfrom itertools import combinations\\nimport math\\n\\ndef task_func(n):\\n    \\\"\\\"\\\"\\n    Generate n random dots within a unit square (0 to 1 on both axes) in a 2D space \\n    and find the pair that comes closest to each other.\\n\\n    Parameters:\\n    n (int): The number of points to generate. If n is less than 2, the function returns None.\\n\\n    Returns:\\n    tuple or None: A tuple of the form ((x1, y1), (x2, y2)), which are the coordinates of the closest pair,\\n                   or None if n is less than 2.\\n    \\n    Note:\\n    - This function will return None if the input n less than 2.\\n    \\n    Requirements:\\n    - random\\n    - itertools.combinations\\n    - math\\n\\n    Example:\\n    >>> random.seed(0)\\n    >>> print(task_func(2))\\n    ((0.8444218515250481, 0.7579544029403025), (0.420571580830845, 0.25891675029296335))\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generate n random dots within a unit square (0 to 1 on both axes) in a 2D space and find the pair that comes closest to each other.\\nNote that: This function will return None if the input n less than 2.\\nThe function should output with:\\n    tuple or None: A tuple of the form ((x1, y1), (x2, y2)), which are the coordinates of the closest pair,\\n    or None if n is less than 2.\\nYou should write self-contained code starting with:\\n```\\nimport random\\nfrom itertools import combinations\\nimport math\\ndef task_func(n):\\n```\",\"libs\":\"['math', 'random', 'itertools']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}