{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu-pro","formal_name":"MMLU-Pro","introduction":"MMLU-Pro rebuilds MMLU with ten answer options instead of four and removes items that no longer separate models. Questions span fourteen academic and professional subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","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":"4342c4c6-f0bc-56c7-aacb-4bf2b2b12c7b","task_key":"default--test--10402","task_revision_id":"1","upstream_id":"10402","short_description":"Develop a FORTRAN subroutine that sorts a list of N elements and arranges them…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N DO 20 J = 1, N IF (Y (J).LT.Y (I)) THEN TEMP = Y (I) Y (I) = Y (J) Y (J) = TEMP END IF 20 CONTINUE 10 CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = N, 1, -1 DO 20 J = N, I+1, -1 IF (Y (J).LT.Y (I)) THEN TEMP = Y (I) Y (I) = Y (J) Y (J) = TEMP END IF 20 CONTINUE 10 CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N MIN = I DO 20 J = I+1, N IF (Y (J).LT.Y (MIN)) MIN = J 20 CONTINUE TEMP = Y (I) Y (I) = Y (MIN) Y (MIN) = TEMP 10 CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N DO 20 J = 1, N-1 IF (Y (J).LE.Y (J+1)) GO TO 20 TEMP = Y (J) Y (J) = Y (J+1) Y (J+1) = TEMP 20 CONTINUE 10 CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (1) CY IS THE ARRAY TO BE SORTED N1 = N - 1 DO 10 I = 1, N1 J = I + 1 DO 20 K = J, N IF (Y (I).LT.Y (K)) GO TO 20 TEMP = Y (I) Y (I) = Y (K) Y (K) = TEMP 20CONTINUE 10CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N J = I + 1 DO 20 K = J, N IF (Y (I).GT.Y (K)) GO TO 20 Y (I) = Y (K) Y (K) = TEMP 20CONTINUE 10CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (1) DO 10 I = 1, N J = I + 1 DO 20 K = J, N IF (Y (I).GE.Y (K)) GO TO 20 TEMP = Y (I) Y (I) = Y (K) Y (K) = TEMP 20CONTINUE 10CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N MAX = I DO 20 J = I+1, N IF (Y (J).GT.Y (MAX)) MAX = J 20 CONTINUE TEMP = Y (I) Y (I) = Y (MAX) Y (MAX) = TEMP 10 CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (1) CY IS THE ARRAY TO BE SORTED N1 = N - 1 DO 10 I = 1, N1 J = I + 1 DO 20 K = J, N IF (Y (I).LE.Y (K)) GO TO 20 TEMP = Y (I) Y (I) = Y (K) Y (K) = TEMP 20CONTINUE 10CONTINUE RETURN END', 'SUBROUTINE SORT (Y, N) DIMENSION Y (N) DO 10 I = 1, N-1 DO 20 J = I+1, N IF (Y (J).GT.Y (I)) THEN TEMP = Y (I) Y (I) = Y (J) Y (J) = TEMP END IF 20 CONTINUE 10 CONTINUE RETURN END']\",\"question\":\"Develop a FORTRAN subroutine that sorts a list of N elements and arranges them in ascending order.\",\"src\":\"stemez-ComputerScience\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}