{"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":"75d86c8d-d24f-58c1-8045-9ed74f8a3800","task_key":"default--v0~2e1~2e0~5fhf--75d86c8d-d24f-58c1-8045-9ed74f8a3800","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 75d86c8d-d24f-58c1-8045-9ed74f8a3800","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import random\\nimport string\\nPOSSIBLE_LETTERS = ['a', 'b', 'c']\\ndef task_func(word):\\n\",\"complete_prompt\":\"import random\\nimport string\\n\\nPOSSIBLE_LETTERS = ['a', 'b', 'c']\\ndef task_func(word):\\n    \\\"\\\"\\\"\\n    Generates a list of random pairs of adjacent letters from the given word. The number of such pairs will be equal to the length of the constant POSSIBLE_LETTERS.\\n    \\n    Parameters:\\n    word (str): The input string. Must only contain letters.\\n    \\n    Returns:\\n    list: A list of random pairs of adjacent letters from the word. If the word has fewer than 2 letters, returns a list of empty strings based on POSSIBLE_LETTERS length.\\n    \\n    Requirements:\\n    - random\\n    - string\\n    \\n    Raises:\\n    ValueError: If the input contains non-letter characters.\\n    \\n    Examples:\\n    >>> random.seed(0)\\n    >>> task_func('abcdef')\\n    ['de', 'de', 'ab']\\n    >>> task_func('xyz')\\n    ['yz', 'yz', 'yz']\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generates a list of random pairs of adjacent letters from the given word. The number of such pairs will be equal to the length of the constant POSSIBLE_LETTERS.\\nThe function should raise the exception for: ValueError: If the input contains non-letter characters.\\nThe function should output with:\\n    list: A list of random pairs of adjacent letters from the word. If the word has fewer than 2 letters, returns a list of empty strings based on POSSIBLE_LETTERS length.\\nYou should write self-contained code starting with:\\n```\\nimport random\\nimport string\\nPOSSIBLE_LETTERS = ['a', 'b', 'c']\\ndef task_func(word):\\n```\",\"libs\":\"['random', 'string']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}