{"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":"1ce15691-7c2d-5862-b6ae-7f9c63709d81","task_key":"default--v0~2e1~2e0~5fhf--1ce15691-7c2d-5862-b6ae-7f9c63709d81","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 1ce15691-7c2d-5862-b6ae-7f9c63709d81","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import Counter\\nimport hashlib\\ndef task_func(word: str) -> dict:\\n\",\"complete_prompt\":\"from collections import Counter\\nimport hashlib\\n\\ndef task_func(word: str) -> dict:\\n    \\\"\\\"\\\"\\n    Count the occurrence of each adjacent pair of letters from left to right in a word and encode the result as an MD5 hash.\\n\\n    Parameters:\\n    - word (str): The word in which to count the adjacent letter pairs.\\n\\n    Returns:\\n    - dict: A dictionary where keys are adjacent letter pairs and values are their counts.\\n\\n    Requirements:\\n    - collections.Counter\\n\\n    Examples:\\n    >>> task_func('abracadabra')\\n    'bc9af285d87b312e61ab3661e66b741b'\\n    >>> task_func('hello')\\n    'dd5dec1a853625e2dc48f3d42665c337'\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Count the occurrence of each adjacent pair of letters from left to right in a word and encode the result as an MD5 hash.\\nThe function should output with:\\n    dict: A dictionary where keys are adjacent letter pairs and values are their counts.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import Counter\\nimport hashlib\\ndef task_func(word: str) -> dict:\\n```\",\"libs\":\"['hashlib', 'collections']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}