{"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":"0896e075-3952-568b-afcb-957a998bd955","task_key":"default--v0~2e1~2e0~5fhf--0896e075-3952-568b-afcb-957a998bd955","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 0896e075-3952-568b-afcb-957a998bd955","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import defaultdict\\nimport re\\ndef task_func(word: str) -> dict:\\n\",\"complete_prompt\":\"from collections import defaultdict\\nimport re\\n\\ndef task_func(word: str) -> dict:\\n    \\\"\\\"\\\"\\n    Find the occurrences of each two-letter combination in the sanitized word,\\n    where only alphabetic characters are considered.\\n\\n    Requirements:\\n    - collections.defaultdict\\n    - re\\n    \\n    Parameters:\\n    word (str): The input string.\\n\\n    Returns:\\n    collections.defaultdict: A dictionary with keys as two-letter combinations and values as their counts in the sanitized word.\\n\\n    Example:\\n    >>> task_func('abcdef')\\n    defaultdict(<class 'int'>, {'ab': 1, 'bc': 1, 'cd': 1, 'de': 1, 'ef': 1})\\n    >>> task_func('aabbcc')\\n    defaultdict(<class 'int'>, {'aa': 1, 'ab': 1, 'bb': 1, 'bc': 1, 'cc': 1})\\n    >>> task_func('a1!b@c#d$')\\n    defaultdict(<class 'int'>, {'ab': 1, 'bc': 1, 'cd': 1})\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Find the occurrences of each two-letter combination in the sanitized word, where only alphabetic characters are considered.\\nThe function should output with:\\n    collections.defaultdict: A dictionary with keys as two-letter combinations and values as their counts in the sanitized word.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import defaultdict\\nimport re\\ndef task_func(word: str) -> dict:\\n```\",\"libs\":\"['collections', 're']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}