{"sample_uid": "multipl_e_mbpp_java::mbpp_3_is_not_prime", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to identify non-prime numbers.\n public static boolean isNotPrime(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_3_is_not_prime", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isNotPrime((2l)) == (false));\n assert(isNotPrime((10l)) == (true));\n assert(isNotPrime((35l)) == (true));\n assert(isNotPrime((37l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_3_is_not_prime", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_3_is_not_prime.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_4_heap_queue_largest", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the n largest integers from a given array list of numbers, returned in descending order.\n public static ArrayList heapQueueLargest(ArrayList nums, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_4_heap_queue_largest", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(heapQueueLargest((new ArrayList(Arrays.asList((long)25l, (long)35l, (long)22l, (long)85l, (long)14l, (long)65l, (long)75l, (long)22l, (long)58l))), (3l)).equals((new ArrayList(Arrays.asList((long)85l, (long)75l, (long)65l)))));\n assert(heapQueueLargest((new ArrayList(Arrays.asList((long)25l, (long)35l, (long)22l, (long)85l, (long)14l, (long)65l, (long)75l, (long)22l, (long)58l))), (2l)).equals((new ArrayList(Arrays.asList((long)85l, (long)75l)))));\n assert(heapQueueLargest((new ArrayList(Arrays.asList((long)25l, (long)35l, (long)22l, (long)85l, (long)14l, (long)65l, (long)75l, (long)22l, (long)58l))), (5l)).equals((new ArrayList(Arrays.asList((long)85l, (long)75l, (long)65l, (long)58l, (long)35l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_4_heap_queue_largest", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_4_heap_queue_largest.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_6_differ_At_One_Bit_Pos", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the two numbers differ at one bit position only or not.\n public static boolean differAtOneBitPos(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_6_differ_At_One_Bit_Pos", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(differAtOneBitPos((13l), (9l)) == (true));\n assert(differAtOneBitPos((15l), (8l)) == (false));\n assert(differAtOneBitPos((2l), (4l)) == (false));\n assert(differAtOneBitPos((2l), (3l)) == (true));\n assert(differAtOneBitPos((5l), (1l)) == (true));\n assert(differAtOneBitPos((1l), (5l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_6_differ_At_One_Bit_Pos", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_6_differ_At_One_Bit_Pos.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_8_square_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find squares of individual elements in an array array list.\n public static ArrayList squareNums(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_8_square_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(squareNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)9l, (long)16l, (long)25l, (long)36l, (long)49l, (long)64l, (long)81l, (long)100l)))));\n assert(squareNums((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l)))).equals((new ArrayList(Arrays.asList((long)100l, (long)400l, (long)900l)))));\n assert(squareNums((new ArrayList(Arrays.asList((long)12l, (long)15l)))).equals((new ArrayList(Arrays.asList((long)144l, (long)225l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_8_square_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_8_square_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_9_find_Rotations", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the minimum number of rotations (greater than 0) required to get the same string.\n public static long findRotations(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_9_find_Rotations", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findRotations((\"aaaa\")) == (1l));\n assert(findRotations((\"ab\")) == (2l));\n assert(findRotations((\"abc\")) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_9_find_Rotations", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_9_find_Rotations.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_11_remove_Occ", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to remove first and last occurrence of a given character from the string.\n public static String removeOcc(String s, String ch) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_11_remove_Occ", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeOcc((\"hello\"), (\"l\")).equals((\"heo\")));\n assert(removeOcc((\"abcda\"), (\"a\")).equals((\"bcd\")));\n assert(removeOcc((\"PHP\"), (\"P\")).equals((\"H\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_11_remove_Occ", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_11_remove_Occ.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_12_sort_matrix", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort a given matrix in ascending order according to the sum of its rows.\n public static ArrayList> sortMatrix(ArrayList> M) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_12_sort_matrix", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sortMatrix((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l, (long)5l)))))));\n assert(sortMatrix((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)-2l, (long)4l, (long)-5l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)-1l, (long)1l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)-2l, (long)4l, (long)-5l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)-1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))))));\n assert(sortMatrix((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)5l, (long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)4l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)1l, (long)4l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)1l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)4l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)8l, (long)9l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_12_sort_matrix", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_12_sort_matrix.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_14_find_Volume", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the volume of a triangular prism.\n public static long findVolume(long l, long b, long h) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_14_find_Volume", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findVolume((10l), (8l), (6l)) == (240l));\n assert(findVolume((3l), (2l), (2l)) == (6l));\n assert(findVolume((1l), (2l), (1l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_14_find_Volume", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_14_find_Volume.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_16_text_lowercase_underscore", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to that returns true if the input string contains sequences of lowercase letters joined with an underscore and false otherwise.\n public static boolean textLowercaseUnderscore(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_16_text_lowercase_underscore", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textLowercaseUnderscore((\"aab_cbbbc\")) == (true));\n assert(textLowercaseUnderscore((\"aab_Abbbc\")) == (false));\n assert(textLowercaseUnderscore((\"Aaab_abbbc\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_16_text_lowercase_underscore", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_16_text_lowercase_underscore.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_17_square_perimeter", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that returns the perimeter of a square given its side length as input.\n public static long squarePerimeter(long a) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_17_square_perimeter", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(squarePerimeter((10l)) == (40l));\n assert(squarePerimeter((5l)) == (20l));\n assert(squarePerimeter((4l)) == (16l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_17_square_perimeter", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_17_square_perimeter.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_18_remove_dirty_chars", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove characters from the first string which are present in the second string.\n public static String removeDirtyChars(String string, String second_string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_18_remove_dirty_chars", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeDirtyChars((\"probasscurve\"), (\"pros\")).equals((\"bacuve\")));\n assert(removeDirtyChars((\"digitalindia\"), (\"talent\")).equals((\"digiidi\")));\n assert(removeDirtyChars((\"exoticmiles\"), (\"toxic\")).equals((\"emles\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_18_remove_dirty_chars", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_18_remove_dirty_chars.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_19_test_duplicate", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find whether a given array array list of integers contains any duplicate element.\n public static boolean testDuplicate(ArrayList arraynums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_19_test_duplicate", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(testDuplicate((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))) == (false));\n assert(testDuplicate((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)4l)))) == (true));\n assert(testDuplicate((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)2l, (long)3l, (long)3l, (long)4l, (long)4l, (long)5l)))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_19_test_duplicate", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_19_test_duplicate.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_20_is_woodall", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given number is woodball or not.\n public static boolean isWoodall(long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_20_is_woodall", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isWoodall((383l)) == (true));\n assert(isWoodall((254l)) == (false));\n assert(isWoodall((200l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_20_is_woodall", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_20_is_woodall.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_56_checks", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check if a given number is one less than twice its reverse.\n public static boolean checks(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_56_checks", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checks((70l)) == (false));\n assert(checks((23l)) == (false));\n assert(checks((73l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_56_checks", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_56_checks.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_57_find_Max_Num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the largest number that can be formed with the given array list of digits.\n public static long findMaxNum(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_57_find_Max_Num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findMaxNum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (321l));\n assert(findMaxNum((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l, (long)1l)))) == (6541l));\n assert(findMaxNum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)9l)))) == (9321l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_57_find_Max_Num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_57_find_Max_Num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_58_opposite_Signs", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given two integers have opposite sign or not.\n public static boolean oppositeSigns(long x, long y) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_58_opposite_Signs", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oppositeSigns((1l), (-2l)) == (true));\n assert(oppositeSigns((3l), (2l)) == (false));\n assert(oppositeSigns((-10l), (-10l)) == (false));\n assert(oppositeSigns((-2l), (2l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_58_opposite_Signs", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_58_opposite_Signs.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_59_is_octagonal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth octagonal number.\n public static long isOctagonal(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_59_is_octagonal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isOctagonal((5l)) == (65l));\n assert(isOctagonal((10l)) == (280l));\n assert(isOctagonal((15l)) == (645l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_59_is_octagonal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_59_is_octagonal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_61_count_Substrings", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of substrings with the sum of digits equal to their length.\n public static long countSubstrings(String s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_61_count_Substrings", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countSubstrings((\"112112\")) == (6l));\n assert(countSubstrings((\"111\")) == (6l));\n assert(countSubstrings((\"1101112\")) == (12l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_61_count_Substrings", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_61_count_Substrings.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_62_smallest_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find smallest number in an array array list.\n public static long smallestNum(ArrayList xs) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_62_smallest_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(smallestNum((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)1l, (long)45l, (long)99l)))) == (1l));\n assert(smallestNum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (1l));\n assert(smallestNum((new ArrayList(Arrays.asList((long)45l, (long)46l, (long)50l, (long)60l)))) == (45l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_62_smallest_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_62_smallest_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_63_max_difference", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum difference between available pairs in the given pair array list.\n public static long maxDifference(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_63_max_difference", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxDifference((new ArrayList>(Arrays.asList((Pair)Pair.with(3l, 5l), (Pair)Pair.with(1l, 7l), (Pair)Pair.with(10l, 3l), (Pair)Pair.with(1l, 2l))))) == (7l));\n assert(maxDifference((new ArrayList>(Arrays.asList((Pair)Pair.with(4l, 6l), (Pair)Pair.with(2l, 17l), (Pair)Pair.with(9l, 13l), (Pair)Pair.with(11l, 12l))))) == (15l));\n assert(maxDifference((new ArrayList>(Arrays.asList((Pair)Pair.with(12l, 35l), (Pair)Pair.with(21l, 27l), (Pair)Pair.with(13l, 23l), (Pair)Pair.with(41l, 22l))))) == (23l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_63_max_difference", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_63_max_difference.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_64_subject_marks", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort an array array list of pairs using the second value of each pair.\n public static ArrayList> subjectMarks(ArrayList> subjectmarks) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_64_subject_marks", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(subjectMarks((new ArrayList>(Arrays.asList((Pair)Pair.with(\"English\", 88l), (Pair)Pair.with(\"Science\", 90l), (Pair)Pair.with(\"Maths\", 97l), (Pair)Pair.with(\"Social sciences\", 82l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Social sciences\", 82l), (Pair)Pair.with(\"English\", 88l), (Pair)Pair.with(\"Science\", 90l), (Pair)Pair.with(\"Maths\", 97l))))));\n assert(subjectMarks((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Telugu\", 49l), (Pair)Pair.with(\"Hindhi\", 54l), (Pair)Pair.with(\"Social\", 33l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Social\", 33l), (Pair)Pair.with(\"Telugu\", 49l), (Pair)Pair.with(\"Hindhi\", 54l))))));\n assert(subjectMarks((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Physics\", 96l), (Pair)Pair.with(\"Chemistry\", 97l), (Pair)Pair.with(\"Biology\", 45l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Biology\", 45l), (Pair)Pair.with(\"Physics\", 96l), (Pair)Pair.with(\"Chemistry\", 97l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_64_subject_marks", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_64_subject_marks.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_66_pos_count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of positive numbers in an array array list.\n public static long posCount(ArrayList list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_66_pos_count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(posCount((new ArrayList(Arrays.asList((long)1l, (long)-2l, (long)3l, (long)-4l)))) == (2l));\n assert(posCount((new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l, (long)-1l)))) == (3l));\n assert(posCount((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)))) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_66_pos_count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_66_pos_count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_67_bell_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the number of ways to partition a set of Bell numbers.\n public static long bellNumber(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_67_bell_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(bellNumber((2l)) == (2l));\n assert(bellNumber((10l)) == (115975l));\n assert(bellNumber((56l)) == (6775685320645824322581483068371419745979053216268760300l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_67_bell_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_67_bell_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_68_is_Monotonic", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given array array list is monotonic or not.\n public static boolean isMonotonic(ArrayList A) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_68_is_Monotonic", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isMonotonic((new ArrayList(Arrays.asList((long)6l, (long)5l, (long)4l, (long)4l)))) == (true));\n assert(isMonotonic((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)2l, (long)3l)))) == (true));\n assert(isMonotonic((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)2l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_68_is_Monotonic", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_68_is_Monotonic.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_69_is_sublist", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether an array array list contains the given subarray list or not.\n public static boolean isSublist(ArrayList l, ArrayList s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_69_is_sublist", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isSublist((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)3l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)3l, (long)7l)))) == (false));\n assert(isSublist((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)3l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)4l, (long)3l)))) == (true));\n assert(isSublist((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)3l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)1l, (long)6l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_69_is_sublist", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_69_is_sublist.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_70_get_equal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find whether all the given array lists have equal length or not.\n public static boolean getEqual(ArrayList> Input) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_70_get_equal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getEqual((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)11l, (long)22l, (long)33l)), (ArrayList)new ArrayList(Arrays.asList((long)44l, (long)55l, (long)66l)))))) == (true));\n assert(getEqual((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l, (long)7l)))))) == (false));\n assert(getEqual((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)))))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_70_get_equal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_70_get_equal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_71_comb_sort", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort an array array list of elements.\n public static ArrayList combSort(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_71_comb_sort", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(combSort((new ArrayList(Arrays.asList((long)5l, (long)15l, (long)37l, (long)25l, (long)79l)))).equals((new ArrayList(Arrays.asList((long)5l, (long)15l, (long)25l, (long)37l, (long)79l)))));\n assert(combSort((new ArrayList(Arrays.asList((long)41l, (long)32l, (long)15l, (long)19l, (long)22l)))).equals((new ArrayList(Arrays.asList((long)15l, (long)19l, (long)22l, (long)32l, (long)41l)))));\n assert(combSort((new ArrayList(Arrays.asList((long)99l, (long)15l, (long)13l, (long)47l)))).equals((new ArrayList(Arrays.asList((long)13l, (long)15l, (long)47l, (long)99l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_71_comb_sort", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_71_comb_sort.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_72_dif_Square", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given number can be represented as the difference of two squares or not.\n public static boolean difSquare(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_72_dif_Square", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(difSquare((5l)) == (true));\n assert(difSquare((10l)) == (false));\n assert(difSquare((15l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_72_dif_Square", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_72_dif_Square.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_74_is_samepatterns", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether it follows the sequence given in the patterns array array list.\n public static boolean isSamepatterns(ArrayList colors, ArrayList patterns) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_74_is_samepatterns", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isSamepatterns((new ArrayList(Arrays.asList((String)\"red\", (String)\"green\", (String)\"green\"))), (new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"b\")))) == (true));\n assert(isSamepatterns((new ArrayList(Arrays.asList((String)\"red\", (String)\"green\", (String)\"greenn\"))), (new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"b\")))) == (false));\n assert(isSamepatterns((new ArrayList(Arrays.asList((String)\"red\", (String)\"green\", (String)\"greenn\"))), (new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_74_is_samepatterns", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_74_is_samepatterns.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_75_find_tuples", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find pairs which have all elements divisible by k from the given array list of pairs.\n public static ArrayList> findTuples(ArrayList> test_list, long K) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_75_find_tuples", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findTuples((new ArrayList>(Arrays.asList((Pair)Pair.with(6l, 24l, 12l), (Pair)Pair.with(7l, 9l, 6l), (Pair)Pair.with(12l, 18l, 21l)))), (6l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(6l, 24l, 12l))))));\n assert(findTuples((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 25l, 30l), (Pair)Pair.with(4l, 2l, 3l), (Pair)Pair.with(7l, 8l, 9l)))), (5l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 25l, 30l))))));\n assert(findTuples((new ArrayList>(Arrays.asList((Pair)Pair.with(7l, 9l, 16l), (Pair)Pair.with(8l, 16l, 4l), (Pair)Pair.with(19l, 17l, 18l)))), (4l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(8l, 16l, 4l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_75_find_tuples", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_75_find_tuples.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_77_is_Diff", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find whether a number is divisible by 11.\n public static boolean isDiff(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_77_is_Diff", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isDiff((12345l)) == (false));\n assert(isDiff((1212112l)) == (true));\n assert(isDiff((1212l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_77_is_Diff", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_77_is_Diff.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_79_word_len", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the length of the word is odd or not.\n public static boolean wordLen(String s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_79_word_len", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(wordLen((\"Hadoop\")) == (false));\n assert(wordLen((\"great\")) == (true));\n assert(wordLen((\"structure\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_79_word_len", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_79_word_len.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_80_tetrahedral_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth tetrahedral number.\n public static long tetrahedralNumber(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_80_tetrahedral_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tetrahedralNumber((5l)) == (35l));\n assert(tetrahedralNumber((6l)) == (56l));\n assert(tetrahedralNumber((7l)) == (84l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_80_tetrahedral_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_80_tetrahedral_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_83_get_Char", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the character made by adding the ASCII value of all the characters of the given string modulo 26.\n public static String getChar(String strr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_83_get_Char", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getChar((\"abc\")).equals((\"f\")));\n assert(getChar((\"gfg\")).equals((\"t\")));\n assert(getChar((\"ab\")).equals((\"c\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_83_get_Char", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_83_get_Char.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_84_sequence", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth number in the newman conway sequence.\n public static long sequence(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_84_sequence", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sequence((10l)) == (6l));\n assert(sequence((2l)) == (1l));\n assert(sequence((3l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_84_sequence", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_84_sequence.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_86_centered_hexagonal_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find nth centered hexagonal number.\n public static long centeredHexagonalNumber(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_86_centered_hexagonal_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(centeredHexagonalNumber((10l)) == (271l));\n assert(centeredHexagonalNumber((2l)) == (7l));\n assert(centeredHexagonalNumber((9l)) == (217l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_86_centered_hexagonal_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_86_centered_hexagonal_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_87_merge_dictionaries_three", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to merge three dictionaries into a single hash map.\n public static HashMap mergeDictionariesThree(HashMap dict1, HashMap dict2, HashMap dict3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_87_merge_dictionaries_three", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(mergeDictionariesThree((new HashMap(Map.of(\"R\", \"Red\", \"B\", \"Black\", \"P\", \"Pink\"))), (new HashMap(Map.of(\"G\", \"Green\", \"W\", \"White\"))), (new HashMap(Map.of(\"O\", \"Orange\", \"W\", \"White\", \"B\", \"Black\")))).equals((new HashMap(Map.of(\"B\", \"Black\", \"R\", \"Red\", \"P\", \"Pink\", \"G\", \"Green\", \"W\", \"White\", \"O\", \"Orange\")))));\n assert(mergeDictionariesThree((new HashMap(Map.of(\"R\", \"Red\", \"B\", \"Black\", \"P\", \"Pink\"))), (new HashMap(Map.of(\"G\", \"Green\", \"W\", \"White\"))), (new HashMap(Map.of(\"L\", \"lavender\", \"B\", \"Blue\")))).equals((new HashMap(Map.of(\"W\", \"White\", \"P\", \"Pink\", \"B\", \"Black\", \"R\", \"Red\", \"G\", \"Green\", \"L\", \"lavender\")))));\n assert(mergeDictionariesThree((new HashMap(Map.of(\"R\", \"Red\", \"B\", \"Black\", \"P\", \"Pink\"))), (new HashMap(Map.of(\"L\", \"lavender\", \"B\", \"Blue\"))), (new HashMap(Map.of(\"G\", \"Green\", \"W\", \"White\")))).equals((new HashMap(Map.of(\"B\", \"Black\", \"P\", \"Pink\", \"R\", \"Red\", \"G\", \"Green\", \"L\", \"lavender\", \"W\", \"White\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_87_merge_dictionaries_three", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_87_merge_dictionaries_three.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_88_freq_count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to get the frequency of all the elements in an array array list, returned as a hash map.\n public static HashMap freqCount(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_88_freq_count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(freqCount((new ArrayList(Arrays.asList((long)10l, (long)10l, (long)10l, (long)10l, (long)20l, (long)20l, (long)20l, (long)20l, (long)40l, (long)40l, (long)50l, (long)50l, (long)30l)))).equals((new HashMap(Map.of(10l, 4l, 20l, 4l, 40l, 2l, 50l, 2l, 30l, 1l)))));\n assert(freqCount((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)3l, (long)2l, (long)4l, (long)1l, (long)3l, (long)1l, (long)4l)))).equals((new HashMap(Map.of(1l, 3l, 2l, 2l, 3l, 3l, 4l, 3l)))));\n assert(freqCount((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)4l, (long)9l, (long)10l, (long)4l, (long)5l, (long)6l, (long)7l, (long)9l, (long)5l)))).equals((new HashMap(Map.of(10l, 1l, 5l, 3l, 6l, 2l, 7l, 2l, 4l, 2l, 9l, 2l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_88_freq_count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_88_freq_count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_89_closest_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the closest smaller number than n.\n public static long closestNum(long N) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_89_closest_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(closestNum((11l)) == (10l));\n assert(closestNum((7l)) == (6l));\n assert(closestNum((12l)) == (11l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_89_closest_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_89_closest_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_90_len_log", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the length of the longest word.\n public static long lenLog(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_90_len_log", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lenLog((new ArrayList(Arrays.asList((String)\"python\", (String)\"PHP\", (String)\"bigdata\")))) == (7l));\n assert(lenLog((new ArrayList(Arrays.asList((String)\"a\", (String)\"ab\", (String)\"abc\")))) == (3l));\n assert(lenLog((new ArrayList(Arrays.asList((String)\"small\", (String)\"big\", (String)\"tall\")))) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_90_len_log", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_90_len_log.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_91_find_substring", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if a string is present as a substring in a given array list of string values.\n public static boolean findSubstring(ArrayList str1, String sub_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_91_find_substring", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findSubstring((new ArrayList(Arrays.asList((String)\"red\", (String)\"black\", (String)\"white\", (String)\"green\", (String)\"orange\"))), (\"ack\")) == (true));\n assert(findSubstring((new ArrayList(Arrays.asList((String)\"red\", (String)\"black\", (String)\"white\", (String)\"green\", (String)\"orange\"))), (\"abc\")) == (false));\n assert(findSubstring((new ArrayList(Arrays.asList((String)\"red\", (String)\"black\", (String)\"white\", (String)\"green\", (String)\"orange\"))), (\"ange\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_91_find_substring", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_91_find_substring.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_92_is_undulating", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given number is undulating or not.\n public static boolean isUndulating(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_92_is_undulating", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isUndulating((1212121l)) == (true));\n assert(isUndulating((1991l)) == (false));\n assert(isUndulating((121l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_92_is_undulating", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_92_is_undulating.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_93_power", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the value of 'a' to the power 'b'.\n public static long power(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_93_power", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(power((3l), (4l)) == (81l));\n assert(power((2l), (3l)) == (8l));\n assert(power((5l), (5l)) == (3125l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_93_power", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_93_power.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_94_index_minimum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Given an array array list of pairs, write a function that returns the first value of the pair with the smallest second value.\n public static String indexMinimum(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_94_index_minimum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(indexMinimum((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Rash\", 143l), (Pair)Pair.with(\"Manjeet\", 200l), (Pair)Pair.with(\"Varsha\", 100l))))).equals((\"Varsha\")));\n assert(indexMinimum((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Yash\", 185l), (Pair)Pair.with(\"Dawood\", 125l), (Pair)Pair.with(\"Sanya\", 175l))))).equals((\"Dawood\")));\n assert(indexMinimum((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Sai\", 345l), (Pair)Pair.with(\"Salman\", 145l), (Pair)Pair.with(\"Ayesha\", 96l))))).equals((\"Ayesha\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_94_index_minimum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_94_index_minimum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_95_Find_Min_Length", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the length of the smallest array list in an array array list of array lists.\n public static long FindMinLength(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_95_Find_Min_Length", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(FindMinLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)))))) == (1l));\n assert(FindMinLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)))))) == (2l));\n assert(FindMinLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)3l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)4l, (long)4l, (long)4l)))))) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_95_Find_Min_Length", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_95_Find_Min_Length.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_96_divisor", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the number of divisors of a given integer.\n public static long divisor(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_96_divisor", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(divisor((15l)) == (4l));\n assert(divisor((12l)) == (6l));\n assert(divisor((9l)) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_96_divisor", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_96_divisor.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_97_frequency_lists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find frequency of each element in a flattened array list of array lists, returned in a hash map.\n public static HashMap frequencyLists(ArrayList> list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_97_frequency_lists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(frequencyLists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)5l)))))).equals((new HashMap(Map.of(1l, 1l, 2l, 3l, 3l, 1l, 4l, 1l, 5l, 2l, 6l, 1l, 7l, 1l, 8l, 1l, 9l, 1l)))));\n assert(frequencyLists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)10l, (long)11l, (long)12l)))))).equals((new HashMap(Map.of(1l, 1l, 2l, 1l, 3l, 1l, 4l, 1l, 5l, 1l, 6l, 1l, 7l, 1l, 8l, 1l, 9l, 1l, 10l, 1l, 11l, 1l, 12l, 1l)))));\n assert(frequencyLists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)20l, (long)30l, (long)40l, (long)17l)), (ArrayList)new ArrayList(Arrays.asList((long)18l, (long)16l, (long)14l, (long)13l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l)))))).equals((new HashMap(Map.of(20l, 2l, 30l, 2l, 40l, 2l, 17l, 1l, 18l, 1l, 16l, 1l, 14l, 1l, 13l, 1l, 10l, 1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_97_frequency_lists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_97_frequency_lists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_99_decimal_to_binary", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert the given decimal number to its binary equivalent, represented as a string with no leading zeros.\n public static String decimalToBinary(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_99_decimal_to_binary", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(decimalToBinary((8l)).equals((\"1000\")));\n assert(decimalToBinary((18l)).equals((\"10010\")));\n assert(decimalToBinary((7l)).equals((\"111\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_99_decimal_to_binary", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_99_decimal_to_binary.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_100_next_smallest_palindrome", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the next smallest palindrome of a specified integer, returned as an integer.\n public static long nextSmallestPalindrome(long num) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_100_next_smallest_palindrome", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(nextSmallestPalindrome((99l)) == (101l));\n assert(nextSmallestPalindrome((1221l)) == (1331l));\n assert(nextSmallestPalindrome((120l)) == (121l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_100_next_smallest_palindrome", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_100_next_smallest_palindrome.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_101_kth_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the kth element in the given array array list using 1-based indexing.\n public static long kthElement(ArrayList arr, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_101_kth_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(kthElement((new ArrayList(Arrays.asList((long)12l, (long)3l, (long)5l, (long)7l, (long)19l))), (2l)) == (3l));\n assert(kthElement((new ArrayList(Arrays.asList((long)17l, (long)24l, (long)8l, (long)23l))), (3l)) == (8l));\n assert(kthElement((new ArrayList(Arrays.asList((long)16l, (long)21l, (long)25l, (long)36l, (long)4l))), (4l)) == (36l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_101_kth_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_101_kth_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_102_snake_to_camel", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert a snake case string to camel case string.\n public static String snakeToCamel(String word) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_102_snake_to_camel", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(snakeToCamel((\"python_program\")).equals((\"PythonProgram\")));\n assert(snakeToCamel((\"python_language\")).equals((\"PythonLanguage\")));\n assert(snakeToCamel((\"programming_language\")).equals((\"ProgrammingLanguage\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_102_snake_to_camel", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_102_snake_to_camel.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_103_eulerian_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the Eulerian number a(n, m).\n public static long eulerianNum(long n, long m) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_103_eulerian_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(eulerianNum((3l), (1l)) == (4l));\n assert(eulerianNum((4l), (1l)) == (11l));\n assert(eulerianNum((5l), (3l)) == (26l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_103_eulerian_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_103_eulerian_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_104_sort_sublists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort each subarray list of strings in a given array list of array lists.\n public static ArrayList> sortSublists(ArrayList> input_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_104_sort_sublists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"white\")), (ArrayList)new ArrayList(Arrays.asList((String)\"white\", (String)\"black\", (String)\"orange\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"white\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"orange\", (String)\"white\")))))));\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\" red \", (String)\"green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"blue \", (String)\" black\")), (ArrayList)new ArrayList(Arrays.asList((String)\" orange\", (String)\"brown\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\" red \", (String)\"green\")), (ArrayList)new ArrayList(Arrays.asList((String)\" black\", (String)\"blue \")), (ArrayList)new ArrayList(Arrays.asList((String)\" orange\", (String)\"brown\")))))));\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"zilver\", (String)\"gold\")), (ArrayList)new ArrayList(Arrays.asList((String)\"magnesium\", (String)\"aluminium\")), (ArrayList)new ArrayList(Arrays.asList((String)\"steel\", (String)\"bronze\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"gold\", (String)\"zilver\")), (ArrayList)new ArrayList(Arrays.asList((String)\"aluminium\", (String)\"magnesium\")), (ArrayList)new ArrayList(Arrays.asList((String)\"bronze\", (String)\"steel\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_104_sort_sublists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_104_sort_sublists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_105_count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count true booleans in the given array list.\n public static long count(ArrayList lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_105_count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(count((new ArrayList(Arrays.asList((boolean)true, (boolean)false, (boolean)true)))) == (2l));\n assert(count((new ArrayList(Arrays.asList((boolean)false, (boolean)false)))) == (0l));\n assert(count((new ArrayList(Arrays.asList((boolean)true, (boolean)true, (boolean)true)))) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_105_count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_105_count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_106_add_lists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to append the given array list to the given pairs.\n public static Pair addLists(ArrayList test_list, Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_106_add_lists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addLists((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l))), (Pair.with(9l, 10l))).equals((Pair.with(9l, 10l, 5l, 6l, 7l))));\n assert(addLists((new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l))), (Pair.with(10l, 11l))).equals((Pair.with(10l, 11l, 6l, 7l, 8l))));\n assert(addLists((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l))), (Pair.with(11l, 12l))).equals((Pair.with(11l, 12l, 7l, 8l, 9l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_106_add_lists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_106_add_lists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_108_merge_sorted_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to merge three array lists into a single sorted array list.\n public static ArrayList mergeSortedList(ArrayList num1, ArrayList num2, ArrayList num3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_108_merge_sorted_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(mergeSortedList((new ArrayList(Arrays.asList((long)25l, (long)24l, (long)15l, (long)4l, (long)5l, (long)29l, (long)110l))), (new ArrayList(Arrays.asList((long)19l, (long)20l, (long)11l, (long)56l, (long)25l, (long)233l, (long)154l))), (new ArrayList(Arrays.asList((long)24l, (long)26l, (long)54l, (long)48l)))).equals((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)11l, (long)15l, (long)19l, (long)20l, (long)24l, (long)24l, (long)25l, (long)25l, (long)26l, (long)29l, (long)48l, (long)54l, (long)56l, (long)110l, (long)154l, (long)233l)))));\n assert(mergeSortedList((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)6l, (long)8l, (long)9l))), (new ArrayList(Arrays.asList((long)2l, (long)5l, (long)7l, (long)11l))), (new ArrayList(Arrays.asList((long)1l, (long)4l, (long)7l, (long)8l, (long)12l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)5l, (long)6l, (long)7l, (long)7l, (long)8l, (long)8l, (long)9l, (long)11l, (long)12l)))));\n assert(mergeSortedList((new ArrayList(Arrays.asList((long)18l, (long)14l, (long)10l, (long)9l, (long)8l, (long)7l, (long)9l, (long)3l, (long)2l, (long)4l, (long)1l))), (new ArrayList(Arrays.asList((long)25l, (long)35l, (long)22l, (long)85l, (long)14l, (long)65l, (long)75l, (long)25l, (long)58l))), (new ArrayList(Arrays.asList((long)12l, (long)74l, (long)9l, (long)50l, (long)61l, (long)41l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)7l, (long)8l, (long)9l, (long)9l, (long)9l, (long)10l, (long)12l, (long)14l, (long)14l, (long)18l, (long)22l, (long)25l, (long)25l, (long)35l, (long)41l, (long)50l, (long)58l, (long)61l, (long)65l, (long)74l, (long)75l, (long)85l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_108_merge_sorted_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_108_merge_sorted_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_109_odd_Equivalent", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the number of numbers with an odd value when rotating a binary string the given number of times.\n public static long oddEquivalent(String s, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_109_odd_Equivalent", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oddEquivalent((\"011001\"), (6l)) == (3l));\n assert(oddEquivalent((\"11011\"), (5l)) == (4l));\n assert(oddEquivalent((\"1010\"), (4l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_109_odd_Equivalent", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_109_odd_Equivalent.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_113_check_integer", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if a string represents an integer or not.\n public static boolean checkInteger(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_113_check_integer", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkInteger((\"python\")) == (false));\n assert(checkInteger((\"1\")) == (true));\n assert(checkInteger((\"12345\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_113_check_integer", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_113_check_integer.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_116_tuple_to_int", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert a given pair of positive integers into a single integer.\n public static long tupleToInt(Pair nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_116_tuple_to_int", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tupleToInt((Pair.with(1l, 2l, 3l))) == (123l));\n assert(tupleToInt((Pair.with(4l, 5l, 6l))) == (456l));\n assert(tupleToInt((Pair.with(5l, 6l, 7l))) == (567l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_116_tuple_to_int", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_116_tuple_to_int.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_117_list_to_float", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert all possible convertible elements in an array array list of array lists to floats.\n public static ArrayList> listToFloat(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_117_list_to_float", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(listToFloat((new ArrayList>(Arrays.asList((Pair)Pair.with(\"3\", \"4\"), (Pair)Pair.with(\"1\", \"26.45\"), (Pair)Pair.with(\"7.32\", \"8\"), (Pair)Pair.with(\"4\", \"8\"))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(3.0f, 4.0f), (Pair)Pair.with(1.0f, 26.45f), (Pair)Pair.with(7.32f, 8.0f), (Pair)Pair.with(4.0f, 8.0f))))));\n assert(listToFloat((new ArrayList>(Arrays.asList((Pair)Pair.with(\"4\", \"4\"), (Pair)Pair.with(\"2\", \"27\"), (Pair)Pair.with(\"4.12\", \"9\"), (Pair)Pair.with(\"7\", \"11\"))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(4.0f, 4.0f), (Pair)Pair.with(2.0f, 27.0f), (Pair)Pair.with(4.12f, 9.0f), (Pair)Pair.with(7.0f, 11.0f))))));\n assert(listToFloat((new ArrayList>(Arrays.asList((Pair)Pair.with(\"6\", \"78\"), (Pair)Pair.with(\"5\", \"26.45\"), (Pair)Pair.with(\"1.33\", \"4\"), (Pair)Pair.with(\"82\", \"13\"))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(6.0f, 78.0f), (Pair)Pair.with(5.0f, 26.45f), (Pair)Pair.with(1.33f, 4.0f), (Pair)Pair.with(82.0f, 13.0f))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_117_list_to_float", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_117_list_to_float.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_118_string_to_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert a string to an array array list of strings split on the space character.\n public static ArrayList stringToList(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_118_string_to_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(stringToList((\"python programming\")).equals((new ArrayList(Arrays.asList((String)\"python\", (String)\"programming\")))));\n assert(stringToList((\"lists tuples strings\")).equals((new ArrayList(Arrays.asList((String)\"lists\", (String)\"tuples\", (String)\"strings\")))));\n assert(stringToList((\"write a program\")).equals((new ArrayList(Arrays.asList((String)\"write\", (String)\"a\", (String)\"program\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_118_string_to_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_118_string_to_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_119_search", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the element that appears only once in a sorted array array list.\n public static long search(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_119_search", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(search((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)2l, (long)3l)))) == (3l));\n assert(search((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)3l, (long)3l, (long)4l, (long)4l, (long)5l, (long)5l, (long)7l, (long)7l, (long)8l)))) == (8l));\n assert(search((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)2l, (long)3l, (long)3l, (long)4l, (long)4l)))) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_119_search", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_119_search.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_120_max_product_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum absolute product between numbers in pairs of pairs within a given array list.\n public static long maxProductTuple(ArrayList> list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_120_max_product_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(2l, 7l), (Pair)Pair.with(2l, 6l), (Pair)Pair.with(1l, 8l), (Pair)Pair.with(4l, 9l))))) == (36l));\n assert(maxProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(10l, 20l), (Pair)Pair.with(15l, 2l), (Pair)Pair.with(5l, 10l))))) == (200l));\n assert(maxProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(11l, 44l), (Pair)Pair.with(10l, 15l), (Pair)Pair.with(20l, 5l), (Pair)Pair.with(12l, 9l))))) == (484l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_120_max_product_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_120_max_product_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_123_amicable_numbers_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sum all amicable numbers from 1 to a specified number.\n public static long amicableNumbersSum(long limit) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_123_amicable_numbers_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(amicableNumbersSum((999l)) == (504l));\n assert(amicableNumbersSum((9999l)) == (31626l));\n assert(amicableNumbersSum((99l)) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_123_amicable_numbers_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_123_amicable_numbers_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_125_find_length", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum difference between the number of 0s and number of 1s in any sub-string of the given binary string.\n public static long findLength(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_125_find_length", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findLength((\"11000010001\")) == (6l));\n assert(findLength((\"10111\")) == (1l));\n assert(findLength((\"11011101100101\")) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_125_find_length", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_125_find_length.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_126_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of common divisors of two given numbers.\n public static long sum(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_126_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sum((10l), (15l)) == (6l));\n assert(sum((100l), (150l)) == (93l));\n assert(sum((4l), (6l)) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_126_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_126_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_127_multiply_int", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to multiply two integers.\n public static long multiplyInt(long x, long y) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_127_multiply_int", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(multiplyInt((10l), (20l)) == (200l));\n assert(multiplyInt((5l), (10l)) == (50l));\n assert(multiplyInt((4l), (8l)) == (32l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_127_multiply_int", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_127_multiply_int.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_128_long_words", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find words that are longer than n characters from a given array list of words.\n public static ArrayList longWords(long n, String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_128_long_words", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(longWords((3l), (\"python is a programming language\")).equals((new ArrayList(Arrays.asList((String)\"python\", (String)\"programming\", (String)\"language\")))));\n assert(longWords((2l), (\"writing a program\")).equals((new ArrayList(Arrays.asList((String)\"writing\", (String)\"program\")))));\n assert(longWords((5l), (\"sorting list\")).equals((new ArrayList(Arrays.asList((String)\"sorting\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_128_long_words", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_128_long_words.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_129_magic_square_test", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate whether the matrix is a magic square.\n public static boolean magicSquareTest(ArrayList> my_matrix) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_129_magic_square_test", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(magicSquareTest((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)12l, (long)1l, (long)14l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)13l, (long)8l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)16l, (long)3l, (long)10l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)6l, (long)15l, (long)4l)))))) == (true));\n assert(magicSquareTest((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)7l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)3l, (long)8l)))))) == (true));\n assert(magicSquareTest((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)7l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)3l, (long)7l)))))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_129_magic_square_test", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_129_magic_square_test.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_130_max_occurrences", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the item with maximum frequency in a given array list.\n public static long maxOccurrences(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_130_max_occurrences", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxOccurrences((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)8l, (long)4l, (long)7l, (long)9l, (long)8l, (long)2l, (long)6l, (long)5l, (long)1l, (long)6l, (long)1l, (long)2l, (long)3l, (long)2l, (long)4l, (long)6l, (long)9l, (long)1l, (long)2l)))) == (2l));\n assert(maxOccurrences((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)8l, (long)4l, (long)7l, (long)9l, (long)8l, (long)7l, (long)9l, (long)15l, (long)14l, (long)10l, (long)12l, (long)13l, (long)16l, (long)18l)))) == (8l));\n assert(maxOccurrences((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)20l, (long)30l, (long)40l, (long)90l, (long)80l, (long)50l, (long)30l, (long)20l, (long)50l, (long)10l)))) == (20l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_130_max_occurrences", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_130_max_occurrences.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_131_reverse_vowels", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to reverse only the vowels of a given string (where y is not a vowel).\n public static String reverseVowels(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_131_reverse_vowels", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(reverseVowels((\"Python\")).equals((\"Python\")));\n assert(reverseVowels((\"USA\")).equals((\"ASU\")));\n assert(reverseVowels((\"ab\")).equals((\"ab\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_131_reverse_vowels", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_131_reverse_vowels.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_132_tup_string", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert an array array list to a string.\n public static String tupString(ArrayList tup1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_132_tup_string", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tupString((new ArrayList(Arrays.asList((String)\"e\", (String)\"x\", (String)\"e\", (String)\"r\", (String)\"c\", (String)\"i\", (String)\"s\", (String)\"e\", (String)\"s\")))).equals((\"exercises\")));\n assert(tupString((new ArrayList(Arrays.asList((String)\"p\", (String)\"y\", (String)\"t\", (String)\"h\", (String)\"o\", (String)\"n\")))).equals((\"python\")));\n assert(tupString((new ArrayList(Arrays.asList((String)\"p\", (String)\"r\", (String)\"o\", (String)\"g\", (String)\"r\", (String)\"a\", (String)\"m\")))).equals((\"program\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_132_tup_string", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_132_tup_string.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_133_sum_negativenum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the sum of the negative numbers of a given array list of numbers.\n public static long sumNegativenum(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_133_sum_negativenum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumNegativenum((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)-6l, (long)-9l, (long)11l, (long)-12l, (long)14l, (long)-5l, (long)17l)))) == (-32l));\n assert(sumNegativenum((new ArrayList(Arrays.asList((long)10l, (long)15l, (long)-14l, (long)13l, (long)-18l, (long)12l, (long)-20l)))) == (-52l));\n assert(sumNegativenum((new ArrayList(Arrays.asList((long)19l, (long)-65l, (long)57l, (long)39l, (long)152l, (long)-639l, (long)121l, (long)44l, (long)90l, (long)-190l)))) == (-894l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_133_sum_negativenum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_133_sum_negativenum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_135_hexagonal_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth hexagonal number.\n public static long hexagonalNum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_135_hexagonal_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(hexagonalNum((10l)) == (190l));\n assert(hexagonalNum((5l)) == (45l));\n assert(hexagonalNum((7l)) == (91l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_135_hexagonal_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_135_hexagonal_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_138_is_Sum_Of_Powers_Of_Two", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given number can be represented as sum of non-zero powers of 2 or not.\n public static boolean isSumOfPowersOfTwo(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_138_is_Sum_Of_Powers_Of_Two", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isSumOfPowersOfTwo((10l)) == (true));\n assert(isSumOfPowersOfTwo((7l)) == (false));\n assert(isSumOfPowersOfTwo((14l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_138_is_Sum_Of_Powers_Of_Two", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_138_is_Sum_Of_Powers_Of_Two.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_141_pancake_sort", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort an array array list of elements.\n public static ArrayList pancakeSort(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_141_pancake_sort", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(pancakeSort((new ArrayList(Arrays.asList((long)15l, (long)79l, (long)25l, (long)38l, (long)69l)))).equals((new ArrayList(Arrays.asList((long)15l, (long)25l, (long)38l, (long)69l, (long)79l)))));\n assert(pancakeSort((new ArrayList(Arrays.asList((long)98l, (long)12l, (long)54l, (long)36l, (long)85l)))).equals((new ArrayList(Arrays.asList((long)12l, (long)36l, (long)54l, (long)85l, (long)98l)))));\n assert(pancakeSort((new ArrayList(Arrays.asList((long)41l, (long)42l, (long)32l, (long)12l, (long)23l)))).equals((new ArrayList(Arrays.asList((long)12l, (long)23l, (long)32l, (long)41l, (long)42l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_141_pancake_sort", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_141_pancake_sort.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_142_count_samepair", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count number items that are identical in the same position of three given array lists.\n public static long countSamepair(ArrayList list1, ArrayList list2, ArrayList list3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_142_count_samepair", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countSamepair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)2l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)9l))), (new ArrayList(Arrays.asList((long)2l, (long)1l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)9l)))) == (3l));\n assert(countSamepair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)2l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)1l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)8l)))) == (4l));\n assert(countSamepair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)2l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)2l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)1l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)8l)))) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_142_count_samepair", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_142_count_samepair.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_143_find_lists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find number of array lists present in the given array list.\n public static long findLists(ArrayList Input) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_143_find_lists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findLists((new ArrayList(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l)))))) == (2l));\n assert(findLists((new ArrayList(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)))))) == (3l));\n assert(findLists((new ArrayList(Arrays.asList((long)9l, (long)8l, (long)7l, (long)6l, (long)5l, (long)4l, (long)3l, (long)2l, (long)1l)))) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_143_find_lists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_143_find_lists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_145_max_Abs_Diff", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the maximum difference between any two elements in a given array array list.\n public static long maxAbsDiff(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_145_max_Abs_Diff", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxAbsDiff((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)5l, (long)3l)))) == (4l));\n assert(maxAbsDiff((new ArrayList(Arrays.asList((long)9l, (long)3l, (long)2l, (long)5l, (long)1l)))) == (8l));\n assert(maxAbsDiff((new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_145_max_Abs_Diff", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_145_max_Abs_Diff.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_160_find_solution", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that returns integers x and y that satisfy ax + by = n as a pair, or return null if no solution exists.\n public static Optional> findSolution(long a, long b, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_160_find_solution", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findSolution((2l), (3l), (7l)).equals(Optional.of(Pair.with(2l, 1l))));\n assert(findSolution((4l), (2l), (7l)).equals(Optional.empty()));\n assert(findSolution((1l), (13l), (17l)).equals(Optional.of(Pair.with(4l, 1l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_160_find_solution", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_160_find_solution.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_161_remove_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove all elements from a given array list present in another array list.\n public static ArrayList removeElements(ArrayList list1, ArrayList list2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_161_remove_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeElements((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l, (long)8l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)9l, (long)10l)))));\n assert(removeElements((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l, (long)8l, (long)9l, (long)10l)))));\n assert(removeElements((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)5l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)6l, (long)8l, (long)9l, (long)10l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_161_remove_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_161_remove_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_162_sum_series", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the sum (n - 2*i) from i=0 to n // 2, for instance n + (n-2) + (n-4)... (until n-x =< 0).\n public static long sumSeries(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_162_sum_series", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumSeries((6l)) == (12l));\n assert(sumSeries((10l)) == (30l));\n assert(sumSeries((9l)) == (25l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_162_sum_series", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_162_sum_series.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_164_are_equivalent", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to determine if the sum of the divisors of two integers are the same.\n public static boolean areEquivalent(long num1, long num2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_164_are_equivalent", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(areEquivalent((36l), (57l)) == (false));\n assert(areEquivalent((2l), (4l)) == (false));\n assert(areEquivalent((23l), (47l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_164_are_equivalent", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_164_are_equivalent.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_165_count_char_position", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the number of characters in a string that occur at the same position in the string as in the English alphabet (case insensitive).\n public static long countCharPosition(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_165_count_char_position", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countCharPosition((\"xbcefg\")) == (2l));\n assert(countCharPosition((\"ABcED\")) == (3l));\n assert(countCharPosition((\"AbgdeF\")) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_165_count_char_position", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_165_count_char_position.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_166_find_even_pair", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that counts the number of pairs of integers in an array array list that xor to an even number.\n public static long findEvenPair(ArrayList A) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_166_find_even_pair", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findEvenPair((new ArrayList(Arrays.asList((long)5l, (long)4l, (long)7l, (long)2l, (long)1l)))) == (4l));\n assert(findEvenPair((new ArrayList(Arrays.asList((long)7l, (long)2l, (long)8l, (long)1l, (long)0l, (long)5l, (long)11l)))) == (9l));\n assert(findEvenPair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_166_find_even_pair", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_166_find_even_pair.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_167_next_power_of_2", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the smallest power of 2 greater than or equal to n.\n public static long nextPowerOf2(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_167_next_power_of_2", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(nextPowerOf2((0l)) == (1l));\n assert(nextPowerOf2((5l)) == (8l));\n assert(nextPowerOf2((17l)) == (32l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_167_next_power_of_2", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_167_next_power_of_2.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_168_frequency", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the number of occurrences of a number in a given array list.\n public static long frequency(ArrayList a, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_168_frequency", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(frequency((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (4l)) == (0l));\n assert(frequency((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)2l, (long)3l, (long)3l, (long)3l, (long)4l))), (3l)) == (3l));\n assert(frequency((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)1l, (long)2l))), (1l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_168_frequency", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_168_frequency.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_170_sum_range_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the sum of numbers in an array array list within a range specified by two indices.\n public static long sumRangeList(ArrayList list1, long m, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_170_sum_range_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumRangeList((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)5l, (long)6l, (long)8l, (long)3l, (long)4l, (long)9l, (long)10l, (long)11l, (long)8l, (long)12l))), (8l), (10l)) == (29l));\n assert(sumRangeList((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)5l, (long)6l, (long)8l, (long)3l, (long)4l, (long)9l, (long)10l, (long)11l, (long)8l, (long)12l))), (5l), (7l)) == (16l));\n assert(sumRangeList((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)5l, (long)6l, (long)8l, (long)3l, (long)4l, (long)9l, (long)10l, (long)11l, (long)8l, (long)12l))), (7l), (10l)) == (38l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_170_sum_range_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_170_sum_range_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_171_perimeter_pentagon", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the perimeter of a regular pentagon from the length of its sides.\n public static long perimeterPentagon(long a) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_171_perimeter_pentagon", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(perimeterPentagon((5l)) == (25l));\n assert(perimeterPentagon((10l)) == (50l));\n assert(perimeterPentagon((15l)) == (75l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_171_perimeter_pentagon", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_171_perimeter_pentagon.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_172_count_occurance", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the number of occurence of the string 'std' in a given string.\n public static long countOccurance(String s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_172_count_occurance", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countOccurance((\"letstdlenstdporstd\")) == (3l));\n assert(countOccurance((\"truststdsolensporsd\")) == (1l));\n assert(countOccurance((\"makestdsostdworthit\")) == (2l));\n assert(countOccurance((\"stds\")) == (1l));\n assert(countOccurance((\"\")) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_172_count_occurance", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_172_count_occurance.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_222_check_type", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if all the elements in pair have same data type or not.\n public static boolean checkType(Object test_tuple) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_222_check_type", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkType(Pair.with(5l, 6l, 7l, 3l, 5l, 6l)) == (true));\n assert(checkType(Pair.with(1l, 2l, \"4\")) == (false));\n assert(checkType(Pair.with(3l, 2l, 1l, 4l, 5l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_222_check_type", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_222_check_type.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_223_is_majority", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in a sorted array array list, its length (n), and an element and returns whether the element is the majority element in the given sorted array array list. (The majority element is the element that occurs more than n/2 times.)\n public static boolean isMajority(ArrayList arr, long n, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_223_is_majority", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isMajority((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)3l, (long)3l, (long)3l, (long)10l))), (7l), (3l)) == (true));\n assert(isMajority((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)4l, (long)4l, (long)4l, (long)6l, (long)6l))), (8l), (4l)) == (false));\n assert(isMajority((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)2l, (long)2l))), (5l), (1l)) == (true));\n assert(isMajority((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)2l))), (5l), (1l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_223_is_majority", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_223_is_majority.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_224_count_Set_Bits", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of set bits (binary digits with value 1) in a given number.\n public static long countSetBits(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_224_count_Set_Bits", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countSetBits((2l)) == (1l));\n assert(countSetBits((4l)) == (1l));\n assert(countSetBits((6l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_224_count_Set_Bits", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_224_count_Set_Bits.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_226_odd_values_string", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to remove the characters which have odd index values of a given string.\n public static String oddValuesString(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_226_odd_values_string", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oddValuesString((\"abcdef\")).equals((\"ace\")));\n assert(oddValuesString((\"python\")).equals((\"pto\")));\n assert(oddValuesString((\"data\")).equals((\"dt\")));\n assert(oddValuesString((\"lambs\")).equals((\"lms\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_226_odd_values_string", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_226_odd_values_string.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_227_min_of_three", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find minimum of three numbers.\n public static long minOfThree(long a, long b, long c) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_227_min_of_three", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minOfThree((10l), (20l), (0l)) == (0l));\n assert(minOfThree((19l), (15l), (18l)) == (15l));\n assert(minOfThree((-10l), (-20l), (-30l)) == (-30l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_227_min_of_three", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_227_min_of_three.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_228_all_Bits_Set_In_The_Given_Range", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether all the bits are unset in the given range or not.\n public static boolean allBitsSetInTheGivenRange(long n, long l, long r) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_228_all_Bits_Set_In_The_Given_Range", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(allBitsSetInTheGivenRange((4l), (1l), (2l)) == (true));\n assert(allBitsSetInTheGivenRange((17l), (2l), (4l)) == (true));\n assert(allBitsSetInTheGivenRange((39l), (4l), (6l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_228_all_Bits_Set_In_The_Given_Range", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_228_all_Bits_Set_In_The_Given_Range.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_229_re_arrange_array", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and an integer n, and re-arranges the first n elements of the given array array list so that all negative elements appear before positive ones, and where the relative order among negative and positive elements is preserved.\n public static ArrayList reArrangeArray(ArrayList arr, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_229_re_arrange_array", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(reArrangeArray((new ArrayList(Arrays.asList((long)-1l, (long)2l, (long)-3l, (long)4l, (long)5l, (long)6l, (long)-7l, (long)8l, (long)9l))), (9l)).equals((new ArrayList(Arrays.asList((long)-1l, (long)-3l, (long)-7l, (long)4l, (long)5l, (long)6l, (long)2l, (long)8l, (long)9l)))));\n assert(reArrangeArray((new ArrayList(Arrays.asList((long)12l, (long)-14l, (long)-26l, (long)13l, (long)15l))), (5l)).equals((new ArrayList(Arrays.asList((long)-14l, (long)-26l, (long)12l, (long)13l, (long)15l)))));\n assert(reArrangeArray((new ArrayList(Arrays.asList((long)10l, (long)24l, (long)36l, (long)-42l, (long)-39l, (long)-78l, (long)85l))), (7l)).equals((new ArrayList(Arrays.asList((long)-42l, (long)-39l, (long)-78l, (long)10l, (long)24l, (long)36l, (long)85l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_229_re_arrange_array", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_229_re_arrange_array.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_230_replace_blank", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in a string and character, replaces blank spaces in the string with the character, and returns the string.\n public static String replaceBlank(String str1, String char) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_230_replace_blank", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceBlank((\"hello people\"), (\"@\")).equals((\"hello@people\")));\n assert(replaceBlank((\"python program language\"), (\"$\")).equals((\"python$program$language\")));\n assert(replaceBlank((\"blank space\"), (\"-\")).equals((\"blank-space\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_230_replace_blank", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_230_replace_blank.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_234_volume_cube", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the volume of a cube given its side length.\n public static long volumeCube(long l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_234_volume_cube", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(volumeCube((3l)) == (27l));\n assert(volumeCube((2l)) == (8l));\n assert(volumeCube((5l)) == (125l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_234_volume_cube", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_234_volume_cube.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_237_check_occurences", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list of pairs and returns a hash map mapping each unique pair to the number of times it occurs in the array list.\n public static HashMap,Long> checkOccurences(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_237_check_occurences", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkOccurences((new ArrayList>(Arrays.asList((Pair)Pair.with(3l, 1l), (Pair)Pair.with(1l, 3l), (Pair)Pair.with(2l, 5l), (Pair)Pair.with(5l, 2l), (Pair)Pair.with(6l, 3l))))).equals((new HashMap,Long>(Map.of(Pair.with(1l, 3l), 2l, Pair.with(2l, 5l), 2l, Pair.with(3l, 6l), 1l)))));\n assert(checkOccurences((new ArrayList>(Arrays.asList((Pair)Pair.with(4l, 2l), (Pair)Pair.with(2l, 4l), (Pair)Pair.with(3l, 6l), (Pair)Pair.with(6l, 3l), (Pair)Pair.with(7l, 4l))))).equals((new HashMap,Long>(Map.of(Pair.with(2l, 4l), 2l, Pair.with(3l, 6l), 2l, Pair.with(4l, 7l), 1l)))));\n assert(checkOccurences((new ArrayList>(Arrays.asList((Pair)Pair.with(13l, 2l), (Pair)Pair.with(11l, 23l), (Pair)Pair.with(12l, 25l), (Pair)Pair.with(25l, 12l), (Pair)Pair.with(16l, 23l))))).equals((new HashMap,Long>(Map.of(Pair.with(2l, 13l), 1l, Pair.with(11l, 23l), 1l, Pair.with(12l, 25l), 2l, Pair.with(16l, 23l), 1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_237_check_occurences", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_237_check_occurences.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_238_number_of_substrings", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of non-empty substrings of a given string.\n public static long numberOfSubstrings(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_238_number_of_substrings", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(numberOfSubstrings((\"abc\")) == (6l));\n assert(numberOfSubstrings((\"abcd\")) == (10l));\n assert(numberOfSubstrings((\"abcde\")) == (15l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_238_number_of_substrings", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_238_number_of_substrings.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_239_get_total_number_of_sequences", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in positive integers m and n and finds the number of possible sequences of length n, such that each element is a positive integer and is greater than or equal to twice the previous element but less than or equal to m.\n public static long getTotalNumberOfSequences(long m, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_239_get_total_number_of_sequences", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getTotalNumberOfSequences((10l), (4l)) == (4l));\n assert(getTotalNumberOfSequences((5l), (2l)) == (6l));\n assert(getTotalNumberOfSequences((16l), (3l)) == (84l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_239_get_total_number_of_sequences", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_239_get_total_number_of_sequences.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_240_replace_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in two array lists and replaces the last element of the first array list with the elements of the second array list.\n public static ArrayList replaceList(ArrayList list1, ArrayList list2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_240_replace_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceList((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l, (long)8l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)9l, (long)2l, (long)4l, (long)6l, (long)8l)))));\n assert(replaceList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l)))));\n assert(replaceList((new ArrayList(Arrays.asList((String)\"red\", (String)\"blue\", (String)\"green\"))), (new ArrayList(Arrays.asList((String)\"yellow\")))).equals((new ArrayList(Arrays.asList((String)\"red\", (String)\"blue\", (String)\"yellow\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_240_replace_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_240_replace_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_242_count_charac", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the total number of characters in a string.\n public static long countCharac(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_242_count_charac", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countCharac((\"python programming\")) == (18l));\n assert(countCharac((\"language\")) == (8l));\n assert(countCharac((\"words\")) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_242_count_charac", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_242_count_charac.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_244_next_Perfect_Square", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the next perfect square greater than a given number.\n public static long nextPerfectSquare(long N) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_244_next_Perfect_Square", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(nextPerfectSquare((35l)) == (36l));\n assert(nextPerfectSquare((6l)) == (9l));\n assert(nextPerfectSquare((9l)) == (16l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_244_next_Perfect_Square", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_244_next_Perfect_Square.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_245_max_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes an array array list and finds the maximum sum of a bitonic subsequence for the given array array list, where a sequence is bitonic if it is first increasing and then decreasing.\n public static long maxSum(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_245_max_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSum((new ArrayList(Arrays.asList((long)1l, (long)15l, (long)51l, (long)45l, (long)33l, (long)100l, (long)12l, (long)18l, (long)9l)))) == (194l));\n assert(maxSum((new ArrayList(Arrays.asList((long)80l, (long)60l, (long)30l, (long)40l, (long)20l, (long)10l)))) == (210l));\n assert(maxSum((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)14l, (long)16l, (long)21l, (long)23l, (long)29l, (long)30l)))) == (138l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_245_max_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_245_max_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_247_lps", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the length of the longest palindromic subsequence in the given string.\n public static long lps(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_247_lps", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lps((\"TENS FOR TENS\")) == (5l));\n assert(lps((\"CARDIO FOR CARDS\")) == (7l));\n assert(lps((\"PART OF THE JOURNEY IS PART\")) == (9l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_247_lps", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_247_lps.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_249_intersection_array", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the intersection of two array array lists.\n public static ArrayList intersectionArray(ArrayList array_nums1, ArrayList array_nums2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_249_intersection_array", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(intersectionArray((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)8l, (long)9l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)8l, (long)9l)))));\n assert(intersectionArray((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)3l, (long)5l, (long)7l, (long)9l)))).equals((new ArrayList(Arrays.asList((long)3l, (long)5l, (long)7l, (long)9l)))));\n assert(intersectionArray((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l, (long)8l, (long)9l, (long)10l))), (new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l)))).equals((new ArrayList(Arrays.asList((long)10l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_249_intersection_array", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_249_intersection_array.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_250_count_X", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function that takes in a pair and an element and counts the occcurences of the element in the array list.\n public static long countX(ArrayList tup, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_250_count_X", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countX((new ArrayList(Arrays.asList((long)10l, (long)8l, (long)5l, (long)2l, (long)10l, (long)15l, (long)10l, (long)8l, (long)5l, (long)8l, (long)8l, (long)2l))), (4l)) == (0l));\n assert(countX((new ArrayList(Arrays.asList((long)10l, (long)8l, (long)5l, (long)2l, (long)10l, (long)15l, (long)10l, (long)8l, (long)5l, (long)8l, (long)8l, (long)2l))), (10l)) == (3l));\n assert(countX((new ArrayList(Arrays.asList((long)10l, (long)8l, (long)5l, (long)2l, (long)10l, (long)15l, (long)10l, (long)8l, (long)5l, (long)8l, (long)8l, (long)2l))), (8l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_250_count_X", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_250_count_X.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_251_insert_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and an element and inserts the element before each element in the array list, and returns the resulting array list.\n public static ArrayList insertElement(ArrayList list, String element) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_251_insert_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(insertElement((new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Black\"))), (\"c\")).equals((new ArrayList(Arrays.asList((String)\"c\", (String)\"Red\", (String)\"c\", (String)\"Green\", (String)\"c\", (String)\"Black\")))));\n assert(insertElement((new ArrayList(Arrays.asList((String)\"python\", (String)\"java\"))), (\"program\")).equals((new ArrayList(Arrays.asList((String)\"program\", (String)\"python\", (String)\"program\", (String)\"java\")))));\n assert(insertElement((new ArrayList(Arrays.asList((String)\"happy\", (String)\"sad\"))), (\"laugh\")).equals((new ArrayList(Arrays.asList((String)\"laugh\", (String)\"happy\", (String)\"laugh\", (String)\"sad\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_251_insert_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_251_insert_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_252_convert", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to convert complex numbers to polar coordinates.\n public static Pair convert(long numbers) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_252_convert", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(convert((1l)).equals((Pair.with(1.0f, 0.0f))));\n assert(convert((4l)).equals((Pair.with(4.0f, 0.0f))));\n assert(convert((5l)).equals((Pair.with(5.0f, 0.0f))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_252_convert", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_252_convert.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_255_combinations_colors", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and length n, and generates all combinations (with repetition) of the elements of the array list and returns an array array list with an array array list for each combination.\n public static ArrayList> combinationsColors(ArrayList l, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_255_combinations_colors", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(combinationsColors((new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Blue\"))), (1l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"Red\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Blue\")))))));\n assert(combinationsColors((new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Blue\"))), (2l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Red\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\", (String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Blue\", (String)\"Blue\")))))));\n assert(combinationsColors((new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Blue\"))), (3l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Red\", (String)\"Red\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Red\", (String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Red\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Red\", (String)\"Blue\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\", (String)\"Green\", (String)\"Green\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\", (String)\"Green\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Green\", (String)\"Blue\", (String)\"Blue\")), (ArrayList)new ArrayList(Arrays.asList((String)\"Blue\", (String)\"Blue\", (String)\"Blue\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_255_combinations_colors", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_255_combinations_colors.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_256_count_Primes_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function that takes in a non-negative number and returns the number of prime numbers less than the given non-negative number.\n public static long countPrimesNums(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_256_count_Primes_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countPrimesNums((5l)) == (2l));\n assert(countPrimesNums((10l)) == (4l));\n assert(countPrimesNums((100l)) == (25l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_256_count_Primes_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_256_count_Primes_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_257_swap_numbers", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in two numbers and returns an array array list with the second number and then the first number.\n public static ArrayList swapNumbers(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_257_swap_numbers", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(swapNumbers((10l), (20l)).equals((new ArrayList(Arrays.asList((long)20l, (long)10l)))));\n assert(swapNumbers((15l), (17l)).equals((new ArrayList(Arrays.asList((long)17l, (long)15l)))));\n assert(swapNumbers((100l), (200l)).equals((new ArrayList(Arrays.asList((long)200l, (long)100l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_257_swap_numbers", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_257_swap_numbers.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_259_maximize_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to maximize the given two array lists.\n public static ArrayList> maximizeElements(ArrayList> test_tup1, ArrayList> test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_259_maximize_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maximizeElements((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)10l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)3l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)10l)))))));\n assert(maximizeElements((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)11l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)4l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)11l)))))));\n assert(maximizeElements((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)12l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)12l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_259_maximize_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_259_maximize_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_260_newman_prime", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth newman–shanks–williams prime number.\n public static long newmanPrime(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_260_newman_prime", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(newmanPrime((3l)) == (7l));\n assert(newmanPrime((4l)) == (17l));\n assert(newmanPrime((5l)) == (41l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_260_newman_prime", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_260_newman_prime.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_261_division_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in two pairs and performs mathematical division operation element-wise across the given pairs.\n public static Pair divisionElements(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_261_division_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(divisionElements((Pair.with(10l, 4l, 6l, 9l)), (Pair.with(5l, 2l, 3l, 3l))).equals((Pair.with(2l, 2l, 2l, 3l))));\n assert(divisionElements((Pair.with(12l, 6l, 8l, 16l)), (Pair.with(6l, 3l, 4l, 4l))).equals((Pair.with(2l, 2l, 2l, 4l))));\n assert(divisionElements((Pair.with(20l, 14l, 36l, 18l)), (Pair.with(5l, 7l, 6l, 9l))).equals((Pair.with(4l, 2l, 6l, 2l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_261_division_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_261_division_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_262_split_two_parts", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and an integer L and splits the given array list into two parts where the length of the first part of the array list is L, and returns the resulting array lists in a pair.\n public static Object splitTwoParts(ArrayList list1, long L) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_262_split_two_parts", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(splitTwoParts((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)3l, (long)4l, (long)4l, (long)5l, (long)1l))), (3l)).equals(Pair.with(new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l)), new ArrayList(Arrays.asList((long)3l, (long)4l, (long)4l, (long)5l, (long)1l)))));\n assert(splitTwoParts((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\"))), (2l)).equals(Pair.with(new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")), new ArrayList(Arrays.asList((String)\"c\", (String)\"d\")))));\n assert(splitTwoParts((new ArrayList(Arrays.asList((String)\"p\", (String)\"y\", (String)\"t\", (String)\"h\", (String)\"o\", (String)\"n\"))), (4l)).equals(Pair.with(new ArrayList(Arrays.asList((String)\"p\", (String)\"y\", (String)\"t\", (String)\"h\")), new ArrayList(Arrays.asList((String)\"o\", (String)\"n\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_262_split_two_parts", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_262_split_two_parts.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_264_dog_age", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate a dog's age in dog's years.\n public static long dogAge(long h_age) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_264_dog_age", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(dogAge((12l)) == (61l));\n assert(dogAge((15l)) == (73l));\n assert(dogAge((24l)) == (109l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_264_dog_age", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_264_dog_age.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_265_list_split", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and an integer n and splits an array array list for every nth element, returning an array array list of the resulting array lists.\n public static ArrayList> listSplit(ArrayList S, long step) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_265_list_split", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(listSplit((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\", (String)\"e\", (String)\"f\", (String)\"g\", (String)\"h\", (String)\"i\", (String)\"j\", (String)\"k\", (String)\"l\", (String)\"m\", (String)\"n\"))), (3l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"d\", (String)\"g\", (String)\"j\", (String)\"m\")), (ArrayList)new ArrayList(Arrays.asList((String)\"b\", (String)\"e\", (String)\"h\", (String)\"k\", (String)\"n\")), (ArrayList)new ArrayList(Arrays.asList((String)\"c\", (String)\"f\", (String)\"i\", (String)\"l\")))))));\n assert(listSplit((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l, (long)11l, (long)12l, (long)13l, (long)14l))), (3l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)4l, (long)7l, (long)10l, (long)13l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)5l, (long)8l, (long)11l, (long)14l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)6l, (long)9l, (long)12l)))))));\n assert(listSplit((new ArrayList(Arrays.asList((String)\"python\", (String)\"java\", (String)\"C\", (String)\"C++\", (String)\"DBMS\", (String)\"SQL\"))), (2l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"python\", (String)\"C\", (String)\"DBMS\")), (ArrayList)new ArrayList(Arrays.asList((String)\"java\", (String)\"C++\", (String)\"SQL\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_265_list_split", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_265_list_split.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_266_lateralsurface_cube", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the lateral surface area of a cube given its side length.\n public static long lateralsurfaceCube(long l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_266_lateralsurface_cube", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lateralsurfaceCube((5l)) == (100l));\n assert(lateralsurfaceCube((9l)) == (324l));\n assert(lateralsurfaceCube((10l)) == (400l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_266_lateralsurface_cube", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_266_lateralsurface_cube.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_267_square_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function that takes in an integer n and returns the sum of the squares of the first n odd natural numbers.\n public static long squareSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_267_square_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(squareSum((2l)) == (10l));\n assert(squareSum((3l)) == (35l));\n assert(squareSum((4l)) == (84l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_267_square_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_267_square_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_268_find_star_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the n'th star number.\n public static long findStarNum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_268_find_star_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findStarNum((3l)) == (37l));\n assert(findStarNum((4l)) == (73l));\n assert(findStarNum((5l)) == (121l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_268_find_star_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_268_find_star_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_269_ascii_value", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the ascii value of a character.\n public static long asciiValue(String k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_269_ascii_value", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(asciiValue((\"A\")) == (65l));\n assert(asciiValue((\"R\")) == (82l));\n assert(asciiValue((\"S\")) == (83l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_269_ascii_value", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_269_ascii_value.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_270_sum_even_and_even_index", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of even numbers at even positions of an array array list.\n public static long sumEvenAndEvenIndex(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_270_sum_even_and_even_index", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumEvenAndEvenIndex((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)12l, (long)1l, (long)18l, (long)8l)))) == (30l));\n assert(sumEvenAndEvenIndex((new ArrayList(Arrays.asList((long)3l, (long)20l, (long)17l, (long)9l, (long)2l, (long)10l, (long)18l, (long)13l, (long)6l, (long)18l)))) == (26l));\n assert(sumEvenAndEvenIndex((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)12l, (long)1l)))) == (12l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_270_sum_even_and_even_index", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_270_sum_even_and_even_index.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_271_even_Power_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function that takes in an integer n and finds the sum of the first n even natural numbers that are raised to the fifth power.\n public static long evenPowerSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_271_even_Power_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(evenPowerSum((2l)) == (1056l));\n assert(evenPowerSum((3l)) == (8832l));\n assert(evenPowerSum((1l)) == (32l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_271_even_Power_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_271_even_Power_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_272_rear_extract", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list of pairs and returns an array array list containing the rear element of each pair.\n public static ArrayList rearExtract(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_272_rear_extract", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rearExtract((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, \"Rash\", 21l), (Pair)Pair.with(2l, \"Varsha\", 20l), (Pair)Pair.with(3l, \"Kil\", 19l))))).equals((new ArrayList(Arrays.asList((long)21l, (long)20l, (long)19l)))));\n assert(rearExtract((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, \"Sai\", 36l), (Pair)Pair.with(2l, \"Ayesha\", 25l), (Pair)Pair.with(3l, \"Salman\", 45l))))).equals((new ArrayList(Arrays.asList((long)36l, (long)25l, (long)45l)))));\n assert(rearExtract((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, \"Sudeep\", 14l), (Pair)Pair.with(2l, \"Vandana\", 36l), (Pair)Pair.with(3l, \"Dawood\", 56l))))).equals((new ArrayList(Arrays.asList((long)14l, (long)36l, (long)56l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_272_rear_extract", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_272_rear_extract.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_273_substract_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in two pairs and subtracts the elements of the first pair by the elements of the second pair with the same index.\n public static Pair substractElements(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_273_substract_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(substractElements((Pair.with(10l, 4l, 5l)), (Pair.with(2l, 5l, 18l))).equals((Pair.with(8l, -1l, -13l))));\n assert(substractElements((Pair.with(11l, 2l, 3l)), (Pair.with(24l, 45l, 16l))).equals((Pair.with(-13l, -43l, -13l))));\n assert(substractElements((Pair.with(7l, 18l, 9l)), (Pair.with(10l, 11l, 12l))).equals((Pair.with(-3l, 7l, -3l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_273_substract_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_273_substract_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_274_even_binomial_Coeff_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function that takes in a positive integer n and finds the sum of even index binomial coefficients.\n public static long evenBinomialCoeffSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_274_even_binomial_Coeff_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(evenBinomialCoeffSum((4l)) == (8l));\n assert(evenBinomialCoeffSum((6l)) == (32l));\n assert(evenBinomialCoeffSum((2l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_274_even_binomial_Coeff_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_274_even_binomial_Coeff_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_277_dict_filter", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in a hash map and integer n and filters the hash map to only include entries with values greater than or equal to n.\n public static HashMap dictFilter(HashMap dict, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_277_dict_filter", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(dictFilter((new HashMap(Map.of(\"Cierra Vega\", 175l, \"Alden Cantrell\", 180l, \"Kierra Gentry\", 165l, \"Pierre Cox\", 190l))), (170l)).equals((new HashMap(Map.of(\"Cierra Vega\", 175l, \"Alden Cantrell\", 180l, \"Pierre Cox\", 190l)))));\n assert(dictFilter((new HashMap(Map.of(\"Cierra Vega\", 175l, \"Alden Cantrell\", 180l, \"Kierra Gentry\", 165l, \"Pierre Cox\", 190l))), (180l)).equals((new HashMap(Map.of(\"Alden Cantrell\", 180l, \"Pierre Cox\", 190l)))));\n assert(dictFilter((new HashMap(Map.of(\"Cierra Vega\", 175l, \"Alden Cantrell\", 180l, \"Kierra Gentry\", 165l, \"Pierre Cox\", 190l))), (190l)).equals((new HashMap(Map.of(\"Pierre Cox\", 190l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_277_dict_filter", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_277_dict_filter.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_279_is_num_decagonal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth decagonal number.\n public static long isNumDecagonal(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_279_is_num_decagonal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isNumDecagonal((3l)) == (27l));\n assert(isNumDecagonal((7l)) == (175l));\n assert(isNumDecagonal((10l)) == (370l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_279_is_num_decagonal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_279_is_num_decagonal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_280_sequential_search", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and element and returns a pair containing a boolean that indicates if the element is in the array array list and the index position of the element (or -1 if the element is not found).\n public static Pair sequentialSearch(ArrayList dlist, long item) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_280_sequential_search", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sequentialSearch((new ArrayList(Arrays.asList((long)11l, (long)23l, (long)58l, (long)31l, (long)56l, (long)77l, (long)43l, (long)12l, (long)65l, (long)19l))), (31l)).equals((Pair.with(true, 3l))));\n assert(sequentialSearch((new ArrayList(Arrays.asList((long)12l, (long)32l, (long)45l, (long)62l, (long)35l, (long)47l, (long)44l, (long)61l))), (61l)).equals((Pair.with(true, 7l))));\n assert(sequentialSearch((new ArrayList(Arrays.asList((long)9l, (long)10l, (long)17l, (long)19l, (long)22l, (long)39l, (long)48l, (long)56l))), (48l)).equals((Pair.with(true, 6l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_280_sequential_search", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_280_sequential_search.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_281_all_unique", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check if the elements of a given array list are unique or not.\n public static boolean allUnique(ArrayList test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_281_all_unique", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(allUnique((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (true));\n assert(allUnique((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l, (long)2l)))) == (false));\n assert(allUnique((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_281_all_unique", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_281_all_unique.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_282_sub_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to subtract two array lists element-wise.\n public static ArrayList subList(ArrayList nums1, ArrayList nums2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_282_sub_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(subList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)-3l, (long)-3l, (long)-3l)))));\n assert(subList((new ArrayList(Arrays.asList((long)1l, (long)2l))), (new ArrayList(Arrays.asList((long)3l, (long)4l)))).equals((new ArrayList(Arrays.asList((long)-2l, (long)-2l)))));\n assert(subList((new ArrayList(Arrays.asList((long)90l, (long)120l))), (new ArrayList(Arrays.asList((long)50l, (long)70l)))).equals((new ArrayList(Arrays.asList((long)40l, (long)50l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_282_sub_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_282_sub_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_283_validate", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function takes in an integer and check whether the frequency of each digit in the integer is less than or equal to the digit itself.\n public static boolean validate(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_283_validate", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(validate((1234l)) == (true));\n assert(validate((51241l)) == (false));\n assert(validate((321l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_283_validate", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_283_validate.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_284_check_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes in an array array list and element and checks whether all items in the array list are equal to the given element.\n public static boolean checkElement(ArrayList list, Object element) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_284_check_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkElement((new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\", (String)\"black\", (String)\"white\"))), (Object(\"blue\"))) == (false));\n assert(checkElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l))), (Object(7l))) == (false));\n assert(checkElement((new ArrayList(Arrays.asList((String)\"green\", (String)\"green\", (String)\"green\", (String)\"green\"))), (Object(\"green\"))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_284_check_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_284_check_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_285_text_match_two_three", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that checks whether a string contains the 'a' character followed by two or three 'b' characters.\n public static boolean textMatchTwoThree(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_285_text_match_two_three", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchTwoThree((\"ac\")) == (false));\n assert(textMatchTwoThree((\"dc\")) == (false));\n assert(textMatchTwoThree((\"abbbba\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_285_text_match_two_three", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_285_text_match_two_three.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_286_max_sub_array_sum_repeated", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the largest sum of a contiguous array array list in the modified array array list which is formed by repeating the given array array list k times.\n public static long maxSubArraySumRepeated(ArrayList a, long n, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_286_max_sub_array_sum_repeated", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSubArraySumRepeated((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)-30l, (long)-1l))), (4l), (3l)) == (30l));\n assert(maxSubArraySumRepeated((new ArrayList(Arrays.asList((long)-1l, (long)10l, (long)20l))), (3l), (2l)) == (59l));\n assert(maxSubArraySumRepeated((new ArrayList(Arrays.asList((long)-1l, (long)-2l, (long)-3l))), (3l), (3l)) == (-1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_286_max_sub_array_sum_repeated", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_286_max_sub_array_sum_repeated.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_287_square_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function takes in an integer n and returns the sum of squares of first n even natural numbers.\n public static long squareSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_287_square_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(squareSum((2l)) == (20l));\n assert(squareSum((3l)) == (56l));\n assert(squareSum((4l)) == (120l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_287_square_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_287_square_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_290_max_length", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the array list of maximum length in an array array list of array lists.\n public static Pair> maxLength(ArrayList> list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_290_max_length", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)13l, (long)15l, (long)17l)))))).equals((Pair.with(3l, new ArrayList(Arrays.asList((long)13l, (long)15l, (long)17l))))));\n assert(maxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)12l, (long)14l, (long)15l)))))).equals((Pair.with(4l, new ArrayList(Arrays.asList((long)10l, (long)12l, (long)14l, (long)15l))))));\n assert(maxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)15l, (long)20l, (long)25l)))))).equals((Pair.with(3l, new ArrayList(Arrays.asList((long)15l, (long)20l, (long)25l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_290_max_length", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_290_max_length.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_291_count_no_of_ways", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find out the number of ways of painting the fence such that at most 2 adjacent posts have the same color for the given fence with n posts and k colors.\n public static long countNoOfWays(long n, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_291_count_no_of_ways", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countNoOfWays((2l), (4l)) == (16l));\n assert(countNoOfWays((3l), (2l)) == (6l));\n assert(countNoOfWays((4l), (4l)) == (228l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_291_count_no_of_ways", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_291_count_no_of_ways.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_292_find", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find quotient of two numbers (rounded down to the nearest integer).\n public static long find(long n, long m) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_292_find", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(find((10l), (3l)) == (3l));\n assert(find((4l), (2l)) == (2l));\n assert(find((20l), (5l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_292_find", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_292_find.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_293_otherside_rightangle", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the third side of a right angled triangle.\n public static float othersideRightangle(long w, long h) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_293_otherside_rightangle", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(othersideRightangle((7l), (8l)) == (10.63014581273465f));\n assert(othersideRightangle((3l), (4l)) == (float)5l);\n assert(othersideRightangle((7l), (15l)) == (16.55294535724685f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_293_otherside_rightangle", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_293_otherside_rightangle.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_295_sum_div", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to return the sum of all divisors of a number.\n public static long sumDiv(long number) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_295_sum_div", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumDiv((8l)) == (7l));\n assert(sumDiv((12l)) == (16l));\n assert(sumDiv((7l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_295_sum_div", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_295_sum_div.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_296_get_Inv_Count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count inversions in an array array list.\n public static long getInvCount(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_296_get_Inv_Count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getInvCount((new ArrayList(Arrays.asList((long)1l, (long)20l, (long)6l, (long)4l, (long)5l)))) == (5l));\n assert(getInvCount((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l)))) == (1l));\n assert(getInvCount((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)5l, (long)6l, (long)1l)))) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_296_get_Inv_Count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_296_get_Inv_Count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_299_max_aggregate", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the maximum aggregate from the array list of pairs.\n public static Pair maxAggregate(ArrayList> stdata) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_299_max_aggregate", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxAggregate((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Juan Whelan\", 90l), (Pair)Pair.with(\"Sabah Colley\", 88l), (Pair)Pair.with(\"Peter Nichols\", 7l), (Pair)Pair.with(\"Juan Whelan\", 122l), (Pair)Pair.with(\"Sabah Colley\", 84l))))).equals((Pair.with(\"Juan Whelan\", 212l))));\n assert(maxAggregate((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Juan Whelan\", 50l), (Pair)Pair.with(\"Sabah Colley\", 48l), (Pair)Pair.with(\"Peter Nichols\", 37l), (Pair)Pair.with(\"Juan Whelan\", 22l), (Pair)Pair.with(\"Sabah Colley\", 14l))))).equals((Pair.with(\"Juan Whelan\", 72l))));\n assert(maxAggregate((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Juan Whelan\", 10l), (Pair)Pair.with(\"Sabah Colley\", 20l), (Pair)Pair.with(\"Peter Nichols\", 30l), (Pair)Pair.with(\"Juan Whelan\", 40l), (Pair)Pair.with(\"Sabah Colley\", 50l))))).equals((Pair.with(\"Sabah Colley\", 70l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_299_max_aggregate", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_299_max_aggregate.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_304_find_Element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find element at a given index after number of rotations.\n public static long findElement(ArrayList arr, ArrayList> ranges, long rotations, long index) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_304_find_Element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)0l, (long)3l))))), (2l), (1l)) == (3l));\n assert(findElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)0l, (long)2l))))), (1l), (2l)) == (3l));\n assert(findElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)0l, (long)2l))))), (1l), (1l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_304_find_Element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_304_find_Element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_305_start_withp", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to return two words from an array array list of words starting with letter 'p'.\n public static Pair startWithp(ArrayList words) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_305_start_withp", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(startWithp((new ArrayList(Arrays.asList((String)\"Python PHP\", (String)\"Java JavaScript\", (String)\"c c++\")))).equals((Pair.with(\"Python\", \"PHP\"))));\n assert(startWithp((new ArrayList(Arrays.asList((String)\"Python Programming\", (String)\"Java Programming\")))).equals((Pair.with(\"Python\", \"Programming\"))));\n assert(startWithp((new ArrayList(Arrays.asList((String)\"Pqrst Pqr\", (String)\"qrstuv\")))).equals((Pair.with(\"Pqrst\", \"Pqr\"))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_305_start_withp", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_305_start_withp.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_306_max_sum_increasing_subseq", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum sum of increasing subsequence from prefix until ith index and also including a given kth element which is after i, i.e., k > i .\n public static long maxSumIncreasingSubseq(ArrayList a, long n, long index, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_306_max_sum_increasing_subseq", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSumIncreasingSubseq((new ArrayList(Arrays.asList((long)1l, (long)101l, (long)2l, (long)3l, (long)100l, (long)4l, (long)5l))), (7l), (4l), (6l)) == (11l));\n assert(maxSumIncreasingSubseq((new ArrayList(Arrays.asList((long)1l, (long)101l, (long)2l, (long)3l, (long)100l, (long)4l, (long)5l))), (7l), (2l), (5l)) == (7l));\n assert(maxSumIncreasingSubseq((new ArrayList(Arrays.asList((long)11l, (long)15l, (long)19l, (long)21l, (long)26l, (long)28l, (long)31l))), (7l), (2l), (4l)) == (71l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_306_max_sum_increasing_subseq", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_306_max_sum_increasing_subseq.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_308_large_product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the specified number of largest products from two given array lists, selecting one factor from each array list.\n public static ArrayList largeProduct(ArrayList nums1, ArrayList nums2, long N) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_308_large_product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(largeProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)3l, (long)6l, (long)8l, (long)9l, (long)10l, (long)6l))), (3l)).equals((new ArrayList(Arrays.asList((long)60l, (long)54l, (long)50l)))));\n assert(largeProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)3l, (long)6l, (long)8l, (long)9l, (long)10l, (long)6l))), (4l)).equals((new ArrayList(Arrays.asList((long)60l, (long)54l, (long)50l, (long)48l)))));\n assert(largeProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)3l, (long)6l, (long)8l, (long)9l, (long)10l, (long)6l))), (5l)).equals((new ArrayList(Arrays.asList((long)60l, (long)54l, (long)50l, (long)48l, (long)45l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_308_large_product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_308_large_product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_309_maximum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the maximum of two numbers.\n public static long maximum(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_309_maximum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maximum((5l), (10l)) == (10l));\n assert(maximum((-1l), (-2l)) == (-1l));\n assert(maximum((9l), (7l)) == (9l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_309_maximum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_309_maximum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_310_string_to_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert a given string to an array array list of characters.\n public static ArrayList stringToTuple(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_310_string_to_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(stringToTuple((\"python 3.0\")).equals((new ArrayList(Arrays.asList((String)\"p\", (String)\"y\", (String)\"t\", (String)\"h\", (String)\"o\", (String)\"n\", (String)\"3\", (String)\".\", (String)\"0\")))));\n assert(stringToTuple((\"item1\")).equals((new ArrayList(Arrays.asList((String)\"i\", (String)\"t\", (String)\"e\", (String)\"m\", (String)\"1\")))));\n assert(stringToTuple((\"15.10\")).equals((new ArrayList(Arrays.asList((String)\"1\", (String)\"5\", (String)\".\", (String)\"1\", (String)\"0\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_310_string_to_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_310_string_to_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_388_highest_Power_of_2", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the highest power of 2 that is less than or equal to n.\n public static long highestPowerOf2(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_388_highest_Power_of_2", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(highestPowerOf2((10l)) == (8l));\n assert(highestPowerOf2((19l)) == (16l));\n assert(highestPowerOf2((32l)) == (32l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_388_highest_Power_of_2", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_388_highest_Power_of_2.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_389_find_lucas", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the n'th lucas number.\n public static long findLucas(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_389_find_lucas", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findLucas((9l)) == (76l));\n assert(findLucas((4l)) == (7l));\n assert(findLucas((3l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_389_find_lucas", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_389_find_lucas.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_390_add_string", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to apply a given format string to all of the elements in an array array list.\n public static ArrayList addString(ArrayList list_, String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_390_add_string", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addString((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l))), (\"temp{0}\")).equals((new ArrayList(Arrays.asList((String)\"temp1\", (String)\"temp2\", (String)\"temp3\", (String)\"temp4\")))));\n assert(addString((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\"))), (\"python{0}\")).equals((new ArrayList(Arrays.asList((String)\"pythona\", (String)\"pythonb\", (String)\"pythonc\", (String)\"pythond\")))));\n assert(addString((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l))), (\"string{0}\")).equals((new ArrayList(Arrays.asList((String)\"string5\", (String)\"string6\", (String)\"string7\", (String)\"string8\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_390_add_string", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_390_add_string.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_391_convert_list_dictionary", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert more than one array list to nested hash map.\n public static ArrayList>> convertListDictionary(ArrayList l1, ArrayList l2, ArrayList l3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_391_convert_list_dictionary", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(convertListDictionary((new ArrayList(Arrays.asList((String)\"S001\", (String)\"S002\", (String)\"S003\", (String)\"S004\"))), (new ArrayList(Arrays.asList((String)\"Adina Park\", (String)\"Leyton Marsh\", (String)\"Duncan Boyle\", (String)\"Saim Richards\"))), (new ArrayList(Arrays.asList((long)85l, (long)98l, (long)89l, (long)92l)))).equals((new ArrayList>>(Arrays.asList((HashMap>)new HashMap>(Map.of(\"S001\", new HashMap(Map.of(\"Adina Park\", 85l)))), (HashMap>)new HashMap>(Map.of(\"S002\", new HashMap(Map.of(\"Leyton Marsh\", 98l)))), (HashMap>)new HashMap>(Map.of(\"S003\", new HashMap(Map.of(\"Duncan Boyle\", 89l)))), (HashMap>)new HashMap>(Map.of(\"S004\", new HashMap(Map.of(\"Saim Richards\", 92l)))))))));\n assert(convertListDictionary((new ArrayList(Arrays.asList((String)\"abc\", (String)\"def\", (String)\"ghi\", (String)\"jkl\"))), (new ArrayList(Arrays.asList((String)\"python\", (String)\"program\", (String)\"language\", (String)\"programs\"))), (new ArrayList(Arrays.asList((long)100l, (long)200l, (long)300l, (long)400l)))).equals((new ArrayList>>(Arrays.asList((HashMap>)new HashMap>(Map.of(\"abc\", new HashMap(Map.of(\"python\", 100l)))), (HashMap>)new HashMap>(Map.of(\"def\", new HashMap(Map.of(\"program\", 200l)))), (HashMap>)new HashMap>(Map.of(\"ghi\", new HashMap(Map.of(\"language\", 300l)))), (HashMap>)new HashMap>(Map.of(\"jkl\", new HashMap(Map.of(\"programs\", 400l)))))))));\n assert(convertListDictionary((new ArrayList(Arrays.asList((String)\"A1\", (String)\"A2\", (String)\"A3\", (String)\"A4\"))), (new ArrayList(Arrays.asList((String)\"java\", (String)\"C\", (String)\"C++\", (String)\"DBMS\"))), (new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l)))).equals((new ArrayList>>(Arrays.asList((HashMap>)new HashMap>(Map.of(\"A1\", new HashMap(Map.of(\"java\", 10l)))), (HashMap>)new HashMap>(Map.of(\"A2\", new HashMap(Map.of(\"C\", 20l)))), (HashMap>)new HashMap>(Map.of(\"A3\", new HashMap(Map.of(\"C++\", 30l)))), (HashMap>)new HashMap>(Map.of(\"A4\", new HashMap(Map.of(\"DBMS\", 40l)))))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_391_convert_list_dictionary", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_391_convert_list_dictionary.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_392_get_max_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum sum possible by using the given equation f(n) = max( (f(n/2) + f(n/3) + f(n/4) + f(n/5)), n).\n public static long getMaxSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_392_get_max_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getMaxSum((60l)) == (106l));\n assert(getMaxSum((10l)) == (12l));\n assert(getMaxSum((2l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_392_get_max_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_392_get_max_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_393_max_length_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the array list with maximum length.\n public static Pair> maxLengthList(ArrayList> input_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_393_max_length_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxLengthList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)13l, (long)15l, (long)17l)))))).equals((Pair.with(3l, new ArrayList(Arrays.asList((long)13l, (long)15l, (long)17l))))));\n assert(maxLengthList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l)))))).equals((Pair.with(5l, new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))))));\n assert(maxLengthList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)11l, (long)12l)))))).equals((Pair.with(4l, new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_393_max_length_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_393_max_length_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_394_check_distinct", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if given array list contains no duplicates.\n public static boolean checkDistinct(ArrayList test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_394_check_distinct", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkDistinct((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)5l, (long)6l, (long)1l, (long)4l)))) == (false));\n assert(checkDistinct((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)5l, (long)6l)))) == (true));\n assert(checkDistinct((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)5l, (long)6l)))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_394_check_distinct", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_394_check_distinct.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_395_first_non_repeating_character", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the first non-repeated character in a given string.\n public static Optional firstNonRepeatingCharacter(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_395_first_non_repeating_character", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(firstNonRepeatingCharacter((\"abcabc\")).equals(Optional.empty()));\n assert(firstNonRepeatingCharacter((\"abc\")).equals(Optional.of(\"a\")));\n assert(firstNonRepeatingCharacter((\"ababc\")).equals(Optional.of(\"c\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_395_first_non_repeating_character", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_395_first_non_repeating_character.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_396_check_char", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given string starts and ends with the same character or not.\n public static String checkChar(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_396_check_char", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkChar((\"abba\")).equals((\"Valid\")));\n assert(checkChar((\"a\")).equals((\"Valid\")));\n assert(checkChar((\"abcd\")).equals((\"Invalid\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_396_check_char", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_396_check_char.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_397_median_numbers", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the median of three numbers.\n public static float medianNumbers(long a, long b, long c) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_397_median_numbers", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(medianNumbers((25l), (55l), (65l)) == (55.0f));\n assert(medianNumbers((20l), (10l), (30l)) == (20.0f));\n assert(medianNumbers((15l), (45l), (75l)) == (45.0f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_397_median_numbers", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_397_median_numbers.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_398_sum_of_digits", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to compute the sum of digits of each number of a given array list.\n public static long sumOfDigits(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_398_sum_of_digits", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumOfDigits((new ArrayList(Arrays.asList((long)10l, (long)2l, (long)56l)))) == (14l));\n assert(sumOfDigits((new ArrayList(Arrays.asList((ArrayList)new ArrayList(Arrays.asList(10l, 20l, 4l, 5l, \"b\", 70l, \"a\")))))) == (19l));\n assert(sumOfDigits((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)-4l, (long)5l, (long)-70l)))) == (19l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_398_sum_of_digits", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_398_sum_of_digits.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_399_bitwise_xor", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to perform the mathematical bitwise xor operation across the given pairs.\n public static Pair bitwiseXor(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_399_bitwise_xor", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(bitwiseXor((Pair.with(10l, 4l, 6l, 9l)), (Pair.with(5l, 2l, 3l, 3l))).equals((Pair.with(15l, 6l, 5l, 10l))));\n assert(bitwiseXor((Pair.with(11l, 5l, 7l, 10l)), (Pair.with(6l, 3l, 4l, 4l))).equals((Pair.with(13l, 6l, 3l, 14l))));\n assert(bitwiseXor((Pair.with(12l, 6l, 8l, 11l)), (Pair.with(7l, 4l, 5l, 6l))).equals((Pair.with(11l, 2l, 13l, 13l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_399_bitwise_xor", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_399_bitwise_xor.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_400_extract_freq", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract the number of unique pairs in the given array list.\n public static long extractFreq(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_400_extract_freq", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractFreq((new ArrayList>(Arrays.asList((Pair)Pair.with(3l, 4l), (Pair)Pair.with(1l, 2l), (Pair)Pair.with(4l, 3l), (Pair)Pair.with(5l, 6l))))) == (3l));\n assert(extractFreq((new ArrayList>(Arrays.asList((Pair)Pair.with(4l, 15l), (Pair)Pair.with(2l, 3l), (Pair)Pair.with(5l, 4l), (Pair)Pair.with(6l, 7l))))) == (4l));\n assert(extractFreq((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 16l), (Pair)Pair.with(2l, 3l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(6l, 9l))))) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_400_extract_freq", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_400_extract_freq.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_401_add_nested_tuples", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to perform index wise addition of array list elements in the given two nested array lists.\n public static ArrayList> addNestedTuples(ArrayList> test_tup1, ArrayList> test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_401_add_nested_tuples", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addNestedTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)10l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)3l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)14l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)13l)))))));\n assert(addNestedTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)11l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)4l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)9l, (long)12l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)16l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)12l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)15l)))))));\n assert(addNestedTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)12l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)11l, (long)14l)), (ArrayList)new ArrayList(Arrays.asList((long)11l, (long)18l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)14l)), (ArrayList)new ArrayList(Arrays.asList((long)12l, (long)17l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_401_add_nested_tuples", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_401_add_nested_tuples.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_404_minimum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the minimum of two numbers.\n public static long minimum(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_404_minimum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minimum((1l), (2l)) == (1l));\n assert(minimum((-5l), (-4l)) == (-5l));\n assert(minimum((0l), (0l)) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_404_minimum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_404_minimum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_406_find_Parity", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find whether the parity of a given number is odd.\n public static boolean findParity(long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_406_find_Parity", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findParity((12l)) == (false));\n assert(findParity((7l)) == (true));\n assert(findParity((10l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_406_find_Parity", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_406_find_Parity.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_407_rearrange_bigger", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to create the next bigger number by rearranging the digits of a given number.\n public static Object rearrangeBigger(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_407_rearrange_bigger", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rearrangeBigger((12l)).equals((Object(21l))));\n assert(rearrangeBigger((10l)).equals((Object(false))));\n assert(rearrangeBigger((102l)).equals((Object(120l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_407_rearrange_bigger", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_407_rearrange_bigger.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_408_k_smallest_pairs", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find k number of smallest pairs which consist of one element from the first array array list and one element from the second array array list.\n public static ArrayList> kSmallestPairs(ArrayList nums1, ArrayList nums2, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_408_k_smallest_pairs", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(kSmallestPairs((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)7l))), (new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l))), (2l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)4l)))))));\n assert(kSmallestPairs((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)7l))), (new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l))), (1l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)))))));\n assert(kSmallestPairs((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)7l))), (new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l))), (7l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)2l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_408_k_smallest_pairs", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_408_k_smallest_pairs.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_409_min_product_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the minimum product from the pairs of pairs within a given array list.\n public static long minProductTuple(ArrayList> list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_409_min_product_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(2l, 7l), (Pair)Pair.with(2l, 6l), (Pair)Pair.with(1l, 8l), (Pair)Pair.with(4l, 9l))))) == (8l));\n assert(minProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(10l, 20l), (Pair)Pair.with(15l, 2l), (Pair)Pair.with(5l, 10l))))) == (30l));\n assert(minProductTuple((new ArrayList>(Arrays.asList((Pair)Pair.with(11l, 44l), (Pair)Pair.with(10l, 15l), (Pair)Pair.with(20l, 5l), (Pair)Pair.with(12l, 9l))))) == (100l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_409_min_product_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_409_min_product_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_411_snake_to_camel", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert the given snake case string to camel case string.\n public static String snakeToCamel(String word) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_411_snake_to_camel", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(snakeToCamel((\"android_tv\")).equals((\"AndroidTv\")));\n assert(snakeToCamel((\"google_pixel\")).equals((\"GooglePixel\")));\n assert(snakeToCamel((\"apple_watch\")).equals((\"AppleWatch\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_411_snake_to_camel", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_411_snake_to_camel.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_412_remove_odd", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to remove odd numbers from a given array list.\n public static ArrayList removeOdd(ArrayList l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_412_remove_odd", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeOdd((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))).equals((new ArrayList(Arrays.asList((long)2l)))));\n assert(removeOdd((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l)))));\n assert(removeOdd((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)3l)))).equals((new ArrayList(Arrays.asList((long)10l, (long)20l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_412_remove_odd", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_412_remove_odd.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_413_extract_nth_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract the nth element from a given array list of pairs.\n public static ArrayList extractNthElement(ArrayList> list1, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_413_extract_nth_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractNthElement((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Greyson Fulton\", 98l, 99l), (Pair)Pair.with(\"Brady Kent\", 97l, 96l), (Pair)Pair.with(\"Wyatt Knott\", 91l, 94l), (Pair)Pair.with(\"Beau Turnbull\", 94l, 98l)))), (0l)).equals((new ArrayList(Arrays.asList((String)\"Greyson Fulton\", (String)\"Brady Kent\", (String)\"Wyatt Knott\", (String)\"Beau Turnbull\")))));\n assert(extractNthElement((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Greyson Fulton\", 98l, 99l), (Pair)Pair.with(\"Brady Kent\", 97l, 96l), (Pair)Pair.with(\"Wyatt Knott\", 91l, 94l), (Pair)Pair.with(\"Beau Turnbull\", 94l, 98l)))), (2l)).equals((new ArrayList(Arrays.asList((long)99l, (long)96l, (long)94l, (long)98l)))));\n assert(extractNthElement((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Greyson Fulton\", 98l, 99l), (Pair)Pair.with(\"Brady Kent\", 97l, 96l), (Pair)Pair.with(\"Wyatt Knott\", 91l, 94l), (Pair)Pair.with(\"Beau Turnbull\", 94l, 98l)))), (1l)).equals((new ArrayList(Arrays.asList((long)98l, (long)97l, (long)91l, (long)94l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_413_extract_nth_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_413_extract_nth_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_414_overlapping", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether any value in a sequence exists in a sequence or not.\n public static boolean overlapping(ArrayList list1, ArrayList list2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_414_overlapping", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(overlapping((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l)))) == (false));\n assert(overlapping((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)))) == (false));\n assert(overlapping((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)1l, (long)4l, (long)5l)))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_414_overlapping", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_414_overlapping.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_415_max_Product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find a pair with highest product from a given array array list of integers.\n public static Pair maxProduct(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_415_max_Product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)7l, (long)0l, (long)8l, (long)4l)))).equals((Pair.with(7l, 8l))));\n assert(maxProduct((new ArrayList(Arrays.asList((long)0l, (long)-1l, (long)-2l, (long)-4l, (long)5l, (long)0l, (long)-6l)))).equals((Pair.with(-4l, -6l))));\n assert(maxProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))).equals((Pair.with(2l, 3l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_415_max_Product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_415_max_Product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_417_group_tuples", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find common first element in given array list of array lists.\n public static ArrayList> groupTuples(ArrayList> Input) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_417_group_tuples", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(groupTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\")), (ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"z\")), (ArrayList)new ArrayList(Arrays.asList((String)\"w\", (String)\"t\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\", (String)\"z\")), (ArrayList)new ArrayList(Arrays.asList((String)\"w\", (String)\"t\")))))));\n assert(groupTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")), (ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"c\")), (ArrayList)new ArrayList(Arrays.asList((String)\"d\", (String)\"e\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\")), (ArrayList)new ArrayList(Arrays.asList((String)\"d\", (String)\"e\")))))));\n assert(groupTuples((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"f\", (String)\"g\")), (ArrayList)new ArrayList(Arrays.asList((String)\"f\", (String)\"g\")), (ArrayList)new ArrayList(Arrays.asList((String)\"h\", (String)\"i\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"f\", (String)\"g\", (String)\"g\")), (ArrayList)new ArrayList(Arrays.asList((String)\"h\", (String)\"i\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_417_group_tuples", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_417_group_tuples.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_418_Find_Max", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the element of an array array list having maximum length.\n public static ArrayList FindMax(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_418_Find_Max", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(FindMax((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"A\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"B\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"B\", (String)\"C\")))))).equals((new ArrayList(Arrays.asList((String)\"A\", (String)\"B\", (String)\"C\")))));\n assert(FindMax((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))));\n assert(FindMax((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)5l, (long)6l, (long)1l)))))).equals((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)6l, (long)1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_418_Find_Max", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_418_Find_Max.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_420_cube_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the cube sum of first n even natural numbers.\n public static long cubeSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_420_cube_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(cubeSum((2l)) == (72l));\n assert(cubeSum((3l)) == (288l));\n assert(cubeSum((4l)) == (800l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_420_cube_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_420_cube_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_421_concatenate_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to concatenate each element of pair by the delimiter.\n public static String concatenateTuple(Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_421_concatenate_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(concatenateTuple((Pair.with(\"ID\", \"is\", 4l, \"UTS\"))).equals((\"ID-is-4-UTS\")));\n assert(concatenateTuple((Pair.with(\"QWE\", \"is\", 4l, \"RTY\"))).equals((\"QWE-is-4-RTY\")));\n assert(concatenateTuple((Pair.with(\"ZEN\", \"is\", 4l, \"OP\"))).equals((\"ZEN-is-4-OP\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_421_concatenate_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_421_concatenate_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_422_find_Average_Of_Cube", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the average of cubes of first n natural numbers.\n public static float findAverageOfCube(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_422_find_Average_Of_Cube", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findAverageOfCube((2l)) == (4.5f));\n assert(findAverageOfCube((3l)) == (float)12l);\n assert(findAverageOfCube((1l)) == (float)1l);\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_422_find_Average_Of_Cube", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_422_find_Average_Of_Cube.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_424_extract_rear", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract only the rear index element of each string in the given pair.\n public static ArrayList extractRear(Pair test_tuple) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_424_extract_rear", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractRear((Pair.with(\"Mers\", \"for\", \"Vers\"))).equals((new ArrayList(Arrays.asList((String)\"s\", (String)\"r\", (String)\"s\")))));\n assert(extractRear((Pair.with(\"Avenge\", \"for\", \"People\"))).equals((new ArrayList(Arrays.asList((String)\"e\", (String)\"r\", (String)\"e\")))));\n assert(extractRear((Pair.with(\"Gotta\", \"get\", \"go\"))).equals((new ArrayList(Arrays.asList((String)\"a\", (String)\"t\", (String)\"o\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_424_extract_rear", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_424_extract_rear.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_425_count_element_in_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the number of subarray lists containing a particular element.\n public static long countElementInList(ArrayList> list1, Object x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_425_count_element_in_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countElementInList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)15l, (long)7l))))), (Object(1l))) == (3l));\n assert(countElementInList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"B\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"C\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"D\", (String)\"E\")), (ArrayList)new ArrayList(Arrays.asList((String)\"B\", (String)\"C\", (String)\"D\"))))), (Object(\"A\"))) == (3l));\n assert(countElementInList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"B\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"C\")), (ArrayList)new ArrayList(Arrays.asList((String)\"A\", (String)\"D\", (String)\"E\")), (ArrayList)new ArrayList(Arrays.asList((String)\"B\", (String)\"C\", (String)\"D\"))))), (Object(\"E\"))) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_425_count_element_in_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_425_count_element_in_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_426_filter_oddnumbers", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to filter odd numbers.\n public static ArrayList filterOddnumbers(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_426_filter_oddnumbers", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(filterOddnumbers((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)9l)))));\n assert(filterOddnumbers((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)45l, (long)67l, (long)84l, (long)93l)))).equals((new ArrayList(Arrays.asList((long)45l, (long)67l, (long)93l)))));\n assert(filterOddnumbers((new ArrayList(Arrays.asList((long)5l, (long)7l, (long)9l, (long)8l, (long)6l, (long)4l, (long)3l)))).equals((new ArrayList(Arrays.asList((long)5l, (long)7l, (long)9l, (long)3l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_426_filter_oddnumbers", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_426_filter_oddnumbers.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_427_change_date_format", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert a date of yyyy-mm-dd format to dd-mm-yyyy format.\n public static String changeDateFormat(String dt) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_427_change_date_format", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(changeDateFormat((\"2026-01-02\")).equals((\"02-01-2026\")));\n assert(changeDateFormat((\"2020-11-13\")).equals((\"13-11-2020\")));\n assert(changeDateFormat((\"2021-04-26\")).equals((\"26-04-2021\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_427_change_date_format", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_427_change_date_format.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_428_shell_sort", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort the given array array list by using shell sort.\n public static ArrayList shellSort(ArrayList my_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_428_shell_sort", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(shellSort((new ArrayList(Arrays.asList((long)12l, (long)23l, (long)4l, (long)5l, (long)3l, (long)2l, (long)12l, (long)81l, (long)56l, (long)95l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)5l, (long)12l, (long)12l, (long)23l, (long)56l, (long)81l, (long)95l)))));\n assert(shellSort((new ArrayList(Arrays.asList((long)24l, (long)22l, (long)39l, (long)34l, (long)87l, (long)73l, (long)68l)))).equals((new ArrayList(Arrays.asList((long)22l, (long)24l, (long)34l, (long)39l, (long)68l, (long)73l, (long)87l)))));\n assert(shellSort((new ArrayList(Arrays.asList((long)32l, (long)30l, (long)16l, (long)96l, (long)82l, (long)83l, (long)74l)))).equals((new ArrayList(Arrays.asList((long)16l, (long)30l, (long)32l, (long)74l, (long)82l, (long)83l, (long)96l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_428_shell_sort", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_428_shell_sort.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_429_and_tuples", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract the elementwise and pairs from the given two pairs.\n public static Pair andTuples(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_429_and_tuples", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(andTuples((Pair.with(10l, 4l, 6l, 9l)), (Pair.with(5l, 2l, 3l, 3l))).equals((Pair.with(0l, 0l, 2l, 1l))));\n assert(andTuples((Pair.with(1l, 2l, 3l, 4l)), (Pair.with(5l, 6l, 7l, 8l))).equals((Pair.with(1l, 2l, 3l, 0l))));\n assert(andTuples((Pair.with(8l, 9l, 11l, 12l)), (Pair.with(7l, 13l, 14l, 17l))).equals((Pair.with(0l, 9l, 10l, 0l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_429_and_tuples", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_429_and_tuples.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_430_parabola_directrix", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the directrix of a parabola.\n public static long parabolaDirectrix(long a, long b, long c) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_430_parabola_directrix", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(parabolaDirectrix((5l), (3l), (2l)) == (-198l));\n assert(parabolaDirectrix((9l), (8l), (4l)) == (-2336l));\n assert(parabolaDirectrix((2l), (4l), (6l)) == (-130l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_430_parabola_directrix", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_430_parabola_directrix.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_431_common_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes two array lists and returns true if they have at least one common element.\n public static Optional commonElement(ArrayList list1, ArrayList list2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_431_common_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(commonElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l, (long)9l)))).equals(Optional.of(true)));\n assert(commonElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l)))).equals(Optional.empty()));\n assert(commonElement((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\"))), (new ArrayList(Arrays.asList((String)\"d\", (String)\"b\", (String)\"e\")))).equals(Optional.of(true)));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_431_common_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_431_common_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_432_median_trapezium", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the median length of a trapezium.\n public static float medianTrapezium(long base1, long base2, long height) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_432_median_trapezium", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(medianTrapezium((15l), (25l), (35l)) == (float)20l);\n assert(medianTrapezium((10l), (20l), (30l)) == (float)15l);\n assert(medianTrapezium((6l), (9l), (4l)) == (7.5f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_432_median_trapezium", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_432_median_trapezium.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_433_check_greater", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the entered number is greater than the elements of the given array array list.\n public static boolean checkGreater(ArrayList arr, long number) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_433_check_greater", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkGreater((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (4l)) == (false));\n assert(checkGreater((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (8l)) == (true));\n assert(checkGreater((new ArrayList(Arrays.asList((long)9l, (long)7l, (long)4l, (long)8l, (long)6l, (long)1l))), (11l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_433_check_greater", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_433_check_greater.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_434_text_match_one", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that matches a string that has an a followed by one or more b's.\n public static boolean textMatchOne(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_434_text_match_one", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchOne((\"ac\")) == (false));\n assert(textMatchOne((\"dc\")) == (false));\n assert(textMatchOne((\"abba\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_434_text_match_one", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_434_text_match_one.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_435_last_Digit", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the last digit of a given number.\n public static long lastDigit(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_435_last_Digit", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lastDigit((123l)) == (3l));\n assert(lastDigit((25l)) == (5l));\n assert(lastDigit((30l)) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_435_last_Digit", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_435_last_Digit.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_436_neg_nos", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to return the negative numbers in an array array list.\n public static ArrayList negNos(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_436_neg_nos", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(negNos((new ArrayList(Arrays.asList((long)-1l, (long)4l, (long)5l, (long)-6l)))).equals((new ArrayList(Arrays.asList((long)-1l, (long)-6l)))));\n assert(negNos((new ArrayList(Arrays.asList((long)-1l, (long)-2l, (long)3l, (long)4l)))).equals((new ArrayList(Arrays.asList((long)-1l, (long)-2l)))));\n assert(negNos((new ArrayList(Arrays.asList((long)-7l, (long)-6l, (long)8l, (long)9l)))).equals((new ArrayList(Arrays.asList((long)-7l, (long)-6l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_436_neg_nos", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_436_neg_nos.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_437_remove_odd", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove odd characters in a string.\n public static String removeOdd(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_437_remove_odd", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeOdd((\"python\")).equals((\"yhn\")));\n assert(removeOdd((\"program\")).equals((\"rga\")));\n assert(removeOdd((\"language\")).equals((\"agae\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_437_remove_odd", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_437_remove_odd.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_438_count_bidirectional", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count bidirectional pair pairs.\n public static long countBidirectional(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_438_count_bidirectional", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countBidirectional((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 6l), (Pair)Pair.with(1l, 2l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(9l, 1l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(2l, 1l))))) == (3l));\n assert(countBidirectional((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 6l), (Pair)Pair.with(1l, 3l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(9l, 1l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(2l, 1l))))) == (2l));\n assert(countBidirectional((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 6l), (Pair)Pair.with(1l, 2l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(9l, 2l), (Pair)Pair.with(6l, 5l), (Pair)Pair.with(2l, 1l))))) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_438_count_bidirectional", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_438_count_bidirectional.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_439_multiple_to_single", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to join an array array list of multiple integers into a single integer.\n public static long multipleToSingle(ArrayList L) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_439_multiple_to_single", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(multipleToSingle((new ArrayList(Arrays.asList((long)11l, (long)33l, (long)50l)))) == (113350l));\n assert(multipleToSingle((new ArrayList(Arrays.asList((long)-1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l)))) == (-123456l));\n assert(multipleToSingle((new ArrayList(Arrays.asList((long)10l, (long)15l, (long)20l, (long)25l)))) == (10152025l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_439_multiple_to_single", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_439_multiple_to_single.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_440_find_adverb_position", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the first adverb and their positions in a given sentence.\n public static Pair findAdverbPosition(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_440_find_adverb_position", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findAdverbPosition((\"clearly!! we can see the sky\")).equals((Pair.with(0l, 7l, \"clearly\"))));\n assert(findAdverbPosition((\"seriously!! there are many roses\")).equals((Pair.with(0l, 9l, \"seriously\"))));\n assert(findAdverbPosition((\"unfortunately!! sita is going to home\")).equals((Pair.with(0l, 13l, \"unfortunately\"))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_440_find_adverb_position", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_440_find_adverb_position.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_441_surfacearea_cube", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the surface area of a cube of a given size.\n public static long surfaceareaCube(long l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_441_surfacearea_cube", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(surfaceareaCube((5l)) == (150l));\n assert(surfaceareaCube((3l)) == (54l));\n assert(surfaceareaCube((10l)) == (600l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_441_surfacearea_cube", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_441_surfacearea_cube.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_442_positive_count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the ration of positive numbers in an array array list of integers.\n public static float positiveCount(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_442_positive_count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(positiveCount((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)-1l, (long)-5l, (long)6l, (long)0l, (long)-3l, (long)-2l, (long)3l, (long)4l, (long)6l, (long)8l)))) == (0.54f));\n assert(positiveCount((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)2l, (long)-1l, (long)-5l, (long)6l, (long)4l, (long)-3l, (long)-2l, (long)3l, (long)4l, (long)6l, (long)8l)))) == (0.69f));\n assert(positiveCount((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)-6l, (long)-9l, (long)11l, (long)-12l, (long)14l, (long)-5l, (long)17l)))) == (0.56f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_442_positive_count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_442_positive_count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_443_largest_neg", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the largest negative number from the given array list.\n public static long largestNeg(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_443_largest_neg", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(largestNeg((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)-4l, (long)-6l)))) == (-6l));\n assert(largestNeg((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)-8l, (long)-9l)))) == (-9l));\n assert(largestNeg((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)-1l)))) == (-1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_443_largest_neg", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_443_largest_neg.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_444_trim_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to trim each array list by k in the given array lists.\n public static ArrayList> trimTuple(ArrayList> test_list, long K) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_444_trim_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(trimTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)5l, (long)3l, (long)2l, (long)1l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l, (long)9l, (long)2l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)1l, (long)2l, (long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)8l, (long)2l, (long)1l, (long)7l))))), (2l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)2l)))))));\n assert(trimTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)5l, (long)3l, (long)2l, (long)1l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l, (long)9l, (long)2l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)1l, (long)2l, (long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)8l, (long)2l, (long)1l, (long)7l))))), (1l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)9l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)2l, (long)1l)))))));\n assert(trimTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)4l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)11l, (long)8l, (long)12l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)1l, (long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)6l, (long)9l, (long)7l))))), (1l)).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)8l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)12l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)9l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_444_trim_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_444_trim_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_445_index_multiplication", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to perform index wise multiplication of array list elements in the given two array lists.\n public static ArrayList> indexMultiplication(ArrayList> test_tup1, ArrayList> test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_445_index_multiplication", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(indexMultiplication((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)10l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)3l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)21l)), (ArrayList)new ArrayList(Arrays.asList((long)12l, (long)45l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)30l)))))));\n assert(indexMultiplication((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)11l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)4l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)14l, (long)32l)), (ArrayList)new ArrayList(Arrays.asList((long)20l, (long)60l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)20l)), (ArrayList)new ArrayList(Arrays.asList((long)16l, (long)44l)))))));\n assert(indexMultiplication((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)12l))))), (new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)24l, (long)45l)), (ArrayList)new ArrayList(Arrays.asList((long)30l, (long)77l)), (ArrayList)new ArrayList(Arrays.asList((long)12l, (long)33l)), (ArrayList)new ArrayList(Arrays.asList((long)27l, (long)60l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_445_index_multiplication", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_445_index_multiplication.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_446_count_Occurrence", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the occurence of all elements of array list in a pair.\n public static long countOccurrence(Object tup, ArrayList lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_446_count_Occurrence", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countOccurrence(Pair.with(\"a\", \"a\", \"c\", \"b\", \"d\"), (new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")))) == (3l));\n assert(countOccurrence(Pair.with(1l, 2l, 3l, 1l, 4l, 6l, 7l, 1l, 4l), (new ArrayList(Arrays.asList((long)1l, (long)4l, (long)7l)))) == (6l));\n assert(countOccurrence(Pair.with(1l, 2l, 3l, 4l, 5l, 6l), (new ArrayList(Arrays.asList((long)1l, (long)2l)))) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_446_count_Occurrence", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_446_count_Occurrence.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_447_cube_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find cubes of individual elements in an array array list.\n public static ArrayList cubeNums(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_447_cube_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(cubeNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)8l, (long)27l, (long)64l, (long)125l, (long)216l, (long)343l, (long)512l, (long)729l, (long)1000l)))));\n assert(cubeNums((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l)))).equals((new ArrayList(Arrays.asList((long)1000l, (long)8000l, (long)27000l)))));\n assert(cubeNums((new ArrayList(Arrays.asList((long)12l, (long)15l)))).equals((new ArrayList(Arrays.asList((long)1728l, (long)3375l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_447_cube_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_447_cube_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_448_cal_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the sum of perrin numbers.\n public static long calSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_448_cal_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(calSum((9l)) == (49l));\n assert(calSum((10l)) == (66l));\n assert(calSum((11l)) == (88l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_448_cal_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_448_cal_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_450_extract_string", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract specified size of strings from a given array list of string values.\n public static ArrayList extractString(ArrayList str, long l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_450_extract_string", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractString((new ArrayList(Arrays.asList((String)\"Python\", (String)\"list\", (String)\"exercises\", (String)\"practice\", (String)\"solution\"))), (8l)).equals((new ArrayList(Arrays.asList((String)\"practice\", (String)\"solution\")))));\n assert(extractString((new ArrayList(Arrays.asList((String)\"Python\", (String)\"list\", (String)\"exercises\", (String)\"practice\", (String)\"solution\"))), (6l)).equals((new ArrayList(Arrays.asList((String)\"Python\")))));\n assert(extractString((new ArrayList(Arrays.asList((String)\"Python\", (String)\"list\", (String)\"exercises\", (String)\"practice\", (String)\"solution\"))), (9l)).equals((new ArrayList(Arrays.asList((String)\"exercises\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_450_extract_string", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_450_extract_string.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_451_remove_whitespaces", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove all whitespaces from the given string.\n public static String removeWhitespaces(String text1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_451_remove_whitespaces", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeWhitespaces((\" Google Flutter \")).equals((\"GoogleFlutter\")));\n assert(removeWhitespaces((\" Google Dart \")).equals((\"GoogleDart\")));\n assert(removeWhitespaces((\" iOS Swift \")).equals((\"iOSSwift\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_451_remove_whitespaces", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_451_remove_whitespaces.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_452_loss_amount", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that gives loss amount on a sale if the given amount has loss else return 0.\n public static long lossAmount(long actual_cost, long sale_amount) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_452_loss_amount", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lossAmount((1500l), (1200l)) == (0l));\n assert(lossAmount((100l), (200l)) == (100l));\n assert(lossAmount((2000l), (5000l)) == (3000l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_452_loss_amount", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_452_loss_amount.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_453_sumofFactors", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of even factors of a number.\n public static long sumofFactors(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_453_sumofFactors", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumofFactors((18l)) == (26l));\n assert(sumofFactors((30l)) == (48l));\n assert(sumofFactors((6l)) == (8l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_453_sumofFactors", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_453_sumofFactors.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_454_text_match_wordz", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that matches a word containing 'z'.\n public static boolean textMatchWordz(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_454_text_match_wordz", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchWordz((\"pythonz.\")) == (true));\n assert(textMatchWordz((\"xyz.\")) == (true));\n assert(textMatchWordz((\" lang .\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_454_text_match_wordz", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_454_text_match_wordz.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_455_check_monthnumb_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given month number contains 31 days or not.\n public static boolean checkMonthnumbNumber(long monthnum2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_455_check_monthnumb_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkMonthnumbNumber((5l)) == (true));\n assert(checkMonthnumbNumber((2l)) == (false));\n assert(checkMonthnumbNumber((6l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_455_check_monthnumb_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_455_check_monthnumb_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_456_reverse_string_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to reverse each string in a given array list of string values.\n public static ArrayList reverseStringList(ArrayList stringlist) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_456_reverse_string_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(reverseStringList((new ArrayList(Arrays.asList((String)\"Red\", (String)\"Green\", (String)\"Blue\", (String)\"White\", (String)\"Black\")))).equals((new ArrayList(Arrays.asList((String)\"deR\", (String)\"neerG\", (String)\"eulB\", (String)\"etihW\", (String)\"kcalB\")))));\n assert(reverseStringList((new ArrayList(Arrays.asList((String)\"john\", (String)\"amal\", (String)\"joel\", (String)\"george\")))).equals((new ArrayList(Arrays.asList((String)\"nhoj\", (String)\"lama\", (String)\"leoj\", (String)\"egroeg\")))));\n assert(reverseStringList((new ArrayList(Arrays.asList((String)\"jack\", (String)\"john\", (String)\"mary\")))).equals((new ArrayList(Arrays.asList((String)\"kcaj\", (String)\"nhoj\", (String)\"yram\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_456_reverse_string_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_456_reverse_string_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_457_Find_Min", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the subarray list having minimum length.\n public static ArrayList FindMin(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_457_Find_Min", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(FindMin((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))))).equals((new ArrayList(Arrays.asList((long)1l)))));\n assert(FindMin((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)7l, (long)8l)))))).equals((new ArrayList(Arrays.asList((long)1l, (long)1l)))));\n assert(FindMin((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\")), (ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\")), (ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\", (String)\"z\")))))).equals((new ArrayList(Arrays.asList((String)\"x\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_457_Find_Min", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_457_Find_Min.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_458_rectangle_area", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the area of a rectangle.\n public static long rectangleArea(long l, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_458_rectangle_area", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rectangleArea((10l), (20l)) == (200l));\n assert(rectangleArea((10l), (5l)) == (50l));\n assert(rectangleArea((4l), (2l)) == (8l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_458_rectangle_area", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_458_rectangle_area.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_459_remove_uppercase", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove uppercase substrings from a given string.\n public static String removeUppercase(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_459_remove_uppercase", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeUppercase((\"cAstyoUrFavoRitETVshoWs\")).equals((\"cstyoravoitshos\")));\n assert(removeUppercase((\"wAtchTheinTernEtrAdIo\")).equals((\"wtchheinerntrdo\")));\n assert(removeUppercase((\"VoicESeaRchAndreComMendaTionS\")).equals((\"oiceachndreomendaion\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_459_remove_uppercase", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_459_remove_uppercase.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_460_Extract", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to get the first element of each subarray list.\n public static ArrayList Extract(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_460_Extract", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(Extract((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l)))))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)6l)))));\n assert(Extract((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)))))).equals((new ArrayList(Arrays.asList((long)1l, (long)4l)))));\n assert(Extract((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)9l, (long)8l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)))))).equals((new ArrayList(Arrays.asList((long)9l, (long)1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_460_Extract", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_460_Extract.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_461_upper_ctr", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the upper case characters in a given string.\n public static long upperCtr(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_461_upper_ctr", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(upperCtr((\"PYthon\")) == (1l));\n assert(upperCtr((\"BigData\")) == (1l));\n assert(upperCtr((\"program\")) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_461_upper_ctr", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_461_upper_ctr.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_463_max_subarray_product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum product subarray array list of the given array array list.\n public static long maxSubarrayProduct(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_463_max_subarray_product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSubarrayProduct((new ArrayList(Arrays.asList((long)1l, (long)-2l, (long)-3l, (long)0l, (long)7l, (long)-8l, (long)-2l)))) == (112l));\n assert(maxSubarrayProduct((new ArrayList(Arrays.asList((long)6l, (long)-3l, (long)-10l, (long)0l, (long)2l)))) == (180l));\n assert(maxSubarrayProduct((new ArrayList(Arrays.asList((long)-2l, (long)-40l, (long)0l, (long)-2l, (long)-3l)))) == (80l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_463_max_subarray_product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_463_max_subarray_product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_464_check_value", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if all values are same in a hash map.\n public static boolean checkValue(HashMap dict, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_464_check_value", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkValue((new HashMap(Map.of(\"Cierra Vega\", 12l, \"Alden Cantrell\", 12l, \"Kierra Gentry\", 12l, \"Pierre Cox\", 12l))), (10l)) == (false));\n assert(checkValue((new HashMap(Map.of(\"Cierra Vega\", 12l, \"Alden Cantrell\", 12l, \"Kierra Gentry\", 12l, \"Pierre Cox\", 12l))), (12l)) == (true));\n assert(checkValue((new HashMap(Map.of(\"Cierra Vega\", 12l, \"Alden Cantrell\", 12l, \"Kierra Gentry\", 12l, \"Pierre Cox\", 12l))), (5l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_464_check_value", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_464_check_value.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_465_drop_empty", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to drop empty items from a given hash map.\n public static HashMap dropEmpty(HashMap> dict1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_465_drop_empty", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(dropEmpty(new HashMap(Map.of(\"c1\", \"Red\", \"c2\", \"Green\", \"c3\", Optional.empty()))).equals((new HashMap(Map.of(\"c1\", \"Red\", \"c2\", \"Green\")))));\n assert(dropEmpty(new HashMap(Map.of(\"c1\", \"Red\", \"c2\", Optional.empty(), \"c3\", Optional.empty()))).equals((new HashMap(Map.of(\"c1\", \"Red\")))));\n assert(dropEmpty(new HashMap(Map.of(\"c1\", Optional.empty(), \"c2\", \"Green\", \"c3\", Optional.empty()))).equals((new HashMap(Map.of(\"c2\", \"Green\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_465_drop_empty", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_465_drop_empty.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_468_max_product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the maximum product formed by multiplying numbers of an increasing subsequence of that array array list.\n public static long maxProduct(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_468_max_product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxProduct((new ArrayList(Arrays.asList((long)3l, (long)100l, (long)4l, (long)5l, (long)150l, (long)6l)))) == (3000l));\n assert(maxProduct((new ArrayList(Arrays.asList((long)4l, (long)42l, (long)55l, (long)68l, (long)80l)))) == (50265600l));\n assert(maxProduct((new ArrayList(Arrays.asList((long)10l, (long)22l, (long)9l, (long)33l, (long)21l, (long)50l, (long)41l, (long)60l)))) == (2460l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_468_max_product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_468_max_product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_470_add_pairwise", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the pairwise addition of the neighboring elements of the given pair.\n public static Pair addPairwise(Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_470_add_pairwise", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addPairwise((Pair.with(1l, 5l, 7l, 8l, 10l))).equals((Pair.with(6l, 12l, 15l, 18l))));\n assert(addPairwise((Pair.with(2l, 6l, 8l, 9l, 11l))).equals((Pair.with(8l, 14l, 17l, 20l))));\n assert(addPairwise((Pair.with(3l, 7l, 9l, 10l, 12l))).equals((Pair.with(10l, 16l, 19l, 22l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_470_add_pairwise", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_470_add_pairwise.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_471_find_remainder", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the product of the array array list multiplication modulo n.\n public static long findRemainder(ArrayList arr, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_471_find_remainder", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findRemainder((new ArrayList(Arrays.asList((long)100l, (long)10l, (long)5l, (long)25l, (long)35l, (long)14l))), (11l)) == (9l));\n assert(findRemainder((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l))), (1l)) == (0l));\n assert(findRemainder((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l))), (2l)) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_471_find_remainder", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_471_find_remainder.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_472_check_Consecutive", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given array list contains consecutive numbers or not.\n public static boolean checkConsecutive(ArrayList l) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_472_check_Consecutive", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkConsecutive((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))) == (true));\n assert(checkConsecutive((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)6l)))) == (false));\n assert(checkConsecutive((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_472_check_Consecutive", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_472_check_Consecutive.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_474_replace_char", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to replace characters in a string.\n public static String replaceChar(String str1, String ch, String newch) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_474_replace_char", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceChar((\"polygon\"), (\"y\"), (\"l\")).equals((\"pollgon\")));\n assert(replaceChar((\"character\"), (\"c\"), (\"a\")).equals((\"aharaater\")));\n assert(replaceChar((\"python\"), (\"l\"), (\"a\")).equals((\"python\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_474_replace_char", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_474_replace_char.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_475_sort_counter", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort a hash map by value.\n public static ArrayList> sortCounter(HashMap dict1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_475_sort_counter", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sortCounter((new HashMap(Map.of(\"Math\", 81l, \"Physics\", 83l, \"Chemistry\", 87l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Chemistry\", 87l), (Pair)Pair.with(\"Physics\", 83l), (Pair)Pair.with(\"Math\", 81l))))));\n assert(sortCounter((new HashMap(Map.of(\"Math\", 400l, \"Physics\", 300l, \"Chemistry\", 250l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Math\", 400l), (Pair)Pair.with(\"Physics\", 300l), (Pair)Pair.with(\"Chemistry\", 250l))))));\n assert(sortCounter((new HashMap(Map.of(\"Math\", 900l, \"Physics\", 1000l, \"Chemistry\", 1250l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Chemistry\", 1250l), (Pair)Pair.with(\"Physics\", 1000l), (Pair)Pair.with(\"Math\", 900l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_475_sort_counter", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_475_sort_counter.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_476_big_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of the largest and smallest value in a given array array list.\n public static long bigSum(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_476_big_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(bigSum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (4l));\n assert(bigSum((new ArrayList(Arrays.asList((long)-1l, (long)2l, (long)3l, (long)4l)))) == (3l));\n assert(bigSum((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)6l)))) == (8l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_476_big_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_476_big_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_477_is_lower", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to convert the given string to lower case.\n public static String isLower(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_477_is_lower", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isLower((\"InValid\")).equals((\"invalid\")));\n assert(isLower((\"TruE\")).equals((\"true\")));\n assert(isLower((\"SenTenCE\")).equals((\"sentence\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_477_is_lower", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_477_is_lower.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_478_remove_lowercase", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove lowercase substrings from a given string.\n public static String removeLowercase(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_478_remove_lowercase", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeLowercase((\"PYTHon\")).equals((\"PYTH\")));\n assert(removeLowercase((\"FInD\")).equals((\"FID\")));\n assert(removeLowercase((\"STRinG\")).equals((\"STRG\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_478_remove_lowercase", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_478_remove_lowercase.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_479_first_Digit", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the first digit of a given number.\n public static long firstDigit(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_479_first_Digit", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(firstDigit((123l)) == (1l));\n assert(firstDigit((456l)) == (4l));\n assert(firstDigit((12l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_479_first_Digit", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_479_first_Digit.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_554_Split", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function which takes an array array list of integers and only returns the odd ones.\n public static ArrayList Split(ArrayList list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_554_Split", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(Split((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l)))));\n assert(Split((new ArrayList(Arrays.asList((long)10l, (long)11l, (long)12l, (long)13l)))).equals((new ArrayList(Arrays.asList((long)11l, (long)13l)))));\n assert(Split((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)1l)))).equals((new ArrayList(Arrays.asList((long)7l, (long)9l, (long)1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_554_Split", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_554_Split.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_555_difference", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the difference between the sum of cubes of the first n natural numbers and the sum of the first n natural numbers.\n public static long difference(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_555_difference", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(difference((3l)) == (30l));\n assert(difference((5l)) == (210l));\n assert(difference((2l)) == (6l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_555_difference", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_555_difference.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_556_find_Odd_Pair", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of pairs whose xor value is odd.\n public static long findOddPair(ArrayList A, long N) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_556_find_Odd_Pair", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findOddPair((new ArrayList(Arrays.asList((long)5l, (long)4l, (long)7l, (long)2l, (long)1l))), (5l)) == (6l));\n assert(findOddPair((new ArrayList(Arrays.asList((long)7l, (long)2l, (long)8l, (long)1l, (long)0l, (long)5l, (long)11l))), (7l)) == (12l));\n assert(findOddPair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (3l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_556_find_Odd_Pair", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_556_find_Odd_Pair.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_557_toggle_string", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to toggle the case of all characters in a string.\n public static String toggleString(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_557_toggle_string", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(toggleString((\"Python\")).equals((\"pYTHON\")));\n assert(toggleString((\"Pangram\")).equals((\"pANGRAM\")));\n assert(toggleString((\"LIttLE\")).equals((\"liTTle\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_557_toggle_string", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_557_toggle_string.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_558_digit_distance_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of the per-digit difference between two integers.\n public static long digitDistanceNums(long n1, long n2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_558_digit_distance_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(digitDistanceNums((1l), (2l)) == (1l));\n assert(digitDistanceNums((23l), (56l)) == (6l));\n assert(digitDistanceNums((123l), (256l)) == (7l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_558_digit_distance_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_558_digit_distance_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_559_max_sub_array_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the sum of the largest contiguous subarray list in the given array list.\n public static long maxSubArraySum(ArrayList a, long size) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_559_max_sub_array_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSubArraySum((new ArrayList(Arrays.asList((long)-2l, (long)-3l, (long)4l, (long)-1l, (long)-2l, (long)1l, (long)5l, (long)-3l))), (8l)) == (7l));\n assert(maxSubArraySum((new ArrayList(Arrays.asList((long)-3l, (long)-4l, (long)5l, (long)-2l, (long)-3l, (long)2l, (long)6l, (long)-4l))), (8l)) == (8l));\n assert(maxSubArraySum((new ArrayList(Arrays.asList((long)-4l, (long)-5l, (long)6l, (long)-3l, (long)-4l, (long)3l, (long)7l, (long)-5l))), (8l)) == (10l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_559_max_sub_array_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_559_max_sub_array_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_560_union_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the union of the elements of two given array lists and output them in sorted order.\n public static ArrayList unionElements(ArrayList test_tup1, ArrayList test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_560_union_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(unionElements((new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)5l, (long)7l, (long)4l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)10l)))));\n assert(unionElements((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l))), (new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l)))));\n assert(unionElements((new ArrayList(Arrays.asList((long)11l, (long)12l, (long)13l, (long)14l))), (new ArrayList(Arrays.asList((long)13l, (long)15l, (long)16l, (long)17l)))).equals((new ArrayList(Arrays.asList((long)11l, (long)12l, (long)13l, (long)14l, (long)15l, (long)16l, (long)17l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_560_union_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_560_union_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_562_Find_Max_Length", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the length of the longest subarray lists.\n public static long FindMaxLength(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_562_Find_Max_Length", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(FindMaxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)8l)))))) == (4l));\n assert(FindMaxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))))) == (3l));\n assert(FindMaxLength((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)22l, (long)23l)), (ArrayList)new ArrayList(Arrays.asList((long)13l, (long)14l, (long)15l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l, (long)50l)))))) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_562_Find_Max_Length", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_562_Find_Max_Length.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_563_extract_values", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract values between quotation marks from a string.\n public static ArrayList extractValues(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_563_extract_values", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractValues((\"\"Python\", \"PHP\", \"Java\"\")).equals((new ArrayList(Arrays.asList((String)\"Python\", (String)\"PHP\", (String)\"Java\")))));\n assert(extractValues((\"\"python\",\"program\",\"language\"\")).equals((new ArrayList(Arrays.asList((String)\"python\", (String)\"program\", (String)\"language\")))));\n assert(extractValues((\"\"red\",\"blue\",\"green\",\"yellow\"\")).equals((new ArrayList(Arrays.asList((String)\"red\", (String)\"blue\", (String)\"green\", (String)\"yellow\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_563_extract_values", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_563_extract_values.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_564_count_Pairs", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function which takes an array array list of integers and counts the number of possible unordered pairs where both elements are unequal.\n public static long countPairs(ArrayList arr, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_564_count_Pairs", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countPairs((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l))), (3l)) == (2l));\n assert(countPairs((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)1l))), (4l)) == (0l));\n assert(countPairs((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (5l)) == (10l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_564_count_Pairs", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_564_count_Pairs.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_565_split", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to split a string into characters.\n public static ArrayList split(String word) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_565_split", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(split((\"python\")).equals((new ArrayList(Arrays.asList((String)\"p\", (String)\"y\", (String)\"t\", (String)\"h\", (String)\"o\", (String)\"n\")))));\n assert(split((\"Name\")).equals((new ArrayList(Arrays.asList((String)\"N\", (String)\"a\", (String)\"m\", (String)\"e\")))));\n assert(split((\"program\")).equals((new ArrayList(Arrays.asList((String)\"p\", (String)\"r\", (String)\"o\", (String)\"g\", (String)\"r\", (String)\"a\", (String)\"m\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_565_split", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_565_split.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_566_sum_digits", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to get the sum of the digits of a non-negative integer.\n public static long sumDigits(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_566_sum_digits", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumDigits((345l)) == (12l));\n assert(sumDigits((12l)) == (3l));\n assert(sumDigits((97l)) == (16l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_566_sum_digits", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_566_sum_digits.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_567_issort_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether a specified array list is sorted or not.\n public static boolean issortList(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_567_issort_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(issortList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)6l, (long)8l, (long)10l, (long)12l, (long)14l, (long)16l, (long)17l)))) == (true));\n assert(issortList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)6l, (long)8l, (long)10l, (long)12l, (long)14l, (long)20l, (long)17l)))) == (false));\n assert(issortList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)6l, (long)8l, (long)10l, (long)15l, (long)14l, (long)20l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_567_issort_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_567_issort_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_568_empty_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to create an array array list of N empty dictionaries.\n public static ArrayList> emptyList(long length) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_568_empty_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(emptyList((5l)).equals(Optional.of(new ArrayList>(Arrays.asList((HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()))))));\n assert(emptyList((6l)).equals(Optional.of(new ArrayList>(Arrays.asList((HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()))))));\n assert(emptyList((7l)).equals(Optional.of(new ArrayList>(Arrays.asList((HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()), (HashMap)new HashMap(Map.of()))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_568_empty_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_568_empty_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_569_sort_sublists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort each subarray list of strings in a given array list of array lists.\n public static ArrayList> sortSublists(ArrayList> list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_569_sort_sublists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"white\")), (ArrayList)new ArrayList(Arrays.asList((String)\"white\", (String)\"black\", (String)\"orange\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"white\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\", (String)\"orange\", (String)\"white\")))))));\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\")), (ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"white\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"black\")), (ArrayList)new ArrayList(Arrays.asList((String)\"green\", (String)\"orange\")), (ArrayList)new ArrayList(Arrays.asList((String)\"white\")))))));\n assert(sortSublists((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")), (ArrayList)new ArrayList(Arrays.asList((String)\"d\", (String)\"c\")), (ArrayList)new ArrayList(Arrays.asList((String)\"g\", (String)\"h\")), (ArrayList)new ArrayList(Arrays.asList((String)\"f\", (String)\"e\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")), (ArrayList)new ArrayList(Arrays.asList((String)\"c\", (String)\"d\")), (ArrayList)new ArrayList(Arrays.asList((String)\"g\", (String)\"h\")), (ArrayList)new ArrayList(Arrays.asList((String)\"e\", (String)\"f\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_569_sort_sublists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_569_sort_sublists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_572_two_unique_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to remove duplicate numbers from a given number of array lists.\n public static ArrayList twoUniqueNums(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_572_two_unique_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(twoUniqueNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)2l, (long)3l, (long)4l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)5l)))));\n assert(twoUniqueNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)2l, (long)4l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)4l, (long)5l)))));\n assert(twoUniqueNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_572_two_unique_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_572_two_unique_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_573_unique_product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to calculate the product of the unique numbers in a given array list.\n public static long uniqueProduct(ArrayList list_data) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_573_unique_product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(uniqueProduct((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l, (long)20l, (long)50l, (long)60l, (long)40l)))) == (720000000l));\n assert(uniqueProduct((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)1l)))) == (6l));\n assert(uniqueProduct((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)0l, (long)1l, (long)1l)))) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_573_unique_product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_573_unique_product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_574_surfacearea_cylinder", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the surface area of a cylinder.\n public static float surfaceareaCylinder(long r, long h) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_574_surfacearea_cylinder", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(surfaceareaCylinder((10l), (5l)) == (942.45f));\n assert(surfaceareaCylinder((4l), (5l)) == (226.18800000000002f));\n assert(surfaceareaCylinder((4l), (10l)) == (351.848f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_574_surfacearea_cylinder", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_574_surfacearea_cylinder.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_576_is_Sub_Array", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether an array array list is subarray list of another or not.\n public static boolean isSubArray(ArrayList A, ArrayList B) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_576_is_Sub_Array", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isSubArray((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)3l, (long)5l))), (new ArrayList(Arrays.asList((long)1l, (long)2l)))) == (false));\n assert(isSubArray((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l))), (new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l)))) == (true));\n assert(isSubArray((new ArrayList(Arrays.asList((long)1l, (long)0l, (long)2l, (long)2l))), (new ArrayList(Arrays.asList((long)2l, (long)2l, (long)0l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_576_is_Sub_Array", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_576_is_Sub_Array.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_577_last_Digit_Factorial", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the last digit in factorial of a given number.\n public static long lastDigitFactorial(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_577_last_Digit_Factorial", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lastDigitFactorial((4l)) == (4l));\n assert(lastDigitFactorial((21l)) == (0l));\n assert(lastDigitFactorial((30l)) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_577_last_Digit_Factorial", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_577_last_Digit_Factorial.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_578_interleave_lists", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to interleave 3 array lists of the same length into a single flat array list.\n public static ArrayList interleaveLists(ArrayList list1, ArrayList list2, ArrayList list3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_578_interleave_lists", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(interleaveLists((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l))), (new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l, (long)50l, (long)60l, (long)70l))), (new ArrayList(Arrays.asList((long)100l, (long)200l, (long)300l, (long)400l, (long)500l, (long)600l, (long)700l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)10l, (long)100l, (long)2l, (long)20l, (long)200l, (long)3l, (long)30l, (long)300l, (long)4l, (long)40l, (long)400l, (long)5l, (long)50l, (long)500l, (long)6l, (long)60l, (long)600l, (long)7l, (long)70l, (long)700l)))));\n assert(interleaveLists((new ArrayList(Arrays.asList((long)10l, (long)20l))), (new ArrayList(Arrays.asList((long)15l, (long)2l))), (new ArrayList(Arrays.asList((long)5l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)10l, (long)15l, (long)5l, (long)20l, (long)2l, (long)10l)))));\n assert(interleaveLists((new ArrayList(Arrays.asList((long)11l, (long)44l))), (new ArrayList(Arrays.asList((long)10l, (long)15l))), (new ArrayList(Arrays.asList((long)20l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)11l, (long)10l, (long)20l, (long)44l, (long)15l, (long)5l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_578_interleave_lists", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_578_interleave_lists.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_579_find_dissimilar", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the dissimilar elements in the given two pairs.\n public static Pair findDissimilar(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_579_find_dissimilar", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findDissimilar((Pair.with(3l, 4l, 5l, 6l)), (Pair.with(5l, 7l, 4l, 10l))).equals((Pair.with(3l, 6l, 7l, 10l))));\n assert(findDissimilar((Pair.with(1l, 2l, 3l, 4l)), (Pair.with(7l, 2l, 3l, 9l))).equals((Pair.with(1l, 4l, 7l, 9l))));\n assert(findDissimilar((Pair.with(21l, 11l, 25l, 26l)), (Pair.with(26l, 34l, 21l, 36l))).equals((Pair.with(34l, 36l, 11l, 25l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_579_find_dissimilar", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_579_find_dissimilar.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_580_extract_even", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove uneven elements in the nested mixed pair.\n public static Object extractEven(Pair>, Long, Long> test_tuple) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_580_extract_even", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractEven((Pair.with(4l, 5l, Pair.with(7l, 6l, Pair.with(2l, 4l)), 6l, 8l))).equals(Pair.with(4l, Pair.with(6l, Pair.with(2l, 4l)), 6l, 8l)));\n assert(extractEven((Pair.with(5l, 6l, Pair.with(8l, 7l, Pair.with(4l, 8l)), 7l, 9l))).equals(Pair.with(6l, Pair.with(8l, Pair.with(4l, 8l)))));\n assert(extractEven((Pair.with(5l, 6l, Pair.with(9l, 8l, Pair.with(4l, 6l)), 8l, 10l))).equals(Pair.with(6l, Pair.with(8l, Pair.with(4l, 6l)), 8l, 10l)));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_580_extract_even", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_580_extract_even.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_581_surface_Area", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the surface area of a square javaramid with a given base edge and height.\n public static long surfaceArea(long b, long s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_581_surface_Area", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(surfaceArea((3l), (4l)) == (33l));\n assert(surfaceArea((4l), (5l)) == (56l));\n assert(surfaceArea((1l), (2l)) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_581_surface_Area", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_581_surface_Area.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_583_catalan_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function which returns nth catalan number.\n public static long catalanNumber(long num) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_583_catalan_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(catalanNumber((10l)) == (16796l));\n assert(catalanNumber((9l)) == (4862l));\n assert(catalanNumber((7l)) == (429l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_583_catalan_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_583_catalan_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_584_find_adverbs", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the first adverb ending with ly and its positions in a given string.\n public static String findAdverbs(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_584_find_adverbs", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findAdverbs((\"Clearly, he has no excuse for such behavior.\")).equals((\"0-7: Clearly\")));\n assert(findAdverbs((\"Please handle the situation carefuly\")).equals((\"28-36: carefuly\")));\n assert(findAdverbs((\"Complete the task quickly\")).equals((\"18-25: quickly\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_584_find_adverbs", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_584_find_adverbs.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_586_split_Arr", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to split an array array list at the nth eelment and add the first part to the end.\n public static ArrayList splitArr(ArrayList l, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_586_split_Arr", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(splitArr((new ArrayList(Arrays.asList((long)12l, (long)10l, (long)5l, (long)6l, (long)52l, (long)36l))), (2l)).equals((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)52l, (long)36l, (long)12l, (long)10l)))));\n assert(splitArr((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l))), (1l)).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)1l)))));\n assert(splitArr((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l))), (3l)).equals((new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)0l, (long)1l, (long)2l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_586_split_Arr", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_586_split_Arr.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_587_list_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert an array array list to a pair.\n public static Object listTuple(ArrayList listx) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_587_list_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(listTuple((new ArrayList(Arrays.asList((long)5l, (long)10l, (long)7l, (long)4l, (long)15l, (long)3l)))).equals(Pair.with(5l, 10l, 7l, 4l, 15l, 3l)));\n assert(listTuple((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)5l, (long)6l, (long)2l, (long)3l, (long)4l, (long)4l, (long)7l)))).equals(Pair.with(2l, 4l, 5l, 6l, 2l, 3l, 4l, 4l, 7l)));\n assert(listTuple((new ArrayList(Arrays.asList((long)58l, (long)44l, (long)56l)))).equals(Pair.with(58l, 44l, 56l)));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_587_list_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_587_list_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_588_big_diff", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the difference between largest and smallest value in a given array list.\n public static long bigDiff(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_588_big_diff", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(bigDiff((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)))) == (3l));\n assert(bigDiff((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)12l)))) == (8l));\n assert(bigDiff((new ArrayList(Arrays.asList((long)9l, (long)2l, (long)3l)))) == (7l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_588_big_diff", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_588_big_diff.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_589_perfect_squares", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find perfect squares between two given numbers.\n public static ArrayList perfectSquares(long a, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_589_perfect_squares", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(perfectSquares((1l), (30l)).equals((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)9l, (long)16l, (long)25l)))));\n assert(perfectSquares((50l), (100l)).equals((new ArrayList(Arrays.asList((long)64l, (long)81l, (long)100l)))));\n assert(perfectSquares((100l), (200l)).equals((new ArrayList(Arrays.asList((long)100l, (long)121l, (long)144l, (long)169l, (long)196l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_589_perfect_squares", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_589_perfect_squares.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_591_swap_List", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to interchange the first and last elements in an array array list.\n public static ArrayList swapList(ArrayList newList) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_591_swap_List", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(swapList((new ArrayList(Arrays.asList((long)12l, (long)35l, (long)9l, (long)56l, (long)24l)))).equals((new ArrayList(Arrays.asList((long)24l, (long)35l, (long)9l, (long)56l, (long)12l)))));\n assert(swapList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))).equals((new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))));\n assert(swapList((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)6l, (long)5l, (long)4l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_591_swap_List", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_591_swap_List.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_592_sum_Of_product", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of the product of consecutive binomial co-efficients.\n public static long sumOfProduct(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_592_sum_Of_product", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumOfProduct((3l)) == (15l));\n assert(sumOfProduct((4l)) == (56l));\n assert(sumOfProduct((1l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_592_sum_Of_product", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_592_sum_Of_product.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_593_removezero_ip", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove leading zeroes from an ip address.\n public static String removezeroIp(String ip) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_593_removezero_ip", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removezeroIp((\"216.08.094.196\")).equals((\"216.8.94.196\")));\n assert(removezeroIp((\"12.01.024\")).equals((\"12.1.24\")));\n assert(removezeroIp((\"216.08.094.0196\")).equals((\"216.8.94.196\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_593_removezero_ip", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_593_removezero_ip.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_594_diff_even_odd", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the difference of the first even and first odd number of a given array list.\n public static long diffEvenOdd(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_594_diff_even_odd", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(diffEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)4l, (long)1l, (long)6l, (long)8l)))) == (3l));\n assert(diffEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))) == (1l));\n assert(diffEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)9l, (long)10l)))) == (9l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_594_diff_even_odd", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_594_diff_even_odd.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_595_min_Swaps", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count minimum number of swaps required to convert one binary number represented as a string to another.\n public static Object minSwaps(String str1, String str2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_595_min_Swaps", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minSwaps((\"1101\"), (\"1110\")).equals((Object(1l))));\n assert(minSwaps((\"111\"), (\"000\")).equals((Object(\"Not Possible\"))));\n assert(minSwaps((\"111\"), (\"110\")).equals((Object(\"Not Possible\"))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_595_min_Swaps", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_595_min_Swaps.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_597_find_kth", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find kth element from the given two sorted array array lists.\n public static long findKth(ArrayList arr1, ArrayList arr2, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_597_find_kth", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findKth((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)6l, (long)7l, (long)9l))), (new ArrayList(Arrays.asList((long)1l, (long)4l, (long)8l, (long)10l))), (5l)) == (6l));\n assert(findKth((new ArrayList(Arrays.asList((long)100l, (long)112l, (long)256l, (long)349l, (long)770l))), (new ArrayList(Arrays.asList((long)72l, (long)86l, (long)113l, (long)119l, (long)265l, (long)445l, (long)892l))), (7l)) == (256l));\n assert(findKth((new ArrayList(Arrays.asList((long)3l, (long)4l, (long)7l, (long)8l, (long)10l))), (new ArrayList(Arrays.asList((long)2l, (long)5l, (long)9l, (long)11l))), (6l)) == (8l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_597_find_kth", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_597_find_kth.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_598_armstrong_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given number is armstrong or not.\n public static boolean armstrongNumber(long number) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_598_armstrong_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(armstrongNumber((153l)) == (true));\n assert(armstrongNumber((259l)) == (false));\n assert(armstrongNumber((4458l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_598_armstrong_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_598_armstrong_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_599_sum_average", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find sum and average of first n natural numbers.\n public static Pair sumAverage(long number) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_599_sum_average", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumAverage((10l)).equals((Pair.with(55l, 5.5f))));\n assert(sumAverage((15l)).equals((Pair.with(120l, 8.0f))));\n assert(sumAverage((20l)).equals((Pair.with(210l, 10.5f))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_599_sum_average", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_599_sum_average.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_600_is_Even", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the given number is even or not.\n public static boolean isEven(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_600_is_Even", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isEven((1l)) == (false));\n assert(isEven((2l)) == (true));\n assert(isEven((3l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_600_is_Even", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_600_is_Even.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_602_first_repeated_char", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the first repeated character in a given string.\n public static Optional firstRepeatedChar(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_602_first_repeated_char", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(firstRepeatedChar((\"abcabc\")).equals(Optional.of(\"a\")));\n assert(firstRepeatedChar((\"abc\")).equals(Optional.empty()));\n assert(firstRepeatedChar((\"123123\")).equals(Optional.of(\"1\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_602_first_repeated_char", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_602_first_repeated_char.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_603_get_ludic", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to get all lucid numbers smaller than or equal to a given integer.\n public static ArrayList getLudic(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_603_get_ludic", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getLudic((10l)).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l)))));\n assert(getLudic((25l)).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l, (long)11l, (long)13l, (long)17l, (long)23l, (long)25l)))));\n assert(getLudic((45l)).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)5l, (long)7l, (long)11l, (long)13l, (long)17l, (long)23l, (long)25l, (long)29l, (long)37l, (long)41l, (long)43l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_603_get_ludic", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_603_get_ludic.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_604_reverse_words", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to reverse words seperated by spaces in a given string.\n public static String reverseWords(String s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_604_reverse_words", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(reverseWords((\"python program\")).equals((\"program python\")));\n assert(reverseWords((\"java language\")).equals((\"language java\")));\n assert(reverseWords((\"indian man\")).equals((\"man indian\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_604_reverse_words", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_604_reverse_words.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_605_prime_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given integer is a prime number.\n public static boolean primeNum(long num) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_605_prime_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(primeNum((13l)) == (true));\n assert(primeNum((7l)) == (true));\n assert(primeNum((-1010l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_605_prime_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_605_prime_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_606_radian_degree", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert degrees to radians.\n public static float radianDegree(long degree) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_606_radian_degree", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(radianDegree((90l)) == (1.5707963267948966f));\n assert(radianDegree((60l)) == (1.0471975511965976f));\n assert(radianDegree((120l)) == (2.0943951023931953f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_606_radian_degree", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_606_radian_degree.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_607_find_literals", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to search a string for a regex pattern. The function should return the matching subtring, a start index and an end index.\n public static Pair findLiterals(String text, String pattern) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_607_find_literals", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findLiterals((\"The quick brown fox jumps over the lazy dog.\"), (\"fox\")).equals((Pair.with(\"fox\", 16l, 19l))));\n assert(findLiterals((\"Its been a very crazy procedure right\"), (\"crazy\")).equals((Pair.with(\"crazy\", 16l, 21l))));\n assert(findLiterals((\"Hardest choices required strongest will\"), (\"will\")).equals((Pair.with(\"will\", 35l, 39l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_607_find_literals", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_607_find_literals.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_608_bell_Number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find nth bell number.\n public static long bellNumber(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_608_bell_Number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(bellNumber((2l)) == (2l));\n assert(bellNumber((3l)) == (5l));\n assert(bellNumber((4l)) == (15l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_608_bell_Number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_608_bell_Number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_610_remove_kth_element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function which takes an array array list and returns an array array list with the same elements, but the k'th element removed.\n public static ArrayList removeKthElement(ArrayList list1, long L) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_610_remove_kth_element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeKthElement((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)3l, (long)4l, (long)4l, (long)5l, (long)1l))), (3l)).equals((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)3l, (long)4l, (long)4l, (long)5l, (long)1l)))));\n assert(removeKthElement((new ArrayList(Arrays.asList((long)0l, (long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)4l, (long)5l, (long)6l, (long)6l, (long)6l, (long)7l, (long)8l, (long)9l, (long)4l, (long)4l))), (4l)).equals((new ArrayList(Arrays.asList((long)0l, (long)0l, (long)1l, (long)3l, (long)4l, (long)4l, (long)5l, (long)6l, (long)6l, (long)6l, (long)7l, (long)8l, (long)9l, (long)4l, (long)4l)))));\n assert(removeKthElement((new ArrayList(Arrays.asList((long)10l, (long)10l, (long)15l, (long)19l, (long)18l, (long)18l, (long)17l, (long)26l, (long)26l, (long)17l, (long)18l, (long)10l))), (5l)).equals((new ArrayList(Arrays.asList((long)10l, (long)10l, (long)15l, (long)19l, (long)18l, (long)17l, (long)26l, (long)26l, (long)17l, (long)18l, (long)10l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_610_remove_kth_element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_610_remove_kth_element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_611_max_of_nth", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function which given a matrix represented as an array array list of array lists returns the max of the n'th column.\n public static long maxOfNth(ArrayList> test_list, long N) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_611_max_of_nth", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxOfNth((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)9l, (long)19l))))), (2l)) == (19l));\n assert(maxOfNth((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)10l, (long)20l))))), (1l)) == (10l));\n assert(maxOfNth((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)11l, (long)21l))))), (1l)) == (11l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_611_max_of_nth", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_611_max_of_nth.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_612_merge", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function which takes an array array list of array lists, where each subarray list has two elements, and returns an array array list of two array lists where the first array list has the first element of each subarray list and the second one has the second.\n public static ArrayList> merge(ArrayList> lst) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_612_merge", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(merge((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\")), (ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\")), (ArrayList)new ArrayList(Arrays.asList((String)\"m\", (String)\"n\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"a\", (String)\"m\")), (ArrayList)new ArrayList(Arrays.asList((String)\"y\", (String)\"b\", (String)\"n\")))))));\n assert(merge((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l)))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l, (long)6l, (long)8l)))))));\n assert(merge((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"y\", (String)\"z\")), (ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\")), (ArrayList)new ArrayList(Arrays.asList((String)\"m\", (String)\"n\", (String)\"o\")))))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"x\", (String)\"a\", (String)\"m\")), (ArrayList)new ArrayList(Arrays.asList((String)\"y\", (String)\"b\", (String)\"n\")), (ArrayList)new ArrayList(Arrays.asList((String)\"z\", (String)\"c\", (String)\"o\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_612_merge", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_612_merge.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_614_cummulative_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the cumulative sum of all the values that are present in the given array list of array lists.\n public static long cummulativeSum(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_614_cummulative_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(cummulativeSum((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)6l)))))) == (30l));\n assert(cummulativeSum((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)7l)))))) == (37l));\n assert(cummulativeSum((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)8l)))))) == (44l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_614_cummulative_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_614_cummulative_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_615_average_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function which takes an array array lists of array lists and returns the average value for each subarray list as an array array list.\n public static ArrayList averageTuple(ArrayList> nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_615_average_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(averageTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)10l, (long)10l, (long)10l, (long)12l)), (ArrayList)new ArrayList(Arrays.asList((long)30l, (long)45l, (long)56l, (long)45l)), (ArrayList)new ArrayList(Arrays.asList((long)81l, (long)80l, (long)39l, (long)32l)), (ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)))))).equals((new ArrayList(Arrays.asList((float)30.5f, (float)34.25f, (float)27.0f, (float)23.25f)))));\n assert(averageTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)1l, (long)-5l)), (ArrayList)new ArrayList(Arrays.asList((long)30l, (long)-15l, (long)56l)), (ArrayList)new ArrayList(Arrays.asList((long)81l, (long)-60l, (long)-39l)), (ArrayList)new ArrayList(Arrays.asList((long)-10l, (long)2l, (long)3l)))))).equals((new ArrayList(Arrays.asList((float)25.5f, (float)-18.0f, (float)3.75f)))));\n assert(averageTuple((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)100l, (long)100l, (long)100l, (long)120l)), (ArrayList)new ArrayList(Arrays.asList((long)300l, (long)450l, (long)560l, (long)450l)), (ArrayList)new ArrayList(Arrays.asList((long)810l, (long)800l, (long)390l, (long)320l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)40l)))))).equals((new ArrayList(Arrays.asList((float)305.0f, (float)342.5f, (float)270.0f, (float)232.5f)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_615_average_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_615_average_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_616_tuple_modulo", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function which takes two pairs of the same length and performs the element wise modulo.\n public static Pair tupleModulo(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_616_tuple_modulo", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tupleModulo((Pair.with(10l, 4l, 5l, 6l)), (Pair.with(5l, 6l, 7l, 5l))).equals((Pair.with(0l, 4l, 5l, 1l))));\n assert(tupleModulo((Pair.with(11l, 5l, 6l, 7l)), (Pair.with(6l, 7l, 8l, 6l))).equals((Pair.with(5l, 5l, 6l, 1l))));\n assert(tupleModulo((Pair.with(12l, 6l, 7l, 8l)), (Pair.with(7l, 8l, 9l, 7l))).equals((Pair.with(5l, 6l, 7l, 1l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_616_tuple_modulo", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_616_tuple_modulo.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_617_min_Jumps", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check for the number of jumps required of given length to reach a point of form (d, 0) from origin in a 2d plane.\n public static float minJumps(Pair steps, long d) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_617_min_Jumps", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minJumps((Pair.with(3l, 4l)), (11l)) == (3.5f));\n assert(minJumps((Pair.with(3l, 4l)), (0l)) == (float)0l);\n assert(minJumps((Pair.with(11l, 14l)), (11l)) == (float)1l);\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_617_min_Jumps", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_617_min_Jumps.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_618_div_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to divide two array lists element wise.\n public static ArrayList divList(ArrayList nums1, ArrayList nums2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_618_div_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(divList((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))).equals((new ArrayList(Arrays.asList((float)4.0f, (float)2.5f, (float)2.0f)))));\n assert(divList((new ArrayList(Arrays.asList((long)3l, (long)2l))), (new ArrayList(Arrays.asList((long)1l, (long)4l)))).equals((new ArrayList(Arrays.asList((float)3.0f, (float)0.5f)))));\n assert(divList((new ArrayList(Arrays.asList((long)90l, (long)120l))), (new ArrayList(Arrays.asList((long)50l, (long)70l)))).equals((new ArrayList(Arrays.asList((float)1.8f, (float)1.7142857142857142f)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_618_div_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_618_div_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_619_move_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to move all the numbers to the end of the given string.\n public static String moveNum(String test_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_619_move_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(moveNum((\"I1love143you55three3000thousand\")).equals((\"Iloveyouthreethousand1143553000\")));\n assert(moveNum((\"Avengers124Assemble\")).equals((\"AvengersAssemble124\")));\n assert(moveNum((\"Its11our12path13to14see15things16do17things\")).equals((\"Itsourpathtoseethingsdothings11121314151617\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_619_move_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_619_move_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_622_get_median", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the median of two sorted array lists of same size.\n public static float getMedian(ArrayList arr1, ArrayList arr2, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_622_get_median", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getMedian((new ArrayList(Arrays.asList((long)1l, (long)12l, (long)15l, (long)26l, (long)38l))), (new ArrayList(Arrays.asList((long)2l, (long)13l, (long)17l, (long)30l, (long)45l))), (5l)) == (16.0f));\n assert(getMedian((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)8l, (long)9l))), (new ArrayList(Arrays.asList((long)7l, (long)13l, (long)19l, (long)28l))), (4l)) == (8.5f));\n assert(getMedian((new ArrayList(Arrays.asList((long)3l, (long)6l, (long)14l, (long)23l, (long)36l, (long)42l))), (new ArrayList(Arrays.asList((long)2l, (long)18l, (long)27l, (long)39l, (long)49l, (long)55l))), (6l)) == (25.0f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_622_get_median", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_622_get_median.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_623_nth_nums", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to compute the n-th power of each number in an array array list.\n public static ArrayList nthNums(ArrayList nums, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_623_nth_nums", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(nthNums((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (2l)).equals((new ArrayList(Arrays.asList((long)1l, (long)4l, (long)9l, (long)16l, (long)25l, (long)36l, (long)49l, (long)64l, (long)81l, (long)100l)))));\n assert(nthNums((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l))), (3l)).equals((new ArrayList(Arrays.asList((long)1000l, (long)8000l, (long)27000l)))));\n assert(nthNums((new ArrayList(Arrays.asList((long)12l, (long)15l))), (5l)).equals((new ArrayList(Arrays.asList((long)248832l, (long)759375l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_623_nth_nums", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_623_nth_nums.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_624_is_upper", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to convert a given string to uppercase.\n public static String isUpper(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_624_is_upper", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isUpper((\"person\")).equals((\"PERSON\")));\n assert(isUpper((\"final\")).equals((\"FINAL\")));\n assert(isUpper((\"Valid\")).equals((\"VALID\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_624_is_upper", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_624_is_upper.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_625_swap_List", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to interchange the first and last element in a given array list.\n public static ArrayList swapList(ArrayList newList) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_625_swap_List", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(swapList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))).equals((new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))));\n assert(swapList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)4l)))).equals((new ArrayList(Arrays.asList((long)4l, (long)2l, (long)3l, (long)4l, (long)1l)))));\n assert(swapList((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)))).equals((new ArrayList(Arrays.asList((long)6l, (long)5l, (long)4l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_625_swap_List", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_625_swap_List.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_626_triangle_area", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the area of the largest triangle that can be inscribed in a semicircle with a given radius.\n public static Optional triangleArea(long r) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_626_triangle_area", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(triangleArea((-1l)).equals(Optional.empty()));\n assert(triangleArea((0l)).equals(Optional.of(0l)));\n assert(triangleArea((2l)).equals(Optional.of(4l)));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_626_triangle_area", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_626_triangle_area.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_627_find_First_Missing", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the smallest missing number from a sorted array list of natural numbers.\n public static long findFirstMissing(ArrayList array) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_627_find_First_Missing", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findFirstMissing((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l)))) == (4l));\n assert(findFirstMissing((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)6l, (long)9l)))) == (3l));\n assert(findFirstMissing((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)5l, (long)8l, (long)9l)))) == (0l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_627_find_First_Missing", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_627_find_First_Missing.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_628_replace_spaces", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to replace all spaces in the given string with '%20'.\n public static String replaceSpaces(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_628_replace_spaces", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceSpaces((\"My Name is Dawood\")).equals((\"My%20Name%20is%20Dawood\")));\n assert(replaceSpaces((\"I am a Programmer\")).equals((\"I%20am%20a%20Programmer\")));\n assert(replaceSpaces((\"I love Coding\")).equals((\"I%20love%20Coding\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_628_replace_spaces", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_628_replace_spaces.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_629_Split", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find even numbers from an array array list of numbers.\n public static ArrayList Split(ArrayList list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_629_Split", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(Split((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)4l)))));\n assert(Split((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)0l, (long)1l)))).equals((new ArrayList(Arrays.asList((long)4l, (long)6l, (long)8l, (long)0l)))));\n assert(Split((new ArrayList(Arrays.asList((long)8l, (long)12l, (long)15l, (long)19l)))).equals((new ArrayList(Arrays.asList((long)8l, (long)12l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_629_Split", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_629_Split.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_630_get_coordinates", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract all the adjacent coordinates of the given coordinate pair.\n public static ArrayList> getCoordinates(Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_630_get_coordinates", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getCoordinates((Pair.with(3l, 4l))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)))))));\n assert(getCoordinates((Pair.with(4l, 5l))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)3l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)))))));\n assert(getCoordinates((Pair.with(5l, 6l))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)7l)))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_630_get_coordinates", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_630_get_coordinates.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_631_replace_spaces", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to replace whitespaces with an underscore and vice versa in a given string.\n public static String replaceSpaces(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_631_replace_spaces", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceSpaces((\"Jumanji The Jungle\")).equals((\"Jumanji_The_Jungle\")));\n assert(replaceSpaces((\"The_Avengers\")).equals((\"The Avengers\")));\n assert(replaceSpaces((\"Fast and Furious\")).equals((\"Fast_and_Furious\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_631_replace_spaces", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_631_replace_spaces.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_632_move_zero", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to move all zeroes to the end of the given array list.\n public static ArrayList moveZero(ArrayList num_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_632_move_zero", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(moveZero((new ArrayList(Arrays.asList((long)1l, (long)0l, (long)2l, (long)0l, (long)3l, (long)4l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)0l, (long)0l)))));\n assert(moveZero((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)2l, (long)0l, (long)0l, (long)4l, (long)0l, (long)5l, (long)0l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)2l, (long)4l, (long)5l, (long)0l, (long)0l, (long)0l, (long)0l)))));\n assert(moveZero((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)0l, (long)1l, (long)1l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)0l, (long)0l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_632_move_zero", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_632_move_zero.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_633_pair_xor_Sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of xor of all pairs of numbers in the given array list.\n public static long pairXorSum(ArrayList arr, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_633_pair_xor_Sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(pairXorSum((new ArrayList(Arrays.asList((long)5l, (long)9l, (long)7l, (long)6l))), (4l)) == (47l));\n assert(pairXorSum((new ArrayList(Arrays.asList((long)7l, (long)3l, (long)5l))), (3l)) == (12l));\n assert(pairXorSum((new ArrayList(Arrays.asList((long)7l, (long)3l))), (2l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_633_pair_xor_Sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_633_pair_xor_Sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_635_heap_sort", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort the given array list.\n public static ArrayList heapSort(ArrayList iterable) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_635_heap_sort", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(heapSort((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)9l, (long)2l, (long)4l, (long)6l, (long)8l, (long)0l)))).equals((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l)))));\n assert(heapSort((new ArrayList(Arrays.asList((long)25l, (long)35l, (long)22l, (long)85l, (long)14l, (long)65l, (long)75l, (long)25l, (long)58l)))).equals((new ArrayList(Arrays.asList((long)14l, (long)22l, (long)25l, (long)25l, (long)35l, (long)58l, (long)65l, (long)75l, (long)85l)))));\n assert(heapSort((new ArrayList(Arrays.asList((long)7l, (long)1l, (long)9l, (long)5l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)9l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_635_heap_sort", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_635_heap_sort.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_637_noprofit_noloss", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given amount has no profit and no loss\n public static boolean noprofitNoloss(long actual_cost, long sale_amount) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_637_noprofit_noloss", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(noprofitNoloss((1500l), (1200l)) == (false));\n assert(noprofitNoloss((100l), (100l)) == (true));\n assert(noprofitNoloss((2000l), (5000l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_637_noprofit_noloss", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_637_noprofit_noloss.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_638_wind_chill", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the wind chill index rounded to the next integer given the wind velocity in km/h and a temperature in celsius.\n public static long windChill(long v, long t) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_638_wind_chill", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(windChill((120l), (35l)) == (40l));\n assert(windChill((40l), (20l)) == (19l));\n assert(windChill((10l), (8l)) == (6l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_638_wind_chill", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_638_wind_chill.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_639_sample_nam", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sum the length of the names of a given array list of names after removing the names that start with a lowercase letter.\n public static long sampleNam(ArrayList sample_names) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_639_sample_nam", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sampleNam((new ArrayList(Arrays.asList((String)\"sally\", (String)\"Dylan\", (String)\"rebecca\", (String)\"Diana\", (String)\"Joanne\", (String)\"keith\")))) == (16l));\n assert(sampleNam((new ArrayList(Arrays.asList((String)\"php\", (String)\"res\", (String)\"Python\", (String)\"abcd\", (String)\"Java\", (String)\"aaa\")))) == (10l));\n assert(sampleNam((new ArrayList(Arrays.asList((String)\"abcd\", (String)\"Python\", (String)\"abba\", (String)\"aba\")))) == (6l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_639_sample_nam", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_639_sample_nam.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_640_remove_parenthesis", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove the parenthesis and what is inbetween them from a string.\n public static String removeParenthesis(ArrayList items) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_640_remove_parenthesis", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeParenthesis((new ArrayList(Arrays.asList((String)\"python (chrome)\")))).equals((\"python\")));\n assert(removeParenthesis((new ArrayList(Arrays.asList((String)\"string(.abc)\")))).equals((\"string\")));\n assert(removeParenthesis((new ArrayList(Arrays.asList((String)\"alpha(num)\")))).equals((\"alpha\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_640_remove_parenthesis", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_640_remove_parenthesis.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_641_is_nonagonal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth nonagonal number.\n public static long isNonagonal(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_641_is_nonagonal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isNonagonal((10l)) == (325l));\n assert(isNonagonal((15l)) == (750l));\n assert(isNonagonal((18l)) == (1089l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_641_is_nonagonal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_641_is_nonagonal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_643_text_match_wordz_middle", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that checks if a strings contains 'z', except at the start and end of the word.\n public static boolean textMatchWordzMiddle(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_643_text_match_wordz_middle", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchWordzMiddle((\"pythonzabc.\")) == (true));\n assert(textMatchWordzMiddle((\"zxyabc.\")) == (false));\n assert(textMatchWordzMiddle((\" lang .\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_643_text_match_wordz_middle", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_643_text_match_wordz_middle.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_644_reverse_Array_Upto_K", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to reverse an array array list upto a given position.\n public static ArrayList reverseArrayUptoK(ArrayList input, long k) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_644_reverse_Array_Upto_K", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(reverseArrayUptoK((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (4l)).equals((new ArrayList(Arrays.asList((long)4l, (long)3l, (long)2l, (long)1l, (long)5l, (long)6l)))));\n assert(reverseArrayUptoK((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l, (long)7l))), (2l)).equals((new ArrayList(Arrays.asList((long)5l, (long)4l, (long)6l, (long)7l)))));\n assert(reverseArrayUptoK((new ArrayList(Arrays.asList((long)9l, (long)8l, (long)7l, (long)6l, (long)5l))), (3l)).equals((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)6l, (long)5l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_644_reverse_Array_Upto_K", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_644_reverse_Array_Upto_K.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_720_add_dict_to_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to add a hash map to the pair. The output should be a pair.\n public static Pair> addDictToTuple(Pair test_tup, HashMap test_dict) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_720_add_dict_to_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addDictToTuple((Pair.with(4l, 5l, 6l)), (new HashMap(Map.of(\"MSAM\", 1l, \"is\", 2l, \"best\", 3l)))).equals((Pair.with(4l, 5l, 6l, new HashMap(Map.of(\"MSAM\", 1l, \"is\", 2l, \"best\", 3l))))));\n assert(addDictToTuple((Pair.with(1l, 2l, 3l)), (new HashMap(Map.of(\"UTS\", 2l, \"is\", 3l, \"Worst\", 4l)))).equals((Pair.with(1l, 2l, 3l, new HashMap(Map.of(\"UTS\", 2l, \"is\", 3l, \"Worst\", 4l))))));\n assert(addDictToTuple((Pair.with(8l, 9l, 10l)), (new HashMap(Map.of(\"POS\", 3l, \"is\", 4l, \"Okay\", 5l)))).equals((Pair.with(8l, 9l, 10l, new HashMap(Map.of(\"POS\", 3l, \"is\", 4l, \"Okay\", 5l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_720_add_dict_to_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_720_add_dict_to_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_721_maxAverageOfPath", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Given a square matrix of size N*N given as an array array list of array lists, where each cell is associated with a specific cost. A path is defined as a specific sequence of cells that starts from the top-left cell move only right or down and ends on bottom right cell. We want to find a path with the maximum average over all existing paths. Average is computed as total cost divided by the number of cells visited in the path.\n public static float maxAverageOfPath(ArrayList> cost) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_721_maxAverageOfPath", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxAverageOfPath((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)5l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)3l, (long)9l)))))) == (5.2f));\n assert(maxAverageOfPath((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)6l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)4l, (long)10l)))))) == (6.2f));\n assert(maxAverageOfPath((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)4l, (long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)8l, (long)7l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)5l, (long)11l)))))) == (7.2f));\n assert(maxAverageOfPath((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l)))))) == (5.8f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_721_maxAverageOfPath", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_721_maxAverageOfPath.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_722_filter_data", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // The input is given as - a hash map with a student name as a key and a pair of float (student_height, student_weight) as a value, - minimal height, - minimal weight. Write a function to filter students that have height and weight above the minimum.\n public static HashMap> filterData(HashMap> students, float h, long w) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_722_filter_data", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(filterData((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l), \"Alden Cantrell\", Pair.with(5.9f, 65l), \"Kierra Gentry\", Pair.with(6.0f, 68l), \"Pierre Cox\", Pair.with(5.8f, 66l)))), (6.0f), (70l)).equals((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l))))));\n assert(filterData((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l), \"Alden Cantrell\", Pair.with(5.9f, 65l), \"Kierra Gentry\", Pair.with(6.0f, 68l), \"Pierre Cox\", Pair.with(5.8f, 66l)))), (5.9f), (67l)).equals((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l), \"Kierra Gentry\", Pair.with(6.0f, 68l))))));\n assert(filterData((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l), \"Alden Cantrell\", Pair.with(5.9f, 65l), \"Kierra Gentry\", Pair.with(6.0f, 68l), \"Pierre Cox\", Pair.with(5.8f, 66l)))), (5.7f), (64l)).equals((new HashMap>(Map.of(\"Cierra Vega\", Pair.with(6.2f, 70l), \"Alden Cantrell\", Pair.with(5.9f, 65l), \"Kierra Gentry\", Pair.with(6.0f, 68l), \"Pierre Cox\", Pair.with(5.8f, 66l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_722_filter_data", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_722_filter_data.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_723_count_same_pair", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // The input is defined as two array lists of the same length. Write a function to count indices where the array lists have the same values.\n public static long countSamePair(ArrayList nums1, ArrayList nums2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_723_count_same_pair", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countSamePair((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)2l, (long)3l, (long)1l, (long)2l, (long)6l, (long)7l, (long)9l)))) == (4l));\n assert(countSamePair((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)-1l, (long)-5l, (long)6l, (long)0l, (long)-3l, (long)-2l, (long)3l, (long)4l, (long)6l, (long)8l))), (new ArrayList(Arrays.asList((long)2l, (long)1l, (long)2l, (long)-1l, (long)-5l, (long)6l, (long)4l, (long)-3l, (long)-2l, (long)3l, (long)4l, (long)6l, (long)8l)))) == (11l));\n assert(countSamePair((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)-6l, (long)-9l, (long)11l, (long)-12l, (long)14l, (long)-5l, (long)17l))), (new ArrayList(Arrays.asList((long)2l, (long)1l, (long)2l, (long)-1l, (long)-5l, (long)6l, (long)4l, (long)-3l, (long)-2l, (long)3l, (long)4l, (long)6l, (long)8l)))) == (1l));\n assert(countSamePair((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)1l, (long)2l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)2l)))) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_723_count_same_pair", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_723_count_same_pair.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_724_power_base_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes base and power as arguments and calculate the sum of all digits of the base to the specified power.\n public static long powerBaseSum(long base, long power) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_724_power_base_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(powerBaseSum((2l), (100l)) == (115l));\n assert(powerBaseSum((8l), (10l)) == (37l));\n assert(powerBaseSum((8l), (15l)) == (62l));\n assert(powerBaseSum((3l), (3l)) == (9l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_724_power_base_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_724_power_base_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_725_extract_quotation", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to extract values between quotation marks \" \" of the given string.\n public static ArrayList extractQuotation(String text1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_725_extract_quotation", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractQuotation((\"Cortex \"A53\" Based \"multi\" tasking \"Processor\"\")).equals((new ArrayList(Arrays.asList((String)\"A53\", (String)\"multi\", (String)\"Processor\")))));\n assert(extractQuotation((\"Cast your \"favorite\" entertainment \"apps\"\")).equals((new ArrayList(Arrays.asList((String)\"favorite\", (String)\"apps\")))));\n assert(extractQuotation((\"Watch content \"4k Ultra HD\" resolution with \"HDR 10\" Support\")).equals((new ArrayList(Arrays.asList((String)\"4k Ultra HD\", (String)\"HDR 10\")))));\n assert(extractQuotation((\"Watch content '4k Ultra HD' resolution with 'HDR 10' Support\")).equals((new ArrayList(Arrays.asList()))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_725_extract_quotation", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_725_extract_quotation.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_726_multiply_elements", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that takes as input an array array list of numbers (t_1,...,t_{N+1}) and returns an array array list of length N where the i-th element of the pair is equal to t_i * t_{i+1}.\n public static ArrayList multiplyElements(ArrayList test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_726_multiply_elements", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(multiplyElements((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)8l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)5l, (long)35l, (long)56l, (long)80l)))));\n assert(multiplyElements((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)5l, (long)6l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)8l, (long)20l, (long)30l, (long)42l)))));\n assert(multiplyElements((new ArrayList(Arrays.asList((long)12l, (long)13l, (long)14l, (long)9l, (long)15l)))).equals((new ArrayList(Arrays.asList((long)156l, (long)182l, (long)126l, (long)135l)))));\n assert(multiplyElements((new ArrayList(Arrays.asList((long)12l)))).equals((new ArrayList(Arrays.asList()))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_726_multiply_elements", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_726_multiply_elements.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_728_sum_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function takes as input two array lists [a_1,...,a_n], [b_1,...,b_n] and returns [a_1+b_1,...,a_n+b_n].\n public static ArrayList sumList(ArrayList lst1, ArrayList lst2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_728_sum_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumList((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l))), (new ArrayList(Arrays.asList((long)15l, (long)25l, (long)35l)))).equals((new ArrayList(Arrays.asList((long)25l, (long)45l, (long)65l)))));\n assert(sumList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)6l, (long)8l, (long)10l)))));\n assert(sumList((new ArrayList(Arrays.asList((long)15l, (long)20l, (long)30l))), (new ArrayList(Arrays.asList((long)15l, (long)45l, (long)75l)))).equals((new ArrayList(Arrays.asList((long)30l, (long)65l, (long)105l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_728_sum_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_728_sum_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_730_consecutive_duplicates", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove consecutive duplicates of a given array list.\n public static ArrayList consecutiveDuplicates(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_730_consecutive_duplicates", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(consecutiveDuplicates((new ArrayList(Arrays.asList((long)0l, (long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)4l, (long)5l, (long)6l, (long)6l, (long)6l, (long)7l, (long)8l, (long)9l, (long)4l, (long)4l)))).equals((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)4l)))));\n assert(consecutiveDuplicates((new ArrayList(Arrays.asList((long)10l, (long)10l, (long)15l, (long)19l, (long)18l, (long)18l, (long)17l, (long)26l, (long)26l, (long)17l, (long)18l, (long)10l)))).equals((new ArrayList(Arrays.asList((long)10l, (long)15l, (long)19l, (long)18l, (long)17l, (long)26l, (long)17l, (long)18l, (long)10l)))));\n assert(consecutiveDuplicates((new ArrayList(Arrays.asList((String)\"a\", (String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\", (String)\"d\")))).equals((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\")))));\n assert(consecutiveDuplicates((new ArrayList(Arrays.asList((String)\"a\", (String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\", (String)\"d\", (String)\"a\", (String)\"a\")))).equals((new ArrayList(Arrays.asList((String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\", (String)\"a\")))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_730_consecutive_duplicates", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_730_consecutive_duplicates.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_731_lateralsurface_cone", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the lateral surface area of a cone given radius r and the height h.\n public static float lateralsurfaceCone(long r, long h) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_731_lateralsurface_cone", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lateralsurfaceCone((5l), (12l)) == (204.20352248333654f));\n assert(lateralsurfaceCone((10l), (15l)) == (566.3586699569488f));\n assert(lateralsurfaceCone((19l), (17l)) == (1521.8090132193388f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_731_lateralsurface_cone", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_731_lateralsurface_cone.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_732_replace_specialchar", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to replace all occurrences of spaces, commas, or dots with a colon.\n public static String replaceSpecialchar(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_732_replace_specialchar", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(replaceSpecialchar((\"Python language, Programming language.\")).equals((\"Python:language::Programming:language:\")));\n assert(replaceSpecialchar((\"a b c,d e f\")).equals((\"a:b:c:d:e:f\")));\n assert(replaceSpecialchar((\"ram reshma,ram rahim\")).equals((\"ram:reshma:ram:rahim\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_732_replace_specialchar", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_732_replace_specialchar.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_733_find_first_occurrence", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the index of the first occurrence of a given number in a sorted array array list.\n public static long findFirstOccurrence(ArrayList A, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_733_find_first_occurrence", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findFirstOccurrence((new ArrayList(Arrays.asList((long)2l, (long)5l, (long)5l, (long)5l, (long)6l, (long)6l, (long)8l, (long)9l, (long)9l, (long)9l))), (5l)) == (1l));\n assert(findFirstOccurrence((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)5l, (long)5l, (long)6l, (long)6l, (long)8l, (long)9l, (long)9l, (long)9l))), (5l)) == (2l));\n assert(findFirstOccurrence((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)1l, (long)5l, (long)6l, (long)6l, (long)8l, (long)9l, (long)9l, (long)9l))), (6l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_733_find_first_occurrence", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_733_find_first_occurrence.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_734_sum_Of_Subarray_Prod", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find sum of products of all possible subarray lists of a given array list. https://www.geeksforgeeks.org/sum-of-products-of-all-possible-subarray array lists/\n public static long sumOfSubarrayProd(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_734_sum_Of_Subarray_Prod", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumOfSubarrayProd((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (20l));\n assert(sumOfSubarrayProd((new ArrayList(Arrays.asList((long)1l, (long)2l)))) == (5l));\n assert(sumOfSubarrayProd((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l)))) == (84l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_734_sum_Of_Subarray_Prod", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_734_sum_Of_Subarray_Prod.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_735_toggle_middle_bits", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to toggle bits of the number except the first and the last bit. https://www.geeksforgeeks.org/toggle-bits-number-expect-first-last-bits/\n public static long toggleMiddleBits(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_735_toggle_middle_bits", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(toggleMiddleBits((9l)) == (15l));\n assert(toggleMiddleBits((10l)) == (12l));\n assert(toggleMiddleBits((11l)) == (13l));\n assert(toggleMiddleBits((65l)) == (127l));\n assert(toggleMiddleBits((77l)) == (115l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_735_toggle_middle_bits", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_735_toggle_middle_bits.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_736_left_insertion", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to locate the left insertion point for a specified value in sorted order. https://www.w3resource.com/javathon-exercises/data-structures-and-algorithms/javathon-data-structure-exercise-24.php\n public static long leftInsertion(ArrayList a, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_736_left_insertion", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(leftInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (6l)) == (4l));\n assert(leftInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (3l)) == (2l));\n assert(leftInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (7l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_736_left_insertion", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_736_left_insertion.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_737_check_str", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given string is starting with a vowel or not using regex.\n public static boolean checkStr(String string) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_737_check_str", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkStr((\"annie\")) == (true));\n assert(checkStr((\"dawood\")) == (false));\n assert(checkStr((\"Else\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_737_check_str", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_737_check_str.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_738_geometric_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to calculate the geometric sum of n-1. https://www.w3resource.com/javathon-exercises/data-structures-and-algorithms/javathon-recursion-exercise-9.php\n public static float geometricSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_738_geometric_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(geometricSum((7l)) == (1.9921875f));\n assert(geometricSum((4l)) == (1.9375f));\n assert(geometricSum((8l)) == (1.99609375f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_738_geometric_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_738_geometric_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_739_find_Index", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the index of smallest triangular number with n digits. https://www.geeksforgeeks.org/index-of-smallest-triangular-number-with-n-digits/\n public static long findIndex(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_739_find_Index", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findIndex((2l)) == (4l));\n assert(findIndex((3l)) == (14l));\n assert(findIndex((4l)) == (45l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_739_find_Index", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_739_find_Index.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_740_tuple_to_dict", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert the given pair to a key-value hash map using adjacent elements. https://www.geeksforgeeks.org/javathon-convert-pair-to-adjacent-pair-hash map/\n public static HashMap tupleToDict(Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_740_tuple_to_dict", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tupleToDict((Pair.with(1l, 5l, 7l, 10l, 13l, 5l))).equals((new HashMap(Map.of(1l, 5l, 7l, 10l, 13l, 5l)))));\n assert(tupleToDict((Pair.with(1l, 2l, 3l, 4l, 5l, 6l))).equals((new HashMap(Map.of(1l, 2l, 3l, 4l, 5l, 6l)))));\n assert(tupleToDict((Pair.with(7l, 8l, 9l, 10l, 11l, 12l))).equals((new HashMap(Map.of(7l, 8l, 9l, 10l, 11l, 12l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_740_tuple_to_dict", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_740_tuple_to_dict.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_741_all_Characters_Same", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether all the characters are same or not.\n public static boolean allCharactersSame(String s) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_741_all_Characters_Same", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(allCharactersSame((\"python\")) == (false));\n assert(allCharactersSame((\"aaa\")) == (true));\n assert(allCharactersSame((\"data\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_741_all_Characters_Same", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_741_all_Characters_Same.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_742_area_tetrahedron", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to caluclate the area of a tetrahedron.\n public static float areaTetrahedron(long side) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_742_area_tetrahedron", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(areaTetrahedron((3l)) == (15.588457268119894f));\n assert(areaTetrahedron((20l)) == (692.8203230275509f));\n assert(areaTetrahedron((10l)) == (173.20508075688772f));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_742_area_tetrahedron", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_742_area_tetrahedron.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_743_rotate_right", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to rotate a given array list by specified number of items to the right direction. https://www.geeksforgeeks.org/javathon-program-right-rotate-array list-n/\n public static ArrayList rotateRight(ArrayList list, long m) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_743_rotate_right", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rotateRight((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (3l)).equals((new ArrayList(Arrays.asList((long)8l, (long)9l, (long)10l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l)))));\n assert(rotateRight((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (2l)).equals((new ArrayList(Arrays.asList((long)9l, (long)10l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l)))));\n assert(rotateRight((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l))), (5l)).equals((new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)9l, (long)10l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_743_rotate_right", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_743_rotate_right.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_744_check_none", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given pair has any none value or not.\n public static boolean checkNone(Object test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_744_check_none", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkNone(Pair.with(Optional.of(10l), Optional.of(4l), Optional.of(5l), Optional.of(6l), Optional.of(Optional.empty()))) == (true));\n assert(checkNone(Pair.with(7l, 8l, 9l, 11l, 14l)) == (false));\n assert(checkNone(Pair.with(Optional.of(1l), Optional.of(2l), Optional.of(3l), Optional.of(4l), Optional.of(Optional.empty()))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_744_check_none", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_744_check_none.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_745_divisible_by_digits", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find numbers within a given range from startnum ti endnum where every number is divisible by every digit it contains. https://www.w3resource.com/javathon-exercises/lambda/javathon-lambda-exercise-24.php\n public static ArrayList divisibleByDigits(long startnum, long endnum) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_745_divisible_by_digits", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(divisibleByDigits((1l), (22l)).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)11l, (long)12l, (long)15l, (long)22l)))));\n assert(divisibleByDigits((1l), (15l)).equals((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)11l, (long)12l, (long)15l)))));\n assert(divisibleByDigits((20l), (25l)).equals((new ArrayList(Arrays.asList((long)22l, (long)24l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_745_divisible_by_digits", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_745_divisible_by_digits.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_746_sector_area", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find area of a sector. The function takes the radius and angle as inputs. Function should return null if the angle is larger than 360 degrees.\n public static Optional sectorArea(long r, long a) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_746_sector_area", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sectorArea((4l), (45l)).equals(Optional.of(6.283185307179586f)));\n assert(sectorArea((9l), (45l)).equals(Optional.of(31.808625617596654f)));\n assert(sectorArea((9l), (361l)).equals(Optional.empty()));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_746_sector_area", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_746_sector_area.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_747_lcs_of_three", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the longest common subsequence for the given three string sequence. https://www.geeksforgeeks.org/lcs-longest-common-subsequence-three-strings/\n public static long lcsOfThree(String X, String Y, String Z) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_747_lcs_of_three", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(lcsOfThree((\"AGGT12\"), (\"12TXAYB\"), (\"12XBA\")) == (2l));\n assert(lcsOfThree((\"Reels\"), (\"Reelsfor\"), (\"ReelsforReels\")) == (5l));\n assert(lcsOfThree((\"abcd1e2\"), (\"bc12ea\"), (\"bd1ea\")) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_747_lcs_of_three", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_747_lcs_of_three.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_748_capital_words_spaces", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to put spaces between words starting with capital letters in a given string.\n public static String capitalWordsSpaces(String str1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_748_capital_words_spaces", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(capitalWordsSpaces((\"Python\")).equals((\"Python\")));\n assert(capitalWordsSpaces((\"PythonProgrammingExamples\")).equals((\"Python Programming Examples\")));\n assert(capitalWordsSpaces((\"GetReadyToBeCodingFreak\")).equals((\"Get Ready To Be Coding Freak\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_748_capital_words_spaces", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_748_capital_words_spaces.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_749_sort_numeric_strings", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to sort a given array list of strings of numbers numerically. https://www.geeksforgeeks.org/javathon-sort-numeric-strings-in-a-array list/\n public static ArrayList sortNumericStrings(ArrayList nums_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_749_sort_numeric_strings", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sortNumericStrings((new ArrayList(Arrays.asList((String)\"4\", (String)\"12\", (String)\"45\", (String)\"7\", (String)\"0\", (String)\"100\", (String)\"200\", (String)\"-12\", (String)\"-500\")))).equals((new ArrayList(Arrays.asList((long)-500l, (long)-12l, (long)0l, (long)4l, (long)7l, (long)12l, (long)45l, (long)100l, (long)200l)))));\n assert(sortNumericStrings((new ArrayList(Arrays.asList((String)\"2\", (String)\"3\", (String)\"8\", (String)\"4\", (String)\"7\", (String)\"9\", (String)\"8\", (String)\"2\", (String)\"6\", (String)\"5\", (String)\"1\", (String)\"6\", (String)\"1\", (String)\"2\", (String)\"3\", (String)\"4\", (String)\"6\", (String)\"9\", (String)\"1\", (String)\"2\")))).equals((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)2l, (long)2l, (long)2l, (long)2l, (long)3l, (long)3l, (long)4l, (long)4l, (long)5l, (long)6l, (long)6l, (long)6l, (long)7l, (long)8l, (long)8l, (long)9l, (long)9l)))));\n assert(sortNumericStrings((new ArrayList(Arrays.asList((String)\"1\", (String)\"3\", (String)\"5\", (String)\"7\", (String)\"1\", (String)\"3\", (String)\"13\", (String)\"15\", (String)\"17\", (String)\"5\", (String)\"7 \", (String)\"9\", (String)\"1\", (String)\"11\")))).equals((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)3l, (long)3l, (long)5l, (long)5l, (long)7l, (long)7l, (long)9l, (long)11l, (long)13l, (long)15l, (long)17l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_749_sort_numeric_strings", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_749_sort_numeric_strings.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_750_add_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to add the given pair to the given array list.\n public static ArrayList addTuple(ArrayList test_list, Pair test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_750_add_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(addTuple((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l))), (Pair.with(9l, 10l))).equals((new ArrayList(Arrays.asList((long)5l, (long)6l, (long)7l, (long)9l, (long)10l)))));\n assert(addTuple((new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l))), (Pair.with(10l, 11l))).equals((new ArrayList(Arrays.asList((long)6l, (long)7l, (long)8l, (long)10l, (long)11l)))));\n assert(addTuple((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l))), (Pair.with(11l, 12l))).equals((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)11l, (long)12l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_750_add_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_750_add_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_751_check_min_heap", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given array array list represents min heap or not. https://www.geeksforgeeks.org/how-to-check-if-a-given-array array list-represents-a-binary-heap/\n public static boolean checkMinHeap(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_751_check_min_heap", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkMinHeap((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l)))) == (true));\n assert(checkMinHeap((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)5l, (long)10l, (long)15l)))) == (true));\n assert(checkMinHeap((new ArrayList(Arrays.asList((long)2l, (long)10l, (long)4l, (long)5l, (long)3l, (long)15l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_751_check_min_heap", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_751_check_min_heap.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_752_jacobsthal_num", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the nth jacobsthal number. https://www.geeksforgeeks.org/jacobsthal-and-jacobsthal-lucas-numbers/ 0, 1, 1, 3, 5, 11, 21, 43, 85, 171, 341, 683, 1365, 2731, ...\n public static long jacobsthalNum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_752_jacobsthal_num", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(jacobsthalNum((5l)) == (11l));\n assert(jacobsthalNum((2l)) == (1l));\n assert(jacobsthalNum((4l)) == (5l));\n assert(jacobsthalNum((13l)) == (2731l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_752_jacobsthal_num", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_752_jacobsthal_num.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_753_min_k", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find minimum k records from pair array list. https://www.geeksforgeeks.org/javathon-find-minimum-k-records-from-pair-array list/ - in this case a verbatim cojava of test cases\n public static ArrayList> minK(ArrayList> test_list, long K) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_753_min_k", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(minK((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Manjeet\", 10l), (Pair)Pair.with(\"Akshat\", 4l), (Pair)Pair.with(\"Akash\", 2l), (Pair)Pair.with(\"Nikhil\", 8l)))), (2l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Akash\", 2l), (Pair)Pair.with(\"Akshat\", 4l))))));\n assert(minK((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Sanjeev\", 11l), (Pair)Pair.with(\"Angat\", 5l), (Pair)Pair.with(\"Akash\", 3l), (Pair)Pair.with(\"Nepin\", 9l)))), (3l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Akash\", 3l), (Pair)Pair.with(\"Angat\", 5l), (Pair)Pair.with(\"Nepin\", 9l))))));\n assert(minK((new ArrayList>(Arrays.asList((Pair)Pair.with(\"tanmay\", 14l), (Pair)Pair.with(\"Amer\", 11l), (Pair)Pair.with(\"Ayesha\", 9l), (Pair)Pair.with(\"SKD\", 16l)))), (1l)).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(\"Ayesha\", 9l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_753_min_k", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_753_min_k.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_754_extract_index_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // We say that an element is common for array lists l1, l2, l3 if it appears in all three array lists under the same index. Write a function to find common elements from three array lists. The function should return an array array list.\n public static ArrayList extractIndexList(ArrayList l1, ArrayList l2, ArrayList l3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_754_extract_index_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(extractIndexList((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)7l)))));\n assert(extractIndexList((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)6l, (long)5l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)6l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)6l)))));\n assert(extractIndexList((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)3l, (long)4l, (long)6l, (long)5l, (long)6l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l)))).equals((new ArrayList(Arrays.asList((long)1l, (long)5l)))));\n assert(extractIndexList((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)6l, (long)6l, (long)6l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l))), (new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)7l)))).equals((new ArrayList(Arrays.asList()))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_754_extract_index_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_754_extract_index_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_756_text_match_zero_one", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that matches a string that has an 'a' followed by one or more 'b's. https://www.w3resource.com/javathon-exercises/re/javathon-re-exercise-3.php\n public static boolean textMatchZeroOne(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_756_text_match_zero_one", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchZeroOne((\"ac\")) == (false));\n assert(textMatchZeroOne((\"dc\")) == (false));\n assert(textMatchZeroOne((\"abbbba\")) == (true));\n assert(textMatchZeroOne((\"dsabbbba\")) == (true));\n assert(textMatchZeroOne((\"asbbbba\")) == (false));\n assert(textMatchZeroOne((\"abaaa\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_756_text_match_zero_one", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_756_text_match_zero_one.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_757_count_reverse_pairs", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count the pairs of reverse strings in the given string array list. https://www.geeksforgeeks.org/javathon-program-to-count-the-pairs-of-reverse-strings/\n public static long countReversePairs(ArrayList test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_757_count_reverse_pairs", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countReversePairs((new ArrayList(Arrays.asList((String)\"julia\", (String)\"best\", (String)\"tseb\", (String)\"for\", (String)\"ailuj\")))) == (2l));\n assert(countReversePairs((new ArrayList(Arrays.asList((String)\"geeks\", (String)\"best\", (String)\"for\", (String)\"skeeg\")))) == (1l));\n assert(countReversePairs((new ArrayList(Arrays.asList((String)\"makes\", (String)\"best\", (String)\"sekam\", (String)\"for\", (String)\"rof\")))) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_757_count_reverse_pairs", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_757_count_reverse_pairs.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_759_is_decimal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether a given string is a decimal number with a precision of 2.\n public static boolean isDecimal(String num) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_759_is_decimal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isDecimal((\"123.11\")) == (true));\n assert(isDecimal((\"e666.86\")) == (false));\n assert(isDecimal((\"3.124587\")) == (false));\n assert(isDecimal((\"1.11\")) == (true));\n assert(isDecimal((\"1.1.11\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_759_is_decimal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_759_is_decimal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_760_unique_Element", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether an array array list of numbers contains only one distinct element or not.\n public static boolean uniqueElement(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_760_unique_Element", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(uniqueElement((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l)))) == (true));\n assert(uniqueElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l, (long)2l)))) == (false));\n assert(uniqueElement((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_760_unique_Element", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_760_unique_Element.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_762_check_monthnumber_number", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given month number contains 30 days or not. Months are given as number from 1 to 12.\n public static boolean checkMonthnumberNumber(long monthnum3) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_762_check_monthnumber_number", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkMonthnumberNumber((6l)) == (true));\n assert(checkMonthnumberNumber((2l)) == (false));\n assert(checkMonthnumberNumber((12l)) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_762_check_monthnumber_number", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_762_check_monthnumber_number.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_763_find_min_diff", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the minimum difference between any two elements in a given array array list. https://www.geeksforgeeks.org/find-minimum-difference-pair/\n public static long findMinDiff(ArrayList arr, long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_763_find_min_diff", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findMinDiff((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)3l, (long)19l, (long)18l, (long)25l))), (6l)) == (1l));\n assert(findMinDiff((new ArrayList(Arrays.asList((long)4l, (long)3l, (long)2l, (long)6l))), (4l)) == (1l));\n assert(findMinDiff((new ArrayList(Arrays.asList((long)30l, (long)5l, (long)20l, (long)9l))), (4l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_763_find_min_diff", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_763_find_min_diff.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_764_number_ctr", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count number of digits in a given string.\n public static long numberCtr(String str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_764_number_ctr", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(numberCtr((\"program2bedone\")) == (1l));\n assert(numberCtr((\"3wonders\")) == (1l));\n assert(numberCtr((\"123\")) == (3l));\n assert(numberCtr((\"3wond-1ers2\")) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_764_number_ctr", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_764_number_ctr.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_765_is_polite", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find nth polite number. geeksforgeeks.org/n-th-polite-number/\n public static long isPolite(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_765_is_polite", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isPolite((7l)) == (11l));\n assert(isPolite((4l)) == (7l));\n assert(isPolite((9l)) == (13l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_765_is_polite", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_765_is_polite.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_766_pair_wise", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to return an array array list of all pairs of consecutive items in a given array list.\n public static ArrayList> pairWise(ArrayList l1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_766_pair_wise", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(pairWise((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)2l, (long)3l, (long)3l, (long)4l, (long)4l, (long)5l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, 1l), (Pair)Pair.with(1l, 2l), (Pair)Pair.with(2l, 3l), (Pair)Pair.with(3l, 3l), (Pair)Pair.with(3l, 4l), (Pair)Pair.with(4l, 4l), (Pair)Pair.with(4l, 5l))))));\n assert(pairWise((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)9l, (long)10l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, 5l), (Pair)Pair.with(5l, 7l), (Pair)Pair.with(7l, 9l), (Pair)Pair.with(9l, 10l))))));\n assert(pairWise((new ArrayList(Arrays.asList((long)5l, (long)1l, (long)9l, (long)7l, (long)10l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(5l, 1l), (Pair)Pair.with(1l, 9l), (Pair)Pair.with(9l, 7l), (Pair)Pair.with(7l, 10l))))));\n assert(pairWise((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(1l, 2l), (Pair)Pair.with(2l, 3l), (Pair)Pair.with(3l, 4l), (Pair)Pair.with(4l, 5l), (Pair)Pair.with(5l, 6l), (Pair)Pair.with(6l, 7l), (Pair)Pair.with(7l, 8l), (Pair)Pair.with(8l, 9l), (Pair)Pair.with(9l, 10l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_766_pair_wise", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_766_pair_wise.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_767_get_pairs_count", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of pairs whose sum is equal to ‘sum’. The funtion gets as input an array array list of numbers and the sum,\n public static long getPairsCount(ArrayList arr, long sum) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_767_get_pairs_count", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(getPairsCount((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)1l))), (2l)) == (6l));\n assert(getPairsCount((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)-1l, (long)5l))), (6l)) == (3l));\n assert(getPairsCount((new ArrayList(Arrays.asList((long)1l, (long)-2l, (long)3l))), (1l)) == (1l));\n assert(getPairsCount((new ArrayList(Arrays.asList((long)-1l, (long)-2l, (long)3l))), (-3l)) == (1l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_767_get_pairs_count", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_767_get_pairs_count.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_769_Diff", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to get the difference between two array lists.\n public static ArrayList Diff(ArrayList li1, ArrayList li2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_769_Diff", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(Diff((new ArrayList(Arrays.asList((long)10l, (long)15l, (long)20l, (long)25l, (long)30l, (long)35l, (long)40l))), (new ArrayList(Arrays.asList((long)25l, (long)40l, (long)35l)))).equals((new ArrayList(Arrays.asList((long)10l, (long)20l, (long)30l, (long)15l)))));\n assert(Diff((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l))), (new ArrayList(Arrays.asList((long)6l, (long)7l, (long)1l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l)))));\n assert(Diff((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (new ArrayList(Arrays.asList((long)6l, (long)7l, (long)1l)))).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)6l, (long)7l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_769_Diff", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_769_Diff.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_770_odd_num_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of fourth power of first n odd natural numbers.\n public static long oddNumSum(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_770_odd_num_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oddNumSum((2l)) == (82l));\n assert(oddNumSum((3l)) == (707l));\n assert(oddNumSum((4l)) == (3108l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_770_odd_num_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_770_odd_num_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_771_check_expression", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given expression is balanced or not. https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/\n public static boolean checkExpression(String exp) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_771_check_expression", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkExpression((\"{()}[{}]\")) == (true));\n assert(checkExpression((\"{()}[{]\")) == (false));\n assert(checkExpression((\"{()}[{}][]({})\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_771_check_expression", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_771_check_expression.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_772_remove_length", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove all the words with k length in the given string.\n public static String removeLength(String test_str, long K) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_772_remove_length", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeLength((\"The person is most value tet\"), (3l)).equals((\"person is most value\")));\n assert(removeLength((\"If you told me about this ok\"), (4l)).equals((\"If you me about ok\")));\n assert(removeLength((\"Forces of darkeness is come into the play\"), (4l)).equals((\"Forces of darkeness is the\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_772_remove_length", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_772_remove_length.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_773_occurance_substring", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the occurrence and position of the substrings within a string. Return null if there is no match.\n public static Optional> occuranceSubstring(String text, String pattern) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_773_occurance_substring", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(occuranceSubstring((\"python programming, python language\"), (\"python\")).equals(Optional.of(Pair.with(\"python\", 0l, 6l))));\n assert(occuranceSubstring((\"python programming,programming language\"), (\"programming\")).equals(Optional.of(Pair.with(\"programming\", 7l, 18l))));\n assert(occuranceSubstring((\"python programming,programming language\"), (\"language\")).equals(Optional.of(Pair.with(\"language\", 31l, 39l))));\n assert(occuranceSubstring((\"c++ programming, c++ language\"), (\"python\")).equals(Optional.empty()));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_773_occurance_substring", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_773_occurance_substring.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_775_odd_position", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether every odd index contains odd numbers of a given array list.\n public static boolean oddPosition(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_775_odd_position", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oddPosition((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)4l, (long)3l, (long)6l, (long)7l, (long)6l, (long)3l)))) == (true));\n assert(oddPosition((new ArrayList(Arrays.asList((long)4l, (long)1l, (long)2l)))) == (true));\n assert(oddPosition((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_775_odd_position", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_775_odd_position.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_776_count_vowels", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to count those characters which have vowels as their neighbors in the given string.\n public static long countVowels(String test_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_776_count_vowels", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countVowels((\"bestinstareels\")) == (7l));\n assert(countVowels((\"partofthejourneyistheend\")) == (12l));\n assert(countVowels((\"amazonprime\")) == (5l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_776_count_vowels", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_776_count_vowels.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_777_find_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of non-repeated elements in a given array list.\n public static long findSum(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_777_find_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findSum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)1l, (long)1l, (long)4l, (long)5l, (long)6l)))) == (21l));\n assert(findSum((new ArrayList(Arrays.asList((long)1l, (long)10l, (long)9l, (long)4l, (long)2l, (long)10l, (long)10l, (long)45l, (long)4l)))) == (71l));\n assert(findSum((new ArrayList(Arrays.asList((long)12l, (long)10l, (long)9l, (long)45l, (long)2l, (long)10l, (long)10l, (long)45l, (long)10l)))) == (78l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_777_find_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_777_find_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_778_pack_consecutive_duplicates", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to pack consecutive duplicates of a given array list elements into subarray lists.\n public static ArrayList> packConsecutiveDuplicates(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_778_pack_consecutive_duplicates", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(packConsecutiveDuplicates((new ArrayList(Arrays.asList((long)0l, (long)0l, (long)1l, (long)2l, (long)3l, (long)4l, (long)4l, (long)5l, (long)6l, (long)6l, (long)6l, (long)7l, (long)8l, (long)9l, (long)4l, (long)4l)))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)0l, (long)0l)), (ArrayList)new ArrayList(Arrays.asList((long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)5l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)6l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)8l)), (ArrayList)new ArrayList(Arrays.asList((long)9l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)4l)))))));\n assert(packConsecutiveDuplicates((new ArrayList(Arrays.asList((long)10l, (long)10l, (long)15l, (long)19l, (long)18l, (long)18l, (long)17l, (long)26l, (long)26l, (long)17l, (long)18l, (long)10l)))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)10l, (long)10l)), (ArrayList)new ArrayList(Arrays.asList((long)15l)), (ArrayList)new ArrayList(Arrays.asList((long)19l)), (ArrayList)new ArrayList(Arrays.asList((long)18l, (long)18l)), (ArrayList)new ArrayList(Arrays.asList((long)17l)), (ArrayList)new ArrayList(Arrays.asList((long)26l, (long)26l)), (ArrayList)new ArrayList(Arrays.asList((long)17l)), (ArrayList)new ArrayList(Arrays.asList((long)18l)), (ArrayList)new ArrayList(Arrays.asList((long)10l)))))));\n assert(packConsecutiveDuplicates((new ArrayList(Arrays.asList((String)\"a\", (String)\"a\", (String)\"b\", (String)\"c\", (String)\"d\", (String)\"d\")))).equals((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((String)\"a\", (String)\"a\")), (ArrayList)new ArrayList(Arrays.asList((String)\"b\")), (ArrayList)new ArrayList(Arrays.asList((String)\"c\")), (ArrayList)new ArrayList(Arrays.asList((String)\"d\", (String)\"d\")))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_778_pack_consecutive_duplicates", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_778_pack_consecutive_duplicates.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_780_find_combinations", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the combinations of sums with pairs in the given pair array list. https://www.geeksforgeeks.org/javathon-combinations-of-sum-with-pairs-in-pair-array list/\n public static ArrayList> findCombinations(ArrayList> test_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_780_find_combinations", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(findCombinations((new ArrayList>(Arrays.asList((Pair)Pair.with(2l, 4l), (Pair)Pair.with(6l, 7l), (Pair)Pair.with(5l, 1l), (Pair)Pair.with(6l, 10l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(8l, 11l), (Pair)Pair.with(7l, 5l), (Pair)Pair.with(8l, 14l), (Pair)Pair.with(11l, 8l), (Pair)Pair.with(12l, 17l), (Pair)Pair.with(11l, 11l))))));\n assert(findCombinations((new ArrayList>(Arrays.asList((Pair)Pair.with(3l, 5l), (Pair)Pair.with(7l, 8l), (Pair)Pair.with(6l, 2l), (Pair)Pair.with(7l, 11l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(10l, 13l), (Pair)Pair.with(9l, 7l), (Pair)Pair.with(10l, 16l), (Pair)Pair.with(13l, 10l), (Pair)Pair.with(14l, 19l), (Pair)Pair.with(13l, 13l))))));\n assert(findCombinations((new ArrayList>(Arrays.asList((Pair)Pair.with(4l, 6l), (Pair)Pair.with(8l, 9l), (Pair)Pair.with(7l, 3l), (Pair)Pair.with(8l, 12l))))).equals((new ArrayList>(Arrays.asList((Pair)Pair.with(12l, 15l), (Pair)Pair.with(11l, 9l), (Pair)Pair.with(12l, 18l), (Pair)Pair.with(15l, 12l), (Pair)Pair.with(16l, 21l), (Pair)Pair.with(15l, 15l))))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_780_find_combinations", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_780_find_combinations.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_781_count_divisors", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether the count of divisors is even. https://www.w3resource.com/javathon-exercises/basic/javathon-basic-1-exercise-24.php\n public static boolean countDivisors(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_781_count_divisors", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countDivisors((10l)) == (true));\n assert(countDivisors((100l)) == (false));\n assert(countDivisors((125l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_781_count_divisors", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_781_count_divisors.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_782_odd_length_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of all odd length subarray array lists. https://www.geeksforgeeks.org/sum-of-all-odd-length-subarray array lists/\n public static long oddLengthSum(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_782_odd_length_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(oddLengthSum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l)))) == (14l));\n assert(oddLengthSum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l, (long)2l)))) == (15l));\n assert(oddLengthSum((new ArrayList(Arrays.asList((long)1l, (long)7l)))) == (8l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_782_odd_length_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_782_odd_length_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_783_rgb_to_hsv", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert rgb color to hsv color. https://www.geeksforgeeks.org/program-change-rgb-color-model-hsv-color-model/\n public static ArrayList rgbToHsv(long r, long g, long b) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_783_rgb_to_hsv", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rgbToHsv((255l), (255l), (255l)).equals((new ArrayList(Arrays.asList((float)0.0f, (float)0.0f, (float)100.0f)))));\n assert(rgbToHsv((0l), (215l), (0l)).equals((new ArrayList(Arrays.asList((float)120.0f, (float)100.0f, (float)84.31372549019608f)))));\n assert(rgbToHsv((10l), (215l), (110l)).equals((new ArrayList(Arrays.asList((float)149.26829268292684f, (float)95.34883720930233f, (float)84.31372549019608f)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_783_rgb_to_hsv", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_783_rgb_to_hsv.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_784_mul_even_odd", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find the product of first even and odd number of a given array list.\n public static long mulEvenOdd(ArrayList list1) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_784_mul_even_odd", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(mulEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l, (long)7l, (long)4l, (long)1l, (long)6l, (long)8l)))) == (4l));\n assert(mulEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l, (long)7l, (long)8l, (long)9l, (long)10l)))) == (2l));\n assert(mulEvenOdd((new ArrayList(Arrays.asList((long)1l, (long)5l, (long)7l, (long)9l, (long)10l)))) == (10l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_784_mul_even_odd", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_784_mul_even_odd.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_785_tuple_str_int", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to convert pair string to integer pair.\n public static Pair tupleStrInt(String test_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_785_tuple_str_int", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(tupleStrInt((\"(7, 8, 9)\")).equals((Pair.with(7l, 8l, 9l))));\n assert(tupleStrInt((\"(1, 2, 3)\")).equals((Pair.with(1l, 2l, 3l))));\n assert(tupleStrInt((\"(4, 5, 6)\")).equals((Pair.with(4l, 5l, 6l))));\n assert(tupleStrInt((\"(7, 81, 19)\")).equals((Pair.with(7l, 81l, 19l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_785_tuple_str_int", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_785_tuple_str_int.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_786_right_insertion", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to locate the right insertion point for a specified value in sorted order.\n public static long rightInsertion(ArrayList a, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_786_right_insertion", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(rightInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (6l)) == (4l));\n assert(rightInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (3l)) == (2l));\n assert(rightInsertion((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)4l, (long)5l))), (7l)) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_786_right_insertion", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_786_right_insertion.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_787_text_match_three", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that matches a string that has an a followed by three 'b'.\n public static boolean textMatchThree(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_787_text_match_three", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textMatchThree((\"ac\")) == (false));\n assert(textMatchThree((\"dc\")) == (false));\n assert(textMatchThree((\"abbbba\")) == (true));\n assert(textMatchThree((\"caacabbbba\")) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_787_text_match_three", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_787_text_match_three.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_788_new_tuple", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to create a new pair from the given string and array list.\n public static Pair newTuple(ArrayList test_list, String test_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_788_new_tuple", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(newTuple((new ArrayList(Arrays.asList((String)\"WEB\", (String)\"is\"))), (\"best\")).equals((Pair.with(\"WEB\", \"is\", \"best\"))));\n assert(newTuple((new ArrayList(Arrays.asList((String)\"We\", (String)\"are\"))), (\"Developers\")).equals((Pair.with(\"We\", \"are\", \"Developers\"))));\n assert(newTuple((new ArrayList(Arrays.asList((String)\"Part\", (String)\"is\"))), (\"Wrong\")).equals((Pair.with(\"Part\", \"is\", \"Wrong\"))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_788_new_tuple", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_788_new_tuple.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_790_even_position", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to check whether every even index contains even numbers of a given array list.\n public static boolean evenPosition(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_790_even_position", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(evenPosition((new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))) == (false));\n assert(evenPosition((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (false));\n assert(evenPosition((new ArrayList(Arrays.asList((long)2l, (long)1l, (long)4l)))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_790_even_position", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_790_even_position.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_791_remove_nested", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove pairs from the given pair.\n public static Pair removeNested(Object test_tup) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_791_remove_nested", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeNested(Pair.with(1l, 5l, 7l, Pair.with(4l, 6l), 10l)).equals((Pair.with(1l, 5l, 7l, 10l))));\n assert(removeNested(Pair.with(2l, 6l, 8l, Pair.with(5l, 7l), 11l)).equals((Pair.with(2l, 6l, 8l, 11l))));\n assert(removeNested(Pair.with(3l, 7l, 9l, Pair.with(6l, 8l), 12l)).equals((Pair.with(3l, 7l, 9l, 12l))));\n assert(removeNested(Pair.with(3l, 7l, 9l, Pair.with(6l, 8l), Pair.with(5l, 12l), 12l)).equals((Pair.with(3l, 7l, 9l, 12l))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_791_remove_nested", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_791_remove_nested.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_792_count_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of array lists in a given number of array lists.\n public static long countList(ArrayList> input_list) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_792_count_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)5l, (long)7l)), (ArrayList)new ArrayList(Arrays.asList((long)9l, (long)11l)), (ArrayList)new ArrayList(Arrays.asList((long)13l, (long)15l, (long)17l)))))) == (4l));\n assert(countList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l)))))) == (3l));\n assert(countList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)0l)), (ArrayList)new ArrayList(Arrays.asList((long)2l, (long)0l)))))) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_792_count_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_792_count_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_793_last", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the last position of an element in a sorted array array list.\n public static long last(ArrayList arr, long x) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_793_last", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(last((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l))), (1l)) == (0l));\n assert(last((new ArrayList(Arrays.asList((long)1l, (long)1l, (long)1l, (long)2l, (long)3l, (long)4l))), (1l)) == (2l));\n assert(last((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)2l, (long)3l, (long)6l, (long)8l, (long)9l))), (3l)) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_793_last", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_793_last.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_794_text_starta_endb", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that matches a string that has an 'a' followed by anything, ending in 'b'.\n public static boolean textStartaEndb(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_794_text_starta_endb", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(textStartaEndb((\"aabbbb\")) == (true));\n assert(textStartaEndb((\"aabAbbbc\")) == (false));\n assert(textStartaEndb((\"accddbbjjj\")) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_794_text_starta_endb", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_794_text_starta_endb.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_796_return_sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write function to find the sum of all items in the given hash map.\n public static long returnSum(HashMap dict) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_796_return_sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(returnSum((new HashMap(Map.of(\"a\", 100l, \"b\", 200l, \"c\", 300l)))) == (600l));\n assert(returnSum((new HashMap(Map.of(\"a\", 25l, \"b\", 18l, \"c\", 45l)))) == (88l));\n assert(returnSum((new HashMap(Map.of(\"a\", 36l, \"b\", 39l, \"c\", 49l)))) == (124l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_796_return_sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_796_return_sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_797_sum_in_range", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of all odd natural numbers within the range l and r.\n public static long sumInRange(long l, long r) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_797_sum_in_range", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(sumInRange((2l), (5l)) == (8l));\n assert(sumInRange((5l), (7l)) == (12l));\n assert(sumInRange((7l), (13l)) == (40l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_797_sum_in_range", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_797_sum_in_range.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_798__sum", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the sum of an array array list.\n public static long Sum(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_798__sum", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(Sum((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (6l));\n assert(Sum((new ArrayList(Arrays.asList((long)15l, (long)12l, (long)13l, (long)10l)))) == (50l));\n assert(Sum((new ArrayList(Arrays.asList((long)0l, (long)1l, (long)2l)))) == (3l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_798__sum", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_798__sum.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_799_left_rotate", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to that rotate left bits by d bits a given number. We assume that the number is 32 bit.\n public static long leftRotate(long n, long d) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_799_left_rotate", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(leftRotate((16l), (2l)) == (64l));\n assert(leftRotate((10l), (2l)) == (40l));\n assert(leftRotate((99l), (3l)) == (792l));\n assert(leftRotate((99l), (3l)) == (792l));\n assert(leftRotate((1l), (3l)) == (8l));\n assert(leftRotate((5l), (3l)) == (40l));\n assert(leftRotate((29l), (3l)) == (232l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_799_left_rotate", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_799_left_rotate.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_800_remove_all_spaces", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to remove all whitespaces from a string.\n public static String removeAllSpaces(String text) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_800_remove_all_spaces", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(removeAllSpaces((\"python program\")).equals((\"pythonprogram\")));\n assert(removeAllSpaces((\"python programming language\")).equals((\"pythonprogramminglanguage\")));\n assert(removeAllSpaces((\"python program\")).equals((\"pythonprogram\")));\n assert(removeAllSpaces((\" python program\")).equals((\"pythonprogram\")));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_800_remove_all_spaces", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_800_remove_all_spaces.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_801_test_three_equal", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of equal numbers from three given integers.\n public static long testThreeEqual(long x, long y, long z) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_801_test_three_equal", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(testThreeEqual((1l), (1l), (1l)) == (3l));\n assert(testThreeEqual((-1l), (-2l), (-3l)) == (0l));\n assert(testThreeEqual((1l), (2l), (2l)) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_801_test_three_equal", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_801_test_three_equal.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_802_count_rotation", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to count the number of rotations required to generate a sorted array array list. https://www.geeksforgeeks.org/count-of-rotations-required-to-generate-a-sorted-array array list/\n public static long countRotation(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_802_count_rotation", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(countRotation((new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)))) == (1l));\n assert(countRotation((new ArrayList(Arrays.asList((long)4l, (long)5l, (long)1l, (long)2l, (long)3l)))) == (2l));\n assert(countRotation((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)1l, (long)2l, (long)3l)))) == (3l));\n assert(countRotation((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (0l));\n assert(countRotation((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)2l)))) == (2l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_802_count_rotation", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_802_count_rotation.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_803_is_perfect_square", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the given number is a perfect square or not. https://www.geeksforgeeks.org/check-if-given-number-is-perfect-square-in-cpp/\n public static boolean isPerfectSquare(long n) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_803_is_perfect_square", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isPerfectSquare((10l)) == (false));\n assert(isPerfectSquare((36l)) == (true));\n assert(isPerfectSquare((14l)) == (false));\n assert(isPerfectSquare((196l)) == (true));\n assert(isPerfectSquare((125l)) == (false));\n assert(isPerfectSquare((15625l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_803_is_perfect_square", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_803_is_perfect_square.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_804_is_product_even", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check whether the product of numbers in an array array list is even or not.\n public static boolean isProductEven(ArrayList arr) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_804_is_product_even", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(isProductEven((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)))) == (true));\n assert(isProductEven((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)1l, (long)4l)))) == (true));\n assert(isProductEven((new ArrayList(Arrays.asList((long)1l, (long)1l)))) == (false));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_804_is_product_even", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_804_is_product_even.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_805_max_sum_list", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function that returns the array list in an array array list of array lists whose sum of elements is the highest.\n public static ArrayList maxSumList(ArrayList> lists) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_805_max_sum_list", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxSumList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l)), (ArrayList)new ArrayList(Arrays.asList((long)4l, (long)5l, (long)6l)), (ArrayList)new ArrayList(Arrays.asList((long)10l, (long)11l, (long)12l)), (ArrayList)new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l)))))).equals((new ArrayList(Arrays.asList((long)10l, (long)11l, (long)12l)))));\n assert(maxSumList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)3l, (long)2l, (long)1l)), (ArrayList)new ArrayList(Arrays.asList((long)6l, (long)5l, (long)4l)), (ArrayList)new ArrayList(Arrays.asList((long)12l, (long)11l, (long)10l)))))).equals((new ArrayList(Arrays.asList((long)12l, (long)11l, (long)10l)))));\n assert(maxSumList((new ArrayList>(Arrays.asList((ArrayList)new ArrayList(Arrays.asList((long)2l, (long)3l, (long)1l)))))).equals((new ArrayList(Arrays.asList((long)2l, (long)3l, (long)1l)))));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_805_max_sum_list", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_805_max_sum_list.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_806_max_run_uppercase", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to find maximum run of uppercase characters in the given string.\n public static long maxRunUppercase(String test_str) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_806_max_run_uppercase", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(maxRunUppercase((\"GeMKSForGERksISBESt\")) == (5l));\n assert(maxRunUppercase((\"PrECIOusMOVemENTSYT\")) == (6l));\n assert(maxRunUppercase((\"GooGLEFluTTER\")) == (4l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_806_max_run_uppercase", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_806_max_run_uppercase.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_807_first_odd", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a javathon function to find the first odd number in a given array list of numbers.\n public static long firstOdd(ArrayList nums) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_807_first_odd", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(firstOdd((new ArrayList(Arrays.asList((long)1l, (long)3l, (long)5l)))) == (1l));\n assert(firstOdd((new ArrayList(Arrays.asList((long)2l, (long)4l, (long)1l, (long)3l)))) == (1l));\n assert(firstOdd((new ArrayList(Arrays.asList((long)8l, (long)9l, (long)1l)))) == (9l));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_807_first_odd", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_807_first_odd.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_808_check_K", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if the given pairs contain the k or not.\n public static boolean checkK(ArrayList test_tup, long K) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_808_check_K", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkK((new ArrayList(Arrays.asList((long)10l, (long)4l, (long)5l, (long)6l, (long)8l))), (6l)) == (true));\n assert(checkK((new ArrayList(Arrays.asList((long)1l, (long)2l, (long)3l, (long)4l, (long)5l, (long)6l))), (7l)) == (false));\n assert(checkK((new ArrayList(Arrays.asList((long)7l, (long)8l, (long)9l, (long)44l, (long)11l, (long)12l))), (11l)) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_808_check_K", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_808_check_K.py", "prompt_terminology": "reworded"}} {"sample_uid": "multipl_e_mbpp_java::mbpp_809_check_smaller", "benchmark_id": "multipl_e_mbpp_java", "family": "exec_generation", "language": "java", "prompt": "import java.util.*;\nimport java.lang.reflect.*;\nimport org.javatuples.*;\nimport java.security.*;\nimport java.math.*;\nimport java.io.*;\nimport java.util.stream.*;\nclass Problem {\n // Write a function to check if each element of second pair is smaller than its corresponding element in the first pair.\n public static boolean checkSmaller(Pair test_tup1, Pair test_tup2) {\n", "context": {"stop_tokens": ["\n }\n"], "task_name": "mbpp_809_check_smaller", "source_dataset": "nuprl/MultiPL-E", "source_config": "mbpp-java", "split": "test"}, "reference": null, "tests": {"mode": "append", "suffix": " }\n public static void main(String[] args) {\n assert(checkSmaller((Pair.with(1l, 2l, 3l)), (Pair.with(2l, 3l, 4l))) == (false));\n assert(checkSmaller((Pair.with(4l, 5l, 6l)), (Pair.with(3l, 4l, 5l))) == (true));\n assert(checkSmaller((Pair.with(11l, 12l, 13l)), (Pair.with(10l, 11l, 12l))) == (true));\n }\n\n}\n", "main_class": "Problem"}, "repo_meta": {}, "metric_protocol": {"type": "java_compile_run_assert", "family": "exec_generation"}, "raw_metadata": {"name": "mbpp_809_check_smaller", "original": "/Users/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/mbpp-typed/mbpp_809_check_smaller.py", "prompt_terminology": "reworded"}}