{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"c94e9009-d0a4-5e70-b44e-6f4dfd20409d","task_key":"default--test--sample~5f185","task_revision_id":"2","upstream_id":"sample_185","short_description":"[16, 14, 12, 7, 9, 11]","config":"default","split":"test","body":"{\"code\":\"def f(L):\\n    N = len(L)\\n    for k in range(1, N//2 + 1):\\n        i = k - 1\\n        j = N - k\\n        while i < j:\\n            # swap elements:\\n            L[i], L[j] = L[j], L[i]\\n            # update i, j:\\n            i += 1\\n            j -= 1\\n    return L\",\"input\":\"[16, 14, 12, 7, 9, 11]\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://crux-eval.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}