{"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":"31d32689-dcc3-58ed-b55b-feb51a6bdf21","task_key":"default--v0~2e1~2e0~5fhf--31d32689-dcc3-58ed-b55b-feb51a6bdf21","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 31d32689-dcc3-58ed-b55b-feb51a6bdf21","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import deque\\nimport math\\ndef task_func(l):\\n\",\"complete_prompt\":\"from collections import deque\\nimport math\\n\\ndef task_func(l):\\n    \\\"\\\"\\\"\\n    Create a deque from a list, rotate it to the right by 3 positions, and return the deque.\\n    Also, for demonstration, calculates the square root of the sum of numeric elements in the deque,\\n    if there are any, and prints it.\\n\\n    Parameters:\\n    - l (list): A list of elements to be converted into a deque and rotated.\\n\\n    Returns:\\n    - dq (collections.deque): A deque obtained from the input list after performing a right rotation by 3 positions.\\n\\n    Requirements:\\n    - collections\\n    - math\\n\\n    Example:\\n    >>> task_func(['A', 'B', 'C', 'D', 'E'])\\n    deque(['C', 'D', 'E', 'A', 'B'])\\n\\n    >>> task_func([1, 2, 3, 4, 5])\\n    The square root of the sum of numeric elements: 3.872983346207417\\n    deque([3, 4, 5, 1, 2])\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Create a deque from a list, rotate it to the right by 3 positions, and return the deque. Also, for demonstration, calculates the square root of the sum of numeric elements in the deque, if there are any, and prints it. >>> task_func([1, 2, 3, 4, 5]) The square root of the sum of numeric elements: 3.872983346207417 deque([3, 4, 5, 1, 2])\\nThe function should output with:\\n    dq (collections.deque): A deque obtained from the input list after performing a right rotation by 3 positions.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import deque\\nimport math\\ndef task_func(l):\\n```\",\"libs\":\"['math', 'collections']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}