{"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":"64939bc1-60ce-5bc3-80bf-0b15f0fa185b","task_key":"default--v0~2e1~2e0~5fhf--64939bc1-60ce-5bc3-80bf-0b15f0fa185b","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 64939bc1-60ce-5bc3-80bf-0b15f0fa185b","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import numpy as np\\nimport random\\ndef task_func(length=10000, seed=0):\\n\",\"complete_prompt\":\"import numpy as np\\nimport random\\n\\ndef task_func(length=10000, seed=0):\\n    \\\"\\\"\\\"\\n    Generates a random walk of a specified length. A random walk is a path that consists of a series of random steps\\n    on some mathematical space. In this case, the steps are either +1 or -1, chosen with equal probability.\\n\\n    Parameters:\\n    - length (int): The number of steps in the random walk. Must be a non-negative integer. Default is 10000.\\n    - seed (int, optional): An optional seed value to initialize the random number generator. Use this for reproducible results.\\n    \\n    Requirements:\\n    - numpy\\n    - random\\n    \\n    Returns:\\n    - np.array: A numpy array representing the positions of the walk at each step. Starts at 0.\\n\\n    Raises:\\n    - ValueError: If `length` is negative.\\n    \\n    Example:\\n    >>> random.seed(0)     # For reproducibility in doctest\\n    >>> walk = task_func(5)\\n    >>> walk.tolist()\\n    [0, 1, 2, 1, 0, 1]\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generates a random walk of a specified length. A random walk is a path that consists of a series of random steps on some mathematical space. In this case, the steps are either +1 or -1, chosen with equal probability.\\nThe function should raise the exception for: ValueError: If `length` is negative.\\nThe function should output with:\\n    np.array: A numpy array representing the positions of the walk at each step. Starts at 0.\\nYou should write self-contained code starting with:\\n```\\nimport numpy as np\\nimport random\\ndef task_func(length=10000, seed=0):\\n```\",\"libs\":\"['numpy', 'random']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}