{"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":"37eddc08-130e-5440-b712-17c1651b0064","task_key":"default--v0~2e1~2e0~5fhf--37eddc08-130e-5440-b712-17c1651b0064","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 37eddc08-130e-5440-b712-17c1651b0064","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from itertools import combinations\\nimport math\\ndef task_func(x, w):\\n\",\"complete_prompt\":\"from itertools import combinations\\nimport math\\n\\ndef task_func(x, w):\\n    \\\"\\\"\\\"\\n    Find the continuous substring of x, which has the maximum total weight, given a dictionary where the keys are characters and the values are their weights.\\n\\n    Parameters:\\n    - x (str): The input string.\\n    - w (dict): The dictionary of character weights.\\n\\n    Returns:\\n    - max_substr (str): The continuous substring with the highest weight.\\n\\n    Requirements:\\n    - itertools\\n    - math\\n\\n    Example:\\n    >>> task_func('c', {'a': 1, 'b': 2, 'c': 3})\\n    'c'\\n    >>> task_func('abc', {'a': 10, 'b': -5, 'c': 3})\\n    'a'\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Find the continuous substring of x, which has the maximum total weight, given a dictionary where the keys are characters and the values are their weights.\\nThe function should output with:\\n    max_substr (str): The continuous substring with the highest weight.\\nYou should write self-contained code starting with:\\n```\\nfrom itertools import combinations\\nimport math\\ndef task_func(x, w):\\n```\",\"libs\":\"['math', 'itertools']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}