{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"cruxeval","formal_name":"CRUXEval","introduction":"CRUXEval takes 800 short Python functions and asks either for the output given an input (CRUXEval-O) or for an input that produces a given output (CRUXEval-I). It measures the ability to execute code mentally rather than to write it.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://crux-eval.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":"140bd994-419f-5500-ba33-d5cb7bf93cdf","task_key":"default--test--sample~5f363","task_revision_id":"1","upstream_id":"sample_363","short_description":"[1]","config":"default","split":"test","body":"{\"code\":\"def f(nums):\\n    nums.sort()\\n    n = len(nums)\\n    new_nums = [nums[n//2]]\\n    \\n    if n % 2 == 0:\\n        new_nums = [nums[n//2 - 1], nums[n//2]]\\n    \\n    for i in range(0, n//2):\\n        new_nums.insert(0, nums[n-i-1])\\n        new_nums.append(nums[i])\\n    return new_nums\",\"input\":\"[1]\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://crux-eval.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}