{"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":"efc17ae8-5033-5d38-b576-9814f1b2529d","task_key":"default--v0~2e1~2e0~5fhf--efc17ae8-5033-5d38-b576-9814f1b2529d","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf efc17ae8-5033-5d38-b576-9814f1b2529d","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from itertools import combinations\\nimport math\\ndef task_func(seq, letter_weight_dict):\\n\",\"complete_prompt\":\"from itertools import combinations\\nimport math\\n\\ndef task_func(seq, letter_weight_dict):\\n    \\\"\\\"\\\"\\n    Find the subsequence in a string that has the maximum total weight based on the weights given for each character. \\n    The weights are assigned randomly and a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.\\n\\n    Parameters:\\n    - seq (str): The input string.\\n    - letter_weight_dict (dict): A dictionary with the weights for each character.\\n\\n    Returns:\\n    - str: The subsequence with the highest weight.\\n\\n    Requirements:\\n    - itertools\\n    - math\\n\\n    Example:\\n    >>> task_func('abc', {'a': 1, 'b': 2, 'c': 3})\\n    'abc'\\n    >>> task_func('aabc', {'a': 10, 'b': -5, 'c': 3})\\n    'aac'\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Find the subsequence in a string that has the maximum total weight based on the weights given for each character. The weights are assigned randomly and a subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.\\nThe function should output with:\\n    str: The subsequence with the highest weight.\\nYou should write self-contained code starting with:\\n```\\nfrom itertools import combinations\\nimport math\\ndef task_func(seq, letter_weight_dict):\\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":[]}