{"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":"e918d1a5-0f76-590a-8264-0b531a441934","task_key":"default--v0~2e1~2e0~5fhf--e918d1a5-0f76-590a-8264-0b531a441934","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf e918d1a5-0f76-590a-8264-0b531a441934","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import Counter\\nimport random\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\ndef task_func(count, seed=0):\\n\",\"complete_prompt\":\"from collections import Counter\\nimport random\\n\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\n\\ndef task_func(count, seed=0):\\n    \\\"\\\"\\\"\\n    Generate a specific number of random letter pairs, each from a predefined list, and analyze the frequency of each pair.\\n\\n    Parameters:\\n    - count (int): The number of letter pairs to generate.\\n    - seed (int, optional): Seed for the random number generator to ensure reproducibility. Defaults to None.\\n\\n    Returns:\\n    - Counter: A Counter object representing the frequency of each generated letter pair.\\n\\n    Requirements:\\n    - collections.Counter\\n    - random\\n\\n    Examples:\\n    >>> task_func(5, seed=42)\\n    Counter({('d', 'a'): 1, ('b', 'b'): 1, ('d', 'd'): 1, ('e', 'a'): 1, ('c', 'a'): 1})\\n    >>> task_func(0, seed=42)\\n    Counter()\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Generate a specific number of random letter pairs, each from a predefined list, and analyze the frequency of each pair.\\nThe function should output with:\\n    Counter: A Counter object representing the frequency of each generated letter pair.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import Counter\\nimport random\\nLETTERS = ['a', 'b', 'c', 'd', 'e']\\ndef task_func(count, seed=0):\\n```\",\"libs\":\"['collections', 'random']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}