{"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":"f52f831a-ba30-5672-b8d5-f80a8614d3a8","task_key":"default--v0~2e1~2e0~5fhf--f52f831a-ba30-5672-b8d5-f80a8614d3a8","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf f52f831a-ba30-5672-b8d5-f80a8614d3a8","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"import random\\nimport re\\ndef task_func(text, seed=None):\\n\",\"complete_prompt\":\"import random\\nimport re\\n\\n\\ndef task_func(text, seed=None):\\n    \\\"\\\"\\\"\\n    Scramble the letters in each word of a given text, keeping the first and last letters of each word intact.\\n\\n    Parameters:\\n    text (str): The text to be scrambled.\\n    seed (int, optional): A seed for the random number generator to ensure reproducible results.\\n                          Defaults to None (not set).\\n\\n    Returns:\\n    str: The scrambled text.\\n\\n    Requirements:\\n    - random\\n    - re\\n\\n    Notes:\\n    - Words are determined by regex word boundaries.\\n    - The scrambling only affects words longer than three characters, leaving shorter words unchanged.\\n\\n    Examples:\\n    >>> task_func('Hello, world!', 0)\\n    'Hello, wlrod!'\\n    >>> task_func(\\\"Programming is fun, isn't it?\\\", 42)\\n    \\\"Prmiangmrog is fun, isn't it?\\\"\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Scramble the letters in each word of a given text, keeping the first and last letters of each word intact.\\nNote that: Notes: Words are determined by regex word boundaries. The scrambling only affects words longer than three characters, leaving shorter words unchanged.\\nThe function should output with:\\n    str: The scrambled text.\\nYou should write self-contained code starting with:\\n```\\nimport random\\nimport re\\ndef task_func(text, seed=None):\\n```\",\"libs\":\"['random', 're']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}